./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-38.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_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 8625eca51d55482cec5eb7c96eba9272b260b764c68904ba85421ac6b44d67c1 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:31:17,008 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:31:17,076 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 21:31:17,083 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:31:17,084 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:31:17,111 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:31:17,113 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:31:17,113 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:31:17,114 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:31:17,115 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:31:17,116 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:31:17,117 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:31:17,117 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:31:17,118 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:31:17,121 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:31:17,121 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:31:17,121 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:31:17,121 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:31:17,122 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 21:31:17,122 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:31:17,122 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:31:17,122 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:31:17,123 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:31:17,123 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:31:17,123 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:31:17,124 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:31:17,124 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:31:17,124 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:31:17,124 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:31:17,125 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:31:17,125 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:31:17,125 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:31:17,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:31:17,126 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:31:17,126 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:31:17,126 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:31:17,126 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 21:31:17,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 21:31:17,127 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:31:17,127 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:31:17,127 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:31:17,128 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:31:17,128 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 -> 8625eca51d55482cec5eb7c96eba9272b260b764c68904ba85421ac6b44d67c1 [2024-11-08 21:31:17,340 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:31:17,359 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:31:17,361 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:31:17,362 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:31:17,362 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:31:17,363 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-38.i [2024-11-08 21:31:18,782 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:31:18,956 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:31:18,957 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-38.i [2024-11-08 21:31:18,971 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f28a77f4/4db30db7129b4da4b502921fa922107f/FLAGf80b501a1 [2024-11-08 21:31:18,984 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f28a77f4/4db30db7129b4da4b502921fa922107f [2024-11-08 21:31:18,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:31:18,987 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:31:18,988 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:31:18,988 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:31:18,994 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:31:18,995 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:31:18" (1/1) ... [2024-11-08 21:31:18,996 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6787b0f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:31:18, skipping insertion in model container [2024-11-08 21:31:18,996 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:31:18" (1/1) ... [2024-11-08 21:31:19,030 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:31:19,210 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-38.i[919,932] [2024-11-08 21:31:19,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:31:19,317 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:31:19,332 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-38.i[919,932] [2024-11-08 21:31:19,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:31:19,395 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:31:19,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:31:19 WrapperNode [2024-11-08 21:31:19,396 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:31:19,397 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:31:19,397 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:31:19,397 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:31:19,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:31:19" (1/1) ... [2024-11-08 21:31:19,420 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:31:19" (1/1) ... [2024-11-08 21:31:19,454 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 236 [2024-11-08 21:31:19,455 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:31:19,455 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:31:19,455 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:31:19,456 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:31:19,466 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:31:19" (1/1) ... [2024-11-08 21:31:19,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:31:19" (1/1) ... [2024-11-08 21:31:19,472 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:31:19" (1/1) ... [2024-11-08 21:31:19,487 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-11-08 21:31:19,491 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:31:19" (1/1) ... [2024-11-08 21:31:19,492 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:31:19" (1/1) ... [2024-11-08 21:31:19,503 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:31:19" (1/1) ... [2024-11-08 21:31:19,508 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:31:19" (1/1) ... [2024-11-08 21:31:19,510 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:31:19" (1/1) ... [2024-11-08 21:31:19,512 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:31:19" (1/1) ... [2024-11-08 21:31:19,515 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:31:19,518 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:31:19,518 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:31:19,519 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:31:19,520 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:31:19" (1/1) ... [2024-11-08 21:31:19,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:31:19,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:31:19,551 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-11-08 21:31:19,553 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-11-08 21:31:19,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:31:19,597 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:31:19,598 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:31:19,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 21:31:19,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:31:19,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:31:19,695 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:31:19,698 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:31:20,218 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-08 21:31:20,219 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:31:20,232 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:31:20,232 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:31:20,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:31:20 BoogieIcfgContainer [2024-11-08 21:31:20,232 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:31:20,235 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:31:20,235 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:31:20,238 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:31:20,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:31:18" (1/3) ... [2024-11-08 21:31:20,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fe9466f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:31:20, skipping insertion in model container [2024-11-08 21:31:20,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:31:19" (2/3) ... [2024-11-08 21:31:20,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fe9466f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:31:20, skipping insertion in model container [2024-11-08 21:31:20,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:31:20" (3/3) ... [2024-11-08 21:31:20,240 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-38.i [2024-11-08 21:31:20,255 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:31:20,256 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:31:20,316 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:31:20,322 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;@209d981f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:31:20,322 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:31:20,326 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 66 states have (on average 1.4545454545454546) internal successors, (96), 67 states have internal predecessors, (96), 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-11-08 21:31:20,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 21:31:20,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:31:20,341 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, 1, 1, 1, 1] [2024-11-08 21:31:20,341 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:31:20,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:31:20,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1080470710, now seen corresponding path program 1 times [2024-11-08 21:31:20,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:31:20,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592518877] [2024-11-08 21:31:20,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:31:20,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:31:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:20,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:31:20,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:20,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:31:20,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:20,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:31:20,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:20,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:31:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:20,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:31:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:20,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:31:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:20,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:31:20,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:20,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:31:20,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:20,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:31:20,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:20,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:31:20,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:20,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:31:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:20,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:31:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:20,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 21:31:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:20,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 21:31:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:20,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 21:31:20,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:20,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 21:31:20,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:20,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 21:31:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:20,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 21:31:20,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:20,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:31:20,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:20,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:31:20,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:20,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:31:20,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:20,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:31:20,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:20,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:31:20,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:20,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 21:31:20,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:20,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:31:20,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:20,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 21:31:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:20,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 21:31:20,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:20,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:31:20,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:20,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 21:31:20,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:20,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:31:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:20,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 21:31:20,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:20,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 21:31:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:20,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 21:31:20,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:20,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 21:31:20,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:31:20,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592518877] [2024-11-08 21:31:20,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592518877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:31:20,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:31:20,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:31:20,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129586687] [2024-11-08 21:31:20,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:31:20,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:31:20,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:31:20,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:31:20,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:31:20,844 INFO L87 Difference]: Start difference. First operand has 102 states, 66 states have (on average 1.4545454545454546) internal successors, (96), 67 states have internal predecessors, (96), 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 23.5) internal successors, (47), 2 states have internal predecessors, (47), 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-11-08 21:31:20,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:31:20,879 INFO L93 Difference]: Finished difference Result 197 states and 351 transitions. [2024-11-08 21:31:20,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:31:20,884 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 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 209 [2024-11-08 21:31:20,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:31:20,892 INFO L225 Difference]: With dead ends: 197 [2024-11-08 21:31:20,892 INFO L226 Difference]: Without dead ends: 98 [2024-11-08 21:31:20,896 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-11-08 21:31:20,899 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:31:20,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:31:20,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-08 21:31:20,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-08 21:31:20,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 63 states have internal predecessors, (88), 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-11-08 21:31:20,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 154 transitions. [2024-11-08 21:31:20,948 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 154 transitions. Word has length 209 [2024-11-08 21:31:20,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:31:20,948 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 154 transitions. [2024-11-08 21:31:20,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 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-11-08 21:31:20,949 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 154 transitions. [2024-11-08 21:31:20,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 21:31:20,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:31:20,953 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, 1, 1, 1, 1] [2024-11-08 21:31:20,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 21:31:20,954 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:31:20,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:31:20,954 INFO L85 PathProgramCache]: Analyzing trace with hash -314554176, now seen corresponding path program 1 times [2024-11-08 21:31:20,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:31:20,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469069495] [2024-11-08 21:31:20,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:31:20,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:31:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:21,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:31:21,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:21,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:31:21,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:21,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:31:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:21,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:31:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:21,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:31:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:21,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:31:21,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:21,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:31:21,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:21,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:31:21,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:21,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:31:21,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:21,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:31:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:21,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:31:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:21,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:31:21,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:21,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 21:31:21,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:21,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 21:31:21,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:21,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 21:31:21,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:21,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 21:31:21,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:21,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 21:31:21,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:21,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 21:31:21,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:21,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:31:21,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:21,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:31:21,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:21,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:31:21,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:21,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:31:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:21,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:31:21,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:21,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 21:31:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:21,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:31:21,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:21,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 21:31:21,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:21,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 21:31:21,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:21,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:31:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:21,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 21:31:21,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:21,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:31:21,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:21,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 21:31:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:21,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 21:31:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:21,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 21:31:21,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:21,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 21:31:21,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:31:21,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469069495] [2024-11-08 21:31:21,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469069495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:31:21,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:31:21,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:31:21,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275750376] [2024-11-08 21:31:21,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:31:21,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:31:21,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:31:21,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:31:21,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:31:21,597 INFO L87 Difference]: Start difference. First operand 98 states and 154 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-11-08 21:31:21,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:31:21,730 INFO L93 Difference]: Finished difference Result 289 states and 458 transitions. [2024-11-08 21:31:21,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:31:21,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 209 [2024-11-08 21:31:21,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:31:21,737 INFO L225 Difference]: With dead ends: 289 [2024-11-08 21:31:21,737 INFO L226 Difference]: Without dead ends: 194 [2024-11-08 21:31:21,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:31:21,741 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 86 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:31:21,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 455 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:31:21,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-08 21:31:21,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2024-11-08 21:31:21,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 123 states have (on average 1.4065040650406504) internal successors, (173), 123 states have internal predecessors, (173), 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-11-08 21:31:21,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 305 transitions. [2024-11-08 21:31:21,797 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 305 transitions. Word has length 209 [2024-11-08 21:31:21,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:31:21,798 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 305 transitions. [2024-11-08 21:31:21,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-11-08 21:31:21,798 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 305 transitions. [2024-11-08 21:31:21,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-08 21:31:21,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:31:21,804 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, 1, 1, 1, 1, 1] [2024-11-08 21:31:21,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 21:31:21,808 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:31:21,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:31:21,808 INFO L85 PathProgramCache]: Analyzing trace with hash -704339917, now seen corresponding path program 1 times [2024-11-08 21:31:21,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:31:21,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258501688] [2024-11-08 21:31:21,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:31:21,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:31:21,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:22,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:31:22,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:22,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:31:22,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:22,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:31:22,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:22,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:31:22,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:22,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:31:22,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:22,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:31:22,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:22,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:31:22,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:22,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:31:22,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:22,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:31:22,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:22,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:31:22,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:22,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:31:22,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:22,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:31:22,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:22,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 21:31:22,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:22,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 21:31:22,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:22,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 21:31:22,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:22,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 21:31:22,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:22,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 21:31:22,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:22,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 21:31:22,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:22,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:31:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:22,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:31:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:22,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:31:22,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:22,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:31:22,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:22,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:31:22,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:22,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 21:31:22,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:22,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:31:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:22,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 21:31:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:22,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 21:31:22,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:22,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:31:22,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:22,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 21:31:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:22,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:31:22,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:22,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 21:31:22,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:22,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 21:31:22,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:22,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 21:31:22,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:22,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 21:31:22,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:31:22,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258501688] [2024-11-08 21:31:22,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258501688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:31:22,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:31:22,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 21:31:22,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573263696] [2024-11-08 21:31:22,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:31:22,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:31:22,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:31:22,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:31:22,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:31:22,390 INFO L87 Difference]: Start difference. First operand 192 states and 305 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-11-08 21:31:22,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:31:22,767 INFO L93 Difference]: Finished difference Result 637 states and 1019 transitions. [2024-11-08 21:31:22,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 21:31:22,768 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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 210 [2024-11-08 21:31:22,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:31:22,775 INFO L225 Difference]: With dead ends: 637 [2024-11-08 21:31:22,776 INFO L226 Difference]: Without dead ends: 448 [2024-11-08 21:31:22,777 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-11-08 21:31:22,779 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 152 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 21:31:22,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 576 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 21:31:22,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-11-08 21:31:22,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 381. [2024-11-08 21:31:22,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 244 states have (on average 1.4098360655737705) internal successors, (344), 244 states have internal predecessors, (344), 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-11-08 21:31:22,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 608 transitions. [2024-11-08 21:31:22,866 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 608 transitions. Word has length 210 [2024-11-08 21:31:22,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:31:22,868 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 608 transitions. [2024-11-08 21:31:22,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-11-08 21:31:22,869 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 608 transitions. [2024-11-08 21:31:22,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-08 21:31:22,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:31:22,874 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, 1, 1, 1, 1, 1] [2024-11-08 21:31:22,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 21:31:22,875 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:31:22,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:31:22,876 INFO L85 PathProgramCache]: Analyzing trace with hash -281638091, now seen corresponding path program 1 times [2024-11-08 21:31:22,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:31:22,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962837789] [2024-11-08 21:31:22,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:31:22,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:31:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:31:23,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:31:23,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:31:23,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:31:23,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:31:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:31:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:31:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:31:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:31:23,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:31:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:31:23,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:31:23,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 21:31:23,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 21:31:23,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 21:31:23,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 21:31:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 21:31:23,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 21:31:23,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:31:23,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:31:23,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:31:23,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:31:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:31:23,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 21:31:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:31:23,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 21:31:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 21:31:23,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:31:23,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 21:31:23,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:31:23,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 21:31:23,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 21:31:23,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 21:31:23,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 21:31:23,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:31:23,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962837789] [2024-11-08 21:31:23,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962837789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:31:23,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:31:23,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 21:31:23,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163280045] [2024-11-08 21:31:23,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:31:23,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 21:31:23,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:31:23,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 21:31:23,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 21:31:23,155 INFO L87 Difference]: Start difference. First operand 381 states and 608 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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-11-08 21:31:23,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:31:23,476 INFO L93 Difference]: Finished difference Result 1191 states and 1899 transitions. [2024-11-08 21:31:23,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 21:31:23,477 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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 210 [2024-11-08 21:31:23,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:31:23,487 INFO L225 Difference]: With dead ends: 1191 [2024-11-08 21:31:23,487 INFO L226 Difference]: Without dead ends: 813 [2024-11-08 21:31:23,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-08 21:31:23,493 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 422 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:31:23,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 1142 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 21:31:23,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2024-11-08 21:31:23,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 449. [2024-11-08 21:31:23,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 312 states have (on average 1.4679487179487178) internal successors, (458), 312 states have internal predecessors, (458), 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-11-08 21:31:23,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 722 transitions. [2024-11-08 21:31:23,577 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 722 transitions. Word has length 210 [2024-11-08 21:31:23,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:31:23,577 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 722 transitions. [2024-11-08 21:31:23,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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-11-08 21:31:23,578 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 722 transitions. [2024-11-08 21:31:23,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-08 21:31:23,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:31:23,580 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, 1, 1, 1, 1, 1, 1] [2024-11-08 21:31:23,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 21:31:23,581 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:31:23,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:31:23,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1048771064, now seen corresponding path program 1 times [2024-11-08 21:31:23,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:31:23,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956658010] [2024-11-08 21:31:23,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:31:23,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:31:23,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:31:23,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:31:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:31:23,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:31:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:31:23,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:31:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:31:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:31:23,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:31:23,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:31:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:31:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:31:23,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 21:31:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 21:31:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 21:31:23,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:23,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 21:31:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:24,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 21:31:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:24,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 21:31:24,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:24,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:31:24,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:24,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:31:24,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:24,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:31:24,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:24,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:31:24,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:24,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:31:24,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:24,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 21:31:24,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:24,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:31:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:24,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 21:31:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:24,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 21:31:24,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:24,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:31:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:24,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 21:31:24,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:24,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:31:24,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:24,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 21:31:24,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:24,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 21:31:24,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:24,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 21:31:24,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:24,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 36 proven. 60 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-08 21:31:24,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:31:24,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956658010] [2024-11-08 21:31:24,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956658010] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:31:24,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610855821] [2024-11-08 21:31:24,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:31:24,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:31:24,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:31:24,089 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-11-08 21:31:24,090 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-11-08 21:31:24,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:24,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 21:31:24,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:31:24,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1016 proven. 60 refuted. 0 times theorem prover too weak. 1036 trivial. 0 not checked. [2024-11-08 21:31:24,875 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:31:25,287 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 36 proven. 60 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-08 21:31:25,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610855821] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 21:31:25,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 21:31:25,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 16 [2024-11-08 21:31:25,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608909468] [2024-11-08 21:31:25,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 21:31:25,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 21:31:25,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:31:25,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 21:31:25,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-11-08 21:31:25,292 INFO L87 Difference]: Start difference. First operand 449 states and 722 transitions. Second operand has 16 states, 16 states have (on average 6.8125) internal successors, (109), 16 states have internal predecessors, (109), 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-11-08 21:31:26,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:31:26,142 INFO L93 Difference]: Finished difference Result 1152 states and 1847 transitions. [2024-11-08 21:31:26,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 21:31:26,142 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.8125) internal successors, (109), 16 states have internal predecessors, (109), 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 211 [2024-11-08 21:31:26,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:31:26,148 INFO L225 Difference]: With dead ends: 1152 [2024-11-08 21:31:26,149 INFO L226 Difference]: Without dead ends: 706 [2024-11-08 21:31:26,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 480 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-11-08 21:31:26,152 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 512 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 21:31:26,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 780 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 21:31:26,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2024-11-08 21:31:26,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 546. [2024-11-08 21:31:26,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 407 states have (on average 1.5135135135135136) internal successors, (616), 407 states have internal predecessors, (616), 132 states have call successors, (132), 6 states have call predecessors, (132), 6 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2024-11-08 21:31:26,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 880 transitions. [2024-11-08 21:31:26,242 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 880 transitions. Word has length 211 [2024-11-08 21:31:26,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:31:26,243 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 880 transitions. [2024-11-08 21:31:26,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.8125) internal successors, (109), 16 states have internal predecessors, (109), 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-11-08 21:31:26,244 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 880 transitions. [2024-11-08 21:31:26,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-08 21:31:26,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:31:26,248 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, 1, 1, 1, 1, 1, 1] [2024-11-08 21:31:26,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 21:31:26,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:31:26,449 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:31:26,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:31:26,450 INFO L85 PathProgramCache]: Analyzing trace with hash -101755228, now seen corresponding path program 1 times [2024-11-08 21:31:26,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:31:26,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423670852] [2024-11-08 21:31:26,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:31:26,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:31:26,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:26,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:31:26,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:26,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:31:26,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:26,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:31:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:26,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:31:26,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:26,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:31:26,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:26,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:31:26,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:26,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:31:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:26,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:31:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:26,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:31:26,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:26,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:31:26,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:26,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:31:26,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:26,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:31:26,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:26,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 21:31:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:26,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 21:31:26,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:26,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 21:31:26,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:26,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 21:31:26,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:26,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 21:31:26,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:26,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 21:31:26,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:26,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:31:26,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:26,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:31:26,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:26,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:31:26,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:26,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:31:26,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:26,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:31:26,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:26,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 21:31:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:26,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:31:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:26,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 21:31:26,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:26,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 21:31:26,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:26,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:31:26,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:26,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 21:31:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:26,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:31:26,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:26,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 21:31:26,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:26,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 21:31:26,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:26,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 21:31:26,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:26,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 21:31:26,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:31:26,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423670852] [2024-11-08 21:31:26,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423670852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:31:26,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:31:26,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 21:31:26,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210006555] [2024-11-08 21:31:26,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:31:26,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 21:31:26,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:31:26,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 21:31:26,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 21:31:26,852 INFO L87 Difference]: Start difference. First operand 546 states and 880 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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-11-08 21:31:27,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:31:27,162 INFO L93 Difference]: Finished difference Result 1296 states and 2083 transitions. [2024-11-08 21:31:27,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 21:31:27,162 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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 211 [2024-11-08 21:31:27,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:31:27,167 INFO L225 Difference]: With dead ends: 1296 [2024-11-08 21:31:27,167 INFO L226 Difference]: Without dead ends: 753 [2024-11-08 21:31:27,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-08 21:31:27,171 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 304 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:31:27,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 765 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 21:31:27,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2024-11-08 21:31:27,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 486. [2024-11-08 21:31:27,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 347 states have (on average 1.4553314121037464) internal successors, (505), 347 states have internal predecessors, (505), 132 states have call successors, (132), 6 states have call predecessors, (132), 6 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2024-11-08 21:31:27,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 769 transitions. [2024-11-08 21:31:27,261 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 769 transitions. Word has length 211 [2024-11-08 21:31:27,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:31:27,262 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 769 transitions. [2024-11-08 21:31:27,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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-11-08 21:31:27,262 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 769 transitions. [2024-11-08 21:31:27,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-08 21:31:27,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:31:27,266 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:31:27,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 21:31:27,266 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:31:27,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:31:27,267 INFO L85 PathProgramCache]: Analyzing trace with hash 232630393, now seen corresponding path program 1 times [2024-11-08 21:31:27,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:31:27,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271991469] [2024-11-08 21:31:27,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:31:27,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:31:27,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 21:31:27,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [709498552] [2024-11-08 21:31:27,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:31:27,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:31:27,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:31:27,353 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-11-08 21:31:27,355 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-11-08 21:31:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 21:31:27,495 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 21:31:27,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 21:31:27,703 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 21:31:27,704 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 21:31:27,705 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 21:31:27,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 21:31:27,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-08 21:31:27,910 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:31:28,050 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 21:31:28,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 09:31:28 BoogieIcfgContainer [2024-11-08 21:31:28,053 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 21:31:28,053 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 21:31:28,053 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 21:31:28,054 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 21:31:28,054 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:31:20" (3/4) ... [2024-11-08 21:31:28,056 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 21:31:28,056 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 21:31:28,057 INFO L158 Benchmark]: Toolchain (without parser) took 9069.91ms. Allocated memory was 180.4MB in the beginning and 295.7MB in the end (delta: 115.3MB). Free memory was 109.2MB in the beginning and 245.1MB in the end (delta: -135.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 21:31:28,057 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 113.2MB. Free memory is still 73.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 21:31:28,057 INFO L158 Benchmark]: CACSL2BoogieTranslator took 408.13ms. Allocated memory is still 180.4MB. Free memory was 108.9MB in the beginning and 91.8MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 21:31:28,057 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.69ms. Allocated memory is still 180.4MB. Free memory was 91.8MB in the beginning and 88.5MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 21:31:28,057 INFO L158 Benchmark]: Boogie Preprocessor took 60.25ms. Allocated memory is still 180.4MB. Free memory was 88.5MB in the beginning and 84.7MB in the end (delta: 3.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 21:31:28,058 INFO L158 Benchmark]: RCFGBuilder took 714.42ms. Allocated memory is still 180.4MB. Free memory was 84.7MB in the beginning and 138.8MB in the end (delta: -54.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-08 21:31:28,058 INFO L158 Benchmark]: TraceAbstraction took 7818.05ms. Allocated memory was 180.4MB in the beginning and 295.7MB in the end (delta: 115.3MB). Free memory was 137.6MB in the beginning and 245.1MB in the end (delta: -107.5MB). Peak memory consumption was 164.0MB. Max. memory is 16.1GB. [2024-11-08 21:31:28,058 INFO L158 Benchmark]: Witness Printer took 3.06ms. Allocated memory is still 295.7MB. Free memory is still 245.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 21:31:28,059 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.17ms. Allocated memory is still 113.2MB. Free memory is still 73.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 408.13ms. Allocated memory is still 180.4MB. Free memory was 108.9MB in the beginning and 91.8MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.69ms. Allocated memory is still 180.4MB. Free memory was 91.8MB in the beginning and 88.5MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.25ms. Allocated memory is still 180.4MB. Free memory was 88.5MB in the beginning and 84.7MB in the end (delta: 3.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 714.42ms. Allocated memory is still 180.4MB. Free memory was 84.7MB in the beginning and 138.8MB in the end (delta: -54.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 7818.05ms. Allocated memory was 180.4MB in the beginning and 295.7MB in the end (delta: 115.3MB). Free memory was 137.6MB in the beginning and 245.1MB in the end (delta: -107.5MB). Peak memory consumption was 164.0MB. Max. memory is 16.1GB. * Witness Printer took 3.06ms. Allocated memory is still 295.7MB. Free memory is still 245.1MB. 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 194, overapproximation of shiftRight at line 58. 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] unsigned char var_1_31 = 32; [L42] unsigned char var_1_32 = 25; [L43] unsigned char var_1_33 = 128; [L44] double var_1_34 = 499.6; [L45] double var_1_35 = 3.5; [L46] unsigned char var_1_36 = 200; [L47] unsigned short int var_1_37 = 2; [L48] unsigned short int var_1_41 = 36532; [L49] unsigned short int var_1_42 = 32367; [L50] signed char var_1_43 = -2; [L51] signed char var_1_44 = 1; [L52] unsigned short int last_1_var_1_8 = 4; [L53] signed short int last_1_var_1_21 = -64; [L54] signed char last_1_var_1_25 = -128; VAL [isInitial=0, 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=4] [L198] isInitial = 1 [L199] FCALL initially() [L200] COND TRUE 1 [L201] CALL updateLastVariables() [L189] last_1_var_1_8 = var_1_8 [L190] last_1_var_1_21 = var_1_21 [L191] last_1_var_1_25 = 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=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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=4] [L201] RET updateLastVariables() [L202] CALL updateVariables() [L136] var_1_4 = __VERIFIER_nondet_uchar() [L137] 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=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=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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L137] 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L138] 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=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=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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L138] 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L139] var_1_6 = __VERIFIER_nondet_uchar() [L140] 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_7=0, var_1_8=4] [L140] 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_7=0, var_1_8=4] [L141] 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=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=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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L141] 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L142] var_1_11 = __VERIFIER_nondet_long() [L143] 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=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=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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L143] 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L144] 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=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=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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L144] 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L145] var_1_12 = __VERIFIER_nondet_long() [L146] 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=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=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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L146] 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L147] 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=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=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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L147] 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L148] var_1_13 = __VERIFIER_nondet_ushort() [L149] 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=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_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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L149] 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L150] 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=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=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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L150] 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L151] var_1_15 = __VERIFIER_nondet_short() [L152] 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=8, 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=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=8, 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L152] 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=8, 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L153] 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=8, 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=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=8, 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L153] 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=8, 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L154] 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=8, 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=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=8, 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L154] 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=8, 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L155] var_1_16 = __VERIFIER_nondet_long() [L156] 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=8, var_1_16=64, 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=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=8, var_1_16=64, 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L156] 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=8, var_1_16=64, 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L157] 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=8, var_1_16=64, 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=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=8, var_1_16=64, 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L157] 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=8, var_1_16=64, 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L158] 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=8, var_1_16=64, 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=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=8, var_1_16=64, 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L158] 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=8, var_1_16=64, 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L159] var_1_17 = __VERIFIER_nondet_double() [L160] 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=8, var_1_16=64, 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=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=8, var_1_16=64, 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L160] 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=8, var_1_16=64, 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L161] var_1_18 = __VERIFIER_nondet_double() [L162] 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=8, var_1_16=64, 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=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=8, var_1_16=64, 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L162] 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=8, var_1_16=64, 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L163] var_1_19 = __VERIFIER_nondet_double() [L164] 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=8, var_1_16=64, 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=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=8, var_1_16=64, 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L164] 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=8, var_1_16=64, 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_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L165] var_1_20 = __VERIFIER_nondet_double() [L166] 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=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=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=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L166] 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=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L167] var_1_26 = __VERIFIER_nondet_char() [L168] 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=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=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=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L168] 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=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L169] 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=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=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=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L169] 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=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L170] var_1_31 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_31 >= 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=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=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=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=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_31 >= 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=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=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_31 <= 254) 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=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=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=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=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_31 <= 254) 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=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L173] var_1_32 = __VERIFIER_nondet_uchar() [L174] 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=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=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=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L174] 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=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L175] CALL assume_abort_if_not(var_1_32 <= 254) 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=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=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=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L175] RET assume_abort_if_not(var_1_32 <= 254) 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=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L176] var_1_35 = __VERIFIER_nondet_double() [L177] CALL assume_abort_if_not((var_1_35 >= -922337.2036854765600e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 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=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=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=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L177] RET assume_abort_if_not((var_1_35 >= -922337.2036854765600e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 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=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L178] var_1_41 = __VERIFIER_nondet_ushort() [L179] CALL assume_abort_if_not(var_1_41 >= 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=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=32367, var_1_43=-2, var_1_44=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=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L179] RET assume_abort_if_not(var_1_41 >= 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=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L180] CALL assume_abort_if_not(var_1_41 <= 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=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=32367, var_1_43=-2, var_1_44=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=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L180] RET assume_abort_if_not(var_1_41 <= 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=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L181] var_1_42 = __VERIFIER_nondet_ushort() [L182] CALL assume_abort_if_not(var_1_42 >= 16383) 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=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=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=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L182] RET assume_abort_if_not(var_1_42 >= 16383) 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=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L183] CALL assume_abort_if_not(var_1_42 <= 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=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=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=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L183] RET assume_abort_if_not(var_1_42 <= 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=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L184] var_1_44 = __VERIFIER_nondet_char() [L185] CALL assume_abort_if_not(var_1_44 >= -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=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, 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=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L185] RET assume_abort_if_not(var_1_44 >= -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=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L186] CALL assume_abort_if_not(var_1_44 <= 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=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, 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=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L186] RET assume_abort_if_not(var_1_44 <= 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=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L202] RET updateVariables() [L203] CALL step() [L58] 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=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L58] COND TRUE (last_1_var_1_8 + 4u) <= (last_1_var_1_8 >> var_1_15) [L59] 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=8, var_1_16=64, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L63] signed long int stepLocal_1 = ((((-1) > (var_1_11)) ? (-1) : (var_1_11))) - var_1_12; [L64] 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=8, var_1_16=64, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L65] COND FALSE !((last_1_var_1_21 * last_1_var_1_21) < stepLocal_1) [L70] 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=8, var_1_16=64, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L72] 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=8, var_1_16=64, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L73] COND TRUE \read(var_1_4) [L74] 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=8, var_1_16=64, var_1_1=1, var_1_21=-256, var_1_25=0, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L77] COND FALSE !((8 / var_1_15) < (64 / var_1_16)) [L84] 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=8, var_1_16=64, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=0, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L86] COND TRUE (- var_1_14) <= var_1_14 [L87] 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=8, var_1_16=64, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=0, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L95] COND TRUE var_1_14 < ((((var_1_14) > ((128.5 * var_1_14))) ? (var_1_14) : ((128.5 * var_1_14)))) [L96] var_1_7 = (var_1_1 && (! 1)) 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=8, var_1_16=64, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=0, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L98] COND FALSE !(var_1_14 >= (((((((var_1_14) > (var_1_14)) ? (var_1_14) : (var_1_14))) < 0 ) ? -((((var_1_14) > (var_1_14)) ? (var_1_14) : (var_1_14))) : ((((var_1_14) > (var_1_14)) ? (var_1_14) : (var_1_14)))))) [L105] var_1_27 = var_1_32 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=8, var_1_16=64, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=0, var_1_26=0, var_1_27=0, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L107] COND TRUE var_1_14 >= ((((var_1_14) < (var_1_14)) ? (var_1_14) : (var_1_14))) [L108] var_1_33 = ((((var_1_31) < (var_1_32)) ? (var_1_31) : (var_1_32))) 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=8, var_1_16=64, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=0, var_1_26=0, var_1_27=0, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L110] var_1_34 = var_1_35 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=8, var_1_16=64, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=0, var_1_26=0, var_1_27=0, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=3, var_1_35=3, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L111] COND FALSE !(var_1_14 >= 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=8, var_1_16=64, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=0, var_1_26=0, var_1_27=0, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=3, var_1_35=3, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L116] EXPR ((((var_1_25) < 0 ) ? -(var_1_25) : (var_1_25))) | (-10 * 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, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=8, var_1_16=64, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=0, var_1_26=0, var_1_27=0, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=3, var_1_35=3, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L116] COND FALSE !(-2 > (((((var_1_25) < 0 ) ? -(var_1_25) : (var_1_25))) | (-10 * var_1_21))) [L119] COND FALSE !(((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) <= ((((var_1_25) < 0 ) ? -(var_1_25) : (var_1_25)))) [L124] var_1_37 = (var_1_41 - (var_1_42 - var_1_32)) 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=8, var_1_16=64, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=0, var_1_26=0, var_1_27=0, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=3, var_1_35=3, var_1_36=200, var_1_37=16384, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L127] COND FALSE !(var_1_42 > var_1_41) 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=8, var_1_16=64, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=0, var_1_26=0, var_1_27=0, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=3, var_1_35=3, var_1_36=200, var_1_37=16384, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L203] RET step() [L204] CALL, EXPR property() [L194] 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=8, var_1_16=64, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=0, var_1_26=0, var_1_27=0, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=3, var_1_35=3, var_1_36=200, var_1_37=16384, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L194-L195] 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) ; [L204] RET, EXPR property() [L204] 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=8, var_1_16=64, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=0, var_1_26=0, var_1_27=0, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=3, var_1_35=3, var_1_36=200, var_1_37=16384, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, 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=8, var_1_16=64, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=0, var_1_26=0, var_1_27=0, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=3, var_1_35=3, var_1_36=200, var_1_37=16384, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, 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, 102 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.6s, OverallIterations: 7, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1506 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1476 mSDsluCounter, 3872 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2698 mSDsCounter, 601 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1083 IncrementalHoareTripleChecker+Invalid, 1684 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 601 mSolverCounterUnsat, 1174 mSDtfsCounter, 1083 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 903 GetRequests, 853 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=546occurred in iteration=5, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 6 MinimizatonAttempts, 860 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 1895 NumberOfCodeBlocks, 1895 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1674 ConstructedInterpolants, 0 QuantifiedInterpolants, 4955 SizeOfPredicates, 2 NumberOfNonLiveVariables, 478 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 16716/16896 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-11-08 21:31:28,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_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 8625eca51d55482cec5eb7c96eba9272b260b764c68904ba85421ac6b44d67c1 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:31:30,191 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:31:30,267 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 21:31:30,272 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:31:30,272 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:31:30,306 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:31:30,307 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:31:30,308 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:31:30,308 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:31:30,309 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:31:30,309 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:31:30,309 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:31:30,310 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:31:30,310 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:31:30,310 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:31:30,311 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:31:30,311 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:31:30,313 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:31:30,314 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:31:30,314 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:31:30,317 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:31:30,317 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:31:30,317 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:31:30,318 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 21:31:30,318 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 21:31:30,318 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:31:30,318 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 21:31:30,318 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:31:30,319 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:31:30,319 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:31:30,320 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:31:30,320 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:31:30,320 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:31:30,320 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:31:30,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:31:30,321 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:31:30,322 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:31:30,322 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:31:30,322 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 21:31:30,322 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 21:31:30,322 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:31:30,323 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:31:30,323 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:31:30,323 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:31:30,323 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 -> 8625eca51d55482cec5eb7c96eba9272b260b764c68904ba85421ac6b44d67c1 [2024-11-08 21:31:30,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:31:30,638 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:31:30,642 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:31:30,643 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:31:30,643 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:31:30,644 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-38.i [2024-11-08 21:31:32,080 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:31:32,295 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:31:32,296 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-38.i [2024-11-08 21:31:32,309 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d7316163/bda826a2eb8f4a1eafdb0f3101633fc9/FLAGab169c5b3 [2024-11-08 21:31:32,323 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d7316163/bda826a2eb8f4a1eafdb0f3101633fc9 [2024-11-08 21:31:32,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:31:32,328 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:31:32,331 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:31:32,331 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:31:32,337 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:31:32,338 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:31:32" (1/1) ... [2024-11-08 21:31:32,338 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3621cae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:31:32, skipping insertion in model container [2024-11-08 21:31:32,341 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:31:32" (1/1) ... [2024-11-08 21:31:32,373 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:31:32,552 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-38.i[919,932] [2024-11-08 21:31:32,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:31:32,707 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:31:32,722 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-38.i[919,932] [2024-11-08 21:31:32,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:31:32,791 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:31:32,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:31:32 WrapperNode [2024-11-08 21:31:32,791 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:31:32,792 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:31:32,793 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:31:32,793 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:31:32,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:31:32" (1/1) ... [2024-11-08 21:31:32,813 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:31:32" (1/1) ... [2024-11-08 21:31:32,851 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 202 [2024-11-08 21:31:32,852 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:31:32,853 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:31:32,853 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:31:32,853 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:31:32,865 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:31:32" (1/1) ... [2024-11-08 21:31:32,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:31:32" (1/1) ... [2024-11-08 21:31:32,869 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:31:32" (1/1) ... [2024-11-08 21:31:32,889 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-11-08 21:31:32,889 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:31:32" (1/1) ... [2024-11-08 21:31:32,889 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:31:32" (1/1) ... [2024-11-08 21:31:32,907 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:31:32" (1/1) ... [2024-11-08 21:31:32,914 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:31:32" (1/1) ... [2024-11-08 21:31:32,916 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:31:32" (1/1) ... [2024-11-08 21:31:32,918 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:31:32" (1/1) ... [2024-11-08 21:31:32,925 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:31:32,926 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:31:32,926 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:31:32,926 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:31:32,927 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:31:32" (1/1) ... [2024-11-08 21:31:32,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:31:32,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:31:32,964 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-11-08 21:31:32,970 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-11-08 21:31:33,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:31:33,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 21:31:33,005 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:31:33,005 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:31:33,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:31:33,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:31:33,086 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:31:33,088 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:31:35,853 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-08 21:31:35,853 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:31:35,868 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:31:35,868 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:31:35,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:31:35 BoogieIcfgContainer [2024-11-08 21:31:35,869 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:31:35,871 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:31:35,871 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:31:35,874 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:31:35,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:31:32" (1/3) ... [2024-11-08 21:31:35,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51822f91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:31:35, skipping insertion in model container [2024-11-08 21:31:35,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:31:32" (2/3) ... [2024-11-08 21:31:35,875 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51822f91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:31:35, skipping insertion in model container [2024-11-08 21:31:35,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:31:35" (3/3) ... [2024-11-08 21:31:35,877 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-38.i [2024-11-08 21:31:35,889 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:31:35,889 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:31:35,951 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:31:35,958 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;@73ef4d49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:31:35,960 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:31:35,964 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 57 states have internal predecessors, (81), 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-11-08 21:31:35,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-08 21:31:35,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:31:35,984 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-11-08 21:31:35,984 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:31:35,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:31:35,990 INFO L85 PathProgramCache]: Analyzing trace with hash 2034764968, now seen corresponding path program 1 times [2024-11-08 21:31:36,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:31:36,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1359503422] [2024-11-08 21:31:36,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:31:36,027 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-11-08 21:31:36,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:31:36,032 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-11-08 21:31:36,044 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-11-08 21:31:36,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:36,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 21:31:36,546 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:31:36,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 764 proven. 0 refuted. 0 times theorem prover too weak. 1348 trivial. 0 not checked. [2024-11-08 21:31:36,616 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:31:36,617 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:31:36,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1359503422] [2024-11-08 21:31:36,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1359503422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:31:36,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:31:36,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:31:36,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854709661] [2024-11-08 21:31:36,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:31:36,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:31:36,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:31:36,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:31:36,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:31:36,656 INFO L87 Difference]: Start difference. First operand has 92 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 57 states have internal predecessors, (81), 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 23.5) internal successors, (47), 2 states have internal predecessors, (47), 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-11-08 21:31:36,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:31:36,701 INFO L93 Difference]: Finished difference Result 177 states and 321 transitions. [2024-11-08 21:31:36,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:31:36,704 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 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 205 [2024-11-08 21:31:36,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:31:36,714 INFO L225 Difference]: With dead ends: 177 [2024-11-08 21:31:36,715 INFO L226 Difference]: Without dead ends: 88 [2024-11-08 21:31:36,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 204 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-11-08 21:31:36,721 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:31:36,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:31:36,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-08 21:31:36,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-08 21:31:36,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 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-11-08 21:31:36,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 138 transitions. [2024-11-08 21:31:36,763 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 138 transitions. Word has length 205 [2024-11-08 21:31:36,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:31:36,763 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 138 transitions. [2024-11-08 21:31:36,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 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-11-08 21:31:36,764 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 138 transitions. [2024-11-08 21:31:36,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-08 21:31:36,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:31:36,772 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-11-08 21:31:36,787 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-11-08 21:31:36,972 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-11-08 21:31:36,973 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:31:36,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:31:36,974 INFO L85 PathProgramCache]: Analyzing trace with hash 48822708, now seen corresponding path program 1 times [2024-11-08 21:31:36,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:31:36,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2127274585] [2024-11-08 21:31:36,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:31:36,976 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-11-08 21:31:36,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:31:36,978 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-11-08 21:31:36,980 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-11-08 21:31:37,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:37,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 21:31:37,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:31:39,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 21:31:39,002 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:31:39,002 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:31:39,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2127274585] [2024-11-08 21:31:39,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2127274585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:31:39,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:31:39,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:31:39,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822813727] [2024-11-08 21:31:39,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:31:39,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:31:39,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:31:39,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:31:39,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:31:39,006 INFO L87 Difference]: Start difference. First operand 88 states and 138 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 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-11-08 21:31:42,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.74s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:31:45,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.76s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:31:45,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:31:45,383 INFO L93 Difference]: Finished difference Result 395 states and 622 transitions. [2024-11-08 21:31:45,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 21:31:45,384 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 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 205 [2024-11-08 21:31:45,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:31:45,391 INFO L225 Difference]: With dead ends: 395 [2024-11-08 21:31:45,392 INFO L226 Difference]: Without dead ends: 310 [2024-11-08 21:31:45,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 201 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-11-08 21:31:45,394 INFO L432 NwaCegarLoop]: 335 mSDtfsCounter, 240 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:31:45,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 719 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2024-11-08 21:31:45,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-11-08 21:31:45,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 184. [2024-11-08 21:31:45,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 115 states have (on average 1.391304347826087) internal successors, (160), 115 states have internal predecessors, (160), 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-11-08 21:31:45,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 292 transitions. [2024-11-08 21:31:45,449 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 292 transitions. Word has length 205 [2024-11-08 21:31:45,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:31:45,450 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 292 transitions. [2024-11-08 21:31:45,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 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-11-08 21:31:45,450 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 292 transitions. [2024-11-08 21:31:45,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-08 21:31:45,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:31:45,453 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, 1, 1] [2024-11-08 21:31:45,476 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-11-08 21:31:45,654 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-11-08 21:31:45,654 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:31:45,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:31:45,655 INFO L85 PathProgramCache]: Analyzing trace with hash 2020511964, now seen corresponding path program 1 times [2024-11-08 21:31:45,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:31:45,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1652519595] [2024-11-08 21:31:45,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:31:45,656 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-11-08 21:31:45,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:31:45,659 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-11-08 21:31:45,660 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-11-08 21:31:46,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:46,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 21:31:46,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:31:46,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 21:31:46,217 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:31:46,218 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:31:46,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1652519595] [2024-11-08 21:31:46,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1652519595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:31:46,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:31:46,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:31:46,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741142029] [2024-11-08 21:31:46,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:31:46,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:31:46,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:31:46,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:31:46,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:31:46,224 INFO L87 Difference]: Start difference. First operand 184 states and 292 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-11-08 21:31:51,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.51s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:31:51,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:31:51,679 INFO L93 Difference]: Finished difference Result 537 states and 852 transitions. [2024-11-08 21:31:51,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:31:51,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 207 [2024-11-08 21:31:51,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:31:51,732 INFO L225 Difference]: With dead ends: 537 [2024-11-08 21:31:51,732 INFO L226 Difference]: Without dead ends: 356 [2024-11-08 21:31:51,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:31:51,735 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 125 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-11-08 21:31:51,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 264 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-11-08 21:31:51,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-11-08 21:31:51,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 199. [2024-11-08 21:31:51,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 130 states have (on average 1.3461538461538463) internal successors, (175), 130 states have internal predecessors, (175), 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-11-08 21:31:51,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 307 transitions. [2024-11-08 21:31:51,779 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 307 transitions. Word has length 207 [2024-11-08 21:31:51,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:31:51,780 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 307 transitions. [2024-11-08 21:31:51,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-11-08 21:31:51,780 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 307 transitions. [2024-11-08 21:31:51,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-08 21:31:51,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:31:51,783 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, 1, 1, 1] [2024-11-08 21:31:51,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-08 21:31:51,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:31:51,984 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:31:51,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:31:51,985 INFO L85 PathProgramCache]: Analyzing trace with hash -686392414, now seen corresponding path program 1 times [2024-11-08 21:31:51,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:31:51,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1219059561] [2024-11-08 21:31:51,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:31:51,986 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-11-08 21:31:51,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:31:51,990 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 21:31:51,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 21:31:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:31:52,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 21:31:52,410 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:31:55,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 51 proven. 1080 refuted. 0 times theorem prover too weak. 981 trivial. 0 not checked. [2024-11-08 21:31:55,132 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:31:56,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 51 proven. 45 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-08 21:31:56,338 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:31:56,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1219059561] [2024-11-08 21:31:56,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1219059561] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 21:31:56,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 21:31:56,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-11-08 21:31:56,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342568249] [2024-11-08 21:31:56,339 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 21:31:56,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 21:31:56,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:31:56,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 21:31:56,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-08 21:31:56,341 INFO L87 Difference]: Start difference. First operand 199 states and 307 transitions. Second operand has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 4 states have call successors, (66), 3 states have call predecessors, (66), 5 states have return successors, (66), 4 states have call predecessors, (66), 4 states have call successors, (66) [2024-11-08 21:32:03,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:32:06,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:32:06,075 INFO L93 Difference]: Finished difference Result 766 states and 1156 transitions. [2024-11-08 21:32:06,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-08 21:32:06,077 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 4 states have call successors, (66), 3 states have call predecessors, (66), 5 states have return successors, (66), 4 states have call predecessors, (66), 4 states have call successors, (66) Word has length 208 [2024-11-08 21:32:06,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:32:06,081 INFO L225 Difference]: With dead ends: 766 [2024-11-08 21:32:06,081 INFO L226 Difference]: Without dead ends: 570 [2024-11-08 21:32:06,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=251, Invalid=561, Unknown=0, NotChecked=0, Total=812 [2024-11-08 21:32:06,084 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 468 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 405 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 405 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2024-11-08 21:32:06,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 455 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [405 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2024-11-08 21:32:06,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2024-11-08 21:32:06,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 213. [2024-11-08 21:32:06,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 142 states have (on average 1.3169014084507042) internal successors, (187), 142 states have internal predecessors, (187), 66 states have call successors, (66), 4 states have call predecessors, (66), 4 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-08 21:32:06,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 319 transitions. [2024-11-08 21:32:06,155 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 319 transitions. Word has length 208 [2024-11-08 21:32:06,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:32:06,157 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 319 transitions. [2024-11-08 21:32:06,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 4 states have call successors, (66), 3 states have call predecessors, (66), 5 states have return successors, (66), 4 states have call predecessors, (66), 4 states have call successors, (66) [2024-11-08 21:32:06,159 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 319 transitions. [2024-11-08 21:32:06,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 21:32:06,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:32:06,161 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, 1, 1, 1, 1] [2024-11-08 21:32:06,185 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 (5)] Ended with exit code 0 [2024-11-08 21:32:06,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-11-08 21:32:06,362 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:32:06,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:32:06,363 INFO L85 PathProgramCache]: Analyzing trace with hash 504655036, now seen corresponding path program 1 times [2024-11-08 21:32:06,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:32:06,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1051497015] [2024-11-08 21:32:06,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:32:06,364 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-11-08 21:32:06,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:32:06,367 INFO L229 MonitoredProcess]: Starting monitored process 6 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-11-08 21:32:06,368 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 (6)] Waiting until timeout for monitored process [2024-11-08 21:32:06,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:32:06,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 21:32:06,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:32:06,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 21:32:06,801 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:32:06,801 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:32:06,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1051497015] [2024-11-08 21:32:06,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1051497015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:32:06,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:32:06,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:32:06,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659002390] [2024-11-08 21:32:06,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:32:06,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:32:06,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:32:06,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:32:06,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:32:06,804 INFO L87 Difference]: Start difference. First operand 213 states and 319 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-11-08 21:32:11,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.54s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:32:11,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:32:11,696 INFO L93 Difference]: Finished difference Result 600 states and 909 transitions. [2024-11-08 21:32:11,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:32:11,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 209 [2024-11-08 21:32:11,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:32:11,749 INFO L225 Difference]: With dead ends: 600 [2024-11-08 21:32:11,750 INFO L226 Difference]: Without dead ends: 390 [2024-11-08 21:32:11,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:32:11,751 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 125 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-08 21:32:11,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 262 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-11-08 21:32:11,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-11-08 21:32:11,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 219. [2024-11-08 21:32:11,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 148 states have (on average 1.3445945945945945) internal successors, (199), 148 states have internal predecessors, (199), 66 states have call successors, (66), 4 states have call predecessors, (66), 4 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-08 21:32:11,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 331 transitions. [2024-11-08 21:32:11,786 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 331 transitions. Word has length 209 [2024-11-08 21:32:11,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:32:11,787 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 331 transitions. [2024-11-08 21:32:11,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-11-08 21:32:11,787 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 331 transitions. [2024-11-08 21:32:11,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 21:32:11,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:32:11,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, 1, 1, 1, 1] [2024-11-08 21:32:11,811 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 (6)] Forceful destruction successful, exit code 0 [2024-11-08 21:32:11,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-11-08 21:32:11,991 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:32:11,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:32:11,991 INFO L85 PathProgramCache]: Analyzing trace with hash -82150978, now seen corresponding path program 1 times [2024-11-08 21:32:11,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:32:11,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1332546182] [2024-11-08 21:32:11,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:32:11,993 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-11-08 21:32:11,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:32:11,996 INFO L229 MonitoredProcess]: Starting monitored process 7 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-11-08 21:32:11,997 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 (7)] Waiting until timeout for monitored process [2024-11-08 21:32:12,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:32:12,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 21:32:12,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:32:36,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1106 proven. 90 refuted. 0 times theorem prover too weak. 916 trivial. 0 not checked. [2024-11-08 21:32:36,913 INFO L311 TraceCheckSpWp]: Computing backward predicates...