./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-35.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-35.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 36caaf551db5482f04140b8d335e706a9dbab961e11e8444b233de0d9b0de1a7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 06:24:07,611 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 06:24:07,712 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 06:24:07,718 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 06:24:07,720 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 06:24:07,759 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 06:24:07,760 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 06:24:07,761 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 06:24:07,762 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 06:24:07,762 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 06:24:07,764 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 06:24:07,764 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 06:24:07,765 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 06:24:07,765 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 06:24:07,768 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 06:24:07,768 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 06:24:07,769 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 06:24:07,769 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 06:24:07,769 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 06:24:07,770 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 06:24:07,770 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 06:24:07,774 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 06:24:07,775 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 06:24:07,775 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 06:24:07,775 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 06:24:07,775 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 06:24:07,776 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 06:24:07,776 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 06:24:07,776 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 06:24:07,776 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 06:24:07,777 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 06:24:07,777 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 06:24:07,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:24:07,779 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 06:24:07,779 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 06:24:07,779 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 06:24:07,780 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 06:24:07,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 06:24:07,781 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 06:24:07,781 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 06:24:07,782 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 06:24:07,782 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 06:24:07,782 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 36caaf551db5482f04140b8d335e706a9dbab961e11e8444b233de0d9b0de1a7 [2024-10-24 06:24:08,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 06:24:08,135 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 06:24:08,138 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 06:24:08,140 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 06:24:08,141 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 06:24:08,143 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-35.i [2024-10-24 06:24:09,859 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 06:24:10,131 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 06:24:10,132 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-35.i [2024-10-24 06:24:10,147 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0c271bce/42a79eb07b8f47d3916aa369428bb78b/FLAG3141c5b23 [2024-10-24 06:24:10,163 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0c271bce/42a79eb07b8f47d3916aa369428bb78b [2024-10-24 06:24:10,166 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 06:24:10,168 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 06:24:10,171 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 06:24:10,171 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 06:24:10,178 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 06:24:10,180 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:24:10" (1/1) ... [2024-10-24 06:24:10,181 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58a712f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:10, skipping insertion in model container [2024-10-24 06:24:10,181 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:24:10" (1/1) ... [2024-10-24 06:24:10,225 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 06:24:10,417 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-35.i[915,928] [2024-10-24 06:24:10,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:24:10,513 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 06:24:10,524 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-35.i[915,928] [2024-10-24 06:24:10,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:24:10,595 INFO L204 MainTranslator]: Completed translation [2024-10-24 06:24:10,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:10 WrapperNode [2024-10-24 06:24:10,600 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 06:24:10,602 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 06:24:10,603 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 06:24:10,603 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 06:24:10,610 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:10" (1/1) ... [2024-10-24 06:24:10,624 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:10" (1/1) ... [2024-10-24 06:24:10,665 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 245 [2024-10-24 06:24:10,666 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 06:24:10,667 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 06:24:10,667 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 06:24:10,667 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 06:24:10,685 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:10" (1/1) ... [2024-10-24 06:24:10,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:10" (1/1) ... [2024-10-24 06:24:10,690 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:10" (1/1) ... [2024-10-24 06:24:10,721 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-24 06:24:10,722 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:10" (1/1) ... [2024-10-24 06:24:10,722 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:10" (1/1) ... [2024-10-24 06:24:10,733 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:10" (1/1) ... [2024-10-24 06:24:10,737 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:10" (1/1) ... [2024-10-24 06:24:10,740 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:10" (1/1) ... [2024-10-24 06:24:10,743 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:10" (1/1) ... [2024-10-24 06:24:10,748 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 06:24:10,750 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 06:24:10,750 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 06:24:10,750 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 06:24:10,751 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:10" (1/1) ... [2024-10-24 06:24:10,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:24:10,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:24:10,808 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 06:24:10,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 06:24:10,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 06:24:10,870 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 06:24:10,871 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 06:24:10,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 06:24:10,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 06:24:10,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 06:24:10,997 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 06:24:11,003 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 06:24:11,496 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-24 06:24:11,497 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 06:24:11,547 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 06:24:11,549 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 06:24:11,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:24:11 BoogieIcfgContainer [2024-10-24 06:24:11,550 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 06:24:11,552 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 06:24:11,553 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 06:24:11,556 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 06:24:11,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:24:10" (1/3) ... [2024-10-24 06:24:11,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43a13a9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:24:11, skipping insertion in model container [2024-10-24 06:24:11,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:10" (2/3) ... [2024-10-24 06:24:11,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43a13a9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:24:11, skipping insertion in model container [2024-10-24 06:24:11,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:24:11" (3/3) ... [2024-10-24 06:24:11,561 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-35.i [2024-10-24 06:24:11,575 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 06:24:11,576 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 06:24:11,662 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 06:24:11,670 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;@54d2264a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 06:24:11,670 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 06:24:11,675 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 59 states have (on average 1.423728813559322) internal successors, (84), 60 states have internal predecessors, (84), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-24 06:24:11,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-24 06:24:11,691 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:24:11,692 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:24:11,693 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:24:11,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:24:11,698 INFO L85 PathProgramCache]: Analyzing trace with hash 2066110218, now seen corresponding path program 1 times [2024-10-24 06:24:11,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:24:11,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408775509] [2024-10-24 06:24:11,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:24:11,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:24:12,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:12,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:24:12,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:12,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:24:12,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:12,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:24:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:12,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:24:12,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:12,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:24:12,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:12,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:24:12,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:12,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:24:12,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:12,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:24:12,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:12,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:24:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:12,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:24:12,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:12,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:24:12,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:12,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 06:24:12,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:12,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 06:24:12,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:12,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 06:24:12,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:12,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 06:24:12,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:12,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 06:24:12,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:12,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 06:24:12,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:12,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 06:24:12,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:12,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 06:24:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:12,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 06:24:12,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:12,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 06:24:12,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:12,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 06:24:12,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:12,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 06:24:12,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:12,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-24 06:24:12,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:12,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 06:24:12,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:12,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-24 06:24:12,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:12,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-24 06:24:12,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:12,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-24 06:24:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:12,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-24 06:24:12,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:12,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-24 06:24:12,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:12,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-24 06:24:12,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:12,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-24 06:24:12,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:12,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-24 06:24:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:12,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-24 06:24:12,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:12,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-24 06:24:12,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:24:12,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408775509] [2024-10-24 06:24:12,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408775509] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:24:12,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:24:12,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 06:24:12,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536861582] [2024-10-24 06:24:12,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:24:12,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 06:24:12,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:24:12,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 06:24:12,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:24:12,777 INFO L87 Difference]: Start difference. First operand has 96 states, 59 states have (on average 1.423728813559322) internal successors, (84), 60 states have internal predecessors, (84), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-24 06:24:12,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:24:12,904 INFO L93 Difference]: Finished difference Result 229 states and 420 transitions. [2024-10-24 06:24:12,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 06:24:12,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 214 [2024-10-24 06:24:12,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:24:12,928 INFO L225 Difference]: With dead ends: 229 [2024-10-24 06:24:12,929 INFO L226 Difference]: Without dead ends: 134 [2024-10-24 06:24:12,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 70 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-24 06:24:12,938 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 112 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 06:24:12,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 277 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 06:24:12,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-24 06:24:13,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2024-10-24 06:24:13,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 76 states have internal predecessors, (95), 55 states have call successors, (55), 2 states have call predecessors, (55), 2 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-10-24 06:24:13,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 205 transitions. [2024-10-24 06:24:13,063 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 205 transitions. Word has length 214 [2024-10-24 06:24:13,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:24:13,069 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 205 transitions. [2024-10-24 06:24:13,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-24 06:24:13,072 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 205 transitions. [2024-10-24 06:24:13,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-24 06:24:13,078 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:24:13,079 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:24:13,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 06:24:13,080 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:24:13,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:24:13,082 INFO L85 PathProgramCache]: Analyzing trace with hash -2010002360, now seen corresponding path program 1 times [2024-10-24 06:24:13,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:24:13,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512491301] [2024-10-24 06:24:13,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:24:13,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:24:13,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:13,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:24:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:13,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:24:13,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:13,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:24:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:13,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:24:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:13,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:24:13,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:13,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:24:13,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:13,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:24:13,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:13,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:24:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:13,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:24:13,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:13,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:24:13,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:13,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:24:13,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:13,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 06:24:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:13,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 06:24:13,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:13,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 06:24:13,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:13,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 06:24:13,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:13,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 06:24:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:13,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 06:24:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:13,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 06:24:13,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:13,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 06:24:13,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:13,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 06:24:13,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:13,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 06:24:13,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:13,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 06:24:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:13,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 06:24:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:13,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-24 06:24:13,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:13,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 06:24:13,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:13,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-24 06:24:13,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:13,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-24 06:24:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:13,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-24 06:24:13,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:13,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-24 06:24:13,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:13,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-24 06:24:13,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:13,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-24 06:24:13,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:13,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-24 06:24:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:13,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-24 06:24:13,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:13,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-24 06:24:13,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:13,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-24 06:24:13,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:24:13,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512491301] [2024-10-24 06:24:13,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512491301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:24:13,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:24:13,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 06:24:13,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228471724] [2024-10-24 06:24:13,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:24:13,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 06:24:13,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:24:13,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 06:24:13,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:24:13,548 INFO L87 Difference]: Start difference. First operand 133 states and 205 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-24 06:24:13,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:24:13,610 INFO L93 Difference]: Finished difference Result 230 states and 353 transitions. [2024-10-24 06:24:13,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 06:24:13,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 214 [2024-10-24 06:24:13,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:24:13,620 INFO L225 Difference]: With dead ends: 230 [2024-10-24 06:24:13,620 INFO L226 Difference]: Without dead ends: 133 [2024-10-24 06:24:13,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 70 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-24 06:24:13,623 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 06:24:13,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 279 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 06:24:13,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-24 06:24:13,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-10-24 06:24:13,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 76 states have internal predecessors, (94), 55 states have call successors, (55), 2 states have call predecessors, (55), 2 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-10-24 06:24:13,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 204 transitions. [2024-10-24 06:24:13,658 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 204 transitions. Word has length 214 [2024-10-24 06:24:13,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:24:13,661 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 204 transitions. [2024-10-24 06:24:13,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-24 06:24:13,662 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 204 transitions. [2024-10-24 06:24:13,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-24 06:24:13,666 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:24:13,666 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:24:13,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 06:24:13,667 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:24:13,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:24:13,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1119309140, now seen corresponding path program 1 times [2024-10-24 06:24:13,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:24:13,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868379823] [2024-10-24 06:24:13,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:24:13,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:24:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:14,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:24:14,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:14,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:24:14,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:14,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:24:14,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:14,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:24:14,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:14,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:24:14,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:14,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:24:14,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:14,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:24:14,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:14,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:24:14,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:14,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:24:14,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:14,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:24:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:14,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:24:14,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:14,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 06:24:14,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:14,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 06:24:14,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:14,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 06:24:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:14,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 06:24:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:14,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 06:24:14,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:14,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 06:24:14,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:14,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 06:24:14,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:14,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 06:24:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:14,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 06:24:14,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:14,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 06:24:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:14,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 06:24:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:14,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 06:24:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:14,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-24 06:24:14,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:14,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 06:24:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:14,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-24 06:24:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:14,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-24 06:24:14,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:14,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-24 06:24:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:14,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-24 06:24:14,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:14,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-24 06:24:14,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:14,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-24 06:24:14,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:14,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-24 06:24:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:14,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-24 06:24:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:14,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-24 06:24:14,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:14,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-24 06:24:14,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:24:14,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868379823] [2024-10-24 06:24:14,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868379823] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:24:14,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:24:14,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 06:24:14,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257165166] [2024-10-24 06:24:14,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:24:14,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 06:24:14,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:24:14,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 06:24:14,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 06:24:14,396 INFO L87 Difference]: Start difference. First operand 133 states and 204 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-24 06:24:14,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:24:14,697 INFO L93 Difference]: Finished difference Result 341 states and 516 transitions. [2024-10-24 06:24:14,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 06:24:14,698 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215 [2024-10-24 06:24:14,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:24:14,704 INFO L225 Difference]: With dead ends: 341 [2024-10-24 06:24:14,706 INFO L226 Difference]: Without dead ends: 244 [2024-10-24 06:24:14,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:24:14,712 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 123 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 06:24:14,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 434 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 06:24:14,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-10-24 06:24:14,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 228. [2024-10-24 06:24:14,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 134 states have (on average 1.2761194029850746) internal successors, (171), 135 states have internal predecessors, (171), 89 states have call successors, (89), 4 states have call predecessors, (89), 4 states have return successors, (89), 88 states have call predecessors, (89), 89 states have call successors, (89) [2024-10-24 06:24:14,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 349 transitions. [2024-10-24 06:24:14,771 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 349 transitions. Word has length 215 [2024-10-24 06:24:14,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:24:14,773 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 349 transitions. [2024-10-24 06:24:14,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-24 06:24:14,773 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 349 transitions. [2024-10-24 06:24:14,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-24 06:24:14,777 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:24:14,777 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:24:14,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 06:24:14,778 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:24:14,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:24:14,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1181513450, now seen corresponding path program 1 times [2024-10-24 06:24:14,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:24:14,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819405944] [2024-10-24 06:24:14,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:24:14,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:24:14,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:15,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:24:15,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:15,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:24:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:15,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:24:15,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:15,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:24:15,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:15,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:24:15,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:15,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:24:15,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:15,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:24:15,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:15,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:24:15,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:15,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:24:15,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:15,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:24:15,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:15,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:24:15,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:15,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 06:24:15,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:15,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 06:24:15,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:15,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 06:24:15,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:15,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 06:24:15,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:15,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 06:24:15,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:15,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 06:24:15,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:15,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 06:24:15,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:15,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 06:24:15,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:15,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 06:24:15,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:15,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 06:24:15,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:15,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 06:24:15,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:15,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 06:24:15,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:15,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-24 06:24:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:15,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 06:24:15,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:15,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-24 06:24:15,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:15,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-24 06:24:15,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:15,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-24 06:24:15,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:15,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-24 06:24:15,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:15,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-24 06:24:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:15,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-24 06:24:15,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:15,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-24 06:24:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:15,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-24 06:24:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:15,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-24 06:24:15,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:15,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-24 06:24:15,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:24:15,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819405944] [2024-10-24 06:24:15,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819405944] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:24:15,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:24:15,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 06:24:15,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032838534] [2024-10-24 06:24:15,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:24:15,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 06:24:15,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:24:15,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 06:24:15,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 06:24:15,240 INFO L87 Difference]: Start difference. First operand 228 states and 349 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-24 06:24:15,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:24:15,548 INFO L93 Difference]: Finished difference Result 674 states and 1022 transitions. [2024-10-24 06:24:15,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 06:24:15,549 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215 [2024-10-24 06:24:15,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:24:15,556 INFO L225 Difference]: With dead ends: 674 [2024-10-24 06:24:15,558 INFO L226 Difference]: Without dead ends: 482 [2024-10-24 06:24:15,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 06:24:15,561 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 184 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 06:24:15,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 463 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 06:24:15,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-10-24 06:24:15,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 380. [2024-10-24 06:24:15,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 234 states have (on average 1.2820512820512822) internal successors, (300), 238 states have internal predecessors, (300), 137 states have call successors, (137), 8 states have call predecessors, (137), 8 states have return successors, (137), 133 states have call predecessors, (137), 137 states have call successors, (137) [2024-10-24 06:24:15,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 574 transitions. [2024-10-24 06:24:15,625 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 574 transitions. Word has length 215 [2024-10-24 06:24:15,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:24:15,629 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 574 transitions. [2024-10-24 06:24:15,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-24 06:24:15,629 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 574 transitions. [2024-10-24 06:24:15,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-24 06:24:15,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:24:15,632 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:24:15,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 06:24:15,633 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:24:15,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:24:15,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1439678888, now seen corresponding path program 1 times [2024-10-24 06:24:15,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:24:15,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553591065] [2024-10-24 06:24:15,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:24:15,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:24:15,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:16,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:24:16,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:16,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:24:16,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:16,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:24:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:16,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:24:16,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:16,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:24:16,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:16,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:24:16,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:16,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:24:16,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:16,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:24:16,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:16,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:24:16,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:16,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:24:16,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:16,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:24:16,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:16,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 06:24:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:16,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 06:24:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:16,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 06:24:16,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:16,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 06:24:16,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:16,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 06:24:16,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:16,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 06:24:16,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:16,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 06:24:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:16,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 06:24:16,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:16,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 06:24:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:16,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 06:24:16,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:16,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 06:24:16,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:16,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 06:24:16,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:16,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-24 06:24:16,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:16,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 06:24:16,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:16,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-24 06:24:16,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:16,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-24 06:24:16,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:16,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-24 06:24:16,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:16,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-24 06:24:16,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:16,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-24 06:24:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:16,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-24 06:24:16,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:16,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-24 06:24:16,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:16,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-24 06:24:16,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:16,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-24 06:24:16,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:16,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-24 06:24:16,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:24:16,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553591065] [2024-10-24 06:24:16,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553591065] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:24:16,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:24:16,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 06:24:16,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568249124] [2024-10-24 06:24:16,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:24:16,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 06:24:16,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:24:16,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 06:24:16,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:24:16,199 INFO L87 Difference]: Start difference. First operand 380 states and 574 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-24 06:24:16,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:24:16,514 INFO L93 Difference]: Finished difference Result 590 states and 872 transitions. [2024-10-24 06:24:16,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 06:24:16,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215 [2024-10-24 06:24:16,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:24:16,521 INFO L225 Difference]: With dead ends: 590 [2024-10-24 06:24:16,521 INFO L226 Difference]: Without dead ends: 450 [2024-10-24 06:24:16,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 06:24:16,526 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 101 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 06:24:16,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 541 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 06:24:16,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2024-10-24 06:24:16,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 365. [2024-10-24 06:24:16,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 226 states have (on average 1.2787610619469028) internal successors, (289), 229 states have internal predecessors, (289), 130 states have call successors, (130), 8 states have call predecessors, (130), 8 states have return successors, (130), 127 states have call predecessors, (130), 130 states have call successors, (130) [2024-10-24 06:24:16,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 549 transitions. [2024-10-24 06:24:16,579 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 549 transitions. Word has length 215 [2024-10-24 06:24:16,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:24:16,580 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 549 transitions. [2024-10-24 06:24:16,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-24 06:24:16,581 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 549 transitions. [2024-10-24 06:24:16,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-24 06:24:16,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:24:16,584 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:24:16,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 06:24:16,584 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:24:16,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:24:16,585 INFO L85 PathProgramCache]: Analyzing trace with hash 630332262, now seen corresponding path program 1 times [2024-10-24 06:24:16,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:24:16,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042492314] [2024-10-24 06:24:16,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:24:16,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:24:16,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 06:24:16,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [531745990] [2024-10-24 06:24:16,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:24:16,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:24:16,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:24:16,711 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 06:24:16,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 06:24:16,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:16,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 06:24:16,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:24:17,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-24 06:24:17,936 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:24:17,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:24:17,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042492314] [2024-10-24 06:24:17,938 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 06:24:17,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531745990] [2024-10-24 06:24:17,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531745990] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:24:17,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:24:17,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 06:24:17,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704862074] [2024-10-24 06:24:17,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:24:17,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 06:24:17,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:24:17,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 06:24:17,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 06:24:17,940 INFO L87 Difference]: Start difference. First operand 365 states and 549 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-24 06:24:18,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:24:18,767 INFO L93 Difference]: Finished difference Result 1663 states and 2482 transitions. [2024-10-24 06:24:18,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 06:24:18,768 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215 [2024-10-24 06:24:18,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:24:18,782 INFO L225 Difference]: With dead ends: 1663 [2024-10-24 06:24:18,782 INFO L226 Difference]: Without dead ends: 1334 [2024-10-24 06:24:18,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-24 06:24:18,786 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 394 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 06:24:18,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 790 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 06:24:18,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2024-10-24 06:24:18,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 743. [2024-10-24 06:24:18,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 479 states have (on average 1.2985386221294364) internal successors, (622), 485 states have internal predecessors, (622), 247 states have call successors, (247), 16 states have call predecessors, (247), 16 states have return successors, (247), 241 states have call predecessors, (247), 247 states have call successors, (247) [2024-10-24 06:24:18,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1116 transitions. [2024-10-24 06:24:18,928 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1116 transitions. Word has length 215 [2024-10-24 06:24:18,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:24:18,929 INFO L471 AbstractCegarLoop]: Abstraction has 743 states and 1116 transitions. [2024-10-24 06:24:18,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-24 06:24:18,929 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1116 transitions. [2024-10-24 06:24:18,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-24 06:24:18,934 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:24:18,934 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:24:18,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 06:24:19,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-24 06:24:19,136 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:24:19,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:24:19,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1023359272, now seen corresponding path program 1 times [2024-10-24 06:24:19,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:24:19,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449862035] [2024-10-24 06:24:19,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:24:19,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:24:19,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 06:24:19,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [434464130] [2024-10-24 06:24:19,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:24:19,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:24:19,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:24:19,304 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 06:24:19,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 06:24:19,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:19,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-24 06:24:19,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:24:19,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 378 proven. 0 refuted. 0 times theorem prover too weak. 1866 trivial. 0 not checked. [2024-10-24 06:24:19,712 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:24:19,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:24:19,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449862035] [2024-10-24 06:24:19,713 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 06:24:19,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434464130] [2024-10-24 06:24:19,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434464130] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:24:19,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:24:19,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 06:24:19,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491666113] [2024-10-24 06:24:19,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:24:19,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 06:24:19,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:24:19,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 06:24:19,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-24 06:24:19,716 INFO L87 Difference]: Start difference. First operand 743 states and 1116 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (34), 3 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-24 06:24:20,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:24:20,804 INFO L93 Difference]: Finished difference Result 2100 states and 3096 transitions. [2024-10-24 06:24:20,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-24 06:24:20,805 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (34), 3 states have call predecessors, (34), 2 states have call successors, (34) Word has length 215 [2024-10-24 06:24:20,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:24:20,819 INFO L225 Difference]: With dead ends: 2100 [2024-10-24 06:24:20,819 INFO L226 Difference]: Without dead ends: 1393 [2024-10-24 06:24:20,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2024-10-24 06:24:20,824 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 303 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 06:24:20,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 432 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 06:24:20,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2024-10-24 06:24:20,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 763. [2024-10-24 06:24:20,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 498 states have (on average 1.2951807228915662) internal successors, (645), 504 states have internal predecessors, (645), 244 states have call successors, (244), 20 states have call predecessors, (244), 20 states have return successors, (244), 238 states have call predecessors, (244), 244 states have call successors, (244) [2024-10-24 06:24:20,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1133 transitions. [2024-10-24 06:24:20,995 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1133 transitions. Word has length 215 [2024-10-24 06:24:20,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:24:20,996 INFO L471 AbstractCegarLoop]: Abstraction has 763 states and 1133 transitions. [2024-10-24 06:24:20,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (34), 3 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-24 06:24:20,997 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1133 transitions. [2024-10-24 06:24:21,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-24 06:24:21,001 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:24:21,001 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:24:21,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 06:24:21,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-24 06:24:21,203 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:24:21,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:24:21,203 INFO L85 PathProgramCache]: Analyzing trace with hash -665584470, now seen corresponding path program 1 times [2024-10-24 06:24:21,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:24:21,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202655552] [2024-10-24 06:24:21,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:24:21,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:24:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 06:24:21,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1888152046] [2024-10-24 06:24:21,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:24:21,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:24:21,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:24:21,306 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 06:24:21,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 06:24:21,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 06:24:21,461 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 06:24:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 06:24:21,667 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 06:24:21,668 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 06:24:21,670 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 06:24:21,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 06:24:21,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:24:21,877 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:24:22,064 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 06:24:22,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 06:24:22 BoogieIcfgContainer [2024-10-24 06:24:22,071 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 06:24:22,072 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 06:24:22,072 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 06:24:22,072 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 06:24:22,072 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:24:11" (3/4) ... [2024-10-24 06:24:22,075 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 06:24:22,076 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 06:24:22,076 INFO L158 Benchmark]: Toolchain (without parser) took 11908.64ms. Allocated memory was 161.5MB in the beginning and 323.0MB in the end (delta: 161.5MB). Free memory was 108.4MB in the beginning and 119.8MB in the end (delta: -11.4MB). Peak memory consumption was 152.5MB. Max. memory is 16.1GB. [2024-10-24 06:24:22,077 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 161.5MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 06:24:22,077 INFO L158 Benchmark]: CACSL2BoogieTranslator took 429.60ms. Allocated memory is still 161.5MB. Free memory was 107.8MB in the beginning and 91.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 06:24:22,077 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.48ms. Allocated memory is still 161.5MB. Free memory was 91.0MB in the beginning and 87.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 06:24:22,078 INFO L158 Benchmark]: Boogie Preprocessor took 81.92ms. Allocated memory is still 161.5MB. Free memory was 87.5MB in the beginning and 83.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 06:24:22,078 INFO L158 Benchmark]: RCFGBuilder took 800.37ms. Allocated memory is still 161.5MB. Free memory was 83.3MB in the beginning and 53.9MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-24 06:24:22,078 INFO L158 Benchmark]: TraceAbstraction took 10518.70ms. Allocated memory was 161.5MB in the beginning and 323.0MB in the end (delta: 161.5MB). Free memory was 53.3MB in the beginning and 119.8MB in the end (delta: -66.5MB). Peak memory consumption was 97.9MB. Max. memory is 16.1GB. [2024-10-24 06:24:22,079 INFO L158 Benchmark]: Witness Printer took 4.45ms. Allocated memory is still 323.0MB. Free memory is still 119.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 06:24:22,080 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 161.5MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 429.60ms. Allocated memory is still 161.5MB. Free memory was 107.8MB in the beginning and 91.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.48ms. Allocated memory is still 161.5MB. Free memory was 91.0MB in the beginning and 87.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.92ms. Allocated memory is still 161.5MB. Free memory was 87.5MB in the beginning and 83.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 800.37ms. Allocated memory is still 161.5MB. Free memory was 83.3MB in the beginning and 53.9MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 10518.70ms. Allocated memory was 161.5MB in the beginning and 323.0MB in the end (delta: 161.5MB). Free memory was 53.3MB in the beginning and 119.8MB in the end (delta: -66.5MB). Peak memory consumption was 97.9MB. Max. memory is 16.1GB. * Witness Printer took 4.45ms. Allocated memory is still 323.0MB. Free memory is still 119.8MB. 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 someBinaryFLOATComparisonOperation at line 187, overapproximation of someBinaryDOUBLEComparisonOperation at line 187, overapproximation of someUnaryFLOAToperation at line 112, overapproximation of someBinaryArithmeticFLOAToperation at line 112. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_3 = 1; [L24] unsigned char var_1_4 = 0; [L25] unsigned char var_1_5 = 0; [L26] unsigned short int var_1_6 = 25; [L27] double var_1_9 = 999.625; [L28] unsigned short int var_1_11 = 5; [L29] signed short int var_1_12 = 2; [L30] signed long int var_1_13 = -256; [L31] double var_1_14 = 127.75; [L32] double var_1_15 = 9.75; [L33] float var_1_16 = 32.8; [L34] float var_1_17 = 32.5; [L35] float var_1_18 = 1.75; [L36] float var_1_19 = 1000000000000000.4; [L37] float var_1_20 = 0.875; [L38] unsigned char var_1_21 = 0; [L39] unsigned char var_1_22 = 0; [L40] signed short int var_1_23 = 64; [L41] signed short int var_1_24 = 25; [L42] signed short int var_1_25 = 0; [L43] float var_1_26 = 128.2; [L44] float var_1_27 = 16.625; [L45] signed long int var_1_28 = -100000; [L46] signed long int var_1_29 = -128; [L47] signed char var_1_30 = -25; [L48] unsigned char var_1_31 = 0; [L49] unsigned char var_1_32 = 0; [L50] unsigned short int var_1_33 = 128; [L51] signed long int var_1_34 = 128; [L52] unsigned short int var_1_35 = 4; [L53] unsigned short int var_1_36 = 4; [L54] double var_1_37 = 99.75; [L55] unsigned char var_1_38 = 0; [L56] signed long int var_1_39 = 10; [L57] signed short int last_1_var_1_12 = 2; [L58] signed long int last_1_var_1_13 = -256; [L59] double last_1_var_1_14 = 127.75; [L60] unsigned char last_1_var_1_21 = 0; [L191] isInitial = 1 [L192] FCALL initially() [L193] COND TRUE 1 [L194] CALL updateLastVariables() [L181] last_1_var_1_12 = var_1_12 [L182] last_1_var_1_13 = var_1_13 [L183] last_1_var_1_14 = var_1_14 [L184] last_1_var_1_21 = var_1_21 [L194] RET updateLastVariables() [L195] CALL updateVariables() [L125] var_1_3 = __VERIFIER_nondet_uchar() [L126] CALL assume_abort_if_not(var_1_3 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L126] RET assume_abort_if_not(var_1_3 >= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L127] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L127] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L128] var_1_4 = __VERIFIER_nondet_uchar() [L129] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L129] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L130] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L130] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L131] var_1_5 = __VERIFIER_nondet_uchar() [L132] CALL assume_abort_if_not(var_1_5 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L132] RET assume_abort_if_not(var_1_5 >= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L133] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L133] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L134] var_1_9 = __VERIFIER_nondet_double() [L135] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L135] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L136] var_1_11 = __VERIFIER_nondet_ushort() [L137] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L137] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L138] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L138] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L139] var_1_15 = __VERIFIER_nondet_double() [L140] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L140] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L141] var_1_17 = __VERIFIER_nondet_float() [L142] CALL assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L142] RET assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L143] var_1_18 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L144] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L145] var_1_19 = __VERIFIER_nondet_float() [L146] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L146] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L147] var_1_20 = __VERIFIER_nondet_float() [L148] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L148] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L149] var_1_22 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_22 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L150] RET assume_abort_if_not(var_1_22 >= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L151] CALL assume_abort_if_not(var_1_22 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L151] RET assume_abort_if_not(var_1_22 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L152] var_1_24 = __VERIFIER_nondet_short() [L153] CALL assume_abort_if_not(var_1_24 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L153] RET assume_abort_if_not(var_1_24 >= -1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L154] CALL assume_abort_if_not(var_1_24 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L154] RET assume_abort_if_not(var_1_24 <= 32766) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L155] var_1_25 = __VERIFIER_nondet_short() [L156] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L156] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L157] CALL assume_abort_if_not(var_1_25 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L157] RET assume_abort_if_not(var_1_25 <= 32766) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L158] var_1_27 = __VERIFIER_nondet_float() [L159] CALL assume_abort_if_not((var_1_27 >= -922337.2036854765600e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L159] RET assume_abort_if_not((var_1_27 >= -922337.2036854765600e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L160] var_1_29 = __VERIFIER_nondet_long() [L161] CALL assume_abort_if_not(var_1_29 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L161] RET assume_abort_if_not(var_1_29 >= -2147483647) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L162] CALL assume_abort_if_not(var_1_29 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L162] RET assume_abort_if_not(var_1_29 <= 2147483646) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L163] var_1_32 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_32 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L164] RET assume_abort_if_not(var_1_32 >= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L165] CALL assume_abort_if_not(var_1_32 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L165] RET assume_abort_if_not(var_1_32 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L166] var_1_34 = __VERIFIER_nondet_long() [L167] CALL assume_abort_if_not(var_1_34 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L167] RET assume_abort_if_not(var_1_34 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L168] CALL assume_abort_if_not(var_1_34 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L168] RET assume_abort_if_not(var_1_34 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L169] var_1_35 = __VERIFIER_nondet_ushort() [L170] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L170] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L171] CALL assume_abort_if_not(var_1_35 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L171] RET assume_abort_if_not(var_1_35 <= 65534) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L172] var_1_36 = __VERIFIER_nondet_ushort() [L173] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L173] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L174] CALL assume_abort_if_not(var_1_36 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L174] RET assume_abort_if_not(var_1_36 <= 65534) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L175] var_1_39 = __VERIFIER_nondet_long() [L176] CALL assume_abort_if_not(var_1_39 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=399/4, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=399/4, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L176] RET assume_abort_if_not(var_1_39 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=399/4, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L177] CALL assume_abort_if_not(var_1_39 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=399/4, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=399/4, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L177] RET assume_abort_if_not(var_1_39 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=399/4, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L178] CALL assume_abort_if_not(var_1_39 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=399/4, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=399/4, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L178] RET assume_abort_if_not(var_1_39 != 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=399/4, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L195] RET updateVariables() [L196] CALL step() [L64] var_1_26 = var_1_27 [L65] var_1_28 = var_1_29 [L66] var_1_30 = 0 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=399/4, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L67] COND FALSE !(var_1_28 < var_1_29) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=399/4, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L70] EXPR var_1_28 ^ var_1_29 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=399/4, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L70] COND FALSE !((var_1_28 ^ var_1_29) >= var_1_34) [L77] COND TRUE var_1_31 || var_1_32 [L78] var_1_37 = ((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=3, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L80] COND FALSE !(var_1_34 <= (var_1_29 % var_1_39)) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=3, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L83] COND FALSE !(\read(last_1_var_1_21)) [L86] var_1_1 = (var_1_3 && var_1_5) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=3, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L88] COND FALSE !(var_1_18 > var_1_9) [L91] var_1_23 = (last_1_var_1_13 + 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=3, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L93] signed long int stepLocal_0 = last_1_var_1_12; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, stepLocal_0=2, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=3, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L94] COND TRUE last_1_var_1_12 >= stepLocal_0 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=3, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L95] COND TRUE (var_1_9 - 1.00000000000025E12) >= last_1_var_1_14 [L96] var_1_6 = 200 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=3, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L103] unsigned short int stepLocal_1 = var_1_6; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, stepLocal_1=200, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=3, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L104] COND FALSE !(var_1_11 > stepLocal_1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=3, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L107] EXPR var_1_11 >> var_1_6 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=3, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L107] COND TRUE (var_1_12 + var_1_23) < ((var_1_11 >> var_1_6) * var_1_12) [L108] var_1_14 = var_1_15 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=3, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L112] var_1_16 = (((((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) < 0 ) ? -((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) : ((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))))) [L113] unsigned short int stepLocal_3 = var_1_11; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, stepLocal_3=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=3, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L114] COND FALSE !(stepLocal_3 == var_1_6) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=3, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L117] unsigned short int stepLocal_2 = var_1_6; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, stepLocal_2=200, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=3, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L118] COND FALSE !(stepLocal_2 == var_1_12) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=3, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L196] RET step() [L197] CALL, EXPR property() [L187] EXPR ((((last_1_var_1_21 ? (var_1_1 == ((unsigned char) ((! var_1_3) || var_1_4))) : (var_1_1 == ((unsigned char) (var_1_3 && var_1_5)))) && ((last_1_var_1_12 >= last_1_var_1_12) ? (((var_1_9 - 1.00000000000025E12) >= last_1_var_1_14) ? (var_1_6 == ((unsigned short int) 200)) : (var_1_6 == ((unsigned short int) var_1_11))) : (var_1_6 == ((unsigned short int) var_1_11)))) && ((var_1_11 > var_1_6) ? (var_1_12 == ((signed short int) 32)) : 1)) && ((var_1_6 == var_1_12) ? ((! var_1_3) ? (var_1_13 == ((signed long int) ((last_1_var_1_13 + var_1_6) + (var_1_11 - var_1_23)))) : 1) : 1)) && (((var_1_12 + var_1_23) < ((var_1_11 >> var_1_6) * var_1_12)) ? (var_1_14 == ((double) var_1_15)) : (var_1_14 == ((double) var_1_15))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=3, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L187-L188] return (((((((last_1_var_1_21 ? (var_1_1 == ((unsigned char) ((! var_1_3) || var_1_4))) : (var_1_1 == ((unsigned char) (var_1_3 && var_1_5)))) && ((last_1_var_1_12 >= last_1_var_1_12) ? (((var_1_9 - 1.00000000000025E12) >= last_1_var_1_14) ? (var_1_6 == ((unsigned short int) 200)) : (var_1_6 == ((unsigned short int) var_1_11))) : (var_1_6 == ((unsigned short int) var_1_11)))) && ((var_1_11 > var_1_6) ? (var_1_12 == ((signed short int) 32)) : 1)) && ((var_1_6 == var_1_12) ? ((! var_1_3) ? (var_1_13 == ((signed long int) ((last_1_var_1_13 + var_1_6) + (var_1_11 - var_1_23)))) : 1) : 1)) && (((var_1_12 + var_1_23) < ((var_1_11 >> var_1_6) * var_1_12)) ? (var_1_14 == ((double) var_1_15)) : (var_1_14 == ((double) var_1_15)))) && (var_1_16 == ((float) (((((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) < 0 ) ? -((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) : ((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20))))))))) && ((var_1_11 == var_1_6) ? (var_1_21 == ((unsigned char) ((var_1_5 || var_1_3) && (var_1_1 || var_1_22)))) : 1)) && ((var_1_18 > var_1_9) ? (var_1_23 == ((signed short int) (((((var_1_24 - var_1_25)) > (last_1_var_1_13)) ? ((var_1_24 - var_1_25)) : (last_1_var_1_13))))) : (var_1_23 == ((signed short int) (last_1_var_1_13 + 1)))) ; [L197] RET, EXPR property() [L197] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=3, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=3, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.2s, OverallIterations: 8, TraceHistogramMax: 34, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1269 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1217 mSDsluCounter, 3216 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1928 mSDsCounter, 364 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1412 IncrementalHoareTripleChecker+Invalid, 1776 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 364 mSolverCounterUnsat, 1288 mSDtfsCounter, 1412 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 812 GetRequests, 773 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=763occurred in iteration=7, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 7 MinimizatonAttempts, 1425 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 2363 NumberOfCodeBlocks, 2363 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1496 ConstructedInterpolants, 0 QuantifiedInterpolants, 3624 SizeOfPredicates, 7 NumberOfNonLiveVariables, 992 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 15708/15708 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-24 06:24:22,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-35.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 36caaf551db5482f04140b8d335e706a9dbab961e11e8444b233de0d9b0de1a7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 06:24:24,608 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 06:24:24,701 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 06:24:24,708 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 06:24:24,709 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 06:24:24,749 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 06:24:24,751 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 06:24:24,752 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 06:24:24,753 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 06:24:24,753 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 06:24:24,754 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 06:24:24,754 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 06:24:24,755 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 06:24:24,755 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 06:24:24,755 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 06:24:24,756 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 06:24:24,759 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 06:24:24,762 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 06:24:24,762 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 06:24:24,762 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 06:24:24,762 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 06:24:24,763 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 06:24:24,765 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 06:24:24,765 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 06:24:24,765 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 06:24:24,766 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 06:24:24,766 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 06:24:24,766 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 06:24:24,767 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 06:24:24,767 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 06:24:24,767 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 06:24:24,768 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 06:24:24,768 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 06:24:24,768 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 06:24:24,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:24:24,769 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 06:24:24,769 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 06:24:24,771 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 06:24:24,771 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 06:24:24,771 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 06:24:24,771 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 06:24:24,772 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 06:24:24,772 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 06:24:24,772 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 06:24:24,772 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 06:24:24,773 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 36caaf551db5482f04140b8d335e706a9dbab961e11e8444b233de0d9b0de1a7 [2024-10-24 06:24:25,133 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 06:24:25,162 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 06:24:25,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 06:24:25,167 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 06:24:25,168 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 06:24:25,170 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-35.i [2024-10-24 06:24:26,936 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 06:24:27,183 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 06:24:27,184 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-35.i [2024-10-24 06:24:27,201 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2ca64add/298c54695a0c48c8bac7837c1c80e04e/FLAGd9eaa29b3 [2024-10-24 06:24:27,226 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2ca64add/298c54695a0c48c8bac7837c1c80e04e [2024-10-24 06:24:27,229 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 06:24:27,231 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 06:24:27,246 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 06:24:27,247 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 06:24:27,252 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 06:24:27,253 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:24:27" (1/1) ... [2024-10-24 06:24:27,254 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b40173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:27, skipping insertion in model container [2024-10-24 06:24:27,254 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:24:27" (1/1) ... [2024-10-24 06:24:27,292 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 06:24:27,502 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-35.i[915,928] [2024-10-24 06:24:27,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:24:27,620 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 06:24:27,633 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-35.i[915,928] [2024-10-24 06:24:27,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:24:27,716 INFO L204 MainTranslator]: Completed translation [2024-10-24 06:24:27,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:27 WrapperNode [2024-10-24 06:24:27,717 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 06:24:27,718 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 06:24:27,718 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 06:24:27,718 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 06:24:27,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:27" (1/1) ... [2024-10-24 06:24:27,743 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:27" (1/1) ... [2024-10-24 06:24:27,790 INFO L138 Inliner]: procedures = 27, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 210 [2024-10-24 06:24:27,793 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 06:24:27,794 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 06:24:27,794 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 06:24:27,794 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 06:24:27,807 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:27" (1/1) ... [2024-10-24 06:24:27,808 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:27" (1/1) ... [2024-10-24 06:24:27,831 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:27" (1/1) ... [2024-10-24 06:24:27,855 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-24 06:24:27,856 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:27" (1/1) ... [2024-10-24 06:24:27,856 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:27" (1/1) ... [2024-10-24 06:24:27,872 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:27" (1/1) ... [2024-10-24 06:24:27,880 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:27" (1/1) ... [2024-10-24 06:24:27,883 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:27" (1/1) ... [2024-10-24 06:24:27,886 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:27" (1/1) ... [2024-10-24 06:24:27,890 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 06:24:27,891 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 06:24:27,891 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 06:24:27,892 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 06:24:27,892 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:27" (1/1) ... [2024-10-24 06:24:27,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:24:27,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:24:27,935 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 06:24:27,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 06:24:27,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 06:24:27,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 06:24:27,985 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 06:24:27,985 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 06:24:27,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 06:24:27,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 06:24:28,099 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 06:24:28,104 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 06:24:31,771 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-24 06:24:31,772 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 06:24:31,818 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 06:24:31,818 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 06:24:31,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:24:31 BoogieIcfgContainer [2024-10-24 06:24:31,819 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 06:24:31,821 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 06:24:31,821 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 06:24:31,825 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 06:24:31,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:24:27" (1/3) ... [2024-10-24 06:24:31,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b06f635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:24:31, skipping insertion in model container [2024-10-24 06:24:31,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:27" (2/3) ... [2024-10-24 06:24:31,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b06f635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:24:31, skipping insertion in model container [2024-10-24 06:24:31,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:24:31" (3/3) ... [2024-10-24 06:24:31,828 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-35.i [2024-10-24 06:24:31,846 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 06:24:31,847 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 06:24:31,923 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 06:24:31,934 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;@5019616b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 06:24:31,934 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 06:24:31,940 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 49 states have internal predecessors, (67), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-24 06:24:31,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-24 06:24:31,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:24:31,963 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:24:31,963 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:24:31,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:24:31,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1197699393, now seen corresponding path program 1 times [2024-10-24 06:24:31,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:24:31,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [924554943] [2024-10-24 06:24:31,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:24:31,988 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-24 06:24:31,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:24:31,993 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:24:31,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 06:24:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:32,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 06:24:32,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:24:32,563 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 986 proven. 0 refuted. 0 times theorem prover too weak. 1258 trivial. 0 not checked. [2024-10-24 06:24:32,564 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:24:32,568 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:24:32,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [924554943] [2024-10-24 06:24:32,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [924554943] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:24:32,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:24:32,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 06:24:32,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364697965] [2024-10-24 06:24:32,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:24:32,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 06:24:32,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:24:32,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 06:24:32,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:24:32,625 INFO L87 Difference]: Start difference. First operand has 85 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 49 states have internal predecessors, (67), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-24 06:24:34,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:24:34,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:24:34,325 INFO L93 Difference]: Finished difference Result 167 states and 302 transitions. [2024-10-24 06:24:34,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 06:24:34,349 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 210 [2024-10-24 06:24:34,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:24:34,357 INFO L225 Difference]: With dead ends: 167 [2024-10-24 06:24:34,357 INFO L226 Difference]: Without dead ends: 83 [2024-10-24 06:24:34,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 209 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-24 06:24:34,364 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-24 06:24:34,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-24 06:24:34,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-24 06:24:34,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-24 06:24:34,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 47 states have internal predecessors, (62), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-24 06:24:34,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 130 transitions. [2024-10-24 06:24:34,423 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 130 transitions. Word has length 210 [2024-10-24 06:24:34,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:24:34,424 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 130 transitions. [2024-10-24 06:24:34,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-24 06:24:34,424 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 130 transitions. [2024-10-24 06:24:34,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-24 06:24:34,429 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:24:34,429 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:24:34,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 06:24:34,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:24:34,631 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:24:34,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:24:34,631 INFO L85 PathProgramCache]: Analyzing trace with hash -42975753, now seen corresponding path program 1 times [2024-10-24 06:24:34,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:24:34,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [399618093] [2024-10-24 06:24:34,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:24:34,633 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-24 06:24:34,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:24:34,638 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:24:34,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 06:24:35,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:35,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 06:24:35,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:24:35,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-24 06:24:35,221 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:24:35,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:24:35,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [399618093] [2024-10-24 06:24:35,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [399618093] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:24:35,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:24:35,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 06:24:35,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401291612] [2024-10-24 06:24:35,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:24:35,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 06:24:35,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:24:35,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 06:24:35,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:24:35,227 INFO L87 Difference]: Start difference. First operand 83 states and 130 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-24 06:24:37,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:24:37,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:24:37,073 INFO L93 Difference]: Finished difference Result 205 states and 319 transitions. [2024-10-24 06:24:37,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 06:24:37,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 210 [2024-10-24 06:24:37,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:24:37,084 INFO L225 Difference]: With dead ends: 205 [2024-10-24 06:24:37,084 INFO L226 Difference]: Without dead ends: 123 [2024-10-24 06:24:37,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 208 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-24 06:24:37,087 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 95 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-24 06:24:37,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 265 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-24 06:24:37,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-24 06:24:37,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2024-10-24 06:24:37,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 64 states have (on average 1.21875) internal successors, (78), 65 states have internal predecessors, (78), 55 states have call successors, (55), 2 states have call predecessors, (55), 2 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-10-24 06:24:37,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 188 transitions. [2024-10-24 06:24:37,129 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 188 transitions. Word has length 210 [2024-10-24 06:24:37,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:24:37,130 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 188 transitions. [2024-10-24 06:24:37,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-24 06:24:37,131 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 188 transitions. [2024-10-24 06:24:37,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-24 06:24:37,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:24:37,137 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:24:37,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 06:24:37,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:24:37,338 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:24:37,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:24:37,339 INFO L85 PathProgramCache]: Analyzing trace with hash -2037120459, now seen corresponding path program 1 times [2024-10-24 06:24:37,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:24:37,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368730383] [2024-10-24 06:24:37,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:24:37,340 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-24 06:24:37,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:24:37,343 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:24:37,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 06:24:37,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:37,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 06:24:37,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:24:39,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-24 06:24:39,027 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:24:39,027 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:24:39,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [368730383] [2024-10-24 06:24:39,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [368730383] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:24:39,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:24:39,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 06:24:39,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276865239] [2024-10-24 06:24:39,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:24:39,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 06:24:39,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:24:39,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 06:24:39,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 06:24:39,031 INFO L87 Difference]: Start difference. First operand 122 states and 188 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-24 06:24:40,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:24:42,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:24:42,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:24:42,765 INFO L93 Difference]: Finished difference Result 312 states and 476 transitions. [2024-10-24 06:24:42,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 06:24:42,787 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 210 [2024-10-24 06:24:42,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:24:42,794 INFO L225 Difference]: With dead ends: 312 [2024-10-24 06:24:42,795 INFO L226 Difference]: Without dead ends: 226 [2024-10-24 06:24:42,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 207 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-24 06:24:42,800 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 114 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-24 06:24:42,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 388 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-24 06:24:42,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-10-24 06:24:42,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 206. [2024-10-24 06:24:42,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 112 states have (on average 1.2410714285714286) internal successors, (139), 113 states have internal predecessors, (139), 89 states have call successors, (89), 4 states have call predecessors, (89), 4 states have return successors, (89), 88 states have call predecessors, (89), 89 states have call successors, (89) [2024-10-24 06:24:42,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 317 transitions. [2024-10-24 06:24:42,866 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 317 transitions. Word has length 210 [2024-10-24 06:24:42,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:24:42,868 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 317 transitions. [2024-10-24 06:24:42,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-24 06:24:42,869 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 317 transitions. [2024-10-24 06:24:42,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-24 06:24:42,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:24:42,872 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:24:42,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-24 06:24:43,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:24:43,074 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:24:43,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:24:43,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1246729587, now seen corresponding path program 1 times [2024-10-24 06:24:43,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:24:43,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1044078710] [2024-10-24 06:24:43,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:24:43,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-24 06:24:43,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:24:43,079 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:24:43,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 06:24:43,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:43,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 06:24:43,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:24:44,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-24 06:24:44,487 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:24:44,487 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:24:44,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1044078710] [2024-10-24 06:24:44,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1044078710] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:24:44,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:24:44,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 06:24:44,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338510369] [2024-10-24 06:24:44,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:24:44,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 06:24:44,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:24:44,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 06:24:44,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:24:44,492 INFO L87 Difference]: Start difference. First operand 206 states and 317 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-24 06:24:46,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:24:49,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:24:49,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:24:49,031 INFO L93 Difference]: Finished difference Result 568 states and 868 transitions. [2024-10-24 06:24:49,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 06:24:49,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 210 [2024-10-24 06:24:49,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:24:49,058 INFO L225 Difference]: With dead ends: 568 [2024-10-24 06:24:49,059 INFO L226 Difference]: Without dead ends: 398 [2024-10-24 06:24:49,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 06:24:49,062 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 86 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-24 06:24:49,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 444 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-10-24 06:24:49,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-10-24 06:24:49,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 374. [2024-10-24 06:24:49,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 208 states have (on average 1.25) internal successors, (260), 209 states have internal predecessors, (260), 157 states have call successors, (157), 8 states have call predecessors, (157), 8 states have return successors, (157), 156 states have call predecessors, (157), 157 states have call successors, (157) [2024-10-24 06:24:49,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 574 transitions. [2024-10-24 06:24:49,144 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 574 transitions. Word has length 210 [2024-10-24 06:24:49,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:24:49,146 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 574 transitions. [2024-10-24 06:24:49,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-24 06:24:49,146 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 574 transitions. [2024-10-24 06:24:49,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-10-24 06:24:49,149 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:24:49,149 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:24:49,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-24 06:24:49,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:24:49,350 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:24:49,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:24:49,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1389907022, now seen corresponding path program 1 times [2024-10-24 06:24:49,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:24:49,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [630014171] [2024-10-24 06:24:49,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:24:49,352 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-24 06:24:49,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:24:49,356 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:24:49,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 06:24:50,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:50,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-24 06:24:50,078 INFO L278 TraceCheckSpWp]: Computing forward predicates...