./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-38.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-38.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 c09ae5383c303ea70fa8be3591cb19f07b66ade63b6f0323637dd7a8d6da530f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 08:33:58,499 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 08:33:58,579 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 08:33:58,583 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 08:33:58,583 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 08:33:58,618 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 08:33:58,620 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 08:33:58,621 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 08:33:58,622 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 08:33:58,623 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 08:33:58,623 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 08:33:58,624 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 08:33:58,624 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 08:33:58,625 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 08:33:58,627 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 08:33:58,627 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 08:33:58,628 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 08:33:58,628 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 08:33:58,628 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 08:33:58,629 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 08:33:58,629 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 08:33:58,633 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 08:33:58,633 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 08:33:58,634 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 08:33:58,634 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 08:33:58,634 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 08:33:58,634 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 08:33:58,634 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 08:33:58,635 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 08:33:58,635 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 08:33:58,635 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 08:33:58,635 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 08:33:58,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 08:33:58,636 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 08:33:58,636 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 08:33:58,636 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 08:33:58,636 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 08:33:58,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 08:33:58,637 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 08:33:58,638 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 08:33:58,638 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 08:33:58,639 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 08:33:58,639 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> c09ae5383c303ea70fa8be3591cb19f07b66ade63b6f0323637dd7a8d6da530f [2024-10-14 08:33:58,903 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 08:33:58,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 08:33:58,936 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 08:33:58,937 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 08:33:58,938 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 08:33:58,939 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-38.i [2024-10-14 08:34:00,427 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 08:34:00,654 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 08:34:00,658 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-38.i [2024-10-14 08:34:00,672 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7959e5384/cd8d6fb45a8840c3b40b720dbeda0f64/FLAGcf330ab17 [2024-10-14 08:34:01,011 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7959e5384/cd8d6fb45a8840c3b40b720dbeda0f64 [2024-10-14 08:34:01,013 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 08:34:01,014 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 08:34:01,016 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 08:34:01,016 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 08:34:01,021 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 08:34:01,022 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:34:01" (1/1) ... [2024-10-14 08:34:01,023 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3febda24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:34:01, skipping insertion in model container [2024-10-14 08:34:01,023 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:34:01" (1/1) ... [2024-10-14 08:34:01,059 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 08:34:01,236 WARN L248 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-25_file-38.i[915,928] [2024-10-14 08:34:01,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 08:34:01,342 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 08:34:01,354 WARN L248 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-25_file-38.i[915,928] [2024-10-14 08:34:01,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 08:34:01,399 INFO L204 MainTranslator]: Completed translation [2024-10-14 08:34:01,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:34:01 WrapperNode [2024-10-14 08:34:01,400 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 08:34:01,401 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 08:34:01,401 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 08:34:01,401 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 08:34:01,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:34:01" (1/1) ... [2024-10-14 08:34:01,417 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:34:01" (1/1) ... [2024-10-14 08:34:01,450 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 221 [2024-10-14 08:34:01,451 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 08:34:01,451 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 08:34:01,451 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 08:34:01,452 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 08:34:01,462 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:34:01" (1/1) ... [2024-10-14 08:34:01,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:34:01" (1/1) ... [2024-10-14 08:34:01,465 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:34:01" (1/1) ... [2024-10-14 08:34:01,481 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]. [2024-10-14 08:34:01,482 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:34:01" (1/1) ... [2024-10-14 08:34:01,482 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:34:01" (1/1) ... [2024-10-14 08:34:01,493 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:34:01" (1/1) ... [2024-10-14 08:34:01,501 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:34:01" (1/1) ... [2024-10-14 08:34:01,503 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:34:01" (1/1) ... [2024-10-14 08:34:01,504 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:34:01" (1/1) ... [2024-10-14 08:34:01,507 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 08:34:01,508 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 08:34:01,508 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 08:34:01,508 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 08:34:01,509 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:34:01" (1/1) ... [2024-10-14 08:34:01,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 08:34:01,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 08:34:01,550 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) [2024-10-14 08:34:01,556 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 [2024-10-14 08:34:01,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 08:34:01,592 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 08:34:01,593 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 08:34:01,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 08:34:01,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 08:34:01,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 08:34:01,672 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 08:34:01,674 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 08:34:02,035 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-14 08:34:02,035 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 08:34:02,072 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 08:34:02,073 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 08:34:02,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:34:02 BoogieIcfgContainer [2024-10-14 08:34:02,074 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 08:34:02,076 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 08:34:02,077 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 08:34:02,080 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 08:34:02,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:34:01" (1/3) ... [2024-10-14 08:34:02,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18f3e362 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:34:02, skipping insertion in model container [2024-10-14 08:34:02,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:34:01" (2/3) ... [2024-10-14 08:34:02,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18f3e362 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:34:02, skipping insertion in model container [2024-10-14 08:34:02,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:34:02" (3/3) ... [2024-10-14 08:34:02,083 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-38.i [2024-10-14 08:34:02,103 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 08:34:02,104 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 08:34:02,165 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 08:34:02,170 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;@53824ba7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 08:34:02,170 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 08:34:02,174 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-14 08:34:02,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-10-14 08:34:02,188 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:34:02,189 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 08:34:02,189 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:34:02,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:34:02,194 INFO L85 PathProgramCache]: Analyzing trace with hash 358862912, now seen corresponding path program 1 times [2024-10-14 08:34:02,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:34:02,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868082420] [2024-10-14 08:34:02,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:34:02,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:34:02,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:02,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 08:34:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:02,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 08:34:02,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:02,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 08:34:02,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:02,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 08:34:02,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:02,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 08:34:02,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:02,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 08:34:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:02,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 08:34:02,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:02,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 08:34:02,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:02,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 08:34:02,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:02,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 08:34:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:02,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 08:34:02,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:02,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 08:34:02,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:02,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 08:34:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:02,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 08:34:02,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:02,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 08:34:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:02,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 08:34:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:02,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 08:34:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:02,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 08:34:02,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:02,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 08:34:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:02,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 08:34:02,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:02,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 08:34:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:02,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 08:34:02,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:02,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 08:34:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:02,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 08:34:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:02,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 08:34:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:02,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 08:34:02,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:02,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 08:34:02,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:02,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 08:34:02,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:02,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 08:34:02,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:02,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 08:34:02,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:02,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 08:34:02,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:02,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 08:34:02,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:02,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-14 08:34:02,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:02,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-14 08:34:02,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 08:34:02,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868082420] [2024-10-14 08:34:02,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868082420] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:34:02,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:34:02,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 08:34:02,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839805556] [2024-10-14 08:34:02,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:34:02,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 08:34:02,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 08:34:02,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 08:34:02,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 08:34:02,766 INFO L87 Difference]: Start difference. First operand has 90 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-14 08:34:02,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:34:02,824 INFO L93 Difference]: Finished difference Result 177 states and 321 transitions. [2024-10-14 08:34:02,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 08:34:02,828 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 203 [2024-10-14 08:34:02,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:34:02,836 INFO L225 Difference]: With dead ends: 177 [2024-10-14 08:34:02,836 INFO L226 Difference]: Without dead ends: 88 [2024-10-14 08:34:02,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 08:34:02,847 INFO L432 NwaCegarLoop]: 137 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, 137 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 [2024-10-14 08:34:02,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 08:34:02,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-14 08:34:02,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-14 08:34:02,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 53 states have internal predecessors, (74), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-14 08:34:02,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 140 transitions. [2024-10-14 08:34:02,900 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 140 transitions. Word has length 203 [2024-10-14 08:34:02,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:34:02,900 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 140 transitions. [2024-10-14 08:34:02,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-14 08:34:02,901 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 140 transitions. [2024-10-14 08:34:02,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-10-14 08:34:02,906 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:34:02,906 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 08:34:02,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 08:34:02,907 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:34:02,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:34:02,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1851500554, now seen corresponding path program 1 times [2024-10-14 08:34:02,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:34:02,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119911440] [2024-10-14 08:34:02,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:34:02,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:34:03,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:03,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 08:34:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:03,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 08:34:03,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:03,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 08:34:03,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:03,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 08:34:03,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:03,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 08:34:03,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:03,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 08:34:03,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:03,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 08:34:03,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:03,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 08:34:03,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:03,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 08:34:03,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:03,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 08:34:03,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:03,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 08:34:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:03,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 08:34:03,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:03,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 08:34:03,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:03,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 08:34:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:03,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 08:34:03,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:03,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 08:34:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:03,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 08:34:03,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:03,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 08:34:03,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:03,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 08:34:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:03,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 08:34:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:03,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 08:34:03,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:03,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 08:34:03,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:03,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 08:34:03,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:03,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 08:34:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:03,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 08:34:03,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:03,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 08:34:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:03,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 08:34:03,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:03,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 08:34:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:03,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 08:34:03,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:03,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 08:34:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:03,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 08:34:03,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:03,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 08:34:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:03,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-14 08:34:03,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:03,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-14 08:34:03,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 08:34:03,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119911440] [2024-10-14 08:34:03,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119911440] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:34:03,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:34:03,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 08:34:03,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991205312] [2024-10-14 08:34:03,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:34:03,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 08:34:03,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 08:34:03,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 08:34:03,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 08:34:03,936 INFO L87 Difference]: Start difference. First operand 88 states and 140 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-14 08:34:04,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:34:04,277 INFO L93 Difference]: Finished difference Result 344 states and 548 transitions. [2024-10-14 08:34:04,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 08:34:04,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 203 [2024-10-14 08:34:04,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:34:04,283 INFO L225 Difference]: With dead ends: 344 [2024-10-14 08:34:04,283 INFO L226 Difference]: Without dead ends: 257 [2024-10-14 08:34:04,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 08:34:04,285 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 336 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 08:34:04,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 534 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 08:34:04,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-10-14 08:34:04,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 173. [2024-10-14 08:34:04,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 104 states have (on average 1.3942307692307692) internal successors, (145), 104 states have internal predecessors, (145), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-14 08:34:04,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 277 transitions. [2024-10-14 08:34:04,342 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 277 transitions. Word has length 203 [2024-10-14 08:34:04,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:34:04,347 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 277 transitions. [2024-10-14 08:34:04,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-14 08:34:04,347 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 277 transitions. [2024-10-14 08:34:04,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-14 08:34:04,352 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:34:04,352 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 08:34:04,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 08:34:04,353 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:34:04,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:34:04,353 INFO L85 PathProgramCache]: Analyzing trace with hash -48923620, now seen corresponding path program 1 times [2024-10-14 08:34:04,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:34:04,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702286801] [2024-10-14 08:34:04,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:34:04,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:34:04,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:04,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 08:34:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:04,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 08:34:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:04,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 08:34:04,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:04,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 08:34:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:04,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 08:34:04,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:04,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 08:34:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:04,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 08:34:04,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:04,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 08:34:04,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:04,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 08:34:04,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:04,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 08:34:04,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:04,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 08:34:04,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:04,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 08:34:04,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:04,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 08:34:04,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:04,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 08:34:04,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:04,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 08:34:04,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:04,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 08:34:04,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:04,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 08:34:04,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:04,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 08:34:04,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:04,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 08:34:04,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:04,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 08:34:04,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:04,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 08:34:04,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:04,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 08:34:04,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:04,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 08:34:04,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:04,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 08:34:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:04,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 08:34:04,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:04,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 08:34:04,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:04,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 08:34:04,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:04,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 08:34:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:04,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 08:34:04,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:04,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 08:34:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:04,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 08:34:04,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:04,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 08:34:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:04,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-14 08:34:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:04,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-14 08:34:04,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 08:34:04,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702286801] [2024-10-14 08:34:04,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702286801] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:34:04,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:34:04,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 08:34:04,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378789005] [2024-10-14 08:34:04,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:34:04,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 08:34:04,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 08:34:04,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 08:34:04,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 08:34:04,870 INFO L87 Difference]: Start difference. First operand 173 states and 277 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-14 08:34:05,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:34:05,200 INFO L93 Difference]: Finished difference Result 553 states and 885 transitions. [2024-10-14 08:34:05,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 08:34:05,201 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 204 [2024-10-14 08:34:05,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:34:05,208 INFO L225 Difference]: With dead ends: 553 [2024-10-14 08:34:05,210 INFO L226 Difference]: Without dead ends: 381 [2024-10-14 08:34:05,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 08:34:05,214 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 122 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 08:34:05,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 476 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 08:34:05,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-10-14 08:34:05,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 345. [2024-10-14 08:34:05,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 208 states have (on average 1.3942307692307692) internal successors, (290), 208 states have internal predecessors, (290), 132 states have call successors, (132), 4 states have call predecessors, (132), 4 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2024-10-14 08:34:05,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 554 transitions. [2024-10-14 08:34:05,309 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 554 transitions. Word has length 204 [2024-10-14 08:34:05,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:34:05,311 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 554 transitions. [2024-10-14 08:34:05,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-14 08:34:05,311 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 554 transitions. [2024-10-14 08:34:05,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-14 08:34:05,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:34:05,317 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 08:34:05,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 08:34:05,318 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:34:05,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:34:05,318 INFO L85 PathProgramCache]: Analyzing trace with hash -635729634, now seen corresponding path program 1 times [2024-10-14 08:34:05,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:34:05,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310317538] [2024-10-14 08:34:05,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:34:05,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:34:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:05,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 08:34:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:05,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 08:34:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:05,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 08:34:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:05,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 08:34:05,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:05,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 08:34:05,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:05,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 08:34:05,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:05,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 08:34:05,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:05,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 08:34:05,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:05,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 08:34:05,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:05,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 08:34:05,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:05,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 08:34:05,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:05,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 08:34:05,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:05,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 08:34:05,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:05,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 08:34:05,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:05,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 08:34:05,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:05,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 08:34:05,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:05,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 08:34:05,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:05,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 08:34:05,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:05,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 08:34:05,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:05,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 08:34:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:05,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 08:34:05,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:05,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 08:34:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:05,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 08:34:05,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:05,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 08:34:05,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:05,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 08:34:05,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:05,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 08:34:05,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:05,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 08:34:05,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:05,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 08:34:05,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:05,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 08:34:05,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:05,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 08:34:05,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:05,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 08:34:05,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:05,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 08:34:05,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:05,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-14 08:34:05,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:05,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-10-14 08:34:05,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 08:34:05,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310317538] [2024-10-14 08:34:05,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310317538] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 08:34:05,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906173124] [2024-10-14 08:34:05,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:34:05,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 08:34:05,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 08:34:05,731 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) [2024-10-14 08:34:05,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 08:34:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:05,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 08:34:05,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 08:34:06,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 32 proven. 96 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-14 08:34:06,321 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 08:34:06,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-10-14 08:34:06,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906173124] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 08:34:06,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 08:34:06,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-14 08:34:06,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78473588] [2024-10-14 08:34:06,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 08:34:06,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 08:34:06,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 08:34:06,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 08:34:06,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 08:34:06,698 INFO L87 Difference]: Start difference. First operand 345 states and 554 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (65), 2 states have call predecessors, (65), 4 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66) [2024-10-14 08:34:06,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:34:06,952 INFO L93 Difference]: Finished difference Result 611 states and 967 transitions. [2024-10-14 08:34:06,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 08:34:06,953 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (65), 2 states have call predecessors, (65), 4 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66) Word has length 204 [2024-10-14 08:34:06,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:34:06,957 INFO L225 Difference]: With dead ends: 611 [2024-10-14 08:34:06,957 INFO L226 Difference]: Without dead ends: 267 [2024-10-14 08:34:06,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 469 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-14 08:34:06,959 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 81 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 08:34:06,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 229 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 08:34:06,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-10-14 08:34:06,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 259. [2024-10-14 08:34:06,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 153 states have (on average 1.3333333333333333) internal successors, (204), 153 states have internal predecessors, (204), 99 states have call successors, (99), 6 states have call predecessors, (99), 6 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2024-10-14 08:34:07,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 402 transitions. [2024-10-14 08:34:07,002 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 402 transitions. Word has length 204 [2024-10-14 08:34:07,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:34:07,003 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 402 transitions. [2024-10-14 08:34:07,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (65), 2 states have call predecessors, (65), 4 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66) [2024-10-14 08:34:07,003 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 402 transitions. [2024-10-14 08:34:07,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-14 08:34:07,005 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:34:07,005 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 08:34:07,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 08:34:07,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 08:34:07,207 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:34:07,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:34:07,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1315788004, now seen corresponding path program 1 times [2024-10-14 08:34:07,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:34:07,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903104493] [2024-10-14 08:34:07,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:34:07,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:34:07,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:07,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 08:34:07,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:07,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 08:34:07,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:07,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 08:34:07,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:07,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 08:34:07,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:07,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 08:34:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:07,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 08:34:07,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:07,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 08:34:07,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:07,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 08:34:07,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:07,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 08:34:07,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:07,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 08:34:07,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:07,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 08:34:07,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:07,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 08:34:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:07,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 08:34:07,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:07,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 08:34:07,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:07,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 08:34:07,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:07,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 08:34:07,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:07,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 08:34:07,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:07,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 08:34:07,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:07,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 08:34:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:07,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 08:34:07,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:07,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 08:34:07,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:07,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 08:34:07,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:07,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 08:34:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:07,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 08:34:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:07,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 08:34:07,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:07,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 08:34:07,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:07,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 08:34:07,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:07,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 08:34:07,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:07,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 08:34:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:07,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 08:34:07,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:07,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 08:34:07,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:07,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 08:34:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:07,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-14 08:34:07,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:07,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 36 proven. 60 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-10-14 08:34:07,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 08:34:07,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903104493] [2024-10-14 08:34:07,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903104493] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 08:34:07,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316444936] [2024-10-14 08:34:07,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:34:07,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 08:34:07,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 08:34:07,703 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) [2024-10-14 08:34:07,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 08:34:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:07,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-14 08:34:07,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 08:34:08,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1016 proven. 60 refuted. 0 times theorem prover too weak. 1036 trivial. 0 not checked. [2024-10-14 08:34:08,406 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 08:34:08,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 36 proven. 60 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-10-14 08:34:08,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316444936] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 08:34:08,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 08:34:08,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 16 [2024-10-14 08:34:08,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797692277] [2024-10-14 08:34:08,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 08:34:08,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-14 08:34:08,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 08:34:08,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-14 08:34:08,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-10-14 08:34:08,808 INFO L87 Difference]: Start difference. First operand 259 states and 402 transitions. Second operand has 16 states, 16 states have (on average 6.75) internal successors, (108), 16 states have internal predecessors, (108), 6 states have call successors, (99), 3 states have call predecessors, (99), 6 states have return successors, (99), 6 states have call predecessors, (99), 6 states have call successors, (99) [2024-10-14 08:34:09,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:34:09,719 INFO L93 Difference]: Finished difference Result 520 states and 792 transitions. [2024-10-14 08:34:09,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-14 08:34:09,720 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.75) internal successors, (108), 16 states have internal predecessors, (108), 6 states have call successors, (99), 3 states have call predecessors, (99), 6 states have return successors, (99), 6 states have call predecessors, (99), 6 states have call successors, (99) Word has length 204 [2024-10-14 08:34:09,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:34:09,724 INFO L225 Difference]: With dead ends: 520 [2024-10-14 08:34:09,724 INFO L226 Difference]: Without dead ends: 333 [2024-10-14 08:34:09,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 466 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=493, Unknown=0, NotChecked=0, Total=702 [2024-10-14 08:34:09,728 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 493 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 08:34:09,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 580 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 08:34:09,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-10-14 08:34:09,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 279. [2024-10-14 08:34:09,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 171 states have (on average 1.3391812865497077) internal successors, (229), 171 states have internal predecessors, (229), 99 states have call successors, (99), 8 states have call predecessors, (99), 8 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2024-10-14 08:34:09,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 427 transitions. [2024-10-14 08:34:09,786 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 427 transitions. Word has length 204 [2024-10-14 08:34:09,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:34:09,787 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 427 transitions. [2024-10-14 08:34:09,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.75) internal successors, (108), 16 states have internal predecessors, (108), 6 states have call successors, (99), 3 states have call predecessors, (99), 6 states have return successors, (99), 6 states have call predecessors, (99), 6 states have call successors, (99) [2024-10-14 08:34:09,788 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 427 transitions. [2024-10-14 08:34:09,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-14 08:34:09,790 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:34:09,790 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 08:34:09,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 08:34:09,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 08:34:09,991 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:34:09,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:34:09,992 INFO L85 PathProgramCache]: Analyzing trace with hash 2115698682, now seen corresponding path program 1 times [2024-10-14 08:34:09,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:34:09,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899110459] [2024-10-14 08:34:09,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:34:09,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:34:10,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 08:34:10,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1355338080] [2024-10-14 08:34:10,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:34:10,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 08:34:10,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 08:34:10,086 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 08:34:10,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 08:34:10,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:10,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 08:34:10,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 08:34:10,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 366 proven. 0 refuted. 0 times theorem prover too weak. 1746 trivial. 0 not checked. [2024-10-14 08:34:10,590 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 08:34:10,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 08:34:10,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899110459] [2024-10-14 08:34:10,591 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 08:34:10,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355338080] [2024-10-14 08:34:10,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355338080] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:34:10,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:34:10,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 08:34:10,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123222485] [2024-10-14 08:34:10,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:34:10,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 08:34:10,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 08:34:10,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 08:34:10,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-14 08:34:10,594 INFO L87 Difference]: Start difference. First operand 279 states and 427 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-14 08:34:11,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:34:11,248 INFO L93 Difference]: Finished difference Result 721 states and 1093 transitions. [2024-10-14 08:34:11,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 08:34:11,249 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) Word has length 205 [2024-10-14 08:34:11,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:34:11,253 INFO L225 Difference]: With dead ends: 721 [2024-10-14 08:34:11,254 INFO L226 Difference]: Without dead ends: 515 [2024-10-14 08:34:11,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-10-14 08:34:11,256 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 215 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 08:34:11,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 612 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 08:34:11,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2024-10-14 08:34:11,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 501. [2024-10-14 08:34:11,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 319 states have (on average 1.347962382445141) internal successors, (430), 319 states have internal predecessors, (430), 165 states have call successors, (165), 16 states have call predecessors, (165), 16 states have return successors, (165), 165 states have call predecessors, (165), 165 states have call successors, (165) [2024-10-14 08:34:11,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 760 transitions. [2024-10-14 08:34:11,326 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 760 transitions. Word has length 205 [2024-10-14 08:34:11,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:34:11,327 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 760 transitions. [2024-10-14 08:34:11,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-14 08:34:11,327 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 760 transitions. [2024-10-14 08:34:11,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-14 08:34:11,329 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:34:11,329 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 08:34:11,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 08:34:11,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 08:34:11,530 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:34:11,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:34:11,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1094630328, now seen corresponding path program 1 times [2024-10-14 08:34:11,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:34:11,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55426584] [2024-10-14 08:34:11,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:34:11,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:34:11,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 08:34:11,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [932607332] [2024-10-14 08:34:11,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:34:11,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 08:34:11,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 08:34:11,596 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 08:34:11,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 08:34:11,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 08:34:11,728 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 08:34:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 08:34:11,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 08:34:11,888 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 08:34:11,889 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 08:34:11,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-14 08:34:12,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 08:34:12,095 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-14 08:34:12,231 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 08:34:12,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 08:34:12 BoogieIcfgContainer [2024-10-14 08:34:12,235 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 08:34:12,236 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 08:34:12,236 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 08:34:12,236 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 08:34:12,237 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:34:02" (3/4) ... [2024-10-14 08:34:12,239 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 08:34:12,240 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 08:34:12,241 INFO L158 Benchmark]: Toolchain (without parser) took 11226.24ms. Allocated memory was 167.8MB in the beginning and 306.2MB in the end (delta: 138.4MB). Free memory was 109.9MB in the beginning and 93.9MB in the end (delta: 16.0MB). Peak memory consumption was 156.3MB. Max. memory is 16.1GB. [2024-10-14 08:34:12,241 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 167.8MB. Free memory was 131.8MB in the beginning and 131.7MB in the end (delta: 153.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 08:34:12,241 INFO L158 Benchmark]: CACSL2BoogieTranslator took 384.22ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 95.0MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 08:34:12,241 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.89ms. Allocated memory is still 167.8MB. Free memory was 94.4MB in the beginning and 91.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 08:34:12,254 INFO L158 Benchmark]: Boogie Preprocessor took 55.83ms. Allocated memory is still 167.8MB. Free memory was 91.6MB in the beginning and 88.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 08:34:12,254 INFO L158 Benchmark]: RCFGBuilder took 566.02ms. Allocated memory is still 167.8MB. Free memory was 88.1MB in the beginning and 62.9MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-14 08:34:12,254 INFO L158 Benchmark]: TraceAbstraction took 10158.96ms. Allocated memory was 167.8MB in the beginning and 306.2MB in the end (delta: 138.4MB). Free memory was 62.3MB in the beginning and 93.9MB in the end (delta: -31.6MB). Peak memory consumption was 108.1MB. Max. memory is 16.1GB. [2024-10-14 08:34:12,254 INFO L158 Benchmark]: Witness Printer took 4.09ms. Allocated memory is still 306.2MB. Free memory is still 93.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 08:34:12,257 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.19ms. Allocated memory is still 167.8MB. Free memory was 131.8MB in the beginning and 131.7MB in the end (delta: 153.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 384.22ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 95.0MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.89ms. Allocated memory is still 167.8MB. Free memory was 94.4MB in the beginning and 91.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.83ms. Allocated memory is still 167.8MB. Free memory was 91.6MB in the beginning and 88.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 566.02ms. Allocated memory is still 167.8MB. Free memory was 88.1MB in the beginning and 62.9MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 10158.96ms. Allocated memory was 167.8MB in the beginning and 306.2MB in the end (delta: 138.4MB). Free memory was 62.3MB in the beginning and 93.9MB in the end (delta: -31.6MB). Peak memory consumption was 108.1MB. Max. memory is 16.1GB. * Witness Printer took 4.09ms. Allocated memory is still 306.2MB. Free memory is still 93.9MB. 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 someBinaryDOUBLEComparisonOperation at line 180, overapproximation of shiftRight at line 80. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_6 = 0; [L25] unsigned char var_1_7 = 0; [L26] unsigned short int var_1_8 = 4; [L27] signed long int var_1_11 = 100; [L28] signed long int var_1_12 = 8; [L29] unsigned short int var_1_13 = 128; [L30] double var_1_14 = 64.5; [L31] signed short int var_1_15 = 4; [L32] signed long int var_1_16 = -8; [L33] double var_1_17 = 255.5; [L34] double var_1_18 = 0.6; [L35] double var_1_19 = 1000000000000.5; [L36] double var_1_20 = 999999.25; [L37] signed short int var_1_21 = -64; [L38] signed char var_1_25 = -128; [L39] signed char var_1_26 = -8; [L40] unsigned char var_1_27 = 32; [L41] double var_1_28 = 7.7; [L42] double var_1_29 = 127.8; [L43] unsigned char var_1_30 = 1; [L44] signed long int var_1_31 = -16; [L45] unsigned char var_1_32 = 0; [L46] unsigned short int var_1_33 = 128; [L47] signed short int var_1_34 = 50; [L48] unsigned short int var_1_35 = 10000; [L49] unsigned long int var_1_36 = 128; [L50] signed char var_1_37 = 2; [L51] unsigned short int last_1_var_1_8 = 4; [L52] signed short int last_1_var_1_21 = -64; [L53] signed char last_1_var_1_25 = -128; [L184] isInitial = 1 [L185] FCALL initially() [L186] COND TRUE 1 [L187] CALL updateLastVariables() [L175] last_1_var_1_8 = var_1_8 [L176] last_1_var_1_21 = var_1_21 [L177] last_1_var_1_25 = var_1_25 [L187] RET updateLastVariables() [L188] CALL updateVariables() [L122] var_1_4 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L123] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L124] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L124] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L125] var_1_6 = __VERIFIER_nondet_uchar() [L126] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_7=0, var_1_8=4] [L126] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_7=0, var_1_8=4] [L127] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L127] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L128] var_1_11 = __VERIFIER_nondet_long() [L129] CALL assume_abort_if_not(var_1_11 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L129] RET assume_abort_if_not(var_1_11 >= -1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L130] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L130] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L131] var_1_12 = __VERIFIER_nondet_long() [L132] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L132] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L133] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L133] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L134] var_1_13 = __VERIFIER_nondet_ushort() [L135] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L135] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L136] CALL assume_abort_if_not(var_1_13 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L136] RET assume_abort_if_not(var_1_13 <= 65534) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L137] var_1_15 = __VERIFIER_nondet_short() [L138] CALL assume_abort_if_not(var_1_15 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L138] RET assume_abort_if_not(var_1_15 >= -32768) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L139] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L139] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L140] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L140] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L141] var_1_16 = __VERIFIER_nondet_long() [L142] CALL assume_abort_if_not(var_1_16 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L142] RET assume_abort_if_not(var_1_16 >= -2147483648) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L143] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L143] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L144] CALL assume_abort_if_not(var_1_16 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L144] RET assume_abort_if_not(var_1_16 != 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L145] var_1_17 = __VERIFIER_nondet_double() [L146] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L146] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L147] var_1_18 = __VERIFIER_nondet_double() [L148] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L148] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L149] var_1_19 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L150] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L151] var_1_20 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L152] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L153] var_1_26 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_26 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L154] RET assume_abort_if_not(var_1_26 >= -127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L155] CALL assume_abort_if_not(var_1_26 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L155] RET assume_abort_if_not(var_1_26 <= 126) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L156] var_1_28 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_28 >= -922337.2036854776000e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854776000e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L157] RET assume_abort_if_not((var_1_28 >= -922337.2036854776000e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854776000e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L158] var_1_29 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_29 >= -922337.2036854776000e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854776000e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L159] RET assume_abort_if_not((var_1_29 >= -922337.2036854776000e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854776000e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L160] var_1_31 = __VERIFIER_nondet_long() [L161] CALL assume_abort_if_not(var_1_31 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L161] RET assume_abort_if_not(var_1_31 >= -2147483648) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L162] CALL assume_abort_if_not(var_1_31 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L162] RET assume_abort_if_not(var_1_31 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L163] var_1_32 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L164] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L165] CALL assume_abort_if_not(var_1_32 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L165] RET assume_abort_if_not(var_1_32 <= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L166] var_1_34 = __VERIFIER_nondet_short() [L167] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L167] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L168] CALL assume_abort_if_not(var_1_34 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L168] RET assume_abort_if_not(var_1_34 <= 32767) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L169] var_1_37 = __VERIFIER_nondet_char() [L170] CALL assume_abort_if_not(var_1_37 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L170] RET assume_abort_if_not(var_1_37 >= -128) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L171] CALL assume_abort_if_not(var_1_37 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L171] RET assume_abort_if_not(var_1_37 <= 127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L172] CALL assume_abort_if_not(var_1_37 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L172] RET assume_abort_if_not(var_1_37 != 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L188] RET updateVariables() [L189] CALL step() [L57] COND FALSE !(0.75 <= var_1_28) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L62] COND TRUE (~ var_1_27) < var_1_31 [L63] var_1_30 = var_1_32 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L65] COND FALSE !(\read(var_1_32)) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L76] var_1_35 = var_1_27 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L77] COND FALSE !((-1 / var_1_37) >= ((((var_1_35) < 0 ) ? -(var_1_35) : (var_1_35)))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L80] EXPR last_1_var_1_8 >> var_1_15 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L80] COND TRUE (last_1_var_1_8 + 4u) <= (last_1_var_1_8 >> var_1_15) [L81] var_1_21 = (((((last_1_var_1_25 + last_1_var_1_25)) < (last_1_var_1_25)) ? ((last_1_var_1_25 + last_1_var_1_25)) : (last_1_var_1_25))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L85] signed long int stepLocal_1 = ((((-1) > (var_1_11)) ? (-1) : (var_1_11))) - var_1_12; [L86] signed long int stepLocal_0 = last_1_var_1_21 + last_1_var_1_21; VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, stepLocal_1=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L87] COND FALSE !((last_1_var_1_21 * last_1_var_1_21) < stepLocal_1) [L92] var_1_8 = var_1_13 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L94] COND TRUE ! (var_1_21 > var_1_8) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L95] COND TRUE \read(var_1_4) [L96] var_1_25 = var_1_26 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L99] COND FALSE !((8 / var_1_15) < (64 / var_1_16)) [L106] var_1_14 = var_1_18 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_16=65, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L108] COND TRUE (- var_1_14) <= var_1_14 [L109] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_16=65, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L117] COND FALSE !(var_1_14 < ((((var_1_14) > ((128.5 * var_1_14))) ? (var_1_14) : ((128.5 * var_1_14))))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_16=65, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L189] RET step() [L190] CALL, EXPR property() [L180] EXPR ((((((- var_1_14) <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_4)) : ((var_1_14 <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) var_1_4)))) && ((var_1_14 < ((((var_1_14) > ((128.5 * var_1_14))) ? (var_1_14) : ((128.5 * var_1_14))))) ? (var_1_7 == ((unsigned char) (var_1_1 && (! 1)))) : 1)) && (((last_1_var_1_21 * last_1_var_1_21) < (((((-1) > (var_1_11)) ? (-1) : (var_1_11))) - var_1_12)) ? (((last_1_var_1_21 + last_1_var_1_21) < var_1_12) ? (var_1_8 == ((unsigned short int) var_1_13)) : 1) : (var_1_8 == ((unsigned short int) var_1_13)))) && (((8 / var_1_15) < (64 / var_1_16)) ? ((var_1_8 >= var_1_15) ? (var_1_14 == ((double) (var_1_17 - var_1_18))) : (var_1_14 == ((double) (var_1_18 - (64.25 + ((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20)))))))) : (var_1_14 == ((double) var_1_18)))) && (((last_1_var_1_8 + 4u) <= (last_1_var_1_8 >> var_1_15)) ? (var_1_21 == ((signed short int) (((((last_1_var_1_25 + last_1_var_1_25)) < (last_1_var_1_25)) ? ((last_1_var_1_25 + last_1_var_1_25)) : (last_1_var_1_25))))) : (var_1_21 == ((signed short int) last_1_var_1_25))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_16=65, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L180-L181] return (((((((- var_1_14) <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_4)) : ((var_1_14 <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) var_1_4)))) && ((var_1_14 < ((((var_1_14) > ((128.5 * var_1_14))) ? (var_1_14) : ((128.5 * var_1_14))))) ? (var_1_7 == ((unsigned char) (var_1_1 && (! 1)))) : 1)) && (((last_1_var_1_21 * last_1_var_1_21) < (((((-1) > (var_1_11)) ? (-1) : (var_1_11))) - var_1_12)) ? (((last_1_var_1_21 + last_1_var_1_21) < var_1_12) ? (var_1_8 == ((unsigned short int) var_1_13)) : 1) : (var_1_8 == ((unsigned short int) var_1_13)))) && (((8 / var_1_15) < (64 / var_1_16)) ? ((var_1_8 >= var_1_15) ? (var_1_14 == ((double) (var_1_17 - var_1_18))) : (var_1_14 == ((double) (var_1_18 - (64.25 + ((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20)))))))) : (var_1_14 == ((double) var_1_18)))) && (((last_1_var_1_8 + 4u) <= (last_1_var_1_8 >> var_1_15)) ? (var_1_21 == ((signed short int) (((((last_1_var_1_25 + last_1_var_1_25)) < (last_1_var_1_25)) ? ((last_1_var_1_25 + last_1_var_1_25)) : (last_1_var_1_25))))) : (var_1_21 == ((signed short int) last_1_var_1_25)))) && ((! (var_1_21 > var_1_8)) ? (var_1_4 ? (var_1_25 == ((signed char) var_1_26)) : 1) : 1) ; [L190] RET, EXPR property() [L190] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_16=65, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_16=65, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.0s, OverallIterations: 7, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1307 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1247 mSDsluCounter, 2568 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1807 mSDsCounter, 665 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1567 IncrementalHoareTripleChecker+Invalid, 2232 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 665 mSolverCounterUnsat, 761 mSDtfsCounter, 1567 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1429 GetRequests, 1370 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=501occurred in iteration=6, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 196 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 2246 NumberOfCodeBlocks, 2246 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2029 ConstructedInterpolants, 0 QuantifiedInterpolants, 7923 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1379 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 20652/21120 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 08:34:12,296 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/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-38.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 c09ae5383c303ea70fa8be3591cb19f07b66ade63b6f0323637dd7a8d6da530f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 08:34:14,634 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 08:34:14,722 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 08:34:14,730 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 08:34:14,731 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 08:34:14,760 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 08:34:14,763 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 08:34:14,763 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 08:34:14,764 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 08:34:14,765 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 08:34:14,765 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 08:34:14,766 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 08:34:14,767 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 08:34:14,767 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 08:34:14,769 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 08:34:14,770 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 08:34:14,770 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 08:34:14,770 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 08:34:14,771 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 08:34:14,771 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 08:34:14,771 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 08:34:14,772 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 08:34:14,772 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 08:34:14,772 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 08:34:14,773 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 08:34:14,773 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 08:34:14,773 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 08:34:14,774 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 08:34:14,774 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 08:34:14,774 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 08:34:14,775 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 08:34:14,775 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 08:34:14,779 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 08:34:14,780 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 08:34:14,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 08:34:14,780 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 08:34:14,781 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 08:34:14,781 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 08:34:14,781 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 08:34:14,781 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 08:34:14,782 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 08:34:14,784 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 08:34:14,784 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 08:34:14,784 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 08:34:14,785 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 08:34:14,785 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> c09ae5383c303ea70fa8be3591cb19f07b66ade63b6f0323637dd7a8d6da530f [2024-10-14 08:34:15,130 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 08:34:15,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 08:34:15,163 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 08:34:15,165 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 08:34:15,165 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 08:34:15,167 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-38.i [2024-10-14 08:34:16,797 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 08:34:17,033 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 08:34:17,033 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-38.i [2024-10-14 08:34:17,043 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07b5fa203/38a3a1ac385a41d9954d5a7691b2cb81/FLAG1e044a41e [2024-10-14 08:34:17,056 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07b5fa203/38a3a1ac385a41d9954d5a7691b2cb81 [2024-10-14 08:34:17,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 08:34:17,059 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 08:34:17,061 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 08:34:17,061 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 08:34:17,066 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 08:34:17,067 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:34:17" (1/1) ... [2024-10-14 08:34:17,067 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d246dfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:34:17, skipping insertion in model container [2024-10-14 08:34:17,070 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:34:17" (1/1) ... [2024-10-14 08:34:17,095 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 08:34:17,270 WARN L248 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-25_file-38.i[915,928] [2024-10-14 08:34:17,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 08:34:17,382 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 08:34:17,394 WARN L248 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-25_file-38.i[915,928] [2024-10-14 08:34:17,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 08:34:17,467 INFO L204 MainTranslator]: Completed translation [2024-10-14 08:34:17,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:34:17 WrapperNode [2024-10-14 08:34:17,468 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 08:34:17,469 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 08:34:17,469 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 08:34:17,469 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 08:34:17,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:34:17" (1/1) ... [2024-10-14 08:34:17,492 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:34:17" (1/1) ... [2024-10-14 08:34:17,533 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 194 [2024-10-14 08:34:17,537 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 08:34:17,538 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 08:34:17,538 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 08:34:17,539 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 08:34:17,555 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:34:17" (1/1) ... [2024-10-14 08:34:17,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:34:17" (1/1) ... [2024-10-14 08:34:17,562 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:34:17" (1/1) ... [2024-10-14 08:34:17,583 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]. [2024-10-14 08:34:17,584 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:34:17" (1/1) ... [2024-10-14 08:34:17,584 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:34:17" (1/1) ... [2024-10-14 08:34:17,592 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:34:17" (1/1) ... [2024-10-14 08:34:17,596 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:34:17" (1/1) ... [2024-10-14 08:34:17,598 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:34:17" (1/1) ... [2024-10-14 08:34:17,600 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:34:17" (1/1) ... [2024-10-14 08:34:17,607 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 08:34:17,608 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 08:34:17,608 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 08:34:17,608 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 08:34:17,613 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:34:17" (1/1) ... [2024-10-14 08:34:17,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 08:34:17,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 08:34:17,651 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) [2024-10-14 08:34:17,658 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 [2024-10-14 08:34:17,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 08:34:17,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 08:34:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 08:34:17,702 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 08:34:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 08:34:17,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 08:34:17,794 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 08:34:17,796 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 08:34:23,455 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-14 08:34:23,455 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 08:34:23,516 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 08:34:23,516 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 08:34:23,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:34:23 BoogieIcfgContainer [2024-10-14 08:34:23,517 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 08:34:23,519 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 08:34:23,519 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 08:34:23,527 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 08:34:23,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:34:17" (1/3) ... [2024-10-14 08:34:23,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1012ff3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:34:23, skipping insertion in model container [2024-10-14 08:34:23,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:34:17" (2/3) ... [2024-10-14 08:34:23,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1012ff3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:34:23, skipping insertion in model container [2024-10-14 08:34:23,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:34:23" (3/3) ... [2024-10-14 08:34:23,531 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-38.i [2024-10-14 08:34:23,549 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 08:34:23,549 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 08:34:23,636 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 08:34:23,646 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;@27c5a895, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 08:34:23,647 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 08:34:23,652 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 48 states have internal predecessors, (69), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-14 08:34:23,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-14 08:34:23,673 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:34:23,674 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 08:34:23,675 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:34:23,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:34:23,681 INFO L85 PathProgramCache]: Analyzing trace with hash 407129373, now seen corresponding path program 1 times [2024-10-14 08:34:23,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 08:34:23,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1656348834] [2024-10-14 08:34:23,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:34:23,701 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 [2024-10-14 08:34:23,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 08:34:23,704 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) [2024-10-14 08:34:23,706 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 [2024-10-14 08:34:24,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:24,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 08:34:24,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 08:34:24,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 412 proven. 0 refuted. 0 times theorem prover too weak. 1700 trivial. 0 not checked. [2024-10-14 08:34:24,387 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 08:34:24,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 08:34:24,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1656348834] [2024-10-14 08:34:24,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1656348834] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:34:24,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:34:24,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 08:34:24,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191224885] [2024-10-14 08:34:24,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:34:24,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 08:34:24,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 08:34:24,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 08:34:24,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 08:34:24,428 INFO L87 Difference]: Start difference. First operand has 83 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 48 states have internal predecessors, (69), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-14 08:34:28,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.73s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 08:34:28,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:34:28,223 INFO L93 Difference]: Finished difference Result 163 states and 301 transitions. [2024-10-14 08:34:28,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 08:34:28,265 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 200 [2024-10-14 08:34:28,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:34:28,273 INFO L225 Difference]: With dead ends: 163 [2024-10-14 08:34:28,273 INFO L226 Difference]: Without dead ends: 81 [2024-10-14 08:34:28,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 08:34:28,279 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-14 08:34:28,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-14 08:34:28,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-14 08:34:28,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-14 08:34:28,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 46 states have internal predecessors, (63), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-14 08:34:28,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 129 transitions. [2024-10-14 08:34:28,324 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 129 transitions. Word has length 200 [2024-10-14 08:34:28,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:34:28,324 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 129 transitions. [2024-10-14 08:34:28,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-14 08:34:28,324 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 129 transitions. [2024-10-14 08:34:28,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-14 08:34:28,328 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:34:28,328 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 08:34:28,346 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 (2)] Ended with exit code 0 [2024-10-14 08:34:28,529 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 [2024-10-14 08:34:28,529 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:34:28,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:34:28,530 INFO L85 PathProgramCache]: Analyzing trace with hash 578597733, now seen corresponding path program 1 times [2024-10-14 08:34:28,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 08:34:28,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1878282881] [2024-10-14 08:34:28,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:34:28,532 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 [2024-10-14 08:34:28,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 08:34:28,535 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) [2024-10-14 08:34:28,536 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 [2024-10-14 08:34:28,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:29,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 08:34:29,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 08:34:31,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-14 08:34:31,063 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 08:34:31,063 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 08:34:31,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1878282881] [2024-10-14 08:34:31,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1878282881] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:34:31,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:34:31,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 08:34:31,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363137236] [2024-10-14 08:34:31,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:34:31,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 08:34:31,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 08:34:31,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 08:34:31,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 08:34:31,070 INFO L87 Difference]: Start difference. First operand 81 states and 129 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-14 08:34:34,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.59s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 08:34:37,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.42s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 08:34:37,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:34:37,848 INFO L93 Difference]: Finished difference Result 381 states and 608 transitions. [2024-10-14 08:34:37,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 08:34:37,849 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 200 [2024-10-14 08:34:37,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:34:37,855 INFO L225 Difference]: With dead ends: 381 [2024-10-14 08:34:37,855 INFO L226 Difference]: Without dead ends: 301 [2024-10-14 08:34:37,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 08:34:37,857 INFO L432 NwaCegarLoop]: 343 mSDtfsCounter, 218 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2024-10-14 08:34:37,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 716 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2024-10-14 08:34:37,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-10-14 08:34:37,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 159. [2024-10-14 08:34:37,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 90 states have (on average 1.3666666666666667) internal successors, (123), 90 states have internal predecessors, (123), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-14 08:34:37,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 255 transitions. [2024-10-14 08:34:37,924 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 255 transitions. Word has length 200 [2024-10-14 08:34:37,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:34:37,925 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 255 transitions. [2024-10-14 08:34:37,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-14 08:34:37,926 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 255 transitions. [2024-10-14 08:34:37,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-14 08:34:37,931 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:34:37,932 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 08:34:37,957 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 (3)] Forceful destruction successful, exit code 0 [2024-10-14 08:34:38,132 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 [2024-10-14 08:34:38,133 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:34:38,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:34:38,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1663732996, now seen corresponding path program 1 times [2024-10-14 08:34:38,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 08:34:38,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [511469185] [2024-10-14 08:34:38,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:34:38,135 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 [2024-10-14 08:34:38,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 08:34:38,138 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) [2024-10-14 08:34:38,139 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 [2024-10-14 08:34:38,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:38,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-14 08:34:38,617 INFO L278 TraceCheckSpWp]: Computing forward predicates...