./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-65.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-65.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 431f2117f5c677d2ffce2fa99499007e44687a7dec4f669e88843242de06006b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:50:06,253 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:50:06,305 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 10:50:06,313 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:50:06,316 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:50:06,332 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:50:06,333 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:50:06,333 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:50:06,333 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:50:06,333 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:50:06,333 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:50:06,333 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:50:06,333 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:50:06,334 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:50:06,334 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:50:06,334 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:50:06,334 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:50:06,334 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:50:06,334 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 10:50:06,334 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:50:06,334 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:50:06,334 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:50:06,334 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:50:06,334 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:50:06,334 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:50:06,334 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:50:06,334 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:50:06,334 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:50:06,334 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:50:06,336 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:50:06,336 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:50:06,336 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:50:06,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:50:06,337 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:50:06,337 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:50:06,337 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:50:06,337 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:50:06,337 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 10:50:06,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 10:50:06,337 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:50:06,337 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:50:06,337 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:50:06,337 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:50:06,337 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 431f2117f5c677d2ffce2fa99499007e44687a7dec4f669e88843242de06006b [2025-03-08 10:50:06,546 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:50:06,555 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:50:06,557 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:50:06,558 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:50:06,558 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:50:06,560 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-65.i [2025-03-08 10:50:07,658 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/608f94a14/6fbde59e2ca24d2a8d4d6ca40372cc3b/FLAG314703d6a [2025-03-08 10:50:07,914 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:50:07,919 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-65.i [2025-03-08 10:50:07,936 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/608f94a14/6fbde59e2ca24d2a8d4d6ca40372cc3b/FLAG314703d6a [2025-03-08 10:50:08,227 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/608f94a14/6fbde59e2ca24d2a8d4d6ca40372cc3b [2025-03-08 10:50:08,229 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:50:08,230 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:50:08,232 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:50:08,233 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:50:08,236 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:50:08,237 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:50:08" (1/1) ... [2025-03-08 10:50:08,237 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e3e1e79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:50:08, skipping insertion in model container [2025-03-08 10:50:08,237 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:50:08" (1/1) ... [2025-03-08 10:50:08,254 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:50:08,352 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-65.i[915,928] [2025-03-08 10:50:08,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:50:08,415 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:50:08,425 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-65.i[915,928] [2025-03-08 10:50:08,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:50:08,471 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:50:08,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:50:08 WrapperNode [2025-03-08 10:50:08,472 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:50:08,474 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:50:08,474 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:50:08,474 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:50:08,478 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:50:08" (1/1) ... [2025-03-08 10:50:08,486 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:50:08" (1/1) ... [2025-03-08 10:50:08,511 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 237 [2025-03-08 10:50:08,511 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:50:08,512 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:50:08,512 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:50:08,512 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:50:08,517 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:50:08" (1/1) ... [2025-03-08 10:50:08,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:50:08" (1/1) ... [2025-03-08 10:50:08,520 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:50:08" (1/1) ... [2025-03-08 10:50:08,535 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 10:50:08,535 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:50:08" (1/1) ... [2025-03-08 10:50:08,535 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:50:08" (1/1) ... [2025-03-08 10:50:08,549 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:50:08" (1/1) ... [2025-03-08 10:50:08,551 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:50:08" (1/1) ... [2025-03-08 10:50:08,552 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:50:08" (1/1) ... [2025-03-08 10:50:08,553 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:50:08" (1/1) ... [2025-03-08 10:50:08,559 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:50:08,559 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:50:08,559 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:50:08,560 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:50:08,560 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:50:08" (1/1) ... [2025-03-08 10:50:08,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:50:08,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:50:08,586 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 10:50:08,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 10:50:08,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:50:08,608 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:50:08,608 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:50:08,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 10:50:08,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:50:08,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:50:08,677 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:50:08,679 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:50:08,896 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L160: havoc property_#t~bitwise21#1;havoc property_#t~short22#1;havoc property_#t~bitwise23#1;havoc property_#t~short24#1; [2025-03-08 10:50:08,925 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-08 10:50:08,926 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:50:08,949 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:50:08,951 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:50:08,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:50:08 BoogieIcfgContainer [2025-03-08 10:50:08,951 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:50:08,952 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:50:08,952 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:50:08,956 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:50:08,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:50:08" (1/3) ... [2025-03-08 10:50:08,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2480d8eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:50:08, skipping insertion in model container [2025-03-08 10:50:08,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:50:08" (2/3) ... [2025-03-08 10:50:08,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2480d8eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:50:08, skipping insertion in model container [2025-03-08 10:50:08,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:50:08" (3/3) ... [2025-03-08 10:50:08,958 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-65.i [2025-03-08 10:50:08,966 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:50:08,967 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-65.i that has 2 procedures, 94 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:50:09,002 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:50:09,010 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5719ed78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:50:09,010 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:50:09,013 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 67 states have internal predecessors, (95), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 10:50:09,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 10:50:09,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:50:09,023 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:50:09,023 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:50:09,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:50:09,026 INFO L85 PathProgramCache]: Analyzing trace with hash 687073222, now seen corresponding path program 1 times [2025-03-08 10:50:09,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:50:09,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827438023] [2025-03-08 10:50:09,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:50:09,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:50:09,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 10:50:09,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 10:50:09,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:50:09,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:50:09,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-08 10:50:09,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:50:09,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827438023] [2025-03-08 10:50:09,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827438023] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:50:09,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083990614] [2025-03-08 10:50:09,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:50:09,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:50:09,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:50:09,279 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:50:09,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 10:50:09,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 10:50:09,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 10:50:09,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:50:09,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:50:09,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:50:09,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:50:09,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-08 10:50:09,448 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:50:09,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083990614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:50:09,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:50:09,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 10:50:09,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415495359] [2025-03-08 10:50:09,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:50:09,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:50:09,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:50:09,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:50:09,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:50:09,472 INFO L87 Difference]: Start difference. First operand has 94 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 67 states have internal predecessors, (95), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 10:50:09,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:50:09,499 INFO L93 Difference]: Finished difference Result 180 states and 308 transitions. [2025-03-08 10:50:09,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:50:09,502 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 164 [2025-03-08 10:50:09,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:50:09,506 INFO L225 Difference]: With dead ends: 180 [2025-03-08 10:50:09,507 INFO L226 Difference]: Without dead ends: 89 [2025-03-08 10:50:09,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:50:09,510 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:50:09,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:50:09,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-08 10:50:09,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-08 10:50:09,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 62 states have (on average 1.3709677419354838) internal successors, (85), 62 states have internal predecessors, (85), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 10:50:09,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 135 transitions. [2025-03-08 10:50:09,538 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 135 transitions. Word has length 164 [2025-03-08 10:50:09,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:50:09,538 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 135 transitions. [2025-03-08 10:50:09,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 10:50:09,540 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 135 transitions. [2025-03-08 10:50:09,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 10:50:09,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:50:09,543 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:50:09,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 10:50:09,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 10:50:09,743 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:50:09,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:50:09,744 INFO L85 PathProgramCache]: Analyzing trace with hash 863537795, now seen corresponding path program 1 times [2025-03-08 10:50:09,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:50:09,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253584991] [2025-03-08 10:50:09,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:50:09,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:50:09,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 10:50:09,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 10:50:09,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:50:09,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:50:09,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-08 10:50:09,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:50:09,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253584991] [2025-03-08 10:50:09,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253584991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:50:09,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:50:09,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:50:09,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648464766] [2025-03-08 10:50:09,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:50:09,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:50:09,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:50:09,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:50:09,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:50:09,923 INFO L87 Difference]: Start difference. First operand 89 states and 135 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-08 10:50:10,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:50:10,010 INFO L93 Difference]: Finished difference Result 261 states and 399 transitions. [2025-03-08 10:50:10,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:50:10,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 164 [2025-03-08 10:50:10,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:50:10,013 INFO L225 Difference]: With dead ends: 261 [2025-03-08 10:50:10,013 INFO L226 Difference]: Without dead ends: 175 [2025-03-08 10:50:10,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:50:10,014 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 119 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:50:10,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 348 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 10:50:10,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-08 10:50:10,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 106. [2025-03-08 10:50:10,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 79 states have (on average 1.379746835443038) internal successors, (109), 79 states have internal predecessors, (109), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 10:50:10,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 159 transitions. [2025-03-08 10:50:10,029 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 159 transitions. Word has length 164 [2025-03-08 10:50:10,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:50:10,031 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 159 transitions. [2025-03-08 10:50:10,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-08 10:50:10,031 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 159 transitions. [2025-03-08 10:50:10,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 10:50:10,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:50:10,032 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:50:10,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 10:50:10,033 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:50:10,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:50:10,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1318854923, now seen corresponding path program 1 times [2025-03-08 10:50:10,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:50:10,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019174381] [2025-03-08 10:50:10,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:50:10,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:50:10,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 10:50:10,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 10:50:10,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:50:10,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:50:10,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-08 10:50:10,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:50:10,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019174381] [2025-03-08 10:50:10,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019174381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:50:10,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:50:10,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:50:10,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028832694] [2025-03-08 10:50:10,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:50:10,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:50:10,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:50:10,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:50:10,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:50:10,201 INFO L87 Difference]: Start difference. First operand 106 states and 159 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-08 10:50:10,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:50:10,231 INFO L93 Difference]: Finished difference Result 190 states and 283 transitions. [2025-03-08 10:50:10,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:50:10,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 165 [2025-03-08 10:50:10,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:50:10,235 INFO L225 Difference]: With dead ends: 190 [2025-03-08 10:50:10,235 INFO L226 Difference]: Without dead ends: 87 [2025-03-08 10:50:10,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:50:10,236 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:50:10,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 236 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:50:10,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-08 10:50:10,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-08 10:50:10,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 60 states have internal predecessors, (76), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 10:50:10,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 126 transitions. [2025-03-08 10:50:10,248 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 126 transitions. Word has length 165 [2025-03-08 10:50:10,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:50:10,248 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 126 transitions. [2025-03-08 10:50:10,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-08 10:50:10,249 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 126 transitions. [2025-03-08 10:50:10,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 10:50:10,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:50:10,252 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:50:10,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 10:50:10,252 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:50:10,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:50:10,253 INFO L85 PathProgramCache]: Analyzing trace with hash -118230938, now seen corresponding path program 1 times [2025-03-08 10:50:10,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:50:10,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784334538] [2025-03-08 10:50:10,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:50:10,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:50:10,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 10:50:10,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 10:50:10,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:50:10,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:50:10,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-08 10:50:11,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:50:11,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784334538] [2025-03-08 10:50:11,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784334538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:50:11,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:50:11,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 10:50:11,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406241215] [2025-03-08 10:50:11,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:50:11,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 10:50:11,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:50:11,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 10:50:11,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 10:50:11,001 INFO L87 Difference]: Start difference. First operand 87 states and 126 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-08 10:50:11,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:50:11,286 INFO L93 Difference]: Finished difference Result 295 states and 435 transitions. [2025-03-08 10:50:11,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 10:50:11,286 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 166 [2025-03-08 10:50:11,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:50:11,288 INFO L225 Difference]: With dead ends: 295 [2025-03-08 10:50:11,288 INFO L226 Difference]: Without dead ends: 211 [2025-03-08 10:50:11,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:50:11,289 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 275 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 10:50:11,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 695 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 10:50:11,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-08 10:50:11,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 89. [2025-03-08 10:50:11,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 62 states have (on average 1.2580645161290323) internal successors, (78), 62 states have internal predecessors, (78), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 10:50:11,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 128 transitions. [2025-03-08 10:50:11,299 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 128 transitions. Word has length 166 [2025-03-08 10:50:11,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:50:11,300 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 128 transitions. [2025-03-08 10:50:11,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-08 10:50:11,300 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 128 transitions. [2025-03-08 10:50:11,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-08 10:50:11,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:50:11,301 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:50:11,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 10:50:11,301 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:50:11,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:50:11,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1971315666, now seen corresponding path program 1 times [2025-03-08 10:50:11,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:50:11,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183269268] [2025-03-08 10:50:11,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:50:11,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:50:11,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 10:50:11,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 10:50:11,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:50:11,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:50:12,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-08 10:50:12,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:50:12,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183269268] [2025-03-08 10:50:12,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183269268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:50:12,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:50:12,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 10:50:12,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715353970] [2025-03-08 10:50:12,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:50:12,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 10:50:12,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:50:12,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 10:50:12,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:50:12,135 INFO L87 Difference]: Start difference. First operand 89 states and 128 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2025-03-08 10:50:12,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:50:12,468 INFO L93 Difference]: Finished difference Result 204 states and 292 transitions. [2025-03-08 10:50:12,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 10:50:12,469 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 167 [2025-03-08 10:50:12,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:50:12,470 INFO L225 Difference]: With dead ends: 204 [2025-03-08 10:50:12,470 INFO L226 Difference]: Without dead ends: 118 [2025-03-08 10:50:12,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 10:50:12,471 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 263 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:50:12,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 245 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 10:50:12,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-08 10:50:12,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2025-03-08 10:50:12,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 77 states have internal predecessors, (91), 37 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-08 10:50:12,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 165 transitions. [2025-03-08 10:50:12,489 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 165 transitions. Word has length 167 [2025-03-08 10:50:12,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:50:12,491 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 165 transitions. [2025-03-08 10:50:12,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2025-03-08 10:50:12,491 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 165 transitions. [2025-03-08 10:50:12,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-08 10:50:12,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:50:12,494 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:50:12,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 10:50:12,494 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:50:12,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:50:12,494 INFO L85 PathProgramCache]: Analyzing trace with hash 163861203, now seen corresponding path program 1 times [2025-03-08 10:50:12,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:50:12,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310974063] [2025-03-08 10:50:12,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:50:12,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:50:12,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 10:50:12,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 10:50:12,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:50:12,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:50:13,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-08 10:50:13,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:50:13,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310974063] [2025-03-08 10:50:13,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310974063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:50:13,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:50:13,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 10:50:13,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498336226] [2025-03-08 10:50:13,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:50:13,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 10:50:13,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:50:13,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 10:50:13,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:50:13,171 INFO L87 Difference]: Start difference. First operand 117 states and 165 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-08 10:50:13,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:50:13,521 INFO L93 Difference]: Finished difference Result 325 states and 455 transitions. [2025-03-08 10:50:13,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 10:50:13,521 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 167 [2025-03-08 10:50:13,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:50:13,523 INFO L225 Difference]: With dead ends: 325 [2025-03-08 10:50:13,524 INFO L226 Difference]: Without dead ends: 231 [2025-03-08 10:50:13,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-08 10:50:13,525 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 214 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:50:13,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 817 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 10:50:13,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-03-08 10:50:13,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 143. [2025-03-08 10:50:13,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 87 states have (on average 1.160919540229885) internal successors, (101), 88 states have internal predecessors, (101), 50 states have call successors, (50), 5 states have call predecessors, (50), 5 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-08 10:50:13,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 201 transitions. [2025-03-08 10:50:13,563 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 201 transitions. Word has length 167 [2025-03-08 10:50:13,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:50:13,563 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 201 transitions. [2025-03-08 10:50:13,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-08 10:50:13,563 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 201 transitions. [2025-03-08 10:50:13,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 10:50:13,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:50:13,565 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:50:13,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 10:50:13,565 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:50:13,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:50:13,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1753929345, now seen corresponding path program 1 times [2025-03-08 10:50:13,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:50:13,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079531595] [2025-03-08 10:50:13,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:50:13,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:50:13,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 10:50:13,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 10:50:13,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:50:13,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:50:13,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 18 proven. 54 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-08 10:50:13,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:50:13,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079531595] [2025-03-08 10:50:13,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079531595] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:50:13,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964993273] [2025-03-08 10:50:13,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:50:13,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:50:13,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:50:13,852 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:50:13,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 10:50:13,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 10:50:13,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 10:50:13,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:50:13,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:50:13,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 10:50:13,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:50:14,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 468 proven. 54 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2025-03-08 10:50:14,163 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:50:14,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 18 proven. 54 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-08 10:50:14,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964993273] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 10:50:14,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 10:50:14,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-08 10:50:14,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582302544] [2025-03-08 10:50:14,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 10:50:14,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 10:50:14,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:50:14,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 10:50:14,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-08 10:50:14,407 INFO L87 Difference]: Start difference. First operand 143 states and 201 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2025-03-08 10:50:14,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:50:14,743 INFO L93 Difference]: Finished difference Result 255 states and 345 transitions. [2025-03-08 10:50:14,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 10:50:14,744 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 170 [2025-03-08 10:50:14,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:50:14,746 INFO L225 Difference]: With dead ends: 255 [2025-03-08 10:50:14,746 INFO L226 Difference]: Without dead ends: 163 [2025-03-08 10:50:14,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 337 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2025-03-08 10:50:14,747 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 319 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 10:50:14,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 239 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 10:50:14,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-08 10:50:14,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 155. [2025-03-08 10:50:14,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 96 states have (on average 1.1354166666666667) internal successors, (109), 97 states have internal predecessors, (109), 50 states have call successors, (50), 8 states have call predecessors, (50), 8 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-08 10:50:14,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 209 transitions. [2025-03-08 10:50:14,777 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 209 transitions. Word has length 170 [2025-03-08 10:50:14,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:50:14,777 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 209 transitions. [2025-03-08 10:50:14,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2025-03-08 10:50:14,777 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 209 transitions. [2025-03-08 10:50:14,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-08 10:50:14,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:50:14,779 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:50:14,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 10:50:14,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-08 10:50:14,980 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:50:14,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:50:14,980 INFO L85 PathProgramCache]: Analyzing trace with hash -61195666, now seen corresponding path program 1 times [2025-03-08 10:50:14,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:50:14,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907683971] [2025-03-08 10:50:14,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:50:14,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:50:14,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-08 10:50:15,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-08 10:50:15,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:50:15,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 10:50:15,042 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 10:50:15,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-08 10:50:15,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-08 10:50:15,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:50:15,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 10:50:15,162 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 10:50:15,162 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 10:50:15,163 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 10:50:15,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 10:50:15,166 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:50:15,277 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 10:50:15,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:50:15 BoogieIcfgContainer [2025-03-08 10:50:15,280 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 10:50:15,281 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 10:50:15,281 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 10:50:15,281 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 10:50:15,282 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:50:08" (3/4) ... [2025-03-08 10:50:15,283 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 10:50:15,283 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 10:50:15,284 INFO L158 Benchmark]: Toolchain (without parser) took 7053.68ms. Allocated memory was 167.8MB in the beginning and 419.4MB in the end (delta: 251.7MB). Free memory was 124.7MB in the beginning and 258.6MB in the end (delta: -133.9MB). Peak memory consumption was 113.7MB. Max. memory is 16.1GB. [2025-03-08 10:50:15,284 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 117.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:50:15,284 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.06ms. Allocated memory is still 167.8MB. Free memory was 124.7MB in the beginning and 110.3MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 10:50:15,284 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.58ms. Allocated memory is still 167.8MB. Free memory was 110.3MB in the beginning and 106.9MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:50:15,284 INFO L158 Benchmark]: Boogie Preprocessor took 47.22ms. Allocated memory is still 167.8MB. Free memory was 106.9MB in the beginning and 103.5MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:50:15,285 INFO L158 Benchmark]: IcfgBuilder took 391.85ms. Allocated memory is still 167.8MB. Free memory was 103.5MB in the beginning and 75.9MB in the end (delta: 27.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 10:50:15,285 INFO L158 Benchmark]: TraceAbstraction took 6328.19ms. Allocated memory was 167.8MB in the beginning and 419.4MB in the end (delta: 251.7MB). Free memory was 75.9MB in the beginning and 262.3MB in the end (delta: -186.4MB). Peak memory consumption was 63.4MB. Max. memory is 16.1GB. [2025-03-08 10:50:15,285 INFO L158 Benchmark]: Witness Printer took 2.54ms. Allocated memory is still 419.4MB. Free memory was 258.7MB in the beginning and 258.6MB in the end (delta: 66.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:50:15,286 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 117.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 240.06ms. Allocated memory is still 167.8MB. Free memory was 124.7MB in the beginning and 110.3MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.58ms. Allocated memory is still 167.8MB. Free memory was 110.3MB in the beginning and 106.9MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.22ms. Allocated memory is still 167.8MB. Free memory was 106.9MB in the beginning and 103.5MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 391.85ms. Allocated memory is still 167.8MB. Free memory was 103.5MB in the beginning and 75.9MB in the end (delta: 27.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6328.19ms. Allocated memory was 167.8MB in the beginning and 419.4MB in the end (delta: 251.7MB). Free memory was 75.9MB in the beginning and 262.3MB in the end (delta: -186.4MB). Peak memory consumption was 63.4MB. Max. memory is 16.1GB. * Witness Printer took 2.54ms. Allocated memory is still 419.4MB. Free memory was 258.7MB in the beginning and 258.6MB in the end (delta: 66.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 91, overapproximation of someBinaryFLOATComparisonOperation at line 149, overapproximation of someBinaryDOUBLEComparisonOperation at line 160, overapproximation of someBinaryDOUBLEComparisonOperation at line 127, overapproximation of someBinaryDOUBLEComparisonOperation at line 129, overapproximation of someBinaryDOUBLEComparisonOperation at line 160. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 4; [L23] unsigned short int var_1_8 = 64; [L24] unsigned short int var_1_11 = 256; [L25] unsigned short int var_1_12 = 0; [L26] unsigned short int var_1_13 = 64; [L27] unsigned char var_1_14 = 1; [L28] unsigned char var_1_15 = 0; [L29] signed char var_1_16 = 50; [L30] signed char var_1_19 = -100; [L31] double var_1_20 = 100000000.8; [L32] double var_1_21 = 15.125; [L33] double var_1_22 = 99.22; [L34] signed long int var_1_23 = -16; [L35] unsigned char var_1_24 = 1; [L36] signed char var_1_25 = 10; [L37] signed char var_1_26 = 16; [L38] unsigned char var_1_27 = 0; [L39] double var_1_28 = 5.5; [L40] signed long int var_1_29 = 50; [L41] signed long int var_1_30 = 16; [L42] signed char var_1_31 = 4; [L43] signed char var_1_32 = 64; [L44] unsigned short int var_1_33 = 16; [L45] unsigned short int var_1_34 = 100; [L46] signed short int var_1_35 = -32; [L47] float var_1_36 = 99.05; [L48] float var_1_37 = 10.75; [L49] signed short int last_1_var_1_1 = 4; [L50] unsigned char last_1_var_1_14 = 1; [L51] signed char last_1_var_1_16 = 50; [L52] signed long int last_1_var_1_23 = -16; [L53] unsigned char last_1_var_1_24 = 1; [L54] double last_1_var_1_28 = 5.5; VAL [isInitial=0, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L164] isInitial = 1 [L165] FCALL initially() [L166] COND TRUE 1 [L167] CALL updateLastVariables() [L152] last_1_var_1_1 = var_1_1 [L153] last_1_var_1_14 = var_1_14 [L154] last_1_var_1_16 = var_1_16 [L155] last_1_var_1_23 = var_1_23 [L156] last_1_var_1_24 = var_1_24 [L157] last_1_var_1_28 = var_1_28 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L167] RET updateLastVariables() [L168] CALL updateVariables() [L111] var_1_11 = __VERIFIER_nondet_ushort() [L112] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L112] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L113] CALL assume_abort_if_not(var_1_11 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L113] RET assume_abort_if_not(var_1_11 <= 32767) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L114] var_1_12 = __VERIFIER_nondet_ushort() [L115] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L115] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L116] CALL assume_abort_if_not(var_1_12 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L116] RET assume_abort_if_not(var_1_12 <= 32767) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L117] var_1_13 = __VERIFIER_nondet_ushort() [L118] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L118] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L119] CALL assume_abort_if_not(var_1_13 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L119] RET assume_abort_if_not(var_1_13 <= 65534) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L120] var_1_15 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L121] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L122] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L122] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L123] var_1_19 = __VERIFIER_nondet_char() [L124] CALL assume_abort_if_not(var_1_19 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L124] RET assume_abort_if_not(var_1_19 >= -127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L125] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L125] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L126] var_1_21 = __VERIFIER_nondet_double() [L127] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L127] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L128] var_1_22 = __VERIFIER_nondet_double() [L129] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L129] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L130] var_1_25 = __VERIFIER_nondet_char() [L131] CALL assume_abort_if_not(var_1_25 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L131] RET assume_abort_if_not(var_1_25 >= -1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L132] CALL assume_abort_if_not(var_1_25 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L132] RET assume_abort_if_not(var_1_25 <= 127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L133] var_1_26 = __VERIFIER_nondet_char() [L134] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L134] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L135] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L135] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L136] var_1_27 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L137] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L138] CALL assume_abort_if_not(var_1_27 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L138] RET assume_abort_if_not(var_1_27 <= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L139] var_1_30 = __VERIFIER_nondet_long() [L140] CALL assume_abort_if_not(var_1_30 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L140] RET assume_abort_if_not(var_1_30 >= -2147483647) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L141] CALL assume_abort_if_not(var_1_30 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L141] RET assume_abort_if_not(var_1_30 <= 2147483646) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L142] var_1_32 = __VERIFIER_nondet_char() [L143] CALL assume_abort_if_not(var_1_32 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L143] RET assume_abort_if_not(var_1_32 >= -127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L144] CALL assume_abort_if_not(var_1_32 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L144] RET assume_abort_if_not(var_1_32 <= 126) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L145] var_1_34 = __VERIFIER_nondet_ushort() [L146] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L146] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L147] CALL assume_abort_if_not(var_1_34 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=16, var_1_34=126, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=16, var_1_34=126, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L147] RET assume_abort_if_not(var_1_34 <= 65534) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=16, var_1_34=126, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L148] var_1_37 = __VERIFIER_nondet_float() [L149] CALL assume_abort_if_not((var_1_37 >= -922337.2036854765600e+13F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854765600e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=16, var_1_34=126, var_1_35=-32, var_1_36=1981/20, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=16, var_1_34=126, var_1_35=-32, var_1_36=1981/20, var_1_8=64] [L149] RET assume_abort_if_not((var_1_37 >= -922337.2036854765600e+13F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854765600e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=16, var_1_34=126, var_1_35=-32, var_1_36=1981/20, var_1_8=64] [L168] RET updateVariables() [L169] CALL step() [L58] var_1_29 = var_1_30 [L59] var_1_31 = var_1_32 [L60] var_1_33 = var_1_34 [L61] var_1_35 = var_1_32 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=126, var_1_34=126, var_1_35=126, var_1_36=1981/20, var_1_8=64] [L62] EXPR var_1_29 ^ var_1_34 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=126, var_1_34=126, var_1_35=126, var_1_36=1981/20, var_1_8=64] [L62] COND FALSE !(((((var_1_32) < 0 ) ? -(var_1_32) : (var_1_32))) < (var_1_29 ^ var_1_34)) [L69] var_1_36 = var_1_37 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=126, var_1_34=126, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L71] signed long int stepLocal_3 = last_1_var_1_23; [L72] unsigned char stepLocal_2 = ! (last_1_var_1_14 || last_1_var_1_14); VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, stepLocal_3=-16, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=126, var_1_34=126, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L73] COND FALSE !(last_1_var_1_23 < stepLocal_3) [L84] var_1_16 = 100 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=126, var_1_34=126, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L86] EXPR ((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=126, var_1_34=126, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L86] COND TRUE (((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16) >= last_1_var_1_23 [L87] var_1_23 = (5 - var_1_12) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-32762, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=126, var_1_34=126, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L91] var_1_20 = (var_1_21 - (var_1_22 + 1.5)) [L92] var_1_28 = var_1_21 [L93] unsigned char stepLocal_0 = var_1_23 > 4; VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=4, var_1_21=100000005, var_1_23=-32762, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=126, var_1_34=126, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L94] COND TRUE (var_1_23 <= var_1_23) || stepLocal_0 [L95] var_1_1 = (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=126, var_1_34=126, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L99] var_1_24 = ((var_1_1 <= (var_1_25 - var_1_26)) && var_1_27) [L100] signed char stepLocal_1 = var_1_16; VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_1=100, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=126, var_1_34=126, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L101] EXPR var_1_16 ^ var_1_16 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_1=100, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=126, var_1_34=126, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L101] COND TRUE stepLocal_1 > (var_1_23 + (var_1_16 ^ var_1_16)) [L102] var_1_14 = (var_1_24 || var_1_15) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=126, var_1_34=126, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L104] COND TRUE \read(var_1_14) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=126, var_1_34=126, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L105] COND FALSE !(\read(var_1_24)) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=126, var_1_34=126, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L169] RET step() [L170] CALL, EXPR property() [L160] EXPR ((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=126, var_1_34=126, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L160] EXPR var_1_16 ^ var_1_16 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=126, var_1_34=126, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L160] EXPR ((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=126, var_1_34=126, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L160] EXPR (((((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1)) && ((last_1_var_1_23 < last_1_var_1_23) ? (((! (last_1_var_1_14 || last_1_var_1_14)) && last_1_var_1_24) ? ((((((2.75f) > (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f))))) ? (2.75f) : (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f)))))) != last_1_var_1_28) ? (var_1_16 == ((signed char) 10)) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) 100)))) && (var_1_20 == ((double) (var_1_21 - (var_1_22 + 1.5))))) && (((((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16) >= last_1_var_1_23) ? (var_1_23 == ((signed long int) (5 - var_1_12))) : (var_1_23 == ((signed long int) ((((var_1_11) > (last_1_var_1_1)) ? (var_1_11) : (last_1_var_1_1)))))) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=126, var_1_34=126, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L160-L161] return (((((((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1)) && ((last_1_var_1_23 < last_1_var_1_23) ? (((! (last_1_var_1_14 || last_1_var_1_14)) && last_1_var_1_24) ? ((((((2.75f) > (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f))))) ? (2.75f) : (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f)))))) != last_1_var_1_28) ? (var_1_16 == ((signed char) 10)) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) 100)))) && (var_1_20 == ((double) (var_1_21 - (var_1_22 + 1.5))))) && (((((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16) >= last_1_var_1_23) ? (var_1_23 == ((signed long int) (5 - var_1_12))) : (var_1_23 == ((signed long int) ((((var_1_11) > (last_1_var_1_1)) ? (var_1_11) : (last_1_var_1_1))))))) && (var_1_24 == ((unsigned char) ((var_1_1 <= (var_1_25 - var_1_26)) && var_1_27)))) && (var_1_28 == ((double) var_1_21)) ; [L170] RET, EXPR property() [L170] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=126, var_1_34=126, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=126, var_1_34=126, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 170 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.2s, OverallIterations: 8, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1197 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1190 mSDsluCounter, 2712 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1414 mSDsCounter, 378 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 794 IncrementalHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 378 mSolverCounterUnsat, 1298 mSDtfsCounter, 794 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 560 GetRequests, 519 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155occurred in iteration=7, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 288 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1668 NumberOfCodeBlocks, 1668 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1657 ConstructedInterpolants, 0 QuantifiedInterpolants, 3943 SizeOfPredicates, 2 NumberOfNonLiveVariables, 829 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 11790/12000 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 10:50:15,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-65.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 431f2117f5c677d2ffce2fa99499007e44687a7dec4f669e88843242de06006b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:50:17,106 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:50:17,187 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 10:50:17,193 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:50:17,194 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:50:17,209 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:50:17,209 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:50:17,209 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:50:17,209 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:50:17,210 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:50:17,210 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:50:17,210 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:50:17,210 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:50:17,210 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:50:17,210 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:50:17,210 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:50:17,210 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:50:17,210 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:50:17,210 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:50:17,210 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:50:17,210 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:50:17,210 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:50:17,210 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:50:17,211 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 10:50:17,211 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 10:50:17,211 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 10:50:17,211 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:50:17,211 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:50:17,211 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:50:17,211 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:50:17,211 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:50:17,211 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:50:17,211 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:50:17,211 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:50:17,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:50:17,211 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:50:17,211 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:50:17,211 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:50:17,211 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:50:17,211 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 10:50:17,212 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 10:50:17,212 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:50:17,212 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:50:17,212 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:50:17,212 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:50:17,212 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 431f2117f5c677d2ffce2fa99499007e44687a7dec4f669e88843242de06006b [2025-03-08 10:50:17,464 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:50:17,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:50:17,473 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:50:17,474 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:50:17,474 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:50:17,477 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-65.i [2025-03-08 10:50:18,638 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d605567ab/13b656ca0cd347c59c2bd6bcc59242c6/FLAGadfa6fc64 [2025-03-08 10:50:18,839 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:50:18,841 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-65.i [2025-03-08 10:50:18,849 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d605567ab/13b656ca0cd347c59c2bd6bcc59242c6/FLAGadfa6fc64 [2025-03-08 10:50:19,192 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d605567ab/13b656ca0cd347c59c2bd6bcc59242c6 [2025-03-08 10:50:19,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:50:19,196 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:50:19,197 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:50:19,197 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:50:19,199 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:50:19,200 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:50:19" (1/1) ... [2025-03-08 10:50:19,200 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34938247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:50:19, skipping insertion in model container [2025-03-08 10:50:19,200 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:50:19" (1/1) ... [2025-03-08 10:50:19,215 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:50:19,307 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-65.i[915,928] [2025-03-08 10:50:19,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:50:19,361 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:50:19,369 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-65.i[915,928] [2025-03-08 10:50:19,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:50:19,404 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:50:19,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:50:19 WrapperNode [2025-03-08 10:50:19,405 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:50:19,405 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:50:19,405 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:50:19,406 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:50:19,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:50:19" (1/1) ... [2025-03-08 10:50:19,417 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:50:19" (1/1) ... [2025-03-08 10:50:19,436 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 171 [2025-03-08 10:50:19,436 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:50:19,437 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:50:19,437 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:50:19,437 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:50:19,443 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:50:19" (1/1) ... [2025-03-08 10:50:19,443 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:50:19" (1/1) ... [2025-03-08 10:50:19,449 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:50:19" (1/1) ... [2025-03-08 10:50:19,466 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 10:50:19,467 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:50:19" (1/1) ... [2025-03-08 10:50:19,467 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:50:19" (1/1) ... [2025-03-08 10:50:19,473 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:50:19" (1/1) ... [2025-03-08 10:50:19,473 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:50:19" (1/1) ... [2025-03-08 10:50:19,474 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:50:19" (1/1) ... [2025-03-08 10:50:19,475 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:50:19" (1/1) ... [2025-03-08 10:50:19,481 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:50:19,482 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:50:19,482 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:50:19,482 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:50:19,483 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:50:19" (1/1) ... [2025-03-08 10:50:19,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:50:19,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:50:19,506 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 10:50:19,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 10:50:19,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:50:19,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 10:50:19,527 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:50:19,527 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:50:19,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:50:19,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:50:19,605 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:50:19,607 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:50:20,963 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-08 10:50:20,963 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:50:20,974 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:50:20,974 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:50:20,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:50:20 BoogieIcfgContainer [2025-03-08 10:50:20,975 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:50:20,976 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:50:20,976 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:50:20,980 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:50:20,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:50:19" (1/3) ... [2025-03-08 10:50:20,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e6b7352 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:50:20, skipping insertion in model container [2025-03-08 10:50:20,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:50:19" (2/3) ... [2025-03-08 10:50:20,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e6b7352 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:50:20, skipping insertion in model container [2025-03-08 10:50:20,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:50:20" (3/3) ... [2025-03-08 10:50:20,981 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-65.i [2025-03-08 10:50:20,991 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:50:20,992 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-65.i that has 2 procedures, 70 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:50:21,038 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:50:21,048 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@438cd1c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:50:21,050 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:50:21,053 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 43 states have internal predecessors, (56), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 10:50:21,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-08 10:50:21,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:50:21,062 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:50:21,062 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:50:21,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:50:21,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1608546691, now seen corresponding path program 1 times [2025-03-08 10:50:21,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:50:21,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [652297744] [2025-03-08 10:50:21,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:50:21,074 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:50:21,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:50:21,076 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 10:50:21,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 10:50:21,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-08 10:50:21,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-08 10:50:21,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:50:21,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:50:21,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:50:21,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:50:21,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2025-03-08 10:50:21,423 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:50:21,424 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 10:50:21,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [652297744] [2025-03-08 10:50:21,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [652297744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:50:21,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:50:21,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 10:50:21,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169096158] [2025-03-08 10:50:21,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:50:21,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:50:21,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 10:50:21,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:50:21,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:50:21,447 INFO L87 Difference]: Start difference. First operand has 70 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 43 states have internal predecessors, (56), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 10:50:21,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:50:21,466 INFO L93 Difference]: Finished difference Result 134 states and 232 transitions. [2025-03-08 10:50:21,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:50:21,468 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 157 [2025-03-08 10:50:21,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:50:21,472 INFO L225 Difference]: With dead ends: 134 [2025-03-08 10:50:21,472 INFO L226 Difference]: Without dead ends: 67 [2025-03-08 10:50:21,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:50:21,477 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:50:21,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:50:21,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-08 10:50:21,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-08 10:50:21,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 40 states have (on average 1.25) internal successors, (50), 40 states have internal predecessors, (50), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 10:50:21,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 100 transitions. [2025-03-08 10:50:21,511 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 100 transitions. Word has length 157 [2025-03-08 10:50:21,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:50:21,511 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 100 transitions. [2025-03-08 10:50:21,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 10:50:21,511 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 100 transitions. [2025-03-08 10:50:21,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-08 10:50:21,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:50:21,513 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:50:21,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-08 10:50:21,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:50:21,714 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:50:21,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:50:21,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1967665568, now seen corresponding path program 1 times [2025-03-08 10:50:21,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:50:21,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1301314732] [2025-03-08 10:50:21,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:50:21,716 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:50:21,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:50:21,718 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 10:50:21,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 10:50:21,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-08 10:50:21,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-08 10:50:21,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:50:21,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:50:21,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 10:50:21,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:50:22,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 468 proven. 54 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2025-03-08 10:50:22,379 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:50:22,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 18 proven. 54 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-08 10:50:22,676 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 10:50:22,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1301314732] [2025-03-08 10:50:22,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1301314732] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 10:50:22,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 10:50:22,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2025-03-08 10:50:22,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593398068] [2025-03-08 10:50:22,677 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 10:50:22,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 10:50:22,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 10:50:22,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 10:50:22,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 10:50:22,681 INFO L87 Difference]: Start difference. First operand 67 states and 100 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2025-03-08 10:50:23,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:50:23,843 INFO L93 Difference]: Finished difference Result 150 states and 221 transitions. [2025-03-08 10:50:23,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 10:50:23,844 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 157 [2025-03-08 10:50:23,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:50:23,846 INFO L225 Difference]: With dead ends: 150 [2025-03-08 10:50:23,846 INFO L226 Difference]: Without dead ends: 86 [2025-03-08 10:50:23,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 305 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2025-03-08 10:50:23,847 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 105 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:50:23,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 167 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 10:50:23,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-08 10:50:23,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2025-03-08 10:50:23,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 48 states have internal predecessors, (56), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-08 10:50:23,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 118 transitions. [2025-03-08 10:50:23,858 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 118 transitions. Word has length 157 [2025-03-08 10:50:23,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:50:23,861 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 118 transitions. [2025-03-08 10:50:23,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2025-03-08 10:50:23,861 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 118 transitions. [2025-03-08 10:50:23,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-08 10:50:23,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:50:23,862 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:50:23,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 10:50:24,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:50:24,063 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:50:24,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:50:24,065 INFO L85 PathProgramCache]: Analyzing trace with hash -895734553, now seen corresponding path program 1 times [2025-03-08 10:50:24,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:50:24,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1976583061] [2025-03-08 10:50:24,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:50:24,067 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:50:24,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:50:24,069 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 10:50:24,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 10:50:24,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 10:50:24,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 10:50:24,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:50:24,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:50:24,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 10:50:24,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:50:24,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 534 proven. 21 refuted. 0 times theorem prover too weak. 645 trivial. 0 not checked. [2025-03-08 10:50:24,448 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:50:24,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 51 proven. 21 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-08 10:50:24,668 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 10:50:24,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1976583061] [2025-03-08 10:50:24,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1976583061] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 10:50:24,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 10:50:24,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2025-03-08 10:50:24,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257753390] [2025-03-08 10:50:24,669 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 10:50:24,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 10:50:24,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 10:50:24,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 10:50:24,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 10:50:24,673 INFO L87 Difference]: Start difference. First operand 81 states and 118 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-08 10:50:25,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:50:25,809 INFO L93 Difference]: Finished difference Result 216 states and 305 transitions. [2025-03-08 10:50:25,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 10:50:25,809 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 158 [2025-03-08 10:50:25,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:50:25,811 INFO L225 Difference]: With dead ends: 216 [2025-03-08 10:50:25,813 INFO L226 Difference]: Without dead ends: 148 [2025-03-08 10:50:25,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 308 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2025-03-08 10:50:25,815 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 133 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:50:25,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 325 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 10:50:25,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-08 10:50:25,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 127. [2025-03-08 10:50:25,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 70 states have (on average 1.1142857142857143) internal successors, (78), 71 states have internal predecessors, (78), 50 states have call successors, (50), 6 states have call predecessors, (50), 6 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-08 10:50:25,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 178 transitions. [2025-03-08 10:50:25,845 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 178 transitions. Word has length 158 [2025-03-08 10:50:25,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:50:25,845 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 178 transitions. [2025-03-08 10:50:25,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-08 10:50:25,846 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 178 transitions. [2025-03-08 10:50:25,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-08 10:50:25,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:50:25,849 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:50:25,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-08 10:50:26,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:50:26,050 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:50:26,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:50:26,051 INFO L85 PathProgramCache]: Analyzing trace with hash -894811032, now seen corresponding path program 1 times [2025-03-08 10:50:26,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:50:26,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [407964361] [2025-03-08 10:50:26,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:50:26,052 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:50:26,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:50:26,053 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 10:50:26,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-08 10:50:26,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 10:50:26,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 10:50:26,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:50:26,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:50:26,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-08 10:50:26,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:50:55,627 WARN L286 SmtUtils]: Spent 9.45s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-08 10:51:24,307 WARN L286 SmtUtils]: Spent 11.08s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)