./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-55.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-55.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 0961957eaafd8770638c6edb9922811bdb07ef81189d8eaab330413cde091f0c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:27:17,406 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:27:17,450 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 08:27:17,453 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:27:17,453 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:27:17,469 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:27:17,470 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:27:17,470 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:27:17,471 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:27:17,471 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:27:17,471 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:27:17,472 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:27:17,472 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:27:17,473 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:27:17,473 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:27:17,473 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:27:17,473 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:27:17,474 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:27:17,474 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 08:27:17,474 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:27:17,475 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:27:17,475 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:27:17,475 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:27:17,476 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:27:17,476 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:27:17,476 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:27:17,476 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:27:17,477 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:27:17,477 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:27:17,477 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:27:17,478 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:27:17,478 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:27:17,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:27:17,479 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:27:17,479 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:27:17,479 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:27:17,479 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 08:27:17,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 08:27:17,480 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:27:17,480 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:27:17,480 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:27:17,481 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:27:17,481 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-clean/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-clean/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 -> 0961957eaafd8770638c6edb9922811bdb07ef81189d8eaab330413cde091f0c [2024-10-11 08:27:17,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:27:17,714 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:27:17,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:27:17,719 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:27:17,719 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:27:17,720 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-55.i [2024-10-11 08:27:19,138 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:27:19,300 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:27:19,301 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-55.i [2024-10-11 08:27:19,313 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/61d8840c4/19f9f675d7b44a41a525ef744fb12a05/FLAG141c57fb4 [2024-10-11 08:27:19,327 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/61d8840c4/19f9f675d7b44a41a525ef744fb12a05 [2024-10-11 08:27:19,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:27:19,331 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:27:19,331 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:27:19,332 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:27:19,336 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:27:19,337 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:27:19" (1/1) ... [2024-10-11 08:27:19,338 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72741513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:19, skipping insertion in model container [2024-10-11 08:27:19,338 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:27:19" (1/1) ... [2024-10-11 08:27:19,360 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:27:19,523 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-55.i[915,928] [2024-10-11 08:27:19,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:27:19,638 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:27:19,647 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-55.i[915,928] [2024-10-11 08:27:19,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:27:19,703 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:27:19,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:19 WrapperNode [2024-10-11 08:27:19,703 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:27:19,704 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:27:19,705 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:27:19,705 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:27:19,710 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:19" (1/1) ... [2024-10-11 08:27:19,724 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:19" (1/1) ... [2024-10-11 08:27:19,756 INFO L138 Inliner]: procedures = 26, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 232 [2024-10-11 08:27:19,757 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:27:19,757 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:27:19,758 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:27:19,758 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:27:19,770 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:19" (1/1) ... [2024-10-11 08:27:19,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:19" (1/1) ... [2024-10-11 08:27:19,774 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:19" (1/1) ... [2024-10-11 08:27:19,800 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-11 08:27:19,800 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:19" (1/1) ... [2024-10-11 08:27:19,800 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:19" (1/1) ... [2024-10-11 08:27:19,811 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:19" (1/1) ... [2024-10-11 08:27:19,815 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:19" (1/1) ... [2024-10-11 08:27:19,816 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:19" (1/1) ... [2024-10-11 08:27:19,818 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:19" (1/1) ... [2024-10-11 08:27:19,824 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:27:19,825 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:27:19,825 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:27:19,825 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:27:19,828 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:19" (1/1) ... [2024-10-11 08:27:19,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:27:19,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:27:19,863 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 08:27:19,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 08:27:19,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:27:19,932 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:27:19,932 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:27:19,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 08:27:19,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:27:19,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:27:20,014 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:27:20,017 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:27:20,321 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 08:27:20,321 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:27:20,353 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:27:20,354 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:27:20,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:27:20 BoogieIcfgContainer [2024-10-11 08:27:20,354 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:27:20,356 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:27:20,356 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:27:20,360 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:27:20,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:27:19" (1/3) ... [2024-10-11 08:27:20,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9f6e90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:27:20, skipping insertion in model container [2024-10-11 08:27:20,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:19" (2/3) ... [2024-10-11 08:27:20,362 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9f6e90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:27:20, skipping insertion in model container [2024-10-11 08:27:20,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:27:20" (3/3) ... [2024-10-11 08:27:20,363 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-55.i [2024-10-11 08:27:20,379 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:27:20,379 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:27:20,439 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:27:20,445 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;@7bfeb157, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:27:20,445 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:27:20,450 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 51 states have (on average 1.411764705882353) internal successors, (72), 52 states have internal predecessors, (72), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 08:27:20,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-10-11 08:27:20,462 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:27:20,464 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:27:20,464 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:27:20,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:27:20,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1565673265, now seen corresponding path program 1 times [2024-10-11 08:27:20,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:27:20,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746914228] [2024-10-11 08:27:20,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:27:20,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:27:20,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:20,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:27:20,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:20,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 08:27:20,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:20,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 08:27:20,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:20,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 08:27:20,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:20,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:27:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:20,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 08:27:20,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:20,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:27:20,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:20,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 08:27:20,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:20,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:27:20,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:20,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 08:27:20,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:20,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:27:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:20,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 08:27:20,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:20,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:27:20,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:20,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 08:27:20,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:20,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:27:20,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:20,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 08:27:20,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:20,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:27:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:20,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 08:27:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:20,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:27:20,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:20,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:27:20,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:20,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:27:20,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:20,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 08:27:20,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:20,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 08:27:20,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:20,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 08:27:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:20,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 08:27:20,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:20,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 08:27:20,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:20,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 08:27:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:20,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 08:27:20,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:20,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 08:27:20,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:20,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 08:27:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:20,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 08:27:20,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:20,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 08:27:20,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:20,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 08:27:20,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:20,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 08:27:20,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:20,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-11 08:27:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:20,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 08:27:20,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:20,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-11 08:27:20,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:20,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-11 08:27:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:20,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-11 08:27:20,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:20,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-11 08:27:20,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:20,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-10-11 08:27:20,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:27:20,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746914228] [2024-10-11 08:27:20,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746914228] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:27:20,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:27:20,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 08:27:21,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968917467] [2024-10-11 08:27:21,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:27:21,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 08:27:21,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:27:21,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 08:27:21,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:27:21,034 INFO L87 Difference]: Start difference. First operand has 94 states, 51 states have (on average 1.411764705882353) internal successors, (72), 52 states have internal predecessors, (72), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) [2024-10-11 08:27:21,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:27:21,083 INFO L93 Difference]: Finished difference Result 185 states and 342 transitions. [2024-10-11 08:27:21,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 08:27:21,086 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) Word has length 239 [2024-10-11 08:27:21,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:27:21,092 INFO L225 Difference]: With dead ends: 185 [2024-10-11 08:27:21,093 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 08:27:21,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 122 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-11 08:27:21,101 INFO L432 NwaCegarLoop]: 143 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, 143 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-11 08:27:21,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:27:21,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 08:27:21,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-11 08:27:21,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 50 states have (on average 1.32) internal successors, (66), 50 states have internal predecessors, (66), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 08:27:21,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 146 transitions. [2024-10-11 08:27:21,156 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 146 transitions. Word has length 239 [2024-10-11 08:27:21,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:27:21,157 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 146 transitions. [2024-10-11 08:27:21,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) [2024-10-11 08:27:21,157 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 146 transitions. [2024-10-11 08:27:21,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-10-11 08:27:21,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:27:21,162 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:27:21,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 08:27:21,162 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:27:21,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:27:21,163 INFO L85 PathProgramCache]: Analyzing trace with hash 16943989, now seen corresponding path program 1 times [2024-10-11 08:27:21,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:27:21,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540402564] [2024-10-11 08:27:21,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:27:21,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:27:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:27:21,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 08:27:21,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 08:27:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 08:27:21,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:27:21,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 08:27:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:27:21,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 08:27:21,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:27:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 08:27:21,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:27:21,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 08:27:21,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:27:21,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 08:27:21,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:27:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 08:27:21,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:27:21,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 08:27:21,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:27:21,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:27:21,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:27:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 08:27:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 08:27:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 08:27:21,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 08:27:21,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 08:27:21,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 08:27:21,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 08:27:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 08:27:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 08:27:21,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 08:27:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 08:27:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 08:27:21,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 08:27:21,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-11 08:27:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 08:27:21,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-11 08:27:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-11 08:27:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-11 08:27:21,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-11 08:27:21,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-10-11 08:27:21,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:27:21,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540402564] [2024-10-11 08:27:21,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540402564] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:27:21,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:27:21,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:27:21,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702925811] [2024-10-11 08:27:21,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:27:21,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:27:21,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:27:21,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:27:21,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:27:21,512 INFO L87 Difference]: Start difference. First operand 92 states and 146 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 08:27:21,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:27:21,599 INFO L93 Difference]: Finished difference Result 256 states and 405 transitions. [2024-10-11 08:27:21,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:27:21,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 239 [2024-10-11 08:27:21,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:27:21,603 INFO L225 Difference]: With dead ends: 256 [2024-10-11 08:27:21,603 INFO L226 Difference]: Without dead ends: 165 [2024-10-11 08:27:21,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 82 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-11 08:27:21,604 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 111 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:27:21,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 353 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 08:27:21,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-11 08:27:21,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 162. [2024-10-11 08:27:21,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 86 states have (on average 1.2906976744186047) internal successors, (111), 87 states have internal predecessors, (111), 73 states have call successors, (73), 2 states have call predecessors, (73), 2 states have return successors, (73), 72 states have call predecessors, (73), 73 states have call successors, (73) [2024-10-11 08:27:21,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 257 transitions. [2024-10-11 08:27:21,647 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 257 transitions. Word has length 239 [2024-10-11 08:27:21,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:27:21,648 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 257 transitions. [2024-10-11 08:27:21,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 08:27:21,649 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 257 transitions. [2024-10-11 08:27:21,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-10-11 08:27:21,652 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:27:21,655 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:27:21,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 08:27:21,655 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:27:21,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:27:21,655 INFO L85 PathProgramCache]: Analyzing trace with hash 718008567, now seen corresponding path program 1 times [2024-10-11 08:27:21,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:27:21,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047438602] [2024-10-11 08:27:21,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:27:21,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:27:21,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:27:21,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 08:27:21,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 08:27:21,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 08:27:21,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:27:21,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 08:27:21,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:27:21,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 08:27:21,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:27:21,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 08:27:21,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:27:21,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 08:27:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:27:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 08:27:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:27:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 08:27:21,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:27:21,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 08:27:21,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:27:21,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:27:21,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:27:21,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 08:27:21,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 08:27:21,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 08:27:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 08:27:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 08:27:21,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 08:27:21,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 08:27:21,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 08:27:21,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 08:27:21,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 08:27:21,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 08:27:21,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 08:27:21,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 08:27:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-11 08:27:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 08:27:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-11 08:27:21,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-11 08:27:21,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-11 08:27:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-11 08:27:21,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,984 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-10-11 08:27:21,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:27:21,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047438602] [2024-10-11 08:27:21,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047438602] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:27:21,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:27:21,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:27:21,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993680773] [2024-10-11 08:27:21,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:27:21,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:27:21,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:27:21,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:27:21,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:27:21,988 INFO L87 Difference]: Start difference. First operand 162 states and 257 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 08:27:22,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:27:22,189 INFO L93 Difference]: Finished difference Result 331 states and 520 transitions. [2024-10-11 08:27:22,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:27:22,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 239 [2024-10-11 08:27:22,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:27:22,195 INFO L225 Difference]: With dead ends: 331 [2024-10-11 08:27:22,195 INFO L226 Difference]: Without dead ends: 170 [2024-10-11 08:27:22,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:27:22,201 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 115 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:27:22,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 322 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 08:27:22,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-11 08:27:22,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 99. [2024-10-11 08:27:22,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 56 states have internal predecessors, (71), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 08:27:22,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 151 transitions. [2024-10-11 08:27:22,233 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 151 transitions. Word has length 239 [2024-10-11 08:27:22,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:27:22,235 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 151 transitions. [2024-10-11 08:27:22,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 08:27:22,236 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 151 transitions. [2024-10-11 08:27:22,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-10-11 08:27:22,239 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:27:22,240 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:27:22,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 08:27:22,240 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:27:22,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:27:22,243 INFO L85 PathProgramCache]: Analyzing trace with hash 2084176197, now seen corresponding path program 1 times [2024-10-11 08:27:22,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:27:22,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076463055] [2024-10-11 08:27:22,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:27:22,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:27:22,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:22,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:27:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:22,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 08:27:22,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:22,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 08:27:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:22,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 08:27:22,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:22,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:27:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:22,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 08:27:22,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:22,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:27:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:22,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 08:27:22,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:22,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:27:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:22,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 08:27:22,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:22,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:27:22,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:22,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 08:27:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:22,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:27:22,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:22,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 08:27:22,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:22,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:27:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:22,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 08:27:22,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:22,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:27:22,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:22,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 08:27:22,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:22,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:27:22,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:22,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:27:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:22,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:27:22,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:22,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 08:27:22,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:22,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 08:27:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:22,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 08:27:22,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:22,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 08:27:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:22,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 08:27:22,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:22,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 08:27:22,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:22,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 08:27:22,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:22,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 08:27:22,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:22,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 08:27:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:22,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 08:27:22,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:22,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 08:27:22,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:22,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 08:27:22,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:22,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 08:27:22,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:22,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-11 08:27:22,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:22,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 08:27:22,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:22,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-11 08:27:22,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:22,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-11 08:27:22,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:22,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-11 08:27:22,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:22,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-11 08:27:22,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:22,577 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-10-11 08:27:22,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:27:22,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076463055] [2024-10-11 08:27:22,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076463055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:27:22,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:27:22,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:27:22,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980716472] [2024-10-11 08:27:22,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:27:22,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:27:22,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:27:22,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:27:22,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:27:22,579 INFO L87 Difference]: Start difference. First operand 99 states and 151 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 08:27:22,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:27:22,759 INFO L93 Difference]: Finished difference Result 268 states and 411 transitions. [2024-10-11 08:27:22,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:27:22,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 240 [2024-10-11 08:27:22,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:27:22,762 INFO L225 Difference]: With dead ends: 268 [2024-10-11 08:27:22,762 INFO L226 Difference]: Without dead ends: 170 [2024-10-11 08:27:22,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:27:22,763 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 108 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:27:22,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 326 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 08:27:22,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-11 08:27:22,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 167. [2024-10-11 08:27:22,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 92 states have (on average 1.2608695652173914) internal successors, (116), 93 states have internal predecessors, (116), 71 states have call successors, (71), 3 states have call predecessors, (71), 3 states have return successors, (71), 70 states have call predecessors, (71), 71 states have call successors, (71) [2024-10-11 08:27:22,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 258 transitions. [2024-10-11 08:27:22,801 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 258 transitions. Word has length 240 [2024-10-11 08:27:22,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:27:22,802 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 258 transitions. [2024-10-11 08:27:22,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 08:27:22,803 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 258 transitions. [2024-10-11 08:27:22,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-10-11 08:27:22,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:27:22,805 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:27:22,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 08:27:22,805 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:27:22,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:27:22,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1497370183, now seen corresponding path program 1 times [2024-10-11 08:27:22,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:27:22,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374480530] [2024-10-11 08:27:22,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:27:22,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:27:22,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:23,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:27:23,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:23,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 08:27:23,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:23,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 08:27:23,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:23,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 08:27:23,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:23,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:27:23,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:23,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 08:27:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:23,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:27:23,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:23,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 08:27:23,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:23,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:27:23,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:23,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 08:27:23,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:23,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:27:23,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:23,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 08:27:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:23,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:27:23,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:23,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 08:27:23,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:23,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:27:23,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:23,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 08:27:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:23,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:27:23,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:23,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 08:27:23,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:23,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:27:23,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:23,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:27:23,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:23,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:27:23,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:23,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 08:27:23,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:23,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 08:27:23,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:23,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 08:27:23,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:23,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 08:27:23,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:23,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 08:27:23,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:23,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 08:27:23,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:23,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 08:27:23,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:23,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 08:27:23,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:23,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 08:27:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:23,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 08:27:23,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:23,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 08:27:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:23,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 08:27:23,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:23,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 08:27:23,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:23,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-11 08:27:23,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:23,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 08:27:23,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:23,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-11 08:27:23,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:23,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-11 08:27:23,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:23,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-11 08:27:23,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:23,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-11 08:27:23,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:23,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 78 proven. 39 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2024-10-11 08:27:23,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:27:23,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374480530] [2024-10-11 08:27:23,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374480530] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 08:27:23,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284995959] [2024-10-11 08:27:23,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:27:23,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:27:23,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:27:23,258 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 08:27:23,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 08:27:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:23,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 08:27:23,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:27:23,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1443 proven. 39 refuted. 0 times theorem prover too weak. 1638 trivial. 0 not checked. [2024-10-11 08:27:23,694 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:27:24,053 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 78 proven. 39 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2024-10-11 08:27:24,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284995959] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 08:27:24,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 08:27:24,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2024-10-11 08:27:24,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313252650] [2024-10-11 08:27:24,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 08:27:24,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 08:27:24,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:27:24,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 08:27:24,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 08:27:24,060 INFO L87 Difference]: Start difference. First operand 167 states and 258 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2024-10-11 08:27:24,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:27:24,480 INFO L93 Difference]: Finished difference Result 349 states and 529 transitions. [2024-10-11 08:27:24,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 08:27:24,481 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) Word has length 240 [2024-10-11 08:27:24,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:27:24,484 INFO L225 Difference]: With dead ends: 349 [2024-10-11 08:27:24,484 INFO L226 Difference]: Without dead ends: 183 [2024-10-11 08:27:24,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 555 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2024-10-11 08:27:24,487 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 201 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 08:27:24,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 208 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 08:27:24,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-11 08:27:24,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 175. [2024-10-11 08:27:24,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 99 states have internal predecessors, (118), 71 states have call successors, (71), 5 states have call predecessors, (71), 5 states have return successors, (71), 70 states have call predecessors, (71), 71 states have call successors, (71) [2024-10-11 08:27:24,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 260 transitions. [2024-10-11 08:27:24,550 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 260 transitions. Word has length 240 [2024-10-11 08:27:24,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:27:24,550 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 260 transitions. [2024-10-11 08:27:24,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2024-10-11 08:27:24,551 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 260 transitions. [2024-10-11 08:27:24,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-10-11 08:27:24,552 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:27:24,553 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:27:24,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 08:27:24,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:27:24,754 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:27:24,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:27:24,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1022589751, now seen corresponding path program 1 times [2024-10-11 08:27:24,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:27:24,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959369935] [2024-10-11 08:27:24,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:27:24,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:27:24,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:25,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:27:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:25,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 08:27:25,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:25,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 08:27:25,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:25,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 08:27:25,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:25,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:27:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:25,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 08:27:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:25,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:27:25,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:25,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 08:27:25,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:25,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:27:25,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:25,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 08:27:25,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:25,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:27:25,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:25,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 08:27:25,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:25,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:27:25,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:25,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 08:27:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:25,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:27:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:25,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 08:27:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:25,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:27:25,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:25,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 08:27:25,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:25,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:27:25,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:25,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:27:25,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:25,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:27:25,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:25,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 08:27:25,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:25,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 08:27:25,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:25,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 08:27:25,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:25,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 08:27:25,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:25,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 08:27:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:25,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 08:27:25,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:25,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 08:27:25,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:25,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 08:27:25,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:25,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 08:27:25,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:25,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 08:27:25,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:25,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 08:27:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:25,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 08:27:25,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:25,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 08:27:25,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:25,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-11 08:27:25,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:25,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 08:27:25,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:25,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-11 08:27:25,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:25,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-11 08:27:25,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:25,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-11 08:27:25,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:25,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-11 08:27:25,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:25,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-10-11 08:27:25,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:27:25,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959369935] [2024-10-11 08:27:25,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959369935] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:27:25,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:27:25,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:27:25,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230169315] [2024-10-11 08:27:25,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:27:25,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:27:25,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:27:25,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:27:25,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:27:25,295 INFO L87 Difference]: Start difference. First operand 175 states and 260 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 08:27:25,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:27:25,580 INFO L93 Difference]: Finished difference Result 399 states and 586 transitions. [2024-10-11 08:27:25,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:27:25,581 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 240 [2024-10-11 08:27:25,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:27:25,585 INFO L225 Difference]: With dead ends: 399 [2024-10-11 08:27:25,585 INFO L226 Difference]: Without dead ends: 225 [2024-10-11 08:27:25,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:27:25,586 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 104 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 08:27:25,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 326 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 08:27:25,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-10-11 08:27:25,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 224. [2024-10-11 08:27:25,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 122 states have (on average 1.1311475409836065) internal successors, (138), 124 states have internal predecessors, (138), 92 states have call successors, (92), 9 states have call predecessors, (92), 9 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2024-10-11 08:27:25,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 322 transitions. [2024-10-11 08:27:25,645 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 322 transitions. Word has length 240 [2024-10-11 08:27:25,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:27:25,645 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 322 transitions. [2024-10-11 08:27:25,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 08:27:25,645 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 322 transitions. [2024-10-11 08:27:25,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-10-11 08:27:25,648 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:27:25,648 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:27:25,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 08:27:25,649 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:27:25,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:27:25,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1020683127, now seen corresponding path program 1 times [2024-10-11 08:27:25,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:27:25,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161763000] [2024-10-11 08:27:25,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:27:25,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:27:25,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 08:27:25,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1795688211] [2024-10-11 08:27:25,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:27:25,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:27:25,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:27:25,754 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 08:27:25,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 08:27:25,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 08:27:25,882 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 08:27:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 08:27:26,144 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 08:27:26,144 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 08:27:26,145 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 08:27:26,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 08:27:26,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:27:26,354 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:27:26,461 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 08:27:26,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:27:26 BoogieIcfgContainer [2024-10-11 08:27:26,466 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 08:27:26,466 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 08:27:26,466 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 08:27:26,466 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 08:27:26,467 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:27:20" (3/4) ... [2024-10-11 08:27:26,468 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 08:27:26,469 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 08:27:26,470 INFO L158 Benchmark]: Toolchain (without parser) took 7139.04ms. Allocated memory was 197.1MB in the beginning and 377.5MB in the end (delta: 180.4MB). Free memory was 125.2MB in the beginning and 310.9MB in the end (delta: -185.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 08:27:26,470 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 197.1MB. Free memory is still 154.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 08:27:26,470 INFO L158 Benchmark]: CACSL2BoogieTranslator took 372.05ms. Allocated memory is still 197.1MB. Free memory was 125.0MB in the beginning and 160.4MB in the end (delta: -35.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 08:27:26,471 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.70ms. Allocated memory is still 197.1MB. Free memory was 160.4MB in the beginning and 157.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 08:27:26,471 INFO L158 Benchmark]: Boogie Preprocessor took 66.63ms. Allocated memory is still 197.1MB. Free memory was 157.3MB in the beginning and 152.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 08:27:26,472 INFO L158 Benchmark]: RCFGBuilder took 529.67ms. Allocated memory is still 197.1MB. Free memory was 152.1MB in the beginning and 121.6MB in the end (delta: 30.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-11 08:27:26,472 INFO L158 Benchmark]: TraceAbstraction took 6109.87ms. Allocated memory was 197.1MB in the beginning and 377.5MB in the end (delta: 180.4MB). Free memory was 120.7MB in the beginning and 310.9MB in the end (delta: -190.3MB). Peak memory consumption was 181.8MB. Max. memory is 16.1GB. [2024-10-11 08:27:26,472 INFO L158 Benchmark]: Witness Printer took 3.01ms. Allocated memory is still 377.5MB. Free memory is still 310.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 08:27:26,473 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 197.1MB. Free memory is still 154.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 372.05ms. Allocated memory is still 197.1MB. Free memory was 125.0MB in the beginning and 160.4MB in the end (delta: -35.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.70ms. Allocated memory is still 197.1MB. Free memory was 160.4MB in the beginning and 157.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.63ms. Allocated memory is still 197.1MB. Free memory was 157.3MB in the beginning and 152.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 529.67ms. Allocated memory is still 197.1MB. Free memory was 152.1MB in the beginning and 121.6MB in the end (delta: 30.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6109.87ms. Allocated memory was 197.1MB in the beginning and 377.5MB in the end (delta: 180.4MB). Free memory was 120.7MB in the beginning and 310.9MB in the end (delta: -190.3MB). Peak memory consumption was 181.8MB. Max. memory is 16.1GB. * Witness Printer took 3.01ms. Allocated memory is still 377.5MB. Free memory is still 310.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 185, overapproximation of someBinaryFLOATComparisonOperation at line 79. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 8.8; [L23] double var_1_6 = 127.5; [L24] double var_1_7 = 2.6; [L25] double var_1_8 = 4.5; [L26] signed short int var_1_9 = -128; [L27] signed short int var_1_10 = 16; [L28] signed short int var_1_11 = 4; [L29] signed short int var_1_12 = 100; [L30] signed short int var_1_13 = 64; [L31] signed short int var_1_14 = 2; [L32] signed long int var_1_15 = 5; [L33] signed char var_1_17 = -2; [L34] signed char var_1_18 = -4; [L35] signed char var_1_19 = 8; [L36] signed char var_1_20 = 10; [L37] unsigned long int var_1_21 = 25; [L38] unsigned long int var_1_22 = 3797799060; [L39] unsigned char var_1_23 = 1; [L40] unsigned char var_1_24 = 1; [L41] unsigned char var_1_25 = 0; [L42] unsigned char var_1_26 = 0; [L43] signed short int var_1_27 = -4; [L44] signed short int var_1_28 = 24644; [L45] signed char var_1_29 = 1; [L46] signed char var_1_30 = -1; [L47] unsigned char var_1_31 = 0; [L48] signed long int var_1_32 = -2; [L49] unsigned char var_1_33 = 8; [L50] unsigned char var_1_34 = 128; [L51] signed long int var_1_35 = 1000000000; [L52] float var_1_36 = 99.8; [L53] float var_1_37 = 16.25; [L54] unsigned char var_1_38 = 1; [L55] unsigned char var_1_39 = 0; [L56] unsigned char var_1_40 = 1; [L57] signed short int var_1_41 = 4; [L58] unsigned long int var_1_42 = 1; [L189] isInitial = 1 [L190] FCALL initially() [L191] COND TRUE 1 [L192] FCALL updateLastVariables() [L193] CALL updateVariables() [L119] var_1_6 = __VERIFIER_nondet_double() [L120] CALL assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_7=13/5, var_1_8=9/2, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_7=13/5, var_1_8=9/2, var_1_9=-128] [L120] RET assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_7=13/5, var_1_8=9/2, var_1_9=-128] [L121] var_1_7 = __VERIFIER_nondet_double() [L122] CALL assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_8=9/2, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_8=9/2, var_1_9=-128] [L122] RET assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_8=9/2, var_1_9=-128] [L123] var_1_8 = __VERIFIER_nondet_double() [L124] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L124] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L125] var_1_10 = __VERIFIER_nondet_short() [L126] CALL assume_abort_if_not(var_1_10 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L126] RET assume_abort_if_not(var_1_10 >= -1) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L127] CALL assume_abort_if_not(var_1_10 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L127] RET assume_abort_if_not(var_1_10 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L128] var_1_11 = __VERIFIER_nondet_short() [L129] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L129] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L130] CALL assume_abort_if_not(var_1_11 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L130] RET assume_abort_if_not(var_1_11 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L131] var_1_12 = __VERIFIER_nondet_short() [L132] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L132] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L133] CALL assume_abort_if_not(var_1_12 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L133] RET assume_abort_if_not(var_1_12 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L134] var_1_13 = __VERIFIER_nondet_short() [L135] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L135] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L136] CALL assume_abort_if_not(var_1_13 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L136] RET assume_abort_if_not(var_1_13 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L137] var_1_14 = __VERIFIER_nondet_short() [L138] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L138] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L139] CALL assume_abort_if_not(var_1_14 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L139] RET assume_abort_if_not(var_1_14 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L140] var_1_18 = __VERIFIER_nondet_char() [L141] CALL assume_abort_if_not(var_1_18 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L141] RET assume_abort_if_not(var_1_18 >= -63) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L142] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L142] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L143] var_1_19 = __VERIFIER_nondet_char() [L144] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L144] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L145] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L145] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L146] var_1_20 = __VERIFIER_nondet_char() [L147] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L147] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L148] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L148] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L149] var_1_22 = __VERIFIER_nondet_ulong() [L150] CALL assume_abort_if_not(var_1_22 >= 3221225470) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L150] RET assume_abort_if_not(var_1_22 >= 3221225470) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L151] CALL assume_abort_if_not(var_1_22 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L151] RET assume_abort_if_not(var_1_22 <= 4294967294) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L152] var_1_24 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L153] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L154] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L154] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L155] var_1_25 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_25 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L156] RET assume_abort_if_not(var_1_25 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L157] CALL assume_abort_if_not(var_1_25 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L157] RET assume_abort_if_not(var_1_25 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L158] var_1_26 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L159] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L160] CALL assume_abort_if_not(var_1_26 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L160] RET assume_abort_if_not(var_1_26 <= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L161] var_1_28 = __VERIFIER_nondet_short() [L162] CALL assume_abort_if_not(var_1_28 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L162] RET assume_abort_if_not(var_1_28 >= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L163] CALL assume_abort_if_not(var_1_28 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L163] RET assume_abort_if_not(var_1_28 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L164] var_1_30 = __VERIFIER_nondet_char() [L165] CALL assume_abort_if_not(var_1_30 >= -126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L165] RET assume_abort_if_not(var_1_30 >= -126) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L166] CALL assume_abort_if_not(var_1_30 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L166] RET assume_abort_if_not(var_1_30 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_33=8, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L167] var_1_33 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L168] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L169] CALL assume_abort_if_not(var_1_33 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L169] RET assume_abort_if_not(var_1_33 <= 255) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_34=128, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L170] var_1_34 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L171] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L172] CALL assume_abort_if_not(var_1_34 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L172] RET assume_abort_if_not(var_1_34 <= 255) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_35=1000000000, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L173] var_1_35 = __VERIFIER_nondet_long() [L174] CALL assume_abort_if_not(var_1_35 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_35=1, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_35=1, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L174] RET assume_abort_if_not(var_1_35 >= -2147483648) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_35=1, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L175] CALL assume_abort_if_not(var_1_35 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_35=1, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_35=1, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L175] RET assume_abort_if_not(var_1_35 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_35=1, var_1_36=499/5, var_1_37=65/4, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L176] var_1_37 = __VERIFIER_nondet_float() [L177] CALL assume_abort_if_not((var_1_37 >= -922337.2036854765600e+13F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854765600e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_35=1, var_1_36=499/5, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_35=1, var_1_36=499/5, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L177] RET assume_abort_if_not((var_1_37 >= -922337.2036854765600e+13F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854765600e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_35=1, var_1_36=499/5, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L178] var_1_39 = __VERIFIER_nondet_uchar() [L179] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_35=1, var_1_36=499/5, var_1_38=1, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_35=1, var_1_36=499/5, var_1_38=1, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L179] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_35=1, var_1_36=499/5, var_1_38=1, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L180] CALL assume_abort_if_not(var_1_39 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_35=1, var_1_36=499/5, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_35=1, var_1_36=499/5, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L180] RET assume_abort_if_not(var_1_39 <= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_35=1, var_1_36=499/5, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L193] RET updateVariables() [L194] CALL step() [L62] EXPR var_1_33 | var_1_34 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=499/5, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L62] COND FALSE !((var_1_33 | var_1_34) >= var_1_35) [L67] COND TRUE var_1_35 > var_1_34 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=499/5, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L68] COND FALSE !(var_1_33 > var_1_35) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=499/5, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=4, var_1_42=1, var_1_9=-128] [L72] var_1_38 = var_1_39 [L73] var_1_40 = var_1_39 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=499/5, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=4, var_1_42=1, var_1_9=-128] [L74] COND TRUE var_1_34 < var_1_35 [L75] var_1_41 = ((((var_1_34) < 0 ) ? -(var_1_34) : (var_1_34))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=499/5, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=1, var_1_9=-128] [L79] COND FALSE !(var_1_37 == var_1_36) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=499/5, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=1, var_1_9=-128] [L84] var_1_9 = (((((var_1_10 - var_1_11)) < (((var_1_12 + var_1_13) - var_1_14))) ? ((var_1_10 - var_1_11)) : (((var_1_12 + var_1_13) - var_1_14)))) [L85] var_1_17 = (var_1_18 + (var_1_19 - var_1_20)) [L86] var_1_29 = (((((var_1_30) < 0 ) ? -(var_1_30) : (var_1_30))) - var_1_20) [L87] var_1_31 = var_1_26 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-126, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=-62, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=499/5, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=1, var_1_9=0] [L88] COND FALSE !(var_1_17 <= (var_1_17 * (var_1_29 * var_1_29))) [L95] var_1_1 = var_1_7 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-126, var_1_18=-63, var_1_19=0, var_1_1=2, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=-62, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=499/5, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=1, var_1_7=2, var_1_9=0] [L97] COND FALSE !(\read(var_1_31)) [L100] var_1_23 = (var_1_24 && (var_1_25 && var_1_26)) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-126, var_1_18=-63, var_1_19=0, var_1_1=2, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=0, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=-62, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=499/5, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=1, var_1_7=2, var_1_9=0] [L102] COND FALSE !((- ((((var_1_1) < (var_1_8)) ? (var_1_1) : (var_1_8)))) >= -0.875) [L109] var_1_27 = ((((var_1_29) < (var_1_28)) ? (var_1_29) : (var_1_28))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-126, var_1_18=-63, var_1_19=0, var_1_1=2, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=0, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-62, var_1_28=16383, var_1_29=-62, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=499/5, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=1, var_1_7=2, var_1_9=0] [L111] COND FALSE !(\read(var_1_23)) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-126, var_1_18=-63, var_1_19=0, var_1_1=2, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=0, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-62, var_1_28=16383, var_1_29=-62, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=499/5, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=1, var_1_7=2, var_1_9=0] [L114] COND FALSE !(\read(var_1_23)) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-126, var_1_18=-63, var_1_19=0, var_1_1=2, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=0, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-62, var_1_28=16383, var_1_29=-62, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=499/5, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=1, var_1_7=2, var_1_9=0] [L194] RET step() [L195] CALL, EXPR property() [L185-L186] return (((((((((var_1_17 <= (var_1_17 * (var_1_29 * var_1_29))) ? ((var_1_29 > var_1_29) ? (var_1_1 == ((double) (((((var_1_6) < (var_1_7)) ? (var_1_6) : (var_1_7))) + var_1_8))) : (var_1_1 == ((double) var_1_8))) : (var_1_1 == ((double) var_1_7))) && (var_1_9 == ((signed short int) (((((var_1_10 - var_1_11)) < (((var_1_12 + var_1_13) - var_1_14))) ? ((var_1_10 - var_1_11)) : (((var_1_12 + var_1_13) - var_1_14))))))) && (var_1_23 ? (var_1_15 == ((signed long int) (var_1_14 - var_1_13))) : 1)) && (var_1_17 == ((signed char) (var_1_18 + (var_1_19 - var_1_20))))) && (var_1_23 ? (var_1_21 == ((unsigned long int) ((var_1_22 - (1000000000u - var_1_13)) - var_1_14))) : 1)) && (var_1_31 ? (var_1_23 == ((unsigned char) (var_1_24 && var_1_25))) : (var_1_23 == ((unsigned char) (var_1_24 && (var_1_25 && var_1_26)))))) && (((- ((((var_1_1) < (var_1_8)) ? (var_1_1) : (var_1_8)))) >= -0.875) ? (var_1_31 ? (var_1_27 == ((signed short int) (var_1_19 - var_1_12))) : (var_1_27 == ((signed short int) (var_1_13 - (var_1_28 - (var_1_20 + var_1_19)))))) : (var_1_27 == ((signed short int) ((((var_1_29) < (var_1_28)) ? (var_1_29) : (var_1_28))))))) && (var_1_29 == ((signed char) (((((var_1_30) < 0 ) ? -(var_1_30) : (var_1_30))) - var_1_20)))) && (var_1_31 == ((unsigned char) var_1_26)) ; [L195] RET, EXPR property() [L195] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-126, var_1_18=-63, var_1_19=0, var_1_1=2, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=0, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-62, var_1_28=16383, var_1_29=-62, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=499/5, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=1, var_1_7=2, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-126, var_1_18=-63, var_1_19=0, var_1_1=2, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=0, var_1_24=-255, var_1_25=-255, var_1_26=0, var_1_27=-62, var_1_28=16383, var_1_29=-62, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=499/5, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=1, var_1_7=2, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 7, TraceHistogramMax: 40, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 641 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 639 mSDsluCounter, 1678 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 743 mSDsCounter, 291 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 534 IncrementalHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 291 mSolverCounterUnsat, 935 mSDtfsCounter, 534 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1033 GetRequests, 1008 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=224occurred in iteration=6, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 86 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 2157 NumberOfCodeBlocks, 2157 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1909 ConstructedInterpolants, 0 QuantifiedInterpolants, 2995 SizeOfPredicates, 3 NumberOfNonLiveVariables, 535 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 24843/24960 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-11 08:27:26,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-55.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 0961957eaafd8770638c6edb9922811bdb07ef81189d8eaab330413cde091f0c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:27:28,504 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:27:28,575 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 08:27:28,580 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:27:28,580 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:27:28,608 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:27:28,608 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:27:28,608 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:27:28,609 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:27:28,610 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:27:28,610 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:27:28,610 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:27:28,611 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:27:28,611 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:27:28,612 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:27:28,613 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:27:28,613 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:27:28,613 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:27:28,613 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:27:28,614 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:27:28,614 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:27:28,616 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:27:28,617 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:27:28,617 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 08:27:28,617 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 08:27:28,617 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:27:28,617 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 08:27:28,617 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:27:28,618 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:27:28,618 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:27:28,618 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:27:28,618 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:27:28,619 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:27:28,619 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:27:28,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:27:28,620 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:27:28,620 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:27:28,620 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:27:28,620 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 08:27:28,620 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 08:27:28,621 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:27:28,621 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:27:28,621 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:27:28,621 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:27:28,622 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 08:27:28,622 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-clean/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-clean/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 -> 0961957eaafd8770638c6edb9922811bdb07ef81189d8eaab330413cde091f0c [2024-10-11 08:27:28,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:27:28,911 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:27:28,914 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:27:28,915 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:27:28,916 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:27:28,917 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-55.i [2024-10-11 08:27:30,265 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:27:30,458 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:27:30,458 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-55.i [2024-10-11 08:27:30,466 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f152d47bb/e2573ce982184855b22752fa0ee5b680/FLAG8f01a7a99 [2024-10-11 08:27:30,477 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f152d47bb/e2573ce982184855b22752fa0ee5b680 [2024-10-11 08:27:30,479 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:27:30,480 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:27:30,485 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:27:30,485 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:27:30,492 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:27:30,492 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:27:30" (1/1) ... [2024-10-11 08:27:30,493 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@563f52db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:30, skipping insertion in model container [2024-10-11 08:27:30,493 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:27:30" (1/1) ... [2024-10-11 08:27:30,516 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:27:30,675 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-55.i[915,928] [2024-10-11 08:27:30,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:27:30,746 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:27:30,757 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-55.i[915,928] [2024-10-11 08:27:30,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:27:30,810 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:27:30,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:30 WrapperNode [2024-10-11 08:27:30,810 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:27:30,811 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:27:30,811 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:27:30,811 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:27:30,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:30" (1/1) ... [2024-10-11 08:27:30,832 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:30" (1/1) ... [2024-10-11 08:27:30,861 INFO L138 Inliner]: procedures = 27, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 212 [2024-10-11 08:27:30,861 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:27:30,862 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:27:30,862 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:27:30,862 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:27:30,873 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:30" (1/1) ... [2024-10-11 08:27:30,874 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:30" (1/1) ... [2024-10-11 08:27:30,878 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:30" (1/1) ... [2024-10-11 08:27:30,896 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-11 08:27:30,896 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:30" (1/1) ... [2024-10-11 08:27:30,896 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:30" (1/1) ... [2024-10-11 08:27:30,902 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:30" (1/1) ... [2024-10-11 08:27:30,905 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:30" (1/1) ... [2024-10-11 08:27:30,906 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:30" (1/1) ... [2024-10-11 08:27:30,908 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:30" (1/1) ... [2024-10-11 08:27:30,910 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:27:30,911 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:27:30,911 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:27:30,911 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:27:30,911 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:30" (1/1) ... [2024-10-11 08:27:30,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:27:30,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:27:30,947 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 08:27:30,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 08:27:30,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:27:30,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 08:27:30,985 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:27:30,986 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:27:30,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:27:30,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:27:31,062 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:27:31,067 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:27:31,478 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 08:27:31,479 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:27:31,553 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:27:31,553 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:27:31,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:27:31 BoogieIcfgContainer [2024-10-11 08:27:31,554 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:27:31,555 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:27:31,555 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:27:31,558 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:27:31,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:27:30" (1/3) ... [2024-10-11 08:27:31,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16a8b4d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:27:31, skipping insertion in model container [2024-10-11 08:27:31,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:30" (2/3) ... [2024-10-11 08:27:31,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16a8b4d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:27:31, skipping insertion in model container [2024-10-11 08:27:31,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:27:31" (3/3) ... [2024-10-11 08:27:31,560 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-55.i [2024-10-11 08:27:31,574 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:27:31,574 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:27:31,637 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:27:31,646 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3ab0f75d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:27:31,646 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:27:31,652 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 49 states have internal predecessors, (67), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 08:27:31,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-10-11 08:27:31,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:27:31,671 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:27:31,672 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:27:31,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:27:31,677 INFO L85 PathProgramCache]: Analyzing trace with hash 2071975990, now seen corresponding path program 1 times [2024-10-11 08:27:31,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:27:31,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [793428813] [2024-10-11 08:27:31,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:27:31,692 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-11 08:27:31,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:27:31,696 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 08:27:31,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 08:27:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:31,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 08:27:31,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:27:32,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1158 proven. 0 refuted. 0 times theorem prover too weak. 1962 trivial. 0 not checked. [2024-10-11 08:27:32,002 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:27:32,002 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:27:32,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [793428813] [2024-10-11 08:27:32,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [793428813] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:27:32,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:27:32,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 08:27:32,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629400559] [2024-10-11 08:27:32,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:27:32,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 08:27:32,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:27:32,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 08:27:32,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:27:32,035 INFO L87 Difference]: Start difference. First operand has 91 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 49 states have internal predecessors, (67), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-10-11 08:27:32,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:27:32,108 INFO L93 Difference]: Finished difference Result 179 states and 332 transitions. [2024-10-11 08:27:32,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 08:27:32,113 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 238 [2024-10-11 08:27:32,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:27:32,119 INFO L225 Difference]: With dead ends: 179 [2024-10-11 08:27:32,119 INFO L226 Difference]: Without dead ends: 89 [2024-10-11 08:27:32,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 237 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-11 08:27:32,124 INFO L432 NwaCegarLoop]: 138 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, 138 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-11 08:27:32,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:27:32,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-11 08:27:32,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-11 08:27:32,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 47 states have (on average 1.297872340425532) internal successors, (61), 47 states have internal predecessors, (61), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 08:27:32,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 141 transitions. [2024-10-11 08:27:32,161 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 141 transitions. Word has length 238 [2024-10-11 08:27:32,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:27:32,161 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 141 transitions. [2024-10-11 08:27:32,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-10-11 08:27:32,162 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 141 transitions. [2024-10-11 08:27:32,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-10-11 08:27:32,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:27:32,165 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:27:32,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 08:27:32,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-11 08:27:32,370 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:27:32,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:27:32,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1303118990, now seen corresponding path program 1 times [2024-10-11 08:27:32,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:27:32,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [723629881] [2024-10-11 08:27:32,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:27:32,374 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-11 08:27:32,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:27:32,375 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 08:27:32,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 08:27:32,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:32,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 08:27:32,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:27:32,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-10-11 08:27:32,729 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:27:32,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:27:32,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [723629881] [2024-10-11 08:27:32,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [723629881] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:27:32,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:27:32,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:27:32,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24156896] [2024-10-11 08:27:32,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:27:32,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:27:32,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:27:32,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:27:32,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:27:32,734 INFO L87 Difference]: Start difference. First operand 89 states and 141 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 08:27:32,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:27:32,841 INFO L93 Difference]: Finished difference Result 250 states and 395 transitions. [2024-10-11 08:27:32,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:27:32,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 238 [2024-10-11 08:27:32,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:27:32,844 INFO L225 Difference]: With dead ends: 250 [2024-10-11 08:27:32,844 INFO L226 Difference]: Without dead ends: 162 [2024-10-11 08:27:32,845 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-11 08:27:32,846 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 111 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:27:32,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 346 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 08:27:32,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-11 08:27:32,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 159. [2024-10-11 08:27:32,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 83 states have (on average 1.2771084337349397) internal successors, (106), 84 states have internal predecessors, (106), 73 states have call successors, (73), 2 states have call predecessors, (73), 2 states have return successors, (73), 72 states have call predecessors, (73), 73 states have call successors, (73) [2024-10-11 08:27:32,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 252 transitions. [2024-10-11 08:27:32,865 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 252 transitions. Word has length 238 [2024-10-11 08:27:32,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:27:32,866 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 252 transitions. [2024-10-11 08:27:32,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 08:27:32,866 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 252 transitions. [2024-10-11 08:27:32,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-10-11 08:27:32,869 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:27:32,869 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:27:32,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 08:27:33,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-11 08:27:33,074 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:27:33,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:27:33,075 INFO L85 PathProgramCache]: Analyzing trace with hash -602054412, now seen corresponding path program 1 times [2024-10-11 08:27:33,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:27:33,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2122275069] [2024-10-11 08:27:33,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:27:33,076 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-11 08:27:33,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:27:33,078 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-11 08:27:33,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 08:27:33,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:33,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 08:27:33,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:27:33,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1443 proven. 39 refuted. 0 times theorem prover too weak. 1638 trivial. 0 not checked. [2024-10-11 08:27:33,409 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:27:33,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 78 proven. 39 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2024-10-11 08:27:33,698 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:27:33,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2122275069] [2024-10-11 08:27:33,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2122275069] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 08:27:33,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 08:27:33,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-10-11 08:27:33,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022688520] [2024-10-11 08:27:33,699 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 08:27:33,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 08:27:33,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:27:33,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 08:27:33,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 08:27:33,702 INFO L87 Difference]: Start difference. First operand 159 states and 252 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2024-10-11 08:27:34,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:27:34,184 INFO L93 Difference]: Finished difference Result 333 states and 517 transitions. [2024-10-11 08:27:34,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 08:27:34,189 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) Word has length 238 [2024-10-11 08:27:34,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:27:34,196 INFO L225 Difference]: With dead ends: 333 [2024-10-11 08:27:34,196 INFO L226 Difference]: Without dead ends: 175 [2024-10-11 08:27:34,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 468 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2024-10-11 08:27:34,198 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 188 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 08:27:34,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 192 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 08:27:34,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-10-11 08:27:34,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 167. [2024-10-11 08:27:34,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 89 states have (on average 1.2134831460674158) internal successors, (108), 90 states have internal predecessors, (108), 73 states have call successors, (73), 4 states have call predecessors, (73), 4 states have return successors, (73), 72 states have call predecessors, (73), 73 states have call successors, (73) [2024-10-11 08:27:34,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 254 transitions. [2024-10-11 08:27:34,239 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 254 transitions. Word has length 238 [2024-10-11 08:27:34,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:27:34,240 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 254 transitions. [2024-10-11 08:27:34,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2024-10-11 08:27:34,241 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 254 transitions. [2024-10-11 08:27:34,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-10-11 08:27:34,243 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:27:34,244 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:27:34,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 08:27:34,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-11 08:27:34,445 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:27:34,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:27:34,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1172952950, now seen corresponding path program 1 times [2024-10-11 08:27:34,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:27:34,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [36202500] [2024-10-11 08:27:34,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:27:34,447 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-11 08:27:34,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:27:34,450 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-11 08:27:34,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 08:27:34,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:34,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 08:27:34,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:27:34,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1443 proven. 39 refuted. 0 times theorem prover too weak. 1638 trivial. 0 not checked. [2024-10-11 08:27:34,826 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:27:35,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 78 proven. 39 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2024-10-11 08:27:35,050 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:27:35,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [36202500] [2024-10-11 08:27:35,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [36202500] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 08:27:35,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 08:27:35,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-10-11 08:27:35,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518332942] [2024-10-11 08:27:35,051 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 08:27:35,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 08:27:35,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:27:35,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 08:27:35,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 08:27:35,053 INFO L87 Difference]: Start difference. First operand 167 states and 254 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2024-10-11 08:27:35,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:27:35,930 INFO L93 Difference]: Finished difference Result 436 states and 659 transitions. [2024-10-11 08:27:35,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 08:27:35,930 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) Word has length 238 [2024-10-11 08:27:35,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:27:35,933 INFO L225 Difference]: With dead ends: 436 [2024-10-11 08:27:35,933 INFO L226 Difference]: Without dead ends: 270 [2024-10-11 08:27:35,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 468 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-10-11 08:27:35,935 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 161 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 08:27:35,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 427 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 08:27:35,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-10-11 08:27:35,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 167. [2024-10-11 08:27:35,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 89 states have (on average 1.1685393258426966) internal successors, (104), 90 states have internal predecessors, (104), 73 states have call successors, (73), 4 states have call predecessors, (73), 4 states have return successors, (73), 72 states have call predecessors, (73), 73 states have call successors, (73) [2024-10-11 08:27:35,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 250 transitions. [2024-10-11 08:27:35,958 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 250 transitions. Word has length 238 [2024-10-11 08:27:35,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:27:35,959 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 250 transitions. [2024-10-11 08:27:35,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2024-10-11 08:27:35,959 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 250 transitions. [2024-10-11 08:27:35,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-10-11 08:27:35,961 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:27:35,961 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:27:35,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 08:27:36,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/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-11 08:27:36,162 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:27:36,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:27:36,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1174859574, now seen corresponding path program 1 times [2024-10-11 08:27:36,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:27:36,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1033900539] [2024-10-11 08:27:36,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:27:36,167 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-11 08:27:36,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:27:36,170 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/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-11 08:27:36,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 08:27:36,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:36,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 08:27:36,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:27:36,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-10-11 08:27:36,367 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:27:36,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:27:36,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1033900539] [2024-10-11 08:27:36,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1033900539] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:27:36,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:27:36,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:27:36,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530759734] [2024-10-11 08:27:36,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:27:36,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:27:36,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:27:36,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:27:36,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:27:36,369 INFO L87 Difference]: Start difference. First operand 167 states and 250 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 08:27:36,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:27:36,470 INFO L93 Difference]: Finished difference Result 341 states and 506 transitions. [2024-10-11 08:27:36,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:27:36,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 238 [2024-10-11 08:27:36,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:27:36,472 INFO L225 Difference]: With dead ends: 341 [2024-10-11 08:27:36,472 INFO L226 Difference]: Without dead ends: 175 [2024-10-11 08:27:36,473 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-11 08:27:36,474 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 111 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:27:36,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 267 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 08:27:36,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-10-11 08:27:36,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 100. [2024-10-11 08:27:36,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 56 states have internal predecessors, (65), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 08:27:36,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 145 transitions. [2024-10-11 08:27:36,489 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 145 transitions. Word has length 238 [2024-10-11 08:27:36,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:27:36,490 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 145 transitions. [2024-10-11 08:27:36,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 08:27:36,490 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 145 transitions. [2024-10-11 08:27:36,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-10-11 08:27:36,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:27:36,492 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:27:36,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 08:27:36,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/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-11 08:27:36,693 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:27:36,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:27:36,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1907440774, now seen corresponding path program 1 times [2024-10-11 08:27:36,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:27:36,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1770639029] [2024-10-11 08:27:36,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:27:36,695 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-11 08:27:36,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:27:36,697 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/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-11 08:27:36,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 08:27:37,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:37,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-10-11 08:27:37,656 INFO L278 TraceCheckSpWp]: Computing forward predicates...