./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_loopvsstraightlinecode_100-1loop_file-77.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-77.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0cbe4eb7aae73c01b831078f0e738c68709fa97155cdb7dce934011117170926 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:10:08,689 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:10:08,760 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:10:08,765 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:10:08,766 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:10:08,798 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:10:08,798 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:10:08,799 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:10:08,800 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:10:08,801 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:10:08,802 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:10:08,802 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:10:08,803 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:10:08,805 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:10:08,805 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:10:08,805 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:10:08,805 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:10:08,806 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:10:08,806 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:10:08,806 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:10:08,806 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:10:08,807 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:10:08,807 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:10:08,807 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:10:08,808 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:10:08,808 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:10:08,808 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:10:08,808 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:10:08,809 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:10:08,809 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:10:08,809 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:10:08,810 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:10:08,810 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:10:08,810 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:10:08,811 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:10:08,811 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:10:08,811 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:10:08,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:10:08,812 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:10:08,812 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:10:08,812 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:10:08,813 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:10:08,813 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0cbe4eb7aae73c01b831078f0e738c68709fa97155cdb7dce934011117170926 [2024-10-11 11:10:09,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:10:09,130 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:10:09,133 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:10:09,134 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:10:09,134 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:10:09,135 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-77.i [2024-10-11 11:10:10,567 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:10:10,812 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:10:10,814 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-77.i [2024-10-11 11:10:10,826 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/33810b75c/9ec8ef58b18845a5a2c87b6054fa4487/FLAGb7d458475 [2024-10-11 11:10:10,848 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/33810b75c/9ec8ef58b18845a5a2c87b6054fa4487 [2024-10-11 11:10:10,850 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:10:10,852 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:10:10,854 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:10:10,855 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:10:10,865 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:10:10,866 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:10:10" (1/1) ... [2024-10-11 11:10:10,867 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5eccb845 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:10, skipping insertion in model container [2024-10-11 11:10:10,867 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:10:10" (1/1) ... [2024-10-11 11:10:10,905 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:10:11,102 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_loopvsstraightlinecode_100-1loop_file-77.i[916,929] [2024-10-11 11:10:11,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:10:11,198 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:10:11,213 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_loopvsstraightlinecode_100-1loop_file-77.i[916,929] [2024-10-11 11:10:11,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:10:11,294 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:10:11,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:11 WrapperNode [2024-10-11 11:10:11,295 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:10:11,297 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:10:11,298 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:10:11,298 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:10:11,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:11" (1/1) ... [2024-10-11 11:10:11,314 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:11" (1/1) ... [2024-10-11 11:10:11,344 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 215 [2024-10-11 11:10:11,345 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:10:11,346 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:10:11,346 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:10:11,346 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:10:11,358 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:11" (1/1) ... [2024-10-11 11:10:11,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:11" (1/1) ... [2024-10-11 11:10:11,361 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:11" (1/1) ... [2024-10-11 11:10:11,383 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 11:10:11,383 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:11" (1/1) ... [2024-10-11 11:10:11,384 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:11" (1/1) ... [2024-10-11 11:10:11,396 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:11" (1/1) ... [2024-10-11 11:10:11,403 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:11" (1/1) ... [2024-10-11 11:10:11,405 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:11" (1/1) ... [2024-10-11 11:10:11,414 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:11" (1/1) ... [2024-10-11 11:10:11,420 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:10:11,422 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:10:11,422 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:10:11,422 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:10:11,423 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:11" (1/1) ... [2024-10-11 11:10:11,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:10:11,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:10:11,455 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:10:11,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:10:11,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:10:11,505 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:10:11,505 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:10:11,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:10:11,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:10:11,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:10:11,638 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:10:11,641 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:10:11,985 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-10-11 11:10:11,986 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:10:12,044 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:10:12,046 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:10:12,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:10:12 BoogieIcfgContainer [2024-10-11 11:10:12,046 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:10:12,049 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:10:12,050 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:10:12,054 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:10:12,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:10:10" (1/3) ... [2024-10-11 11:10:12,055 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73562a7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:10:12, skipping insertion in model container [2024-10-11 11:10:12,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:11" (2/3) ... [2024-10-11 11:10:12,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73562a7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:10:12, skipping insertion in model container [2024-10-11 11:10:12,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:10:12" (3/3) ... [2024-10-11 11:10:12,057 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-77.i [2024-10-11 11:10:12,072 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:10:12,072 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:10:12,137 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:10:12,143 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;@f508653, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:10:12,144 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:10:12,149 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 50 states have (on average 1.48) internal successors, (74), 51 states have internal predecessors, (74), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 11:10:12,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-11 11:10:12,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:10:12,166 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:10:12,166 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:10:12,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:10:12,173 INFO L85 PathProgramCache]: Analyzing trace with hash -240178530, now seen corresponding path program 1 times [2024-10-11 11:10:12,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:10:12,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582451882] [2024-10-11 11:10:12,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:10:12,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:10:12,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:12,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:10:12,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:12,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 11:10:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:12,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 11:10:12,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:12,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 11:10:12,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:12,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 11:10:12,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:12,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 11:10:12,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:12,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 11:10:12,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:12,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 11:10:12,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:12,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 11:10:12,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:12,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 11:10:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:12,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 11:10:12,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:12,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 11:10:12,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:12,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 11:10:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:12,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 11:10:12,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:12,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 11:10:12,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:12,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 11:10:12,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:12,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 11:10:12,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:12,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 11:10:12,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:12,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 11:10:12,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:12,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 11:10:12,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:12,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 11:10:12,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:12,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 11:10:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:12,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 11:10:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:12,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 11:10:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:12,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 11:10:12,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:12,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 11:10:12,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:10:12,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582451882] [2024-10-11 11:10:12,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582451882] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:10:12,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:10:12,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:10:12,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329508089] [2024-10-11 11:10:12,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:10:12,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:10:12,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:10:12,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:10:12,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:10:12,739 INFO L87 Difference]: Start difference. First operand has 78 states, 50 states have (on average 1.48) internal successors, (74), 51 states have internal predecessors, (74), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 11:10:12,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:10:12,801 INFO L93 Difference]: Finished difference Result 155 states and 272 transitions. [2024-10-11 11:10:12,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:10:12,804 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 164 [2024-10-11 11:10:12,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:10:12,813 INFO L225 Difference]: With dead ends: 155 [2024-10-11 11:10:12,813 INFO L226 Difference]: Without dead ends: 76 [2024-10-11 11:10:12,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:10:12,823 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:10:12,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:10:12,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-11 11:10:12,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-11 11:10:12,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 49 states have internal predecessors, (69), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 11:10:12,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 119 transitions. [2024-10-11 11:10:12,865 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 119 transitions. Word has length 164 [2024-10-11 11:10:12,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:10:12,865 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 119 transitions. [2024-10-11 11:10:12,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 11:10:12,865 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 119 transitions. [2024-10-11 11:10:12,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-11 11:10:12,870 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:10:12,870 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:10:12,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:10:12,871 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:10:12,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:10:12,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1402281968, now seen corresponding path program 1 times [2024-10-11 11:10:12,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:10:12,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132651261] [2024-10-11 11:10:12,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:10:12,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:10:12,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:13,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:10:13,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:13,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 11:10:13,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:13,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 11:10:13,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:13,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 11:10:13,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:13,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 11:10:13,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:13,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 11:10:13,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:13,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 11:10:13,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:13,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 11:10:13,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:13,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 11:10:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:13,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 11:10:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:13,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 11:10:13,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:13,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 11:10:13,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:13,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 11:10:13,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:13,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 11:10:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:13,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 11:10:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:13,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 11:10:13,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:13,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 11:10:13,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:13,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 11:10:13,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:13,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 11:10:13,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:13,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 11:10:13,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:13,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 11:10:13,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:13,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 11:10:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:13,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 11:10:13,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:13,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 11:10:13,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:13,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 11:10:13,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:13,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 11:10:13,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:10:13,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132651261] [2024-10-11 11:10:13,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132651261] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:10:13,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:10:13,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:10:13,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587965439] [2024-10-11 11:10:13,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:10:13,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:10:13,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:10:13,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:10:13,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:10:13,443 INFO L87 Difference]: Start difference. First operand 76 states and 119 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 11:10:13,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:10:13,663 INFO L93 Difference]: Finished difference Result 226 states and 355 transitions. [2024-10-11 11:10:13,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:10:13,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 164 [2024-10-11 11:10:13,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:10:13,668 INFO L225 Difference]: With dead ends: 226 [2024-10-11 11:10:13,668 INFO L226 Difference]: Without dead ends: 151 [2024-10-11 11:10:13,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 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-11 11:10:13,675 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 65 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:10:13,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 299 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 11:10:13,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-11 11:10:13,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2024-10-11 11:10:13,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-11 11:10:13,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 233 transitions. [2024-10-11 11:10:13,722 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 233 transitions. Word has length 164 [2024-10-11 11:10:13,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:10:13,723 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 233 transitions. [2024-10-11 11:10:13,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 11:10:13,726 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 233 transitions. [2024-10-11 11:10:13,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-11 11:10:13,731 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:10:13,731 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:10:13,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 11:10:13,732 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:10:13,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:10:13,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1447204294, now seen corresponding path program 1 times [2024-10-11 11:10:13,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:10:13,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572935789] [2024-10-11 11:10:13,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:10:13,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:10:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:14,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:10:14,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:14,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 11:10:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:14,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 11:10:14,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:14,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 11:10:14,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:14,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 11:10:14,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:14,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 11:10:14,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:14,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 11:10:14,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:14,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 11:10:14,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:14,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 11:10:14,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:14,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 11:10:14,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:14,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 11:10:14,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:14,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 11:10:14,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:14,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 11:10:14,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:14,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 11:10:14,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:14,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 11:10:14,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:14,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 11:10:14,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:14,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 11:10:14,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:14,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 11:10:14,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:14,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 11:10:14,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:14,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 11:10:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:14,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 11:10:14,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:14,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 11:10:14,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:14,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 11:10:14,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:14,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 11:10:14,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:14,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 11:10:14,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:14,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 27 proven. 45 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-11 11:10:14,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:10:14,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572935789] [2024-10-11 11:10:14,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572935789] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:10:14,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983710350] [2024-10-11 11:10:14,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:10:14,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:10:14,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:10:14,795 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:10:14,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 11:10:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:14,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 11:10:14,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:10:15,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 582 proven. 45 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2024-10-11 11:10:15,280 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:10:15,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 27 proven. 45 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-11 11:10:15,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983710350] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 11:10:15,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 11:10:15,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 11 [2024-10-11 11:10:15,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042861610] [2024-10-11 11:10:15,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 11:10:15,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 11:10:15,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:10:15,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 11:10:15,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-10-11 11:10:15,566 INFO L87 Difference]: Start difference. First operand 148 states and 233 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2024-10-11 11:10:16,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:10:16,230 INFO L93 Difference]: Finished difference Result 447 states and 672 transitions. [2024-10-11 11:10:16,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 11:10:16,231 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) Word has length 165 [2024-10-11 11:10:16,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:10:16,235 INFO L225 Difference]: With dead ends: 447 [2024-10-11 11:10:16,235 INFO L226 Difference]: Without dead ends: 300 [2024-10-11 11:10:16,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 377 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2024-10-11 11:10:16,237 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 229 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 11:10:16,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 369 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 11:10:16,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-10-11 11:10:16,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 236. [2024-10-11 11:10:16,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 163 states have (on average 1.2883435582822085) internal successors, (210), 165 states have internal predecessors, (210), 66 states have call successors, (66), 6 states have call predecessors, (66), 6 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-11 11:10:16,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 342 transitions. [2024-10-11 11:10:16,282 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 342 transitions. Word has length 165 [2024-10-11 11:10:16,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:10:16,283 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 342 transitions. [2024-10-11 11:10:16,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2024-10-11 11:10:16,298 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 342 transitions. [2024-10-11 11:10:16,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 11:10:16,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:10:16,301 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:10:16,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 11:10:16,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:10:16,505 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:10:16,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:10:16,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1448360249, now seen corresponding path program 1 times [2024-10-11 11:10:16,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:10:16,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859130353] [2024-10-11 11:10:16,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:10:16,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:10:16,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 11:10:16,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1949632580] [2024-10-11 11:10:16,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:10:16,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:10:16,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:10:16,634 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:10:16,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 11:10:16,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:16,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-11 11:10:16,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:10:19,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 726 proven. 45 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2024-10-11 11:10:19,002 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:10:19,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:10:19,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859130353] [2024-10-11 11:10:19,900 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 11:10:19,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949632580] [2024-10-11 11:10:19,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949632580] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:10:19,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 11:10:19,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2024-10-11 11:10:19,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091299572] [2024-10-11 11:10:19,901 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 11:10:19,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 11:10:19,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:10:19,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 11:10:19,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2024-10-11 11:10:19,903 INFO L87 Difference]: Start difference. First operand 236 states and 342 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 3 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2024-10-11 11:10:22,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:10:22,078 INFO L93 Difference]: Finished difference Result 877 states and 1244 transitions. [2024-10-11 11:10:22,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-11 11:10:22,079 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 3 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 166 [2024-10-11 11:10:22,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:10:22,087 INFO L225 Difference]: With dead ends: 877 [2024-10-11 11:10:22,087 INFO L226 Difference]: Without dead ends: 758 [2024-10-11 11:10:22,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=389, Invalid=1417, Unknown=0, NotChecked=0, Total=1806 [2024-10-11 11:10:22,091 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 559 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 1364 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 1518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 1364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 11:10:22,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 1266 Invalid, 1518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 1364 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 11:10:22,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2024-10-11 11:10:22,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 396. [2024-10-11 11:10:22,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 266 states have (on average 1.2857142857142858) internal successors, (342), 269 states have internal predecessors, (342), 116 states have call successors, (116), 13 states have call predecessors, (116), 13 states have return successors, (116), 113 states have call predecessors, (116), 116 states have call successors, (116) [2024-10-11 11:10:22,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 574 transitions. [2024-10-11 11:10:22,167 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 574 transitions. Word has length 166 [2024-10-11 11:10:22,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:10:22,168 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 574 transitions. [2024-10-11 11:10:22,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 3 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2024-10-11 11:10:22,169 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 574 transitions. [2024-10-11 11:10:22,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 11:10:22,171 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:10:22,171 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:10:22,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 11:10:22,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:10:22,372 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:10:22,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:10:22,373 INFO L85 PathProgramCache]: Analyzing trace with hash 998074937, now seen corresponding path program 1 times [2024-10-11 11:10:22,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:10:22,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270578295] [2024-10-11 11:10:22,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:10:22,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:10:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 11:10:22,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2076943650] [2024-10-11 11:10:22,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:10:22,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:10:22,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:10:22,465 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:10:22,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 11:10:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:22,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 11:10:22,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:10:22,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 11:10:22,696 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:10:22,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:10:22,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270578295] [2024-10-11 11:10:22,698 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 11:10:22,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076943650] [2024-10-11 11:10:22,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076943650] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:10:22,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:10:22,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 11:10:22,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214904381] [2024-10-11 11:10:22,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:10:22,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 11:10:22,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:10:22,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 11:10:22,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 11:10:22,703 INFO L87 Difference]: Start difference. First operand 396 states and 574 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 11:10:23,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:10:23,115 INFO L93 Difference]: Finished difference Result 713 states and 1036 transitions. [2024-10-11 11:10:23,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 11:10:23,116 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 166 [2024-10-11 11:10:23,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:10:23,120 INFO L225 Difference]: With dead ends: 713 [2024-10-11 11:10:23,120 INFO L226 Difference]: Without dead ends: 594 [2024-10-11 11:10:23,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-11 11:10:23,122 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 233 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 11:10:23,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 643 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 11:10:23,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2024-10-11 11:10:23,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 581. [2024-10-11 11:10:23,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 387 states have (on average 1.268733850129199) internal successors, (491), 392 states have internal predecessors, (491), 174 states have call successors, (174), 19 states have call predecessors, (174), 19 states have return successors, (174), 169 states have call predecessors, (174), 174 states have call successors, (174) [2024-10-11 11:10:23,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 839 transitions. [2024-10-11 11:10:23,200 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 839 transitions. Word has length 166 [2024-10-11 11:10:23,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:10:23,201 INFO L471 AbstractCegarLoop]: Abstraction has 581 states and 839 transitions. [2024-10-11 11:10:23,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 11:10:23,201 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 839 transitions. [2024-10-11 11:10:23,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 11:10:23,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:10:23,203 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:10:23,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 11:10:23,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:10:23,404 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:10:23,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:10:23,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1279148748, now seen corresponding path program 1 times [2024-10-11 11:10:23,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:10:23,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787599769] [2024-10-11 11:10:23,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:10:23,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:10:23,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 11:10:23,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1111208996] [2024-10-11 11:10:23,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:10:23,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:10:23,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:10:23,499 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:10:23,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 11:10:23,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:23,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 11:10:23,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:10:25,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 582 proven. 45 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2024-10-11 11:10:25,091 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:10:25,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:10:25,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787599769] [2024-10-11 11:10:25,624 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 11:10:25,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111208996] [2024-10-11 11:10:25,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111208996] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:10:25,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 11:10:25,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2024-10-11 11:10:25,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143724608] [2024-10-11 11:10:25,624 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 11:10:25,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 11:10:25,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:10:25,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 11:10:25,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2024-10-11 11:10:25,626 INFO L87 Difference]: Start difference. First operand 581 states and 839 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 11:10:27,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:10:27,317 INFO L93 Difference]: Finished difference Result 1213 states and 1741 transitions. [2024-10-11 11:10:27,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-11 11:10:27,318 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 166 [2024-10-11 11:10:27,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:10:27,324 INFO L225 Difference]: With dead ends: 1213 [2024-10-11 11:10:27,324 INFO L226 Difference]: Without dead ends: 862 [2024-10-11 11:10:27,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=500, Invalid=1392, Unknown=0, NotChecked=0, Total=1892 [2024-10-11 11:10:27,327 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 410 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 1399 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 1521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:10:27,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 1046 Invalid, 1521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1399 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 11:10:27,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2024-10-11 11:10:27,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 720. [2024-10-11 11:10:27,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 470 states have (on average 1.2468085106382978) internal successors, (586), 476 states have internal predecessors, (586), 224 states have call successors, (224), 25 states have call predecessors, (224), 25 states have return successors, (224), 218 states have call predecessors, (224), 224 states have call successors, (224) [2024-10-11 11:10:27,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1034 transitions. [2024-10-11 11:10:27,427 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1034 transitions. Word has length 166 [2024-10-11 11:10:27,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:10:27,428 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 1034 transitions. [2024-10-11 11:10:27,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 11:10:27,428 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1034 transitions. [2024-10-11 11:10:27,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 11:10:27,430 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:10:27,430 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:10:27,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 11:10:27,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-11 11:10:27,631 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:10:27,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:10:27,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1729434060, now seen corresponding path program 1 times [2024-10-11 11:10:27,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:10:27,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761268314] [2024-10-11 11:10:27,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:10:27,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:10:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 11:10:27,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1305243278] [2024-10-11 11:10:27,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:10:27,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:10:27,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:10:27,751 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:10:27,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 11:10:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:27,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 11:10:27,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:10:28,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 11:10:28,156 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:10:28,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:10:28,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761268314] [2024-10-11 11:10:28,156 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 11:10:28,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305243278] [2024-10-11 11:10:28,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305243278] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:10:28,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:10:28,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:10:28,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909460135] [2024-10-11 11:10:28,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:10:28,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 11:10:28,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:10:28,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 11:10:28,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:10:28,159 INFO L87 Difference]: Start difference. First operand 720 states and 1034 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 11:10:28,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:10:28,408 INFO L93 Difference]: Finished difference Result 1084 states and 1565 transitions. [2024-10-11 11:10:28,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 11:10:28,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 166 [2024-10-11 11:10:28,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:10:28,415 INFO L225 Difference]: With dead ends: 1084 [2024-10-11 11:10:28,415 INFO L226 Difference]: Without dead ends: 733 [2024-10-11 11:10:28,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 11:10:28,417 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 103 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:10:28,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 547 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 11:10:28,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2024-10-11 11:10:28,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 720. [2024-10-11 11:10:28,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 470 states have (on average 1.2425531914893617) internal successors, (584), 476 states have internal predecessors, (584), 224 states have call successors, (224), 25 states have call predecessors, (224), 25 states have return successors, (224), 218 states have call predecessors, (224), 224 states have call successors, (224) [2024-10-11 11:10:28,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1032 transitions. [2024-10-11 11:10:28,511 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1032 transitions. Word has length 166 [2024-10-11 11:10:28,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:10:28,512 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 1032 transitions. [2024-10-11 11:10:28,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 11:10:28,512 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1032 transitions. [2024-10-11 11:10:28,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-11 11:10:28,514 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:10:28,514 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:10:28,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 11:10:28,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:10:28,715 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:10:28,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:10:28,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1948826982, now seen corresponding path program 1 times [2024-10-11 11:10:28,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:10:28,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814323618] [2024-10-11 11:10:28,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:10:28,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:10:28,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 11:10:28,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [882921390] [2024-10-11 11:10:28,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:10:28,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:10:28,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:10:28,795 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:10:28,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 11:10:28,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:10:28,973 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 11:10:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:10:29,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 11:10:29,150 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 11:10:29,151 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 11:10:29,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 11:10:29,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-11 11:10:29,357 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:10:29,502 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 11:10:29,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:10:29 BoogieIcfgContainer [2024-10-11 11:10:29,505 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 11:10:29,508 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 11:10:29,508 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 11:10:29,508 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 11:10:29,509 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:10:12" (3/4) ... [2024-10-11 11:10:29,511 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 11:10:29,513 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 11:10:29,513 INFO L158 Benchmark]: Toolchain (without parser) took 18661.43ms. Allocated memory was 161.5MB in the beginning and 362.8MB in the end (delta: 201.3MB). Free memory was 128.3MB in the beginning and 289.8MB in the end (delta: -161.5MB). Peak memory consumption was 40.1MB. Max. memory is 16.1GB. [2024-10-11 11:10:29,514 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 76.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:10:29,514 INFO L158 Benchmark]: CACSL2BoogieTranslator took 441.19ms. Allocated memory is still 161.5MB. Free memory was 128.3MB in the beginning and 110.7MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 11:10:29,514 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.18ms. Allocated memory is still 161.5MB. Free memory was 110.7MB in the beginning and 107.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 11:10:29,515 INFO L158 Benchmark]: Boogie Preprocessor took 75.24ms. Allocated memory is still 161.5MB. Free memory was 107.6MB in the beginning and 103.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 11:10:29,515 INFO L158 Benchmark]: RCFGBuilder took 624.85ms. Allocated memory is still 161.5MB. Free memory was 103.4MB in the beginning and 107.5MB in the end (delta: -4.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 11:10:29,515 INFO L158 Benchmark]: TraceAbstraction took 17455.36ms. Allocated memory was 161.5MB in the beginning and 362.8MB in the end (delta: 201.3MB). Free memory was 106.4MB in the beginning and 290.8MB in the end (delta: -184.4MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. [2024-10-11 11:10:29,516 INFO L158 Benchmark]: Witness Printer took 5.02ms. Allocated memory is still 362.8MB. Free memory was 290.8MB in the beginning and 289.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 11:10:29,518 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.16ms. Allocated memory is still 104.9MB. Free memory is still 76.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 441.19ms. Allocated memory is still 161.5MB. Free memory was 128.3MB in the beginning and 110.7MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.18ms. Allocated memory is still 161.5MB. Free memory was 110.7MB in the beginning and 107.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.24ms. Allocated memory is still 161.5MB. Free memory was 107.6MB in the beginning and 103.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 624.85ms. Allocated memory is still 161.5MB. Free memory was 103.4MB in the beginning and 107.5MB in the end (delta: -4.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 17455.36ms. Allocated memory was 161.5MB in the beginning and 362.8MB in the end (delta: 201.3MB). Free memory was 106.4MB in the beginning and 290.8MB in the end (delta: -184.4MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. * Witness Printer took 5.02ms. Allocated memory is still 362.8MB. Free memory was 290.8MB in the beginning and 289.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 199, overapproximation of someBinaryArithmeticFLOAToperation at line 109. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -8; [L23] float var_1_2 = 1.5; [L24] float var_1_3 = 24.7; [L25] float var_1_8 = 0.875; [L26] float var_1_9 = 31.875; [L27] float var_1_10 = 255.25; [L28] float var_1_11 = 0.0; [L29] float var_1_12 = 7.58; [L30] float var_1_13 = 8.6; [L31] float var_1_14 = 49.75; [L32] signed short int var_1_16 = -64; [L33] signed long int var_1_18 = 4; [L34] signed long int var_1_19 = 100; [L35] unsigned char var_1_21 = 0; [L36] unsigned char var_1_23 = 0; [L37] signed char var_1_24 = 16; [L38] signed short int var_1_26 = -1; [L39] signed char var_1_27 = -32; [L40] unsigned char var_1_28 = 1; [L41] signed long int var_1_29 = -4; [L42] signed short int var_1_31 = 1000; [L43] signed long int var_1_32 = 4; [L44] signed short int var_1_33 = 8; [L45] signed short int var_1_34 = 25; [L46] signed short int var_1_35 = 100; [L47] signed short int var_1_36 = 10000; [L48] float var_1_38 = 2.125; [L49] signed long int var_1_39 = -1000000; [L50] signed long int last_1_var_1_1 = -8; [L51] float last_1_var_1_8 = 0.875; [L52] signed short int last_1_var_1_16 = -64; [L53] signed long int last_1_var_1_18 = 4; [L54] signed long int last_1_var_1_19 = 100; [L55] signed char last_1_var_1_24 = 16; [L56] signed long int last_1_var_1_29 = -4; [L57] signed short int last_1_var_1_31 = 1000; [L58] signed long int last_1_var_1_39 = -1000000; [L203] isInitial = 1 [L204] FCALL initially() [L205] int k_loop; [L206] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_2=3/2, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_3=247/10, var_1_8=7/8, var_1_9=255/8] [L206] COND TRUE k_loop < 1 [L207] CALL updateLastVariables() [L188] last_1_var_1_1 = var_1_1 [L189] last_1_var_1_8 = var_1_8 [L190] last_1_var_1_16 = var_1_16 [L191] last_1_var_1_18 = var_1_18 [L192] last_1_var_1_19 = var_1_19 [L193] last_1_var_1_24 = var_1_24 [L194] last_1_var_1_29 = var_1_29 [L195] last_1_var_1_31 = var_1_31 [L196] last_1_var_1_39 = var_1_39 [L207] RET updateLastVariables() [L208] CALL updateVariables() [L145] var_1_2 = __VERIFIER_nondet_float() [L146] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_3=247/10, var_1_8=7/8, var_1_9=255/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_3=247/10, var_1_8=7/8, var_1_9=255/8] [L146] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_3=247/10, var_1_8=7/8, var_1_9=255/8] [L147] var_1_3 = __VERIFIER_nondet_float() [L148] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8, var_1_9=255/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8, var_1_9=255/8] [L148] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8, var_1_9=255/8] [L149] var_1_9 = __VERIFIER_nondet_float() [L150] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L150] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L151] var_1_10 = __VERIFIER_nondet_float() [L152] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L152] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L153] var_1_11 = __VERIFIER_nondet_float() [L154] CALL assume_abort_if_not((var_1_11 >= 6917529.027641073700e+12F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L154] RET assume_abort_if_not((var_1_11 >= 6917529.027641073700e+12F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L155] var_1_12 = __VERIFIER_nondet_float() [L156] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 2305843.009213691390e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L156] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 2305843.009213691390e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L157] var_1_13 = __VERIFIER_nondet_float() [L158] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 2305843.009213691390e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L158] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 2305843.009213691390e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L159] var_1_14 = __VERIFIER_nondet_float() [L160] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L160] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L161] var_1_23 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L162] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L163] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L163] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L164] var_1_26 = __VERIFIER_nondet_short() [L165] CALL assume_abort_if_not(var_1_26 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L165] RET assume_abort_if_not(var_1_26 >= -32768) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L166] CALL assume_abort_if_not(var_1_26 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L166] RET assume_abort_if_not(var_1_26 <= 32767) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L167] CALL assume_abort_if_not(var_1_26 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L167] RET assume_abort_if_not(var_1_26 != 0) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L168] var_1_27 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_27 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L169] RET assume_abort_if_not(var_1_27 >= -127) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L170] CALL assume_abort_if_not(var_1_27 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L170] RET assume_abort_if_not(var_1_27 <= 126) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L171] var_1_32 = __VERIFIER_nondet_long() [L172] CALL assume_abort_if_not(var_1_32 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L172] RET assume_abort_if_not(var_1_32 >= -1) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L173] CALL assume_abort_if_not(var_1_32 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L173] RET assume_abort_if_not(var_1_32 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L174] var_1_33 = __VERIFIER_nondet_short() [L175] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=888, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=888, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L175] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=888, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L176] CALL assume_abort_if_not(var_1_33 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=888, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=888, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L176] RET assume_abort_if_not(var_1_33 <= 16383) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=888, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L177] var_1_34 = __VERIFIER_nondet_short() [L178] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=888, var_1_34=0, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=888, var_1_34=0, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L178] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=888, var_1_34=0, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L179] CALL assume_abort_if_not(var_1_34 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=888, var_1_34=0, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=888, var_1_34=0, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L179] RET assume_abort_if_not(var_1_34 <= 16383) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=888, var_1_34=0, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L180] var_1_35 = __VERIFIER_nondet_short() [L181] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=888, var_1_34=0, var_1_35=0, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=888, var_1_34=0, var_1_35=0, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L181] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=888, var_1_34=0, var_1_35=0, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L182] CALL assume_abort_if_not(var_1_35 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=888, var_1_34=0, var_1_35=0, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=888, var_1_34=0, var_1_35=0, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L182] RET assume_abort_if_not(var_1_35 <= 32766) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=888, var_1_34=0, var_1_35=0, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L183] var_1_36 = __VERIFIER_nondet_short() [L184] CALL assume_abort_if_not(var_1_36 >= 8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=888, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=888, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L184] RET assume_abort_if_not(var_1_36 >= 8191) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=888, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L185] CALL assume_abort_if_not(var_1_36 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=888, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=888, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L185] RET assume_abort_if_not(var_1_36 <= 16383) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=888, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L208] RET updateVariables() [L209] CALL step() [L62] COND TRUE (var_1_2 - var_1_3) >= last_1_var_1_8 [L63] var_1_1 = ((last_1_var_1_24 + last_1_var_1_31) + last_1_var_1_16) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=888, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L67] signed long int stepLocal_6 = -5; [L68] signed long int stepLocal_5 = last_1_var_1_1; [L69] signed long int stepLocal_4 = (var_1_32 - 4) * last_1_var_1_24; VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_4=-64, stepLocal_5=-8, stepLocal_6=-5, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=888, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L70] COND TRUE stepLocal_5 <= (last_1_var_1_18 * var_1_27) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_4=-64, stepLocal_6=-5, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=888, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L71] COND TRUE ((((last_1_var_1_18) < (last_1_var_1_16)) ? (last_1_var_1_18) : (last_1_var_1_16))) == stepLocal_4 [L72] var_1_31 = ((var_1_33 + var_1_34) - var_1_35) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=888, var_1_32=0, var_1_33=888, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L83] COND TRUE ((var_1_13 * var_1_12) * var_1_3) != (var_1_14 + last_1_var_1_8) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=888, var_1_32=0, var_1_33=888, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L84] COND TRUE last_1_var_1_29 >= (last_1_var_1_19 / var_1_26) [L85] var_1_24 = var_1_27 VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=64, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=888, var_1_32=0, var_1_33=888, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L90] COND FALSE !((((((var_1_2 * var_1_10)) > (var_1_11)) ? ((var_1_2 * var_1_10)) : (var_1_11))) > var_1_9) [L97] var_1_16 = var_1_24 VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=64, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=64, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=888, var_1_32=0, var_1_33=888, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L99] COND TRUE var_1_35 <= var_1_27 [L100] var_1_38 = var_1_9 VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=64, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=64, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=888, var_1_32=0, var_1_33=888, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=2, var_1_39=-1000000, var_1_8=7/8, var_1_9=2] [L104] COND TRUE var_1_16 <= ((var_1_31 / -128) + var_1_1) [L105] var_1_21 = var_1_23 VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=64, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=64, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=888, var_1_32=0, var_1_33=888, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=2, var_1_39=-1000000, var_1_8=7/8, var_1_9=2] [L107] signed long int stepLocal_0 = 64; VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_0=64, stepLocal_6=-5, var_1_16=64, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=64, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=888, var_1_32=0, var_1_33=888, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=2, var_1_39=-1000000, var_1_8=7/8, var_1_9=2] [L108] COND TRUE stepLocal_0 <= var_1_24 [L109] var_1_8 = (((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) - (var_1_12 + (var_1_13 + var_1_14))) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=64, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=64, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=888, var_1_32=0, var_1_33=888, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=2, var_1_39=-1000000, var_1_9=2] [L117] COND TRUE var_1_9 > var_1_13 [L118] var_1_18 = (var_1_24 + var_1_31) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=64, var_1_18=952, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=64, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=888, var_1_32=0, var_1_33=888, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=2, var_1_39=-1000000, var_1_9=2] [L120] unsigned char stepLocal_2 = (var_1_31 + var_1_24) >= var_1_1; VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_2=1, stepLocal_6=-5, var_1_16=64, var_1_18=952, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=64, var_1_26=-25, var_1_27=64, var_1_28=1, var_1_29=-4, var_1_31=888, var_1_32=0, var_1_33=888, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=2, var_1_39=-1000000, var_1_9=2] [L121] COND TRUE stepLocal_2 || var_1_23 [L122] var_1_28 = (var_1_21 && var_1_23) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=64, var_1_18=952, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=64, var_1_26=-25, var_1_27=64, var_1_28=0, var_1_29=-4, var_1_31=888, var_1_32=0, var_1_33=888, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=2, var_1_39=-1000000, var_1_9=2] [L124] COND TRUE ! var_1_21 VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=64, var_1_18=952, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=64, var_1_26=-25, var_1_27=64, var_1_28=0, var_1_29=-4, var_1_31=888, var_1_32=0, var_1_33=888, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=2, var_1_39=-1000000, var_1_9=2] [L125] COND TRUE (last_1_var_1_39 <= var_1_31) || var_1_28 [L126] var_1_39 = var_1_36 VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=64, var_1_18=952, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=64, var_1_26=-25, var_1_27=64, var_1_28=0, var_1_29=-4, var_1_31=888, var_1_32=0, var_1_33=888, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=2, var_1_39=8191, var_1_9=2] [L129] unsigned char stepLocal_1 = var_1_21; VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_1=0, stepLocal_6=-5, var_1_16=64, var_1_18=952, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=64, var_1_26=-25, var_1_27=64, var_1_28=0, var_1_29=-4, var_1_31=888, var_1_32=0, var_1_33=888, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=2, var_1_39=8191, var_1_9=2] [L130] COND FALSE !(var_1_28 || stepLocal_1) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=64, var_1_18=952, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=64, var_1_26=-25, var_1_27=64, var_1_28=0, var_1_29=-4, var_1_31=888, var_1_32=0, var_1_33=888, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=2, var_1_39=8191, var_1_9=2] [L133] signed long int stepLocal_3 = var_1_24 * (var_1_31 * var_1_16); VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_3=3637248, stepLocal_6=-5, var_1_16=64, var_1_18=952, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=64, var_1_26=-25, var_1_27=64, var_1_28=0, var_1_29=-4, var_1_31=888, var_1_32=0, var_1_33=888, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=2, var_1_39=8191, var_1_9=2] [L134] COND FALSE !(-50 == stepLocal_3) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=64, var_1_18=952, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=64, var_1_26=-25, var_1_27=64, var_1_28=0, var_1_29=-4, var_1_31=888, var_1_32=0, var_1_33=888, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=2, var_1_39=8191, var_1_9=2] [L137] COND FALSE !(\read(var_1_23)) [L140] var_1_29 = var_1_1 VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=64, var_1_18=952, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=64, var_1_26=-25, var_1_27=64, var_1_28=0, var_1_29=952, var_1_31=888, var_1_32=0, var_1_33=888, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=2, var_1_39=8191, var_1_9=2] [L209] RET step() [L210] CALL, EXPR property() [L199-L200] return (((((((((((((var_1_2 - var_1_3) >= last_1_var_1_8) ? (var_1_1 == ((signed long int) ((last_1_var_1_24 + last_1_var_1_31) + last_1_var_1_16))) : (var_1_1 == ((signed long int) last_1_var_1_16))) && ((64 <= var_1_24) ? (var_1_8 == ((float) (((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) - (var_1_12 + (var_1_13 + var_1_14))))) : (var_1_21 ? (var_1_8 == ((float) (((((((var_1_13) > (var_1_11)) ? (var_1_13) : (var_1_11))) < 0 ) ? -((((var_1_13) > (var_1_11)) ? (var_1_13) : (var_1_11))) : ((((var_1_13) > (var_1_11)) ? (var_1_13) : (var_1_11))))))) : (var_1_8 == ((float) (var_1_12 - 2.125f)))))) && (((((((var_1_2 * var_1_10)) > (var_1_11)) ? ((var_1_2 * var_1_10)) : (var_1_11))) > var_1_9) ? ((var_1_13 != var_1_2) ? (var_1_16 == ((signed short int) var_1_24)) : (var_1_16 == ((signed short int) var_1_24))) : (var_1_16 == ((signed short int) var_1_24)))) && ((var_1_9 > var_1_13) ? (var_1_18 == ((signed long int) (var_1_24 + var_1_31))) : 1)) && ((var_1_28 || var_1_21) ? (var_1_19 == ((signed long int) (((((var_1_31 + var_1_24)) > ((-8 + var_1_18))) ? ((var_1_31 + var_1_24)) : ((-8 + var_1_18)))))) : 1)) && ((var_1_16 <= ((var_1_31 / -128) + var_1_1)) ? (var_1_21 == ((unsigned char) var_1_23)) : 1)) && ((((var_1_13 * var_1_12) * var_1_3) != (var_1_14 + last_1_var_1_8)) ? ((last_1_var_1_29 >= (last_1_var_1_19 / var_1_26)) ? (var_1_24 == ((signed char) var_1_27)) : (var_1_24 == ((signed char) var_1_27))) : 1)) && ((((var_1_31 + var_1_24) >= var_1_1) || var_1_23) ? (var_1_28 == ((unsigned char) (var_1_21 && var_1_23))) : 1)) && ((-50 == (var_1_24 * (var_1_31 * var_1_16))) ? (var_1_29 == ((signed long int) ((((-500) < (var_1_18)) ? (-500) : (var_1_18))))) : (var_1_23 ? (var_1_29 == ((signed long int) var_1_1)) : (var_1_29 == ((signed long int) var_1_1))))) && ((last_1_var_1_1 <= (last_1_var_1_18 * var_1_27)) ? ((((((last_1_var_1_18) < (last_1_var_1_16)) ? (last_1_var_1_18) : (last_1_var_1_16))) == ((var_1_32 - 4) * last_1_var_1_24)) ? (var_1_31 == ((signed short int) ((var_1_33 + var_1_34) - var_1_35))) : (var_1_31 == ((signed short int) (((var_1_36 - 1) - var_1_33) + var_1_34)))) : ((-5 <= last_1_var_1_39) ? (var_1_31 == ((signed short int) var_1_27)) : (var_1_31 == ((signed short int) last_1_var_1_24))))) && ((var_1_35 <= var_1_27) ? (var_1_38 == ((float) var_1_9)) : (var_1_38 == ((float) (((((((var_1_13 - var_1_9) < 0 ) ? -(var_1_13 - var_1_9) : (var_1_13 - var_1_9))) < 0 ) ? -((((var_1_13 - var_1_9) < 0 ) ? -(var_1_13 - var_1_9) : (var_1_13 - var_1_9))) : ((((var_1_13 - var_1_9) < 0 ) ? -(var_1_13 - var_1_9) : (var_1_13 - var_1_9))))))))) && ((! var_1_21) ? (((last_1_var_1_39 <= var_1_31) || var_1_28) ? (var_1_39 == ((signed long int) var_1_36)) : 1) : 1) ; [L210] RET, EXPR property() [L210] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=64, var_1_18=952, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=64, var_1_26=-25, var_1_27=64, var_1_28=0, var_1_29=952, var_1_31=888, var_1_32=0, var_1_33=888, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=2, var_1_39=8191, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=64, var_1_18=952, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=64, var_1_26=-25, var_1_27=64, var_1_28=0, var_1_29=952, var_1_31=888, var_1_32=0, var_1_33=888, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=2, var_1_39=8191, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.2s, OverallIterations: 8, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1609 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1599 mSDsluCounter, 4286 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3153 mSDsCounter, 414 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3663 IncrementalHoareTripleChecker+Invalid, 4077 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 414 mSolverCounterUnsat, 1133 mSDtfsCounter, 3663 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1290 GetRequests, 1171 SyntacticMatches, 2 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=720occurred in iteration=6, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 7 MinimizatonAttempts, 597 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 2320 NumberOfCodeBlocks, 2320 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1478 ConstructedInterpolants, 3 QuantifiedInterpolants, 8549 SizeOfPredicates, 34 NumberOfNonLiveVariables, 2133 ConjunctsInSsa, 73 ConjunctsInUnsatCore, 9 InterpolantComputations, 4 PerfectInterpolantSequences, 10575/10800 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 11:10:29,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-77.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0cbe4eb7aae73c01b831078f0e738c68709fa97155cdb7dce934011117170926 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:10:31,850 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:10:31,938 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 11:10:31,944 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:10:31,945 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:10:31,979 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:10:31,979 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:10:31,980 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:10:31,980 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:10:31,980 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:10:31,981 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:10:31,981 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:10:31,982 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:10:31,982 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:10:31,983 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:10:31,984 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:10:31,985 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:10:31,987 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:10:31,988 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:10:31,988 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:10:31,988 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:10:31,989 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:10:31,990 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:10:31,990 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 11:10:31,991 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 11:10:31,991 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:10:31,991 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 11:10:31,991 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:10:31,992 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:10:31,992 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:10:31,992 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:10:31,992 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:10:31,993 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:10:31,993 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:10:31,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:10:31,993 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:10:31,994 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:10:31,994 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:10:31,995 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 11:10:31,996 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 11:10:31,996 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:10:31,997 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:10:31,997 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:10:31,997 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:10:31,998 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 11:10:31,998 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0cbe4eb7aae73c01b831078f0e738c68709fa97155cdb7dce934011117170926 [2024-10-11 11:10:32,347 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:10:32,372 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:10:32,376 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:10:32,377 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:10:32,378 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:10:32,380 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-77.i [2024-10-11 11:10:33,938 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:10:34,186 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:10:34,187 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-77.i [2024-10-11 11:10:34,199 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d29daa7f4/ab16c2db982746209229ad6082e80286/FLAG543f2a9ca [2024-10-11 11:10:34,218 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d29daa7f4/ab16c2db982746209229ad6082e80286 [2024-10-11 11:10:34,221 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:10:34,223 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:10:34,225 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:10:34,226 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:10:34,232 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:10:34,232 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:10:34" (1/1) ... [2024-10-11 11:10:34,233 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76388ec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:34, skipping insertion in model container [2024-10-11 11:10:34,233 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:10:34" (1/1) ... [2024-10-11 11:10:34,269 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:10:34,471 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_loopvsstraightlinecode_100-1loop_file-77.i[916,929] [2024-10-11 11:10:34,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:10:34,596 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:10:34,609 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_loopvsstraightlinecode_100-1loop_file-77.i[916,929] [2024-10-11 11:10:34,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:10:34,693 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:10:34,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:34 WrapperNode [2024-10-11 11:10:34,694 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:10:34,696 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:10:34,696 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:10:34,696 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:10:34,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:34" (1/1) ... [2024-10-11 11:10:34,724 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:34" (1/1) ... [2024-10-11 11:10:34,767 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 208 [2024-10-11 11:10:34,770 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:10:34,771 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:10:34,771 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:10:34,771 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:10:34,784 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:34" (1/1) ... [2024-10-11 11:10:34,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:34" (1/1) ... [2024-10-11 11:10:34,794 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:34" (1/1) ... [2024-10-11 11:10:34,832 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 11:10:34,833 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:34" (1/1) ... [2024-10-11 11:10:34,833 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:34" (1/1) ... [2024-10-11 11:10:34,853 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:34" (1/1) ... [2024-10-11 11:10:34,857 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:34" (1/1) ... [2024-10-11 11:10:34,862 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:34" (1/1) ... [2024-10-11 11:10:34,868 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:34" (1/1) ... [2024-10-11 11:10:34,876 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:10:34,877 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:10:34,877 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:10:34,877 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:10:34,878 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:34" (1/1) ... [2024-10-11 11:10:34,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:10:34,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:10:34,913 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:10:34,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:10:34,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:10:34,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 11:10:34,963 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:10:34,963 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:10:34,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:10:34,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:10:35,072 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:10:35,075 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:10:46,428 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-10-11 11:10:46,429 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:10:46,508 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:10:46,509 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:10:46,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:10:46 BoogieIcfgContainer [2024-10-11 11:10:46,510 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:10:46,512 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:10:46,512 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:10:46,515 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:10:46,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:10:34" (1/3) ... [2024-10-11 11:10:46,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@474e1cdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:10:46, skipping insertion in model container [2024-10-11 11:10:46,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:34" (2/3) ... [2024-10-11 11:10:46,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@474e1cdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:10:46, skipping insertion in model container [2024-10-11 11:10:46,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:10:46" (3/3) ... [2024-10-11 11:10:46,519 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-77.i [2024-10-11 11:10:46,537 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:10:46,537 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:10:46,606 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:10:46,612 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;@3a8b0b39, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:10:46,613 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:10:46,618 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 50 states have (on average 1.48) internal successors, (74), 51 states have internal predecessors, (74), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 11:10:46,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-11 11:10:46,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:10:46,636 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:10:46,636 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:10:46,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:10:46,642 INFO L85 PathProgramCache]: Analyzing trace with hash -240178530, now seen corresponding path program 1 times [2024-10-11 11:10:46,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:10:46,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2078309264] [2024-10-11 11:10:46,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:10:46,656 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:10:46,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:10:46,688 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:10:46,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 11:10:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:47,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 11:10:47,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:10:47,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 480 proven. 0 refuted. 0 times theorem prover too weak. 720 trivial. 0 not checked. [2024-10-11 11:10:47,315 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:10:47,316 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:10:47,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2078309264] [2024-10-11 11:10:47,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2078309264] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:10:47,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:10:47,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:10:47,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559301639] [2024-10-11 11:10:47,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:10:47,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:10:47,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:10:47,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:10:47,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:10:47,359 INFO L87 Difference]: Start difference. First operand has 78 states, 50 states have (on average 1.48) internal successors, (74), 51 states have internal predecessors, (74), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 11:10:51,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:10:51,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:10:51,647 INFO L93 Difference]: Finished difference Result 155 states and 272 transitions. [2024-10-11 11:10:51,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:10:51,650 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 164 [2024-10-11 11:10:51,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:10:51,657 INFO L225 Difference]: With dead ends: 155 [2024-10-11 11:10:51,657 INFO L226 Difference]: Without dead ends: 76 [2024-10-11 11:10:51,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:10:51,666 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:10:51,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-10-11 11:10:51,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-11 11:10:51,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-11 11:10:51,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 49 states have internal predecessors, (69), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 11:10:51,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 119 transitions. [2024-10-11 11:10:51,729 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 119 transitions. Word has length 164 [2024-10-11 11:10:51,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:10:51,732 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 119 transitions. [2024-10-11 11:10:51,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 11:10:51,732 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 119 transitions. [2024-10-11 11:10:51,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-11 11:10:51,739 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:10:51,739 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:10:51,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 11:10:51,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:10:51,941 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:10:51,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:10:51,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1402281968, now seen corresponding path program 1 times [2024-10-11 11:10:51,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:10:51,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1412090140] [2024-10-11 11:10:51,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:10:51,943 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:10:51,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:10:51,946 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:10:51,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 11:10:52,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:52,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 11:10:52,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:10:54,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 11:10:54,878 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:10:54,878 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:10:54,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1412090140] [2024-10-11 11:10:54,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1412090140] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:10:54,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:10:54,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:10:54,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718597361] [2024-10-11 11:10:54,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:10:54,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:10:54,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:10:54,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:10:54,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:10:54,884 INFO L87 Difference]: Start difference. First operand 76 states and 119 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 11:11:00,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:11:04,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:11:08,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:11:12,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:11:16,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:11:16,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:11:16,918 INFO L93 Difference]: Finished difference Result 226 states and 355 transitions. [2024-10-11 11:11:16,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:11:16,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 164 [2024-10-11 11:11:16,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:11:16,928 INFO L225 Difference]: With dead ends: 226 [2024-10-11 11:11:16,928 INFO L226 Difference]: Without dead ends: 151 [2024-10-11 11:11:16,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:11:16,931 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 36 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:11:16,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 299 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 5 Unknown, 0 Unchecked, 22.0s Time] [2024-10-11 11:11:16,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-11 11:11:16,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2024-10-11 11:11:16,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-11 11:11:16,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 233 transitions. [2024-10-11 11:11:16,982 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 233 transitions. Word has length 164 [2024-10-11 11:11:16,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:11:16,983 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 233 transitions. [2024-10-11 11:11:16,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 11:11:16,983 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 233 transitions. [2024-10-11 11:11:16,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-11 11:11:16,990 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:11:16,990 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:11:17,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 11:11:17,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:11:17,191 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:11:17,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:11:17,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1447204294, now seen corresponding path program 1 times [2024-10-11 11:11:17,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:11:17,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [894984909] [2024-10-11 11:11:17,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:11:17,193 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:11:17,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:11:17,194 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:11:17,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 11:11:17,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:17,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 11:11:17,723 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:11:19,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 582 proven. 45 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2024-10-11 11:11:19,327 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:11:20,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 27 proven. 45 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-11 11:11:20,754 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:11:20,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [894984909] [2024-10-11 11:11:20,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [894984909] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 11:11:20,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 11:11:20,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-10-11 11:11:20,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78135567] [2024-10-11 11:11:20,755 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 11:11:20,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 11:11:20,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:11:20,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 11:11:20,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 11:11:20,758 INFO L87 Difference]: Start difference. First operand 148 states and 233 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2024-10-11 11:11:26,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:11:30,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:11:34,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:11:34,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:11:34,192 INFO L93 Difference]: Finished difference Result 311 states and 479 transitions. [2024-10-11 11:11:34,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 11:11:34,193 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) Word has length 165 [2024-10-11 11:11:34,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:11:34,195 INFO L225 Difference]: With dead ends: 311 [2024-10-11 11:11:34,196 INFO L226 Difference]: Without dead ends: 164 [2024-10-11 11:11:34,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 322 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2024-10-11 11:11:34,201 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 157 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 88 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:11:34,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 184 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 165 Invalid, 3 Unknown, 0 Unchecked, 13.1s Time] [2024-10-11 11:11:34,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-10-11 11:11:34,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 156. [2024-10-11 11:11:34,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 101 states have (on average 1.316831683168317) internal successors, (133), 101 states have internal predecessors, (133), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-11 11:11:34,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 233 transitions. [2024-10-11 11:11:34,242 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 233 transitions. Word has length 165 [2024-10-11 11:11:34,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:11:34,243 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 233 transitions. [2024-10-11 11:11:34,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2024-10-11 11:11:34,243 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 233 transitions. [2024-10-11 11:11:34,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 11:11:34,246 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:11:34,246 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:11:34,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-11 11:11:34,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:11:34,447 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:11:34,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:11:34,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1391101947, now seen corresponding path program 1 times [2024-10-11 11:11:34,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:11:34,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1965365698] [2024-10-11 11:11:34,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:11:34,449 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:11:34,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:11:34,451 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:11:34,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process