./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-1.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 0feebc1024eac08439331e7773a7511b315939c469dc4e0ad2e111de10ff1692 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 01:54:51,154 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 01:54:51,241 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 01:54:51,245 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 01:54:51,249 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 01:54:51,271 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 01:54:51,272 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 01:54:51,272 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 01:54:51,272 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 01:54:51,273 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 01:54:51,273 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 01:54:51,273 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 01:54:51,274 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 01:54:51,274 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 01:54:51,275 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 01:54:51,275 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 01:54:51,275 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 01:54:51,276 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 01:54:51,276 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 01:54:51,276 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 01:54:51,277 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 01:54:51,277 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 01:54:51,278 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 01:54:51,278 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 01:54:51,278 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 01:54:51,279 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 01:54:51,279 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 01:54:51,279 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 01:54:51,280 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 01:54:51,280 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 01:54:51,281 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 01:54:51,281 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 01:54:51,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:54:51,282 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 01:54:51,282 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 01:54:51,282 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 01:54:51,283 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 01:54:51,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 01:54:51,283 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 01:54:51,284 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 01:54:51,284 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 01:54:51,284 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 01:54:51,285 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 -> 0feebc1024eac08439331e7773a7511b315939c469dc4e0ad2e111de10ff1692 [2024-10-13 01:54:51,527 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 01:54:51,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 01:54:51,556 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 01:54:51,558 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 01:54:51,559 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 01:54:51,560 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-1.i [2024-10-13 01:54:52,965 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 01:54:53,207 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 01:54:53,208 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-1.i [2024-10-13 01:54:53,217 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/910b3f935/67350f48133d4c4f8f80cd5aa4397c03/FLAGac2c40335 [2024-10-13 01:54:53,230 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/910b3f935/67350f48133d4c4f8f80cd5aa4397c03 [2024-10-13 01:54:53,232 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 01:54:53,234 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 01:54:53,235 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 01:54:53,235 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 01:54:53,241 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 01:54:53,242 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:54:53" (1/1) ... [2024-10-13 01:54:53,245 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4967ab40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:54:53, skipping insertion in model container [2024-10-13 01:54:53,245 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:54:53" (1/1) ... [2024-10-13 01:54:53,276 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 01:54:53,456 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-1.i[918,931] [2024-10-13 01:54:53,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:54:53,567 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 01:54:53,580 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-1.i[918,931] [2024-10-13 01:54:53,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:54:53,637 INFO L204 MainTranslator]: Completed translation [2024-10-13 01:54:53,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:54:53 WrapperNode [2024-10-13 01:54:53,638 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 01:54:53,639 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 01:54:53,639 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 01:54:53,639 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 01:54:53,646 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:54:53" (1/1) ... [2024-10-13 01:54:53,661 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:54:53" (1/1) ... [2024-10-13 01:54:53,706 INFO L138 Inliner]: procedures = 26, calls = 52, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 243 [2024-10-13 01:54:53,706 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 01:54:53,707 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 01:54:53,707 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 01:54:53,711 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 01:54:53,721 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:54:53" (1/1) ... [2024-10-13 01:54:53,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:54:53" (1/1) ... [2024-10-13 01:54:53,728 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:54:53" (1/1) ... [2024-10-13 01:54:53,747 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 01:54:53,748 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:54:53" (1/1) ... [2024-10-13 01:54:53,748 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:54:53" (1/1) ... [2024-10-13 01:54:53,763 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:54:53" (1/1) ... [2024-10-13 01:54:53,770 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:54:53" (1/1) ... [2024-10-13 01:54:53,778 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:54:53" (1/1) ... [2024-10-13 01:54:53,783 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:54:53" (1/1) ... [2024-10-13 01:54:53,790 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 01:54:53,792 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 01:54:53,792 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 01:54:53,792 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 01:54:53,793 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:54:53" (1/1) ... [2024-10-13 01:54:53,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:54:53,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:54:53,827 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 01:54:53,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 01:54:53,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 01:54:53,879 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 01:54:53,880 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 01:54:53,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 01:54:53,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 01:54:53,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 01:54:53,994 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 01:54:53,996 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 01:54:54,500 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-13 01:54:54,500 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 01:54:54,577 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 01:54:54,578 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 01:54:54,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:54:54 BoogieIcfgContainer [2024-10-13 01:54:54,578 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 01:54:54,580 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 01:54:54,580 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 01:54:54,583 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 01:54:54,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:54:53" (1/3) ... [2024-10-13 01:54:54,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a33feee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:54:54, skipping insertion in model container [2024-10-13 01:54:54,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:54:53" (2/3) ... [2024-10-13 01:54:54,585 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a33feee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:54:54, skipping insertion in model container [2024-10-13 01:54:54,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:54:54" (3/3) ... [2024-10-13 01:54:54,586 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-1.i [2024-10-13 01:54:54,600 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 01:54:54,600 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 01:54:54,653 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 01:54:54,660 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;@41976a81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 01:54:54,660 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 01:54:54,664 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 61 states have internal predecessors, (89), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-13 01:54:54,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-10-13 01:54:54,680 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:54:54,681 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:54:54,682 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:54:54,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:54:54,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1603208641, now seen corresponding path program 1 times [2024-10-13 01:54:54,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:54:54,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288418196] [2024-10-13 01:54:54,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:54:54,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:54:54,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:54:55,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 01:54:55,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 01:54:55,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 01:54:55,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 01:54:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 01:54:55,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:54:55,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 01:54:55,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:54:55,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 01:54:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:54:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 01:54:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:54:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 01:54:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:54:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 01:54:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:54:55,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 01:54:55,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:54:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:54:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:54:55,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:54:55,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 01:54:55,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 01:54:55,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 01:54:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 01:54:55,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 01:54:55,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 01:54:55,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 01:54:55,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 01:54:55,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 01:54:55,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 01:54:55,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 01:54:55,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-13 01:54:55,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-13 01:54:55,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-13 01:54:55,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-13 01:54:55,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-13 01:54:55,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-13 01:54:55,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-13 01:54:55,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:54:55,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288418196] [2024-10-13 01:54:55,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288418196] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:54:55,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:54:55,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 01:54:55,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335299151] [2024-10-13 01:54:55,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:54:55,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 01:54:55,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:54:55,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 01:54:55,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:54:55,285 INFO L87 Difference]: Start difference. First operand has 102 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 61 states have internal predecessors, (89), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) 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, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39) [2024-10-13 01:54:55,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:54:55,334 INFO L93 Difference]: Finished difference Result 201 states and 371 transitions. [2024-10-13 01:54:55,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 01:54:55,338 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, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39) Word has length 239 [2024-10-13 01:54:55,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:54:55,347 INFO L225 Difference]: With dead ends: 201 [2024-10-13 01:54:55,347 INFO L226 Difference]: Without dead ends: 100 [2024-10-13 01:54:55,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:54:55,354 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 01:54:55,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 01:54:55,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-13 01:54:55,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-10-13 01:54:55,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 59 states have internal predecessors, (83), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-13 01:54:55,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 161 transitions. [2024-10-13 01:54:55,420 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 161 transitions. Word has length 239 [2024-10-13 01:54:55,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:54:55,421 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 161 transitions. [2024-10-13 01:54:55,421 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, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39) [2024-10-13 01:54:55,421 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 161 transitions. [2024-10-13 01:54:55,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-10-13 01:54:55,426 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:54:55,444 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:54:55,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 01:54:55,445 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:54:55,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:54:55,445 INFO L85 PathProgramCache]: Analyzing trace with hash 943722559, now seen corresponding path program 1 times [2024-10-13 01:54:55,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:54:55,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821836614] [2024-10-13 01:54:55,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:54:55,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:54:55,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:54:55,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 01:54:55,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 01:54:55,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 01:54:55,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 01:54:55,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 01:54:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:54:55,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 01:54:55,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:54:55,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 01:54:55,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:54:55,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 01:54:55,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:54:55,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 01:54:55,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:54:55,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 01:54:55,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:54:55,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 01:54:55,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:54:55,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:54:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:54:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:54:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 01:54:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 01:54:55,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 01:54:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 01:54:55,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 01:54:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 01:54:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 01:54:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 01:54:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 01:54:55,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 01:54:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 01:54:55,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-13 01:54:55,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-13 01:54:55,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-13 01:54:55,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-13 01:54:55,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-13 01:54:55,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-13 01:54:55,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:55,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-13 01:54:55,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:54:55,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821836614] [2024-10-13 01:54:55,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821836614] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:54:55,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:54:55,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 01:54:55,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173716604] [2024-10-13 01:54:55,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:54:55,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 01:54:55,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:54:55,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 01:54:55,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:54:55,921 INFO L87 Difference]: Start difference. First operand 100 states and 161 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, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 01:54:56,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:54:56,026 INFO L93 Difference]: Finished difference Result 199 states and 321 transitions. [2024-10-13 01:54:56,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 01:54:56,027 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, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 239 [2024-10-13 01:54:56,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:54:56,033 INFO L225 Difference]: With dead ends: 199 [2024-10-13 01:54:56,033 INFO L226 Difference]: Without dead ends: 100 [2024-10-13 01:54:56,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 80 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-10-13 01:54:56,036 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 01:54:56,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 280 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 01:54:56,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-13 01:54:56,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-10-13 01:54:56,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 59 states have internal predecessors, (82), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-13 01:54:56,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 160 transitions. [2024-10-13 01:54:56,058 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 160 transitions. Word has length 239 [2024-10-13 01:54:56,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:54:56,061 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 160 transitions. [2024-10-13 01:54:56,061 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, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 01:54:56,061 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 160 transitions. [2024-10-13 01:54:56,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-10-13 01:54:56,068 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:54:56,069 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:54:56,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 01:54:56,069 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:54:56,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:54:56,070 INFO L85 PathProgramCache]: Analyzing trace with hash 661099236, now seen corresponding path program 1 times [2024-10-13 01:54:56,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:54:56,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732480880] [2024-10-13 01:54:56,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:54:56,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:54:56,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:54:56,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 01:54:56,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 01:54:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 01:54:56,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 01:54:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 01:54:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:54:56,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 01:54:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:54:56,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 01:54:56,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:54:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 01:54:56,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:54:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 01:54:56,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:54:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 01:54:56,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:54:56,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 01:54:56,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:54:56,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:54:56,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:54:56,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:54:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 01:54:56,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 01:54:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 01:54:56,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 01:54:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 01:54:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 01:54:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 01:54:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 01:54:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 01:54:56,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 01:54:56,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 01:54:56,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-13 01:54:56,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-13 01:54:56,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-13 01:54:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-13 01:54:56,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-13 01:54:56,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-13 01:54:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-13 01:54:56,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:54:56,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732480880] [2024-10-13 01:54:56,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732480880] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:54:56,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:54:56,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 01:54:56,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337728771] [2024-10-13 01:54:56,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:54:56,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 01:54:56,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:54:56,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 01:54:56,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:54:56,337 INFO L87 Difference]: Start difference. First operand 100 states and 160 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 01:54:56,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:54:56,430 INFO L93 Difference]: Finished difference Result 296 states and 474 transitions. [2024-10-13 01:54:56,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 01:54:56,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 240 [2024-10-13 01:54:56,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:54:56,436 INFO L225 Difference]: With dead ends: 296 [2024-10-13 01:54:56,438 INFO L226 Difference]: Without dead ends: 197 [2024-10-13 01:54:56,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 80 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-10-13 01:54:56,441 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 145 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 01:54:56,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 416 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 01:54:56,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-10-13 01:54:56,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2024-10-13 01:54:56,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 114 states have (on average 1.3596491228070176) internal successors, (155), 114 states have internal predecessors, (155), 78 states have call successors, (78), 2 states have call predecessors, (78), 2 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-13 01:54:56,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 311 transitions. [2024-10-13 01:54:56,485 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 311 transitions. Word has length 240 [2024-10-13 01:54:56,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:54:56,486 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 311 transitions. [2024-10-13 01:54:56,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 01:54:56,487 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 311 transitions. [2024-10-13 01:54:56,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-10-13 01:54:56,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:54:56,492 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:54:56,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 01:54:56,493 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:54:56,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:54:56,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1398598953, now seen corresponding path program 1 times [2024-10-13 01:54:56,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:54:56,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327242059] [2024-10-13 01:54:56,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:54:56,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:54:56,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:54:56,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 01:54:56,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 01:54:56,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 01:54:56,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 01:54:56,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 01:54:56,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:54:56,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 01:54:56,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:54:56,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 01:54:56,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:54:56,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 01:54:56,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:54:56,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 01:54:56,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:54:56,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 01:54:56,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:54:56,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 01:54:56,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:54:56,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:54:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:54:56,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:54:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 01:54:56,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 01:54:56,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 01:54:56,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 01:54:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 01:54:56,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 01:54:56,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 01:54:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 01:54:56,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 01:54:56,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 01:54:56,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 01:54:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-13 01:54:56,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-13 01:54:56,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-13 01:54:56,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-13 01:54:56,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-13 01:54:56,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-13 01:54:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:56,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-13 01:54:56,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:54:56,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327242059] [2024-10-13 01:54:56,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327242059] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:54:56,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:54:56,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 01:54:56,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518041962] [2024-10-13 01:54:56,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:54:56,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 01:54:56,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:54:56,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 01:54:56,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:54:56,782 INFO L87 Difference]: Start difference. First operand 195 states and 311 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 01:54:56,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:54:56,911 INFO L93 Difference]: Finished difference Result 573 states and 915 transitions. [2024-10-13 01:54:56,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 01:54:56,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 241 [2024-10-13 01:54:56,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:54:56,918 INFO L225 Difference]: With dead ends: 573 [2024-10-13 01:54:56,919 INFO L226 Difference]: Without dead ends: 379 [2024-10-13 01:54:56,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 80 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-10-13 01:54:56,921 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 145 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 01:54:56,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 265 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 01:54:56,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-10-13 01:54:56,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 223. [2024-10-13 01:54:56,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 142 states have (on average 1.3873239436619718) internal successors, (197), 142 states have internal predecessors, (197), 78 states have call successors, (78), 2 states have call predecessors, (78), 2 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-13 01:54:56,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 353 transitions. [2024-10-13 01:54:56,964 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 353 transitions. Word has length 241 [2024-10-13 01:54:56,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:54:56,965 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 353 transitions. [2024-10-13 01:54:56,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 01:54:56,966 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 353 transitions. [2024-10-13 01:54:56,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-10-13 01:54:56,968 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:54:56,968 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:54:56,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 01:54:56,969 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:54:56,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:54:56,969 INFO L85 PathProgramCache]: Analyzing trace with hash 2078719893, now seen corresponding path program 1 times [2024-10-13 01:54:56,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:54:56,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312404258] [2024-10-13 01:54:56,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:54:56,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:54:57,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:54:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 01:54:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 01:54:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 01:54:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 01:54:57,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 01:54:57,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:54:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 01:54:57,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:54:57,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 01:54:57,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:54:57,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 01:54:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:54:57,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 01:54:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:54:57,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 01:54:57,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:54:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 01:54:57,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:54:57,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:54:57,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:54:57,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:54:57,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 01:54:57,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 01:54:57,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 01:54:57,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 01:54:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 01:54:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 01:54:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 01:54:57,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 01:54:57,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 01:54:57,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 01:54:57,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 01:54:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-13 01:54:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-13 01:54:57,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-13 01:54:57,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-13 01:54:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-13 01:54:57,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-13 01:54:57,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-13 01:54:57,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:54:57,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312404258] [2024-10-13 01:54:57,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312404258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:54:57,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:54:57,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 01:54:57,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976006265] [2024-10-13 01:54:57,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:54:57,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 01:54:57,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:54:57,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 01:54:57,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:54:57,254 INFO L87 Difference]: Start difference. First operand 223 states and 353 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 01:54:57,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:54:57,322 INFO L93 Difference]: Finished difference Result 445 states and 705 transitions. [2024-10-13 01:54:57,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 01:54:57,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 241 [2024-10-13 01:54:57,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:54:57,325 INFO L225 Difference]: With dead ends: 445 [2024-10-13 01:54:57,325 INFO L226 Difference]: Without dead ends: 223 [2024-10-13 01:54:57,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 80 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-10-13 01:54:57,329 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 01:54:57,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 279 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 01:54:57,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-10-13 01:54:57,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2024-10-13 01:54:57,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 142 states have (on average 1.3732394366197183) internal successors, (195), 142 states have internal predecessors, (195), 78 states have call successors, (78), 2 states have call predecessors, (78), 2 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-13 01:54:57,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 351 transitions. [2024-10-13 01:54:57,377 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 351 transitions. Word has length 241 [2024-10-13 01:54:57,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:54:57,379 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 351 transitions. [2024-10-13 01:54:57,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 01:54:57,381 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 351 transitions. [2024-10-13 01:54:57,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-10-13 01:54:57,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:54:57,384 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:54:57,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 01:54:57,384 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:54:57,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:54:57,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1491913879, now seen corresponding path program 1 times [2024-10-13 01:54:57,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:54:57,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948416529] [2024-10-13 01:54:57,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:54:57,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:54:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:54:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 01:54:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 01:54:57,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 01:54:57,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 01:54:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 01:54:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:54:57,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 01:54:57,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:54:57,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 01:54:57,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:54:57,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 01:54:57,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:54:57,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 01:54:57,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:54:57,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 01:54:57,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:54:57,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 01:54:57,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:54:57,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:54:57,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:54:57,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:54:57,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 01:54:57,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 01:54:57,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 01:54:57,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 01:54:57,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 01:54:57,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 01:54:57,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 01:54:57,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 01:54:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 01:54:57,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 01:54:57,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 01:54:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-13 01:54:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-13 01:54:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-13 01:54:57,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-13 01:54:57,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-13 01:54:57,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-13 01:54:57,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:57,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-13 01:54:57,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:54:57,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948416529] [2024-10-13 01:54:57,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948416529] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:54:57,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:54:57,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 01:54:57,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599761634] [2024-10-13 01:54:57,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:54:57,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 01:54:57,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:54:57,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 01:54:57,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:54:57,668 INFO L87 Difference]: Start difference. First operand 223 states and 351 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 01:54:57,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:54:57,774 INFO L93 Difference]: Finished difference Result 601 states and 947 transitions. [2024-10-13 01:54:57,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 01:54:57,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 241 [2024-10-13 01:54:57,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:54:57,779 INFO L225 Difference]: With dead ends: 601 [2024-10-13 01:54:57,779 INFO L226 Difference]: Without dead ends: 379 [2024-10-13 01:54:57,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 80 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-10-13 01:54:57,781 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 121 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 01:54:57,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 373 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 01:54:57,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-10-13 01:54:57,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 237. [2024-10-13 01:54:57,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 156 states have (on average 1.3653846153846154) internal successors, (213), 156 states have internal predecessors, (213), 78 states have call successors, (78), 2 states have call predecessors, (78), 2 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-13 01:54:57,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 369 transitions. [2024-10-13 01:54:57,822 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 369 transitions. Word has length 241 [2024-10-13 01:54:57,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:54:57,823 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 369 transitions. [2024-10-13 01:54:57,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 01:54:57,823 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 369 transitions. [2024-10-13 01:54:57,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-10-13 01:54:57,827 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:54:57,827 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:54:57,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 01:54:57,828 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:54:57,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:54:57,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1283009807, now seen corresponding path program 1 times [2024-10-13 01:54:57,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:54:57,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334323577] [2024-10-13 01:54:57,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:54:57,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:54:57,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:58,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:54:58,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:58,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 01:54:58,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:58,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 01:54:58,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:58,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 01:54:58,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:58,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 01:54:58,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:58,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 01:54:58,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:58,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:54:58,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:58,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 01:54:58,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:58,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:54:58,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:58,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 01:54:58,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:58,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:54:58,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:58,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 01:54:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:58,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:54:58,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:58,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 01:54:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:58,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:54:58,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:58,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 01:54:58,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:58,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:54:58,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:58,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 01:54:58,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:58,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:54:58,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:58,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:54:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:58,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:54:58,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:58,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:54:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:58,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 01:54:58,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:58,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 01:54:58,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:58,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 01:54:58,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:58,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 01:54:58,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:58,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 01:54:58,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:58,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 01:54:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:58,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 01:54:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:58,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 01:54:58,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:58,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 01:54:58,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:58,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 01:54:58,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:58,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 01:54:58,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:58,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-13 01:54:58,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:58,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-13 01:54:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:58,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-13 01:54:58,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:58,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-13 01:54:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:58,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-13 01:54:58,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:58,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-13 01:54:58,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:54:58,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-13 01:54:58,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:54:58,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334323577] [2024-10-13 01:54:58,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334323577] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:54:58,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:54:58,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 01:54:58,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482218069] [2024-10-13 01:54:58,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:54:58,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 01:54:58,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:54:58,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 01:54:58,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 01:54:58,383 INFO L87 Difference]: Start difference. First operand 237 states and 369 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 01:54:58,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:54:58,863 INFO L93 Difference]: Finished difference Result 772 states and 1202 transitions. [2024-10-13 01:54:58,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 01:54:58,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 241 [2024-10-13 01:54:58,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:54:58,868 INFO L225 Difference]: With dead ends: 772 [2024-10-13 01:54:58,868 INFO L226 Difference]: Without dead ends: 536 [2024-10-13 01:54:58,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 01:54:58,870 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 272 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 01:54:58,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 398 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 01:54:58,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2024-10-13 01:54:58,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 390. [2024-10-13 01:54:58,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 249 states have (on average 1.3453815261044177) internal successors, (335), 251 states have internal predecessors, (335), 136 states have call successors, (136), 4 states have call predecessors, (136), 4 states have return successors, (136), 134 states have call predecessors, (136), 136 states have call successors, (136) [2024-10-13 01:54:58,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 607 transitions. [2024-10-13 01:54:58,932 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 607 transitions. Word has length 241 [2024-10-13 01:54:58,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:54:58,933 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 607 transitions. [2024-10-13 01:54:58,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 01:54:58,934 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 607 transitions. [2024-10-13 01:54:58,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-10-13 01:54:58,936 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:54:58,936 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:54:58,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 01:54:58,937 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:54:58,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:54:58,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1225751505, now seen corresponding path program 1 times [2024-10-13 01:54:58,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:54:58,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549214246] [2024-10-13 01:54:58,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:54:58,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:54:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 01:54:59,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [425415236] [2024-10-13 01:54:59,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:54:59,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:54:59,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:54:59,092 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 01:54:59,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 01:54:59,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 01:54:59,266 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 01:54:59,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 01:54:59,505 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 01:54:59,506 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 01:54:59,507 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 01:54:59,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 01:54:59,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:54:59,713 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:54:59,886 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 01:54:59,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 01:54:59 BoogieIcfgContainer [2024-10-13 01:54:59,891 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 01:54:59,891 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 01:54:59,891 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 01:54:59,891 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 01:54:59,892 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:54:54" (3/4) ... [2024-10-13 01:54:59,893 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 01:54:59,894 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 01:54:59,894 INFO L158 Benchmark]: Toolchain (without parser) took 6660.82ms. Allocated memory was 169.9MB in the beginning and 257.9MB in the end (delta: 88.1MB). Free memory was 138.6MB in the beginning and 78.4MB in the end (delta: 60.2MB). Peak memory consumption was 147.9MB. Max. memory is 16.1GB. [2024-10-13 01:54:59,895 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 130.0MB. Free memory was 91.0MB in the beginning and 90.8MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 01:54:59,895 INFO L158 Benchmark]: CACSL2BoogieTranslator took 403.11ms. Allocated memory is still 169.9MB. Free memory was 138.6MB in the beginning and 121.2MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 01:54:59,895 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.92ms. Allocated memory is still 169.9MB. Free memory was 121.2MB in the beginning and 117.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 01:54:59,895 INFO L158 Benchmark]: Boogie Preprocessor took 83.49ms. Allocated memory is still 169.9MB. Free memory was 117.0MB in the beginning and 112.0MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 01:54:59,896 INFO L158 Benchmark]: RCFGBuilder took 786.83ms. Allocated memory is still 169.9MB. Free memory was 112.0MB in the beginning and 128.8MB in the end (delta: -16.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-13 01:54:59,896 INFO L158 Benchmark]: TraceAbstraction took 5310.63ms. Allocated memory was 169.9MB in the beginning and 257.9MB in the end (delta: 88.1MB). Free memory was 127.7MB in the beginning and 79.4MB in the end (delta: 48.3MB). Peak memory consumption was 137.4MB. Max. memory is 16.1GB. [2024-10-13 01:54:59,896 INFO L158 Benchmark]: Witness Printer took 2.84ms. Allocated memory is still 257.9MB. Free memory was 79.4MB in the beginning and 78.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 01:54:59,898 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.15ms. Allocated memory is still 130.0MB. Free memory was 91.0MB in the beginning and 90.8MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 403.11ms. Allocated memory is still 169.9MB. Free memory was 138.6MB in the beginning and 121.2MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.92ms. Allocated memory is still 169.9MB. Free memory was 121.2MB in the beginning and 117.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.49ms. Allocated memory is still 169.9MB. Free memory was 117.0MB in the beginning and 112.0MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 786.83ms. Allocated memory is still 169.9MB. Free memory was 112.0MB in the beginning and 128.8MB in the end (delta: -16.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 5310.63ms. Allocated memory was 169.9MB in the beginning and 257.9MB in the end (delta: 88.1MB). Free memory was 127.7MB in the beginning and 79.4MB in the end (delta: 48.3MB). Peak memory consumption was 137.4MB. Max. memory is 16.1GB. * Witness Printer took 2.84ms. Allocated memory is still 257.9MB. Free memory was 79.4MB in the beginning and 78.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 204, overapproximation of someBinaryFLOATComparisonOperation at line 204. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 64; [L23] double var_1_6 = 31.5; [L24] double var_1_9 = 1000000000.25; [L25] float var_1_10 = 1.1; [L26] float var_1_11 = 8.75; [L27] float var_1_12 = 63.8; [L28] unsigned char var_1_13 = 1; [L29] float var_1_14 = 127.5; [L30] signed char var_1_15 = -2; [L31] signed char var_1_16 = 1; [L32] signed char var_1_17 = 1; [L33] signed char var_1_18 = 1; [L34] signed char var_1_19 = -2; [L35] signed char var_1_20 = 16; [L36] signed char var_1_21 = 2; [L37] signed char var_1_22 = 8; [L38] unsigned char var_1_23 = 0; [L39] unsigned char var_1_24 = 0; [L40] unsigned char var_1_25 = 0; [L41] unsigned char var_1_26 = 0; [L42] unsigned char var_1_27 = 32; [L43] unsigned char var_1_28 = 1; [L44] unsigned long int var_1_33 = 10; [L45] unsigned long int var_1_35 = 2632045268; [L46] signed long int var_1_36 = 32; [L47] unsigned long int var_1_37 = 128; [L48] unsigned long int var_1_39 = 1877460848; [L49] unsigned long int var_1_40 = 1831388024; [L50] unsigned long int var_1_41 = 1967003719; [L51] unsigned char var_1_42 = 0; [L52] unsigned char var_1_43 = 0; [L53] unsigned char var_1_45 = 0; [L54] unsigned char var_1_46 = 0; [L55] unsigned char var_1_47 = 1; [L56] unsigned char var_1_48 = 1; [L57] unsigned short int var_1_49 = 0; [L208] isInitial = 1 [L209] FCALL initially() [L210] COND TRUE 1 [L211] FCALL updateLastVariables() [L212] CALL updateVariables() [L140] var_1_9 = __VERIFIER_nondet_double() [L141] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L141] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L142] var_1_11 = __VERIFIER_nondet_float() [L143] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L143] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L144] var_1_13 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L145] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L146] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L146] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L147] var_1_14 = __VERIFIER_nondet_float() [L148] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L148] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L149] var_1_16 = __VERIFIER_nondet_char() [L150] CALL assume_abort_if_not(var_1_16 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L150] RET assume_abort_if_not(var_1_16 >= -1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L151] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L151] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L152] var_1_17 = __VERIFIER_nondet_char() [L153] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L153] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L154] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L154] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L155] var_1_19 = __VERIFIER_nondet_char() [L156] CALL assume_abort_if_not(var_1_19 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L156] RET assume_abort_if_not(var_1_19 >= -63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L157] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L157] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L158] var_1_20 = __VERIFIER_nondet_char() [L159] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L159] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L160] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L160] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L161] var_1_21 = __VERIFIER_nondet_char() [L162] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L162] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L163] CALL assume_abort_if_not(var_1_21 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L163] RET assume_abort_if_not(var_1_21 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L164] var_1_22 = __VERIFIER_nondet_char() [L165] CALL assume_abort_if_not(var_1_22 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L165] RET assume_abort_if_not(var_1_22 >= -63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L166] CALL assume_abort_if_not(var_1_22 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L166] RET assume_abort_if_not(var_1_22 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L167] var_1_24 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L168] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L169] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L169] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L170] var_1_25 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L171] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L172] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L172] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L173] var_1_26 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_26 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L174] RET assume_abort_if_not(var_1_26 >= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L175] CALL assume_abort_if_not(var_1_26 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L175] RET assume_abort_if_not(var_1_26 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L176] var_1_35 = __VERIFIER_nondet_ulong() [L177] CALL assume_abort_if_not(var_1_35 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L177] RET assume_abort_if_not(var_1_35 >= 2147483647) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L178] CALL assume_abort_if_not(var_1_35 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L178] RET assume_abort_if_not(var_1_35 <= 4294967294) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L179] var_1_39 = __VERIFIER_nondet_ulong() [L180] CALL assume_abort_if_not(var_1_39 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L180] RET assume_abort_if_not(var_1_39 >= 1073741823) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L181] CALL assume_abort_if_not(var_1_39 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L181] RET assume_abort_if_not(var_1_39 <= 2147483647) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L182] var_1_40 = __VERIFIER_nondet_ulong() [L183] CALL assume_abort_if_not(var_1_40 >= 1073741824) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L183] RET assume_abort_if_not(var_1_40 >= 1073741824) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L184] CALL assume_abort_if_not(var_1_40 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L184] RET assume_abort_if_not(var_1_40 <= 2147483647) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L185] var_1_41 = __VERIFIER_nondet_ulong() [L186] CALL assume_abort_if_not(var_1_41 >= 1073741824) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L186] RET assume_abort_if_not(var_1_41 >= 1073741824) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L187] CALL assume_abort_if_not(var_1_41 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L187] RET assume_abort_if_not(var_1_41 <= 2147483647) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L188] var_1_43 = __VERIFIER_nondet_uchar() [L189] CALL assume_abort_if_not(var_1_43 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L189] RET assume_abort_if_not(var_1_43 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L190] CALL assume_abort_if_not(var_1_43 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L190] RET assume_abort_if_not(var_1_43 <= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L191] var_1_45 = __VERIFIER_nondet_uchar() [L192] CALL assume_abort_if_not(var_1_45 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L192] RET assume_abort_if_not(var_1_45 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L193] CALL assume_abort_if_not(var_1_45 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L193] RET assume_abort_if_not(var_1_45 <= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L194] var_1_47 = __VERIFIER_nondet_uchar() [L195] CALL assume_abort_if_not(var_1_47 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L195] RET assume_abort_if_not(var_1_47 >= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L196] CALL assume_abort_if_not(var_1_47 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L196] RET assume_abort_if_not(var_1_47 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L197] var_1_48 = __VERIFIER_nondet_uchar() [L198] CALL assume_abort_if_not(var_1_48 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L198] RET assume_abort_if_not(var_1_48 >= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L199] CALL assume_abort_if_not(var_1_48 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L199] RET assume_abort_if_not(var_1_48 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L212] RET updateVariables() [L213] CALL step() [L61] var_1_15 = (var_1_16 - var_1_17) [L62] var_1_27 = var_1_21 [L63] unsigned char stepLocal_1 = var_1_27; [L64] unsigned char stepLocal_0 = var_1_27; VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L65] COND TRUE (var_1_27 + var_1_27) <= stepLocal_1 [L66] var_1_1 = (128 + var_1_27) VAL [isInitial=1, stepLocal_0=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L74] COND FALSE !(var_1_27 < (var_1_27 - var_1_27)) VAL [isInitial=1, stepLocal_0=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L77] unsigned char stepLocal_2 = var_1_27; VAL [isInitial=1, stepLocal_0=0, stepLocal_2=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L78] COND FALSE !(var_1_27 > stepLocal_2) [L81] var_1_10 = 9.75f VAL [isInitial=1, stepLocal_0=0, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L83] COND TRUE ((((var_1_27) < (var_1_27)) ? (var_1_27) : (var_1_27))) < 25u [L84] var_1_18 = (((((var_1_19) > ((var_1_20 - var_1_21))) ? (var_1_19) : ((var_1_20 - var_1_21)))) + (((((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) < 0 ) ? -((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) : ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))))) VAL [isInitial=1, stepLocal_0=0, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L86] signed long int stepLocal_5 = ~ var_1_21; VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L87] COND FALSE !(\read(var_1_13)) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L96] unsigned char stepLocal_4 = var_1_18 >= var_1_27; [L97] unsigned char stepLocal_3 = var_1_27; VAL [isInitial=1, stepLocal_0=0, stepLocal_3=0, stepLocal_4=1, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L98] COND FALSE !(var_1_23 && stepLocal_4) VAL [isInitial=1, stepLocal_0=0, stepLocal_3=0, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L101] COND TRUE 1 >= stepLocal_3 [L102] var_1_12 = var_1_11 VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L107] EXPR var_1_27 | (var_1_27 + var_1_27) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L107] COND FALSE !(var_1_27 < (var_1_27 | (var_1_27 + var_1_27))) [L110] EXPR var_1_27 >> var_1_27 VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L110] COND TRUE var_1_27 >= (var_1_27 >> var_1_27) [L111] COND FALSE !(var_1_23 || (var_1_27 < var_1_27)) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L115] COND FALSE !(var_1_27 > (var_1_27 / var_1_35)) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L118] COND TRUE 63.75f <= var_1_10 [L119] var_1_37 = ((var_1_39 + ((((var_1_40) > (var_1_41)) ? (var_1_40) : (var_1_41)))) - ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15)))) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=-2147483649, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L121] COND FALSE !(var_1_41 < ((((var_1_27) < (var_1_1)) ? (var_1_27) : (var_1_1)))) [L124] var_1_42 = (var_1_45 || var_1_43) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=-2147483649, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L126] COND FALSE !(\read(var_1_23)) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=-2147483649, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L133] COND FALSE !((var_1_39 - ((((-50) < 0 ) ? -(-50) : (-50)))) < var_1_18) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=-2147483649, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L213] RET step() [L214] CALL, EXPR property() [L204-L205] return (((((((((var_1_27 + var_1_27) <= var_1_27) ? (var_1_1 == ((signed short int) (128 + var_1_27))) : ((var_1_27 >= (var_1_27 * var_1_27)) ? (var_1_1 == ((signed short int) var_1_27)) : (var_1_1 == ((signed short int) 1)))) && ((var_1_27 < (var_1_27 - var_1_27)) ? (var_1_6 == ((double) var_1_9)) : 1)) && ((var_1_27 > var_1_27) ? (var_1_10 == ((float) (1.00000000000009E13f - var_1_11))) : (var_1_10 == ((float) 9.75f)))) && ((var_1_23 && (var_1_18 >= var_1_27)) ? (var_1_12 == ((float) var_1_11)) : ((1 >= var_1_27) ? (var_1_12 == ((float) var_1_11)) : (var_1_12 == ((float) var_1_14))))) && (var_1_15 == ((signed char) (var_1_16 - var_1_17)))) && ((((((var_1_27) < (var_1_27)) ? (var_1_27) : (var_1_27))) < 25u) ? (var_1_18 == ((signed char) (((((var_1_19) > ((var_1_20 - var_1_21))) ? (var_1_19) : ((var_1_20 - var_1_21)))) + (((((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) < 0 ) ? -((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) : ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))))))) : 1)) && (var_1_13 ? (((~ var_1_21) > var_1_27) ? (var_1_23 == ((unsigned char) (var_1_24 && (! var_1_25)))) : (var_1_24 ? (var_1_23 == ((unsigned char) ((! var_1_25) || var_1_26))) : 1)) : 1)) && (var_1_27 == ((unsigned char) var_1_21)) ; [L214] RET, EXPR property() [L214] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=-2147483649, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L19] reach_error() VAL [isInitial=1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=-2147483649, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 102 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 8, TraceHistogramMax: 39, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 683 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 683 mSDsluCounter, 2169 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 806 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 370 IncrementalHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 1363 mSDtfsCounter, 370 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 608 GetRequests, 601 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=390occurred in iteration=7, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 446 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 2164 NumberOfCodeBlocks, 2164 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1675 ConstructedInterpolants, 0 QuantifiedInterpolants, 1930 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 20748/20748 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 01:54:59,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-1.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 0feebc1024eac08439331e7773a7511b315939c469dc4e0ad2e111de10ff1692 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 01:55:02,150 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 01:55:02,232 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 01:55:02,241 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 01:55:02,241 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 01:55:02,272 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 01:55:02,273 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 01:55:02,273 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 01:55:02,274 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 01:55:02,274 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 01:55:02,275 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 01:55:02,275 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 01:55:02,276 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 01:55:02,277 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 01:55:02,278 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 01:55:02,278 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 01:55:02,279 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 01:55:02,279 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 01:55:02,279 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 01:55:02,282 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 01:55:02,282 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 01:55:02,282 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 01:55:02,283 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 01:55:02,283 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 01:55:02,284 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 01:55:02,284 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 01:55:02,284 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 01:55:02,284 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 01:55:02,285 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 01:55:02,285 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 01:55:02,285 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 01:55:02,286 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 01:55:02,286 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 01:55:02,286 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 01:55:02,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:55:02,287 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 01:55:02,287 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 01:55:02,287 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 01:55:02,287 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 01:55:02,288 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 01:55:02,288 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 01:55:02,289 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 01:55:02,289 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 01:55:02,290 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 01:55:02,290 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 01:55:02,290 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 -> 0feebc1024eac08439331e7773a7511b315939c469dc4e0ad2e111de10ff1692 [2024-10-13 01:55:02,625 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 01:55:02,647 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 01:55:02,650 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 01:55:02,651 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 01:55:02,652 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 01:55:02,653 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-1.i [2024-10-13 01:55:04,293 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 01:55:04,517 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 01:55:04,518 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-1.i [2024-10-13 01:55:04,533 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f35a98556/01564dd6e0a04a4a9bb53de6fc323b32/FLAGd1040ab11 [2024-10-13 01:55:04,545 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f35a98556/01564dd6e0a04a4a9bb53de6fc323b32 [2024-10-13 01:55:04,547 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 01:55:04,549 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 01:55:04,550 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 01:55:04,550 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 01:55:04,555 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 01:55:04,556 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:55:04" (1/1) ... [2024-10-13 01:55:04,557 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d3e6d6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:04, skipping insertion in model container [2024-10-13 01:55:04,557 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:55:04" (1/1) ... [2024-10-13 01:55:04,598 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 01:55:04,763 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-1.i[918,931] [2024-10-13 01:55:04,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:55:04,871 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 01:55:04,884 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-1.i[918,931] [2024-10-13 01:55:04,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:55:04,961 INFO L204 MainTranslator]: Completed translation [2024-10-13 01:55:04,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:04 WrapperNode [2024-10-13 01:55:04,962 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 01:55:04,963 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 01:55:04,964 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 01:55:04,964 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 01:55:04,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:04" (1/1) ... [2024-10-13 01:55:04,988 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:04" (1/1) ... [2024-10-13 01:55:05,035 INFO L138 Inliner]: procedures = 27, calls = 52, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 221 [2024-10-13 01:55:05,039 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 01:55:05,040 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 01:55:05,040 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 01:55:05,040 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 01:55:05,053 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:04" (1/1) ... [2024-10-13 01:55:05,054 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:04" (1/1) ... [2024-10-13 01:55:05,061 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:04" (1/1) ... [2024-10-13 01:55:05,088 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 01:55:05,088 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:04" (1/1) ... [2024-10-13 01:55:05,089 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:04" (1/1) ... [2024-10-13 01:55:05,105 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:04" (1/1) ... [2024-10-13 01:55:05,125 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:04" (1/1) ... [2024-10-13 01:55:05,132 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:04" (1/1) ... [2024-10-13 01:55:05,134 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:04" (1/1) ... [2024-10-13 01:55:05,141 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 01:55:05,142 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 01:55:05,142 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 01:55:05,142 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 01:55:05,144 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:04" (1/1) ... [2024-10-13 01:55:05,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:55:05,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:55:05,180 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 01:55:05,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 01:55:05,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 01:55:05,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 01:55:05,234 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 01:55:05,234 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 01:55:05,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 01:55:05,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 01:55:05,351 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 01:55:05,353 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 01:55:05,859 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-13 01:55:05,860 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 01:55:05,911 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 01:55:05,912 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 01:55:05,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:55:05 BoogieIcfgContainer [2024-10-13 01:55:05,912 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 01:55:05,914 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 01:55:05,914 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 01:55:05,918 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 01:55:05,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:55:04" (1/3) ... [2024-10-13 01:55:05,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c91b619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:55:05, skipping insertion in model container [2024-10-13 01:55:05,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:04" (2/3) ... [2024-10-13 01:55:05,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c91b619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:55:05, skipping insertion in model container [2024-10-13 01:55:05,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:55:05" (3/3) ... [2024-10-13 01:55:05,922 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-1.i [2024-10-13 01:55:05,938 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 01:55:05,939 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 01:55:06,013 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 01:55:06,019 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;@2e6b7b89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 01:55:06,020 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 01:55:06,027 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 56 states have internal predecessors, (81), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-13 01:55:06,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-10-13 01:55:06,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:55:06,046 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:55:06,046 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:55:06,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:55:06,053 INFO L85 PathProgramCache]: Analyzing trace with hash 900574527, now seen corresponding path program 1 times [2024-10-13 01:55:06,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:55:06,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1050818985] [2024-10-13 01:55:06,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:55:06,066 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:55:06,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:55:06,068 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 01:55:06,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 01:55:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:06,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 01:55:06,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:55:06,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1120 proven. 0 refuted. 0 times theorem prover too weak. 1844 trivial. 0 not checked. [2024-10-13 01:55:06,553 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 01:55:06,554 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:55:06,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1050818985] [2024-10-13 01:55:06,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1050818985] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:55:06,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:55:06,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 01:55:06,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490565884] [2024-10-13 01:55:06,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:55:06,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 01:55:06,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:55:06,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 01:55:06,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:55:06,592 INFO L87 Difference]: Start difference. First operand has 97 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 56 states have internal predecessors, (81), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-10-13 01:55:06,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:55:06,677 INFO L93 Difference]: Finished difference Result 191 states and 355 transitions. [2024-10-13 01:55:06,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 01:55:06,681 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 237 [2024-10-13 01:55:06,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:55:06,691 INFO L225 Difference]: With dead ends: 191 [2024-10-13 01:55:06,692 INFO L226 Difference]: Without dead ends: 95 [2024-10-13 01:55:06,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:55:06,703 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 01:55:06,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 01:55:06,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-13 01:55:06,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-13 01:55:06,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-13 01:55:06,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 152 transitions. [2024-10-13 01:55:06,776 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 152 transitions. Word has length 237 [2024-10-13 01:55:06,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:55:06,777 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 152 transitions. [2024-10-13 01:55:06,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-10-13 01:55:06,777 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 152 transitions. [2024-10-13 01:55:06,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-10-13 01:55:06,782 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:55:06,783 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:55:06,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 01:55:06,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:55:06,984 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:55:06,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:55:06,985 INFO L85 PathProgramCache]: Analyzing trace with hash 514047953, now seen corresponding path program 1 times [2024-10-13 01:55:06,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:55:06,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1685823012] [2024-10-13 01:55:06,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:55:06,987 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:55:06,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:55:06,989 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 01:55:06,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 01:55:07,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:07,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 01:55:07,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:55:08,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1391 proven. 144 refuted. 0 times theorem prover too weak. 1429 trivial. 0 not checked. [2024-10-13 01:55:08,147 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:55:08,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-13 01:55:08,384 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:55:08,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1685823012] [2024-10-13 01:55:08,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1685823012] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 01:55:08,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 01:55:08,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2024-10-13 01:55:08,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113772075] [2024-10-13 01:55:08,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:55:08,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 01:55:08,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:55:08,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 01:55:08,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-13 01:55:08,392 INFO L87 Difference]: Start difference. First operand 95 states and 152 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 01:55:08,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:55:08,608 INFO L93 Difference]: Finished difference Result 200 states and 323 transitions. [2024-10-13 01:55:08,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 01:55:08,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 238 [2024-10-13 01:55:08,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:55:08,614 INFO L225 Difference]: With dead ends: 200 [2024-10-13 01:55:08,614 INFO L226 Difference]: Without dead ends: 106 [2024-10-13 01:55:08,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 465 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-13 01:55:08,616 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 19 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 01:55:08,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 277 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 01:55:08,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-13 01:55:08,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 95. [2024-10-13 01:55:08,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-13 01:55:08,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 151 transitions. [2024-10-13 01:55:08,640 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 151 transitions. Word has length 238 [2024-10-13 01:55:08,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:55:08,644 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 151 transitions. [2024-10-13 01:55:08,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 01:55:08,645 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 151 transitions. [2024-10-13 01:55:08,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-10-13 01:55:08,652 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:55:08,652 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:55:08,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-13 01:55:08,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:55:08,854 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:55:08,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:55:08,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1074299949, now seen corresponding path program 1 times [2024-10-13 01:55:08,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:55:08,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [713571929] [2024-10-13 01:55:08,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:55:08,856 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:55:08,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:55:08,859 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 01:55:08,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 01:55:09,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:09,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 01:55:09,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:55:09,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-13 01:55:09,485 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 01:55:09,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:55:09,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [713571929] [2024-10-13 01:55:09,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [713571929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:55:09,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:55:09,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 01:55:09,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027379723] [2024-10-13 01:55:09,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:55:09,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 01:55:09,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:55:09,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 01:55:09,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:55:09,492 INFO L87 Difference]: Start difference. First operand 95 states and 151 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 01:55:09,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:55:09,582 INFO L93 Difference]: Finished difference Result 281 states and 447 transitions. [2024-10-13 01:55:09,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 01:55:09,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 238 [2024-10-13 01:55:09,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:55:09,586 INFO L225 Difference]: With dead ends: 281 [2024-10-13 01:55:09,586 INFO L226 Difference]: Without dead ends: 187 [2024-10-13 01:55:09,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 236 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-10-13 01:55:09,588 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 27 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 01:55:09,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 279 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 01:55:09,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-10-13 01:55:09,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2024-10-13 01:55:09,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 104 states have (on average 1.3076923076923077) internal successors, (136), 104 states have internal predecessors, (136), 78 states have call successors, (78), 2 states have call predecessors, (78), 2 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-13 01:55:09,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 292 transitions. [2024-10-13 01:55:09,628 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 292 transitions. Word has length 238 [2024-10-13 01:55:09,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:55:09,629 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 292 transitions. [2024-10-13 01:55:09,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 01:55:09,629 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 292 transitions. [2024-10-13 01:55:09,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-10-13 01:55:09,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:55:09,633 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:55:09,646 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-10-13 01:55:09,833 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-10-13 01:55:09,834 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:55:09,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:55:09,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1240094308, now seen corresponding path program 1 times [2024-10-13 01:55:09,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:55:09,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [933063978] [2024-10-13 01:55:09,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:55:09,836 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:55:09,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:55:09,839 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-10-13 01:55:09,841 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-10-13 01:55:10,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:10,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 01:55:10,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:55:10,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1391 proven. 144 refuted. 0 times theorem prover too weak. 1429 trivial. 0 not checked. [2024-10-13 01:55:10,778 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:55:11,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-13 01:55:11,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:55:11,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [933063978] [2024-10-13 01:55:11,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [933063978] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 01:55:11,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 01:55:11,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 14 [2024-10-13 01:55:11,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020917998] [2024-10-13 01:55:11,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:55:11,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 01:55:11,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:55:11,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 01:55:11,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-10-13 01:55:11,156 INFO L87 Difference]: Start difference. First operand 185 states and 292 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 01:55:11,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:55:11,929 INFO L93 Difference]: Finished difference Result 726 states and 1149 transitions. [2024-10-13 01:55:11,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 01:55:11,930 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 239 [2024-10-13 01:55:11,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:55:11,938 INFO L225 Difference]: With dead ends: 726 [2024-10-13 01:55:11,938 INFO L226 Difference]: Without dead ends: 542 [2024-10-13 01:55:11,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 463 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-10-13 01:55:11,940 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 373 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 01:55:11,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 441 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 01:55:11,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2024-10-13 01:55:11,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 220. [2024-10-13 01:55:11,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 139 states have (on average 1.3381294964028776) internal successors, (186), 139 states have internal predecessors, (186), 78 states have call successors, (78), 2 states have call predecessors, (78), 2 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-13 01:55:11,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 342 transitions. [2024-10-13 01:55:11,995 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 342 transitions. Word has length 239 [2024-10-13 01:55:11,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:55:11,996 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 342 transitions. [2024-10-13 01:55:11,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 01:55:11,997 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 342 transitions. [2024-10-13 01:55:11,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-10-13 01:55:11,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:55:11,999 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:55:12,011 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-10-13 01:55:12,200 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-10-13 01:55:12,200 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:55:12,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:55:12,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1348376356, now seen corresponding path program 1 times [2024-10-13 01:55:12,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:55:12,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1317995798] [2024-10-13 01:55:12,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:55:12,202 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:55:12,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:55:12,205 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-10-13 01:55:12,206 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-10-13 01:55:12,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:12,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 01:55:12,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:55:12,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-13 01:55:12,544 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 01:55:12,544 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:55:12,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1317995798] [2024-10-13 01:55:12,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1317995798] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:55:12,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:55:12,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 01:55:12,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119013210] [2024-10-13 01:55:12,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:55:12,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 01:55:12,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:55:12,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 01:55:12,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:55:12,546 INFO L87 Difference]: Start difference. First operand 220 states and 342 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, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 01:55:12,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:55:12,649 INFO L93 Difference]: Finished difference Result 512 states and 796 transitions. [2024-10-13 01:55:12,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 01:55:12,649 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, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 239 [2024-10-13 01:55:12,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:55:12,652 INFO L225 Difference]: With dead ends: 512 [2024-10-13 01:55:12,654 INFO L226 Difference]: Without dead ends: 293 [2024-10-13 01:55:12,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 237 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-10-13 01:55:12,659 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 138 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 01:55:12,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 356 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 01:55:12,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-10-13 01:55:12,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 220. [2024-10-13 01:55:12,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 139 states have (on average 1.316546762589928) internal successors, (183), 139 states have internal predecessors, (183), 78 states have call successors, (78), 2 states have call predecessors, (78), 2 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-13 01:55:12,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 339 transitions. [2024-10-13 01:55:12,688 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 339 transitions. Word has length 239 [2024-10-13 01:55:12,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:55:12,691 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 339 transitions. [2024-10-13 01:55:12,691 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, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 01:55:12,691 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 339 transitions. [2024-10-13 01:55:12,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-10-13 01:55:12,693 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:55:12,693 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:55:12,706 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-10-13 01:55:12,893 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-10-13 01:55:12,894 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:55:12,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:55:12,895 INFO L85 PathProgramCache]: Analyzing trace with hash 426631006, now seen corresponding path program 1 times [2024-10-13 01:55:12,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:55:12,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [194667699] [2024-10-13 01:55:12,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:55:12,895 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:55:12,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:55:12,896 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-10-13 01:55:12,897 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-10-13 01:55:13,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:13,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 01:55:13,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:55:13,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1975 proven. 117 refuted. 0 times theorem prover too weak. 872 trivial. 0 not checked. [2024-10-13 01:55:13,859 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:55:14,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2024-10-13 01:55:14,363 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:55:14,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [194667699] [2024-10-13 01:55:14,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [194667699] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 01:55:14,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 01:55:14,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7] total 18 [2024-10-13 01:55:14,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925882910] [2024-10-13 01:55:14,364 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 01:55:14,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-13 01:55:14,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:55:14,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 01:55:14,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2024-10-13 01:55:14,366 INFO L87 Difference]: Start difference. First operand 220 states and 339 transitions. Second operand has 18 states, 18 states have (on average 5.222222222222222) internal successors, (94), 17 states have internal predecessors, (94), 5 states have call successors, (64), 4 states have call predecessors, (64), 7 states have return successors, (65), 5 states have call predecessors, (65), 5 states have call successors, (65) [2024-10-13 01:55:15,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:55:15,951 INFO L93 Difference]: Finished difference Result 646 states and 956 transitions. [2024-10-13 01:55:15,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-13 01:55:15,952 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.222222222222222) internal successors, (94), 17 states have internal predecessors, (94), 5 states have call successors, (64), 4 states have call predecessors, (64), 7 states have return successors, (65), 5 states have call predecessors, (65), 5 states have call successors, (65) Word has length 239 [2024-10-13 01:55:15,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:55:15,955 INFO L225 Difference]: With dead ends: 646 [2024-10-13 01:55:15,956 INFO L226 Difference]: Without dead ends: 427 [2024-10-13 01:55:15,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 462 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=360, Invalid=830, Unknown=0, NotChecked=0, Total=1190 [2024-10-13 01:55:15,960 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 299 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 01:55:15,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 365 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 01:55:15,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-10-13 01:55:16,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 252. [2024-10-13 01:55:16,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 163 states have (on average 1.2515337423312884) internal successors, (204), 163 states have internal predecessors, (204), 78 states have call successors, (78), 10 states have call predecessors, (78), 10 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-13 01:55:16,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 360 transitions. [2024-10-13 01:55:16,018 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 360 transitions. Word has length 239 [2024-10-13 01:55:16,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:55:16,018 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 360 transitions. [2024-10-13 01:55:16,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.222222222222222) internal successors, (94), 17 states have internal predecessors, (94), 5 states have call successors, (64), 4 states have call predecessors, (64), 7 states have return successors, (65), 5 states have call predecessors, (65), 5 states have call successors, (65) [2024-10-13 01:55:16,019 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 360 transitions. [2024-10-13 01:55:16,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-10-13 01:55:16,022 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:55:16,022 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:55:16,034 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 (7)] Forceful destruction successful, exit code 0 [2024-10-13 01:55:16,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:55:16,223 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:55:16,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:55:16,224 INFO L85 PathProgramCache]: Analyzing trace with hash 483889308, now seen corresponding path program 1 times [2024-10-13 01:55:16,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:55:16,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1627116711] [2024-10-13 01:55:16,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:55:16,225 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:55:16,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:55:16,226 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 01:55:16,227 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 (8)] Waiting until timeout for monitored process [2024-10-13 01:55:16,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:55:16,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-13 01:55:16,449 INFO L278 TraceCheckSpWp]: Computing forward predicates...