./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-99.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-99.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9a4594ea31ffbf6212ff96fe98d0ce3ce9979c812b849295a80843482179f790 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 16:06:51,056 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 16:06:51,151 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 16:06:51,161 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 16:06:51,161 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 16:06:51,201 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 16:06:51,202 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 16:06:51,203 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 16:06:51,203 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 16:06:51,204 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 16:06:51,205 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 16:06:51,206 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 16:06:51,206 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 16:06:51,207 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 16:06:51,208 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 16:06:51,209 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 16:06:51,209 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 16:06:51,209 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 16:06:51,210 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 16:06:51,210 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 16:06:51,210 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 16:06:51,213 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 16:06:51,213 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 16:06:51,214 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 16:06:51,214 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 16:06:51,214 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 16:06:51,214 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 16:06:51,215 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 16:06:51,215 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 16:06:51,215 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 16:06:51,216 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 16:06:51,216 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 16:06:51,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:06:51,216 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 16:06:51,216 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 16:06:51,217 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 16:06:51,217 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 16:06:51,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 16:06:51,218 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 16:06:51,218 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 16:06:51,219 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 16:06:51,219 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 16:06:51,220 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9a4594ea31ffbf6212ff96fe98d0ce3ce9979c812b849295a80843482179f790 [2024-11-16 16:06:51,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 16:06:51,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 16:06:51,503 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 16:06:51,505 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 16:06:51,505 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 16:06:51,506 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-99.i [2024-11-16 16:06:52,960 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 16:06:53,148 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 16:06:53,149 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-99.i [2024-11-16 16:06:53,159 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92f7c97d9/ec3c64bdfd7e4d348d4f7176352b97f2/FLAG7064de934 [2024-11-16 16:06:53,523 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92f7c97d9/ec3c64bdfd7e4d348d4f7176352b97f2 [2024-11-16 16:06:53,525 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 16:06:53,526 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 16:06:53,528 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 16:06:53,528 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 16:06:53,534 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 16:06:53,535 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:06:53" (1/1) ... [2024-11-16 16:06:53,535 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a80a658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:06:53, skipping insertion in model container [2024-11-16 16:06:53,536 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:06:53" (1/1) ... [2024-11-16 16:06:53,571 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 16:06:53,738 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-99.i[916,929] [2024-11-16 16:06:53,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:06:53,859 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 16:06:53,871 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-99.i[916,929] [2024-11-16 16:06:53,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:06:53,950 INFO L204 MainTranslator]: Completed translation [2024-11-16 16:06:53,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:06:53 WrapperNode [2024-11-16 16:06:53,951 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 16:06:53,952 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 16:06:53,952 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 16:06:53,952 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 16:06:53,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:06:53" (1/1) ... [2024-11-16 16:06:53,972 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:06:53" (1/1) ... [2024-11-16 16:06:54,019 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 212 [2024-11-16 16:06:54,019 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 16:06:54,020 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 16:06:54,020 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 16:06:54,020 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 16:06:54,032 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:06:53" (1/1) ... [2024-11-16 16:06:54,033 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:06:53" (1/1) ... [2024-11-16 16:06:54,039 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:06:53" (1/1) ... [2024-11-16 16:06:54,068 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 16:06:54,068 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:06:53" (1/1) ... [2024-11-16 16:06:54,068 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:06:53" (1/1) ... [2024-11-16 16:06:54,095 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:06:53" (1/1) ... [2024-11-16 16:06:54,097 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:06:53" (1/1) ... [2024-11-16 16:06:54,106 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:06:53" (1/1) ... [2024-11-16 16:06:54,115 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:06:53" (1/1) ... [2024-11-16 16:06:54,125 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 16:06:54,127 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 16:06:54,127 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 16:06:54,127 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 16:06:54,128 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:06:53" (1/1) ... [2024-11-16 16:06:54,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:06:54,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:06:54,166 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 16:06:54,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 16:06:54,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 16:06:54,216 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 16:06:54,217 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 16:06:54,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 16:06:54,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 16:06:54,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 16:06:54,321 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 16:06:54,323 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 16:06:54,770 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-16 16:06:54,771 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 16:06:54,793 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 16:06:54,794 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 16:06:54,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:06:54 BoogieIcfgContainer [2024-11-16 16:06:54,795 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 16:06:54,798 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 16:06:54,799 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 16:06:54,802 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 16:06:54,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 04:06:53" (1/3) ... [2024-11-16 16:06:54,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ee0789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:06:54, skipping insertion in model container [2024-11-16 16:06:54,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:06:53" (2/3) ... [2024-11-16 16:06:54,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ee0789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:06:54, skipping insertion in model container [2024-11-16 16:06:54,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:06:54" (3/3) ... [2024-11-16 16:06:54,806 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-99.i [2024-11-16 16:06:54,819 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 16:06:54,819 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 16:06:54,880 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 16:06:54,889 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;@17589c1f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 16:06:54,890 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 16:06:54,917 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 64 states have (on average 1.453125) internal successors, (93), 65 states have internal predecessors, (93), 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-11-16 16:06:54,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-16 16:06:54,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:06:54,941 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-11-16 16:06:54,942 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:06:54,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:06:54,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1495583437, now seen corresponding path program 1 times [2024-11-16 16:06:54,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:06:54,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182858219] [2024-11-16 16:06:54,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:06:54,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:06:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:55,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:06:55,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:55,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:06:55,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:55,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:06:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:55,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:06:55,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:55,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:06:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:55,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:06:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:55,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:06:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:55,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:06:55,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:55,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:06:55,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:55,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:06:55,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:55,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:06:55,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:55,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:06:55,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:55,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:06:55,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:55,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 16:06:55,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:55,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 16:06:55,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:55,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 16:06:55,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:55,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 16:06:55,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:55,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 16:06:55,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:55,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 16:06:55,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:55,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-16 16:06:55,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:55,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 16:06:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:55,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-16 16:06:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:55,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 16:06:55,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:55,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-16 16:06:55,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:55,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 16:06:55,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:55,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-16 16:06:55,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:06:55,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182858219] [2024-11-16 16:06:55,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182858219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:06:55,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:06:55,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 16:06:55,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173896649] [2024-11-16 16:06:55,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:06:55,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 16:06:55,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:06:55,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 16:06:55,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 16:06:55,488 INFO L87 Difference]: Start difference. First operand has 92 states, 64 states have (on average 1.453125) internal successors, (93), 65 states have internal predecessors, (93), 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 22.5) internal successors, (45), 2 states have internal predecessors, (45), 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-11-16 16:06:55,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:06:55,528 INFO L93 Difference]: Finished difference Result 180 states and 307 transitions. [2024-11-16 16:06:55,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 16:06:55,531 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (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 167 [2024-11-16 16:06:55,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:06:55,541 INFO L225 Difference]: With dead ends: 180 [2024-11-16 16:06:55,543 INFO L226 Difference]: Without dead ends: 87 [2024-11-16 16:06:55,549 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-11-16 16:06:55,554 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 16:06:55,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:06:55,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-16 16:06:55,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-16 16:06:55,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 60 states have (on average 1.4) internal successors, (84), 60 states have internal predecessors, (84), 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-11-16 16:06:55,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 134 transitions. [2024-11-16 16:06:55,617 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 134 transitions. Word has length 167 [2024-11-16 16:06:55,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:06:55,618 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 134 transitions. [2024-11-16 16:06:55,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (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-11-16 16:06:55,618 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 134 transitions. [2024-11-16 16:06:55,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-16 16:06:55,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:06:55,622 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, 1] [2024-11-16 16:06:55,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 16:06:55,623 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:06:55,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:06:55,624 INFO L85 PathProgramCache]: Analyzing trace with hash 260880510, now seen corresponding path program 1 times [2024-11-16 16:06:55,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:06:55,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978241973] [2024-11-16 16:06:55,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:06:55,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:06:55,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:56,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:06:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:56,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:06:56,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:56,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:06:56,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:56,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:06:56,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:56,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:06:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:56,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:06:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:56,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:06:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:56,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:06:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:56,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:06:56,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:56,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:06:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:56,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:06:56,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:56,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:06:56,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:56,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:06:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:56,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 16:06:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:56,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 16:06:56,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:56,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 16:06:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:56,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 16:06:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:56,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 16:06:56,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:56,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 16:06:56,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:56,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-16 16:06:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:56,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 16:06:56,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:56,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-16 16:06:56,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:56,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 16:06:56,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:56,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-16 16:06:56,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:56,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 16:06:56,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:56,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-16 16:06:56,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:06:56,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978241973] [2024-11-16 16:06:56,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978241973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:06:56,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:06:56,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 16:06:56,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320402555] [2024-11-16 16:06:56,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:06:56,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 16:06:56,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:06:56,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 16:06:56,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 16:06:56,437 INFO L87 Difference]: Start difference. First operand 87 states and 134 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (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-11-16 16:06:56,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:06:56,551 INFO L93 Difference]: Finished difference Result 255 states and 396 transitions. [2024-11-16 16:06:56,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 16:06:56,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (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 168 [2024-11-16 16:06:56,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:06:56,555 INFO L225 Difference]: With dead ends: 255 [2024-11-16 16:06:56,555 INFO L226 Difference]: Without dead ends: 171 [2024-11-16 16:06:56,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 16:06:56,560 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 71 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 16:06:56,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 263 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:06:56,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-16 16:06:56,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 168. [2024-11-16 16:06:56,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 115 states have (on average 1.4) internal successors, (161), 115 states have internal predecessors, (161), 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-11-16 16:06:56,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 261 transitions. [2024-11-16 16:06:56,609 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 261 transitions. Word has length 168 [2024-11-16 16:06:56,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:06:56,611 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 261 transitions. [2024-11-16 16:06:56,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (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-11-16 16:06:56,612 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 261 transitions. [2024-11-16 16:06:56,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-16 16:06:56,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:06:56,615 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, 1, 1] [2024-11-16 16:06:56,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 16:06:56,616 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:06:56,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:06:56,617 INFO L85 PathProgramCache]: Analyzing trace with hash 769794031, now seen corresponding path program 1 times [2024-11-16 16:06:56,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:06:56,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668548796] [2024-11-16 16:06:56,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:06:56,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:06:56,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:06:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:06:57,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:06:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:06:57,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:06:57,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:06:57,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:06:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:06:57,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:06:57,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:06:57,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:06:57,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:06:57,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:06:57,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 16:06:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 16:06:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 16:06:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 16:06:57,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 16:06:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 16:06:57,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-16 16:06:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 16:06:57,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-16 16:06:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 16:06:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-16 16:06:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 16:06:57,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-16 16:06:57,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:06:57,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668548796] [2024-11-16 16:06:57,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668548796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:06:57,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:06:57,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 16:06:57,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828535123] [2024-11-16 16:06:57,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:06:57,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 16:06:57,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:06:57,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 16:06:57,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 16:06:57,302 INFO L87 Difference]: Start difference. First operand 168 states and 261 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-11-16 16:06:57,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:06:57,660 INFO L93 Difference]: Finished difference Result 442 states and 686 transitions. [2024-11-16 16:06:57,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 16:06:57,661 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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 169 [2024-11-16 16:06:57,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:06:57,665 INFO L225 Difference]: With dead ends: 442 [2024-11-16 16:06:57,668 INFO L226 Difference]: Without dead ends: 277 [2024-11-16 16:06:57,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 16:06:57,670 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 105 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 16:06:57,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 456 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 16:06:57,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-16 16:06:57,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 216. [2024-11-16 16:06:57,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 137 states have (on average 1.3357664233576643) internal successors, (183), 137 states have internal predecessors, (183), 75 states have call successors, (75), 3 states have call predecessors, (75), 3 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2024-11-16 16:06:57,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 333 transitions. [2024-11-16 16:06:57,725 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 333 transitions. Word has length 169 [2024-11-16 16:06:57,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:06:57,725 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 333 transitions. [2024-11-16 16:06:57,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-11-16 16:06:57,726 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 333 transitions. [2024-11-16 16:06:57,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-16 16:06:57,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:06:57,728 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, 1, 1, 1] [2024-11-16 16:06:57,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 16:06:57,729 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:06:57,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:06:57,729 INFO L85 PathProgramCache]: Analyzing trace with hash 775119168, now seen corresponding path program 1 times [2024-11-16 16:06:57,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:06:57,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204113061] [2024-11-16 16:06:57,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:06:57,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:06:57,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:06:57,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:06:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:06:57,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:06:57,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:06:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:06:57,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:06:57,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:06:57,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:06:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:06:57,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:06:57,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:06:57,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:06:57,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 16:06:57,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 16:06:57,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 16:06:57,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 16:06:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 16:06:57,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 16:06:57,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-16 16:06:57,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 16:06:57,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-16 16:06:57,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 16:06:57,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-16 16:06:57,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 16:06:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:57,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-16 16:06:57,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:06:57,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204113061] [2024-11-16 16:06:57,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204113061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:06:57,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:06:57,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 16:06:57,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431483304] [2024-11-16 16:06:57,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:06:57,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 16:06:57,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:06:57,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 16:06:57,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 16:06:57,974 INFO L87 Difference]: Start difference. First operand 216 states and 333 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (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-11-16 16:06:58,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:06:58,160 INFO L93 Difference]: Finished difference Result 442 states and 685 transitions. [2024-11-16 16:06:58,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 16:06:58,161 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (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 170 [2024-11-16 16:06:58,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:06:58,166 INFO L225 Difference]: With dead ends: 442 [2024-11-16 16:06:58,167 INFO L226 Difference]: Without dead ends: 277 [2024-11-16 16:06:58,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 16:06:58,169 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 103 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 16:06:58,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 511 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 16:06:58,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-16 16:06:58,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 217. [2024-11-16 16:06:58,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 138 states have (on average 1.3333333333333333) internal successors, (184), 138 states have internal predecessors, (184), 75 states have call successors, (75), 3 states have call predecessors, (75), 3 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2024-11-16 16:06:58,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 334 transitions. [2024-11-16 16:06:58,216 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 334 transitions. Word has length 170 [2024-11-16 16:06:58,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:06:58,217 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 334 transitions. [2024-11-16 16:06:58,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (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-11-16 16:06:58,220 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 334 transitions. [2024-11-16 16:06:58,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-16 16:06:58,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:06:58,222 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, 1, 1, 1, 1] [2024-11-16 16:06:58,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 16:06:58,222 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:06:58,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:06:58,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1683344053, now seen corresponding path program 1 times [2024-11-16 16:06:58,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:06:58,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730637381] [2024-11-16 16:06:58,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:06:58,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:06:58,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:58,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:06:58,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:58,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:06:58,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:58,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:06:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:58,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:06:58,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:58,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:06:58,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:58,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:06:58,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:58,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:06:58,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:58,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:06:58,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:58,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:06:58,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:58,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:06:58,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:58,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:06:58,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:58,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:06:58,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:58,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:06:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:58,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 16:06:58,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:58,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 16:06:58,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:58,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 16:06:58,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:58,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 16:06:58,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:58,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 16:06:58,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:58,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 16:06:58,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:58,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-16 16:06:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:58,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 16:06:58,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:58,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-16 16:06:58,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:58,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 16:06:58,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:58,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-16 16:06:58,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:58,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 16:06:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:58,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-16 16:06:58,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:06:58,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730637381] [2024-11-16 16:06:58,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730637381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:06:58,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:06:58,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 16:06:58,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261865347] [2024-11-16 16:06:58,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:06:58,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 16:06:58,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:06:58,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 16:06:58,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 16:06:58,768 INFO L87 Difference]: Start difference. First operand 217 states and 334 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-11-16 16:06:59,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:06:59,036 INFO L93 Difference]: Finished difference Result 442 states and 684 transitions. [2024-11-16 16:06:59,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 16:06:59,037 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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 171 [2024-11-16 16:06:59,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:06:59,040 INFO L225 Difference]: With dead ends: 442 [2024-11-16 16:06:59,040 INFO L226 Difference]: Without dead ends: 277 [2024-11-16 16:06:59,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 16:06:59,041 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 87 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 16:06:59,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 444 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 16:06:59,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-16 16:06:59,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 218. [2024-11-16 16:06:59,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 139 states have (on average 1.330935251798561) internal successors, (185), 139 states have internal predecessors, (185), 75 states have call successors, (75), 3 states have call predecessors, (75), 3 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2024-11-16 16:06:59,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 335 transitions. [2024-11-16 16:06:59,080 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 335 transitions. Word has length 171 [2024-11-16 16:06:59,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:06:59,081 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 335 transitions. [2024-11-16 16:06:59,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-11-16 16:06:59,081 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 335 transitions. [2024-11-16 16:06:59,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-16 16:06:59,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:06:59,083 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, 1, 1, 1, 1] [2024-11-16 16:06:59,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 16:06:59,084 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:06:59,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:06:59,085 INFO L85 PathProgramCache]: Analyzing trace with hash -438579572, now seen corresponding path program 1 times [2024-11-16 16:06:59,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:06:59,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240735753] [2024-11-16 16:06:59,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:06:59,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:06:59,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:59,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:06:59,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:59,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:06:59,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:59,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:06:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:59,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:06:59,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:59,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:06:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:59,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:06:59,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:59,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:06:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:59,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:06:59,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:59,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:06:59,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:59,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:06:59,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:59,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:06:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:59,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:06:59,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:59,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:06:59,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:59,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 16:06:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:59,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 16:06:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:59,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 16:06:59,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:59,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 16:06:59,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:59,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 16:06:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:59,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 16:06:59,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:59,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-16 16:06:59,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:59,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 16:06:59,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:59,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-16 16:06:59,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:59,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 16:06:59,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:59,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-16 16:06:59,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:59,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 16:06:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:06:59,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-16 16:06:59,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:06:59,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240735753] [2024-11-16 16:06:59,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240735753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:06:59,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:06:59,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 16:06:59,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968077495] [2024-11-16 16:06:59,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:06:59,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 16:06:59,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:06:59,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 16:06:59,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 16:06:59,405 INFO L87 Difference]: Start difference. First operand 218 states and 335 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (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-11-16 16:06:59,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:06:59,465 INFO L93 Difference]: Finished difference Result 417 states and 643 transitions. [2024-11-16 16:06:59,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 16:06:59,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (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 171 [2024-11-16 16:06:59,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:06:59,469 INFO L225 Difference]: With dead ends: 417 [2024-11-16 16:06:59,469 INFO L226 Difference]: Without dead ends: 252 [2024-11-16 16:06:59,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 16:06:59,470 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 31 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 16:06:59,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 252 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:06:59,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-16 16:06:59,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 218. [2024-11-16 16:06:59,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 139 states have (on average 1.316546762589928) internal successors, (183), 139 states have internal predecessors, (183), 75 states have call successors, (75), 3 states have call predecessors, (75), 3 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2024-11-16 16:06:59,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 333 transitions. [2024-11-16 16:06:59,508 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 333 transitions. Word has length 171 [2024-11-16 16:06:59,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:06:59,509 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 333 transitions. [2024-11-16 16:06:59,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (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-11-16 16:06:59,509 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 333 transitions. [2024-11-16 16:06:59,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-16 16:06:59,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:06:59,511 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, 1, 1, 1, 1, 1] [2024-11-16 16:06:59,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 16:06:59,512 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:06:59,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:06:59,512 INFO L85 PathProgramCache]: Analyzing trace with hash -288264063, now seen corresponding path program 1 times [2024-11-16 16:06:59,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:06:59,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687591561] [2024-11-16 16:06:59,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:06:59,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:06:59,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 16:06:59,669 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 16:06:59,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 16:06:59,877 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 16:06:59,877 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 16:06:59,878 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 16:06:59,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 16:06:59,883 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:07:00,019 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 16:07:00,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 04:07:00 BoogieIcfgContainer [2024-11-16 16:07:00,026 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 16:07:00,026 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 16:07:00,027 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 16:07:00,027 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 16:07:00,027 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:06:54" (3/4) ... [2024-11-16 16:07:00,030 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 16:07:00,031 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 16:07:00,031 INFO L158 Benchmark]: Toolchain (without parser) took 6505.57ms. Allocated memory was 184.5MB in the beginning and 350.2MB in the end (delta: 165.7MB). Free memory was 128.4MB in the beginning and 260.5MB in the end (delta: -132.1MB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB. [2024-11-16 16:07:00,032 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 184.5MB. Free memory is still 147.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 16:07:00,032 INFO L158 Benchmark]: CACSL2BoogieTranslator took 423.46ms. Allocated memory is still 184.5MB. Free memory was 128.4MB in the beginning and 108.9MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-16 16:07:00,032 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.74ms. Allocated memory is still 184.5MB. Free memory was 108.9MB in the beginning and 102.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 16:07:00,033 INFO L158 Benchmark]: Boogie Preprocessor took 106.07ms. Allocated memory is still 184.5MB. Free memory was 102.6MB in the beginning and 91.4MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 16:07:00,033 INFO L158 Benchmark]: IcfgBuilder took 667.84ms. Allocated memory is still 184.5MB. Free memory was 91.4MB in the beginning and 58.6MB in the end (delta: 32.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-16 16:07:00,033 INFO L158 Benchmark]: TraceAbstraction took 5227.66ms. Allocated memory was 184.5MB in the beginning and 350.2MB in the end (delta: 165.7MB). Free memory was 57.9MB in the beginning and 260.5MB in the end (delta: -202.6MB). Peak memory consumption was 116.8MB. Max. memory is 16.1GB. [2024-11-16 16:07:00,034 INFO L158 Benchmark]: Witness Printer took 4.57ms. Allocated memory is still 350.2MB. Free memory is still 260.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 16:07:00,035 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.19ms. Allocated memory is still 184.5MB. Free memory is still 147.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 423.46ms. Allocated memory is still 184.5MB. Free memory was 128.4MB in the beginning and 108.9MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.74ms. Allocated memory is still 184.5MB. Free memory was 108.9MB in the beginning and 102.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 106.07ms. Allocated memory is still 184.5MB. Free memory was 102.6MB in the beginning and 91.4MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * IcfgBuilder took 667.84ms. Allocated memory is still 184.5MB. Free memory was 91.4MB in the beginning and 58.6MB in the end (delta: 32.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 5227.66ms. Allocated memory was 184.5MB in the beginning and 350.2MB in the end (delta: 165.7MB). Free memory was 57.9MB in the beginning and 260.5MB in the end (delta: -202.6MB). Peak memory consumption was 116.8MB. Max. memory is 16.1GB. * Witness Printer took 4.57ms. Allocated memory is still 350.2MB. Free memory is still 260.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 215. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 8; [L23] unsigned char var_1_4 = 200; [L24] unsigned char var_1_5 = 0; [L25] unsigned long int var_1_6 = 1000000; [L26] signed short int var_1_7 = -1; [L27] unsigned char var_1_8 = 1; [L28] unsigned char var_1_9 = 0; [L29] signed short int var_1_10 = 128; [L30] unsigned char var_1_12 = 1; [L31] unsigned char var_1_14 = 128; [L32] unsigned char var_1_15 = 25; [L33] unsigned char var_1_16 = 1; [L34] float var_1_17 = 1.25; [L35] float var_1_18 = 3.5; [L36] float var_1_19 = 127.45; [L37] float var_1_20 = 1.5; [L38] float var_1_21 = 24.4; [L39] float var_1_22 = 0.8; [L40] unsigned char var_1_23 = 4; [L41] unsigned char var_1_24 = 0; [L42] unsigned char var_1_25 = 8; [L43] unsigned char var_1_26 = 64; [L44] signed short int var_1_27 = 256; [L45] unsigned char var_1_28 = 1; [L46] unsigned char var_1_30 = 0; [L47] unsigned char var_1_31 = 0; [L48] unsigned char last_1_var_1_1 = 8; [L49] unsigned long int last_1_var_1_6 = 1000000; [L50] signed short int last_1_var_1_7 = -1; [L51] unsigned char last_1_var_1_12 = 1; [L52] float last_1_var_1_17 = 1.25; [L53] unsigned char last_1_var_1_23 = 4; [L54] unsigned char last_1_var_1_25 = 8; [L55] unsigned char last_1_var_1_28 = 1; VAL [isInitial=0, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=200, var_1_5=0, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L219] isInitial = 1 [L220] FCALL initially() [L221] int k_loop; [L222] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=200, var_1_5=0, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L222] COND TRUE k_loop < 1 [L223] CALL updateLastVariables() [L205] last_1_var_1_1 = var_1_1 [L206] last_1_var_1_6 = var_1_6 [L207] last_1_var_1_7 = var_1_7 [L208] last_1_var_1_12 = var_1_12 [L209] last_1_var_1_17 = var_1_17 [L210] last_1_var_1_23 = var_1_23 [L211] last_1_var_1_25 = var_1_25 [L212] last_1_var_1_28 = var_1_28 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=200, var_1_5=0, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L223] RET updateLastVariables() [L224] CALL updateVariables() [L163] var_1_4 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_4 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=0, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=0, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L164] RET assume_abort_if_not(var_1_4 >= 127) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=0, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L165] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=0, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=0, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L165] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=0, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L166] var_1_5 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L167] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L168] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L168] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L169] var_1_9 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1] [L170] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1] [L171] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L171] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L172] var_1_14 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_14 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L173] RET assume_abort_if_not(var_1_14 >= 127) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L174] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L174] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L175] var_1_15 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L176] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L177] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L177] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L178] var_1_16 = __VERIFIER_nondet_uchar() [L179] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L179] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L180] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L180] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L181] var_1_18 = __VERIFIER_nondet_float() [L182] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L182] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L183] var_1_19 = __VERIFIER_nondet_float() [L184] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L184] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L185] var_1_20 = __VERIFIER_nondet_float() [L186] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L186] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L187] var_1_21 = __VERIFIER_nondet_float() [L188] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L188] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L189] var_1_22 = __VERIFIER_nondet_float() [L190] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L190] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L191] var_1_24 = __VERIFIER_nondet_uchar() [L192] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L192] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L193] CALL assume_abort_if_not(var_1_24 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L193] RET assume_abort_if_not(var_1_24 <= 63) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L194] var_1_26 = __VERIFIER_nondet_uchar() [L195] CALL assume_abort_if_not(var_1_26 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=127, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=127, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L195] RET assume_abort_if_not(var_1_26 >= 63) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=127, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L196] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=127, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=127, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L196] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=127, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L197] var_1_30 = __VERIFIER_nondet_uchar() [L198] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=127, var_1_27=256, var_1_28=1, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=127, var_1_27=256, var_1_28=1, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L198] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=127, var_1_27=256, var_1_28=1, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L199] CALL assume_abort_if_not(var_1_30 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=127, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=127, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L199] RET assume_abort_if_not(var_1_30 <= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=127, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L200] var_1_31 = __VERIFIER_nondet_uchar() [L201] CALL assume_abort_if_not(var_1_31 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=127, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=127, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L201] RET assume_abort_if_not(var_1_31 >= 1) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=127, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L202] CALL assume_abort_if_not(var_1_31 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=127, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=127, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L202] RET assume_abort_if_not(var_1_31 <= 1) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=127, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L224] RET updateVariables() [L225] CALL step() [L59] signed long int stepLocal_5 = last_1_var_1_7; [L60] signed long int stepLocal_4 = last_1_var_1_7; [L61] signed long int stepLocal_3 = last_1_var_1_1; VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_3=8, stepLocal_4=-1, stepLocal_5=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=127, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L62] COND TRUE stepLocal_4 > last_1_var_1_6 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_3=8, stepLocal_5=-1, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=127, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L63] COND TRUE stepLocal_5 < last_1_var_1_25 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_3=8, var_1_10=128, var_1_12=1, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=127, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L64] COND FALSE !(stepLocal_3 <= last_1_var_1_12) [L67] var_1_12 = (((((var_1_5) < (var_1_15)) ? (var_1_5) : (var_1_15))) + var_1_16) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=5, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=127, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L73] COND FALSE !(last_1_var_1_25 < last_1_var_1_1) [L80] var_1_28 = var_1_31 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=5, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=127, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L82] COND FALSE !(var_1_21 != var_1_19) [L89] var_1_25 = (var_1_14 - (var_1_26 - var_1_24)) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=5, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=127, var_1_26=127, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L91] unsigned char stepLocal_0 = ! var_1_28; VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_0=0, var_1_10=128, var_1_12=5, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=127, var_1_26=127, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L92] COND FALSE !(stepLocal_0 && var_1_28) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=5, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=127, var_1_26=127, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L95] COND TRUE \read(var_1_28) [L96] var_1_1 = var_1_5 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=5, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=5, var_1_23=4, var_1_24=0, var_1_25=127, var_1_26=127, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L101] var_1_7 = var_1_5 [L102] unsigned char stepLocal_2 = var_1_12; VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_2=5, var_1_10=128, var_1_12=5, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=5, var_1_23=4, var_1_24=0, var_1_25=127, var_1_26=127, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=5, var_1_8=1, var_1_9=0] [L103] COND TRUE stepLocal_2 == ((((var_1_7) > (var_1_12)) ? (var_1_7) : (var_1_12))) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=5, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=5, var_1_23=4, var_1_24=0, var_1_25=127, var_1_26=127, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=5, var_1_8=1, var_1_9=0] [L104] COND TRUE ! (var_1_12 > ((((var_1_7) < (var_1_4)) ? (var_1_7) : (var_1_4)))) [L105] var_1_8 = var_1_9 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=5, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=5, var_1_23=4, var_1_24=0, var_1_25=127, var_1_26=127, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=5, var_1_8=0, var_1_9=0] [L108] COND FALSE !(var_1_12 < var_1_12) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=5, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=5, var_1_23=4, var_1_24=0, var_1_25=127, var_1_26=127, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=5, var_1_8=0, var_1_9=0] [L111] COND TRUE \read(var_1_28) [L112] var_1_10 = var_1_4 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=254, var_1_12=5, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=5, var_1_23=4, var_1_24=0, var_1_25=127, var_1_26=127, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=5, var_1_8=0, var_1_9=0] [L117] unsigned char stepLocal_10 = var_1_9; [L118] signed short int stepLocal_9 = var_1_10; [L119] unsigned char stepLocal_8 = var_1_15; VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_10=0, stepLocal_8=127, stepLocal_9=254, var_1_10=254, var_1_12=5, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=5, var_1_23=4, var_1_24=0, var_1_25=127, var_1_26=127, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=5, var_1_8=0, var_1_9=0] [L120] COND TRUE \read(var_1_28) [L121] var_1_27 = var_1_5 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_10=0, stepLocal_8=127, stepLocal_9=254, var_1_10=254, var_1_12=5, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=5, var_1_23=4, var_1_24=0, var_1_25=127, var_1_26=127, var_1_27=5, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=5, var_1_8=0, var_1_9=0] [L135] unsigned char stepLocal_1 = var_1_4 > 2; VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_10=0, stepLocal_1=1, stepLocal_8=127, stepLocal_9=254, var_1_10=254, var_1_12=5, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=5, var_1_23=4, var_1_24=0, var_1_25=127, var_1_26=127, var_1_27=5, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=5, var_1_6=1000000, var_1_7=5, var_1_8=0, var_1_9=0] [L136] COND TRUE \read(var_1_28) [L137] var_1_6 = (var_1_4 + var_1_27) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_10=0, stepLocal_1=1, stepLocal_8=127, stepLocal_9=254, var_1_10=254, var_1_12=5, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=5, var_1_23=4, var_1_24=0, var_1_25=127, var_1_26=127, var_1_27=5, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=5, var_1_6=259, var_1_7=5, var_1_8=0, var_1_9=0] [L143] signed short int stepLocal_7 = var_1_27; VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_10=0, stepLocal_1=1, stepLocal_7=5, stepLocal_8=127, stepLocal_9=254, var_1_10=254, var_1_12=5, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=5, var_1_23=4, var_1_24=0, var_1_25=127, var_1_26=127, var_1_27=5, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=5, var_1_6=259, var_1_7=5, var_1_8=0, var_1_9=0] [L144] COND FALSE !(\read(var_1_8)) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_10=0, stepLocal_1=1, stepLocal_7=5, stepLocal_8=127, stepLocal_9=254, var_1_10=254, var_1_12=5, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=5, var_1_23=4, var_1_24=0, var_1_25=127, var_1_26=127, var_1_27=5, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=5, var_1_6=259, var_1_7=5, var_1_8=0, var_1_9=0] [L151] signed short int stepLocal_6 = var_1_10; VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_10=0, stepLocal_1=1, stepLocal_6=254, stepLocal_7=5, stepLocal_8=127, stepLocal_9=254, var_1_10=254, var_1_12=5, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=5/4, var_1_1=5, var_1_23=4, var_1_24=0, var_1_25=127, var_1_26=127, var_1_27=5, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=5, var_1_6=259, var_1_7=5, var_1_8=0, var_1_9=0] [L152] COND FALSE !(\read(var_1_8)) [L159] var_1_17 = var_1_21 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_10=0, stepLocal_1=1, stepLocal_6=254, stepLocal_7=5, stepLocal_8=127, stepLocal_9=254, var_1_10=254, var_1_12=5, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=1000005, var_1_1=5, var_1_21=1000005, var_1_23=4, var_1_24=0, var_1_25=127, var_1_26=127, var_1_27=5, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=5, var_1_6=259, var_1_7=5, var_1_8=0, var_1_9=0] [L225] RET step() [L226] CALL, EXPR property() [L215-L216] return ((((((((((((! var_1_28) && var_1_28) ? (var_1_1 == ((unsigned char) (var_1_4 - var_1_5))) : (var_1_28 ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_1 == ((unsigned char) 1)))) && (var_1_28 ? (var_1_6 == ((unsigned long int) (var_1_4 + var_1_27))) : (((var_1_4 > 2) && var_1_8) ? (var_1_6 == ((unsigned long int) ((((var_1_27) > (var_1_4)) ? (var_1_27) : (var_1_4))))) : 1))) && (var_1_7 == ((signed short int) var_1_5))) && ((var_1_12 == ((((var_1_7) > (var_1_12)) ? (var_1_7) : (var_1_12)))) ? ((! (var_1_12 > ((((var_1_7) < (var_1_4)) ? (var_1_7) : (var_1_4))))) ? (var_1_8 == ((unsigned char) var_1_9)) : 1) : 1)) && ((var_1_12 < var_1_12) ? (var_1_10 == ((signed short int) (var_1_25 - ((((var_1_5) < (16)) ? (var_1_5) : (16)))))) : (var_1_28 ? (var_1_10 == ((signed short int) var_1_4)) : (var_1_10 == ((signed short int) var_1_25))))) && ((last_1_var_1_7 > last_1_var_1_6) ? ((last_1_var_1_7 < last_1_var_1_25) ? ((last_1_var_1_1 <= last_1_var_1_12) ? (var_1_12 == ((unsigned char) (((((var_1_4) < (var_1_14)) ? (var_1_4) : (var_1_14))) - var_1_5))) : (var_1_12 == ((unsigned char) (((((var_1_5) < (var_1_15)) ? (var_1_5) : (var_1_15))) + var_1_16)))) : (var_1_12 == ((unsigned char) var_1_16))) : 1)) && (var_1_8 ? ((var_1_10 <= var_1_23) ? (var_1_17 == ((float) ((((((1.0000000000000012E14f + var_1_18)) < (var_1_19)) ? ((1.0000000000000012E14f + var_1_18)) : (var_1_19))) + var_1_20))) : (var_1_17 == ((float) (var_1_21 - var_1_22)))) : (var_1_17 == ((float) var_1_21)))) && (var_1_8 ? ((var_1_27 <= last_1_var_1_23) ? (var_1_23 == ((unsigned char) 10)) : (var_1_23 == ((unsigned char) ((200 - var_1_24) - 64)))) : 1)) && ((var_1_21 != var_1_19) ? (var_1_28 ? (var_1_25 == ((unsigned char) ((((var_1_24) < (((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) ? (var_1_24) : (((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))))))) : (var_1_25 == ((unsigned char) ((((4) > (var_1_5)) ? (4) : (var_1_5)))))) : (var_1_25 == ((unsigned char) (var_1_14 - (var_1_26 - var_1_24)))))) && (var_1_28 ? (var_1_27 == ((signed short int) var_1_5)) : (var_1_28 ? ((var_1_10 <= var_1_15) ? (var_1_27 == ((signed short int) -10)) : 1) : ((var_1_10 <= (var_1_4 - var_1_5)) ? ((var_1_9 || (var_1_19 < var_1_20)) ? (var_1_27 == ((signed short int) (((((1) < (var_1_4)) ? (1) : (var_1_4))) + ((((var_1_14) > (var_1_10)) ? (var_1_14) : (var_1_10)))))) : 1) : 1)))) && ((last_1_var_1_25 < last_1_var_1_1) ? (((- last_1_var_1_17) < ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))) ? (var_1_28 == ((unsigned char) ((last_1_var_1_28 || var_1_9) && var_1_30))) : (var_1_28 == ((unsigned char) var_1_30))) : (var_1_28 == ((unsigned char) var_1_31))) ; VAL [\result=0, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=254, var_1_12=5, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=1000005, var_1_1=5, var_1_21=1000005, var_1_23=4, var_1_24=0, var_1_25=127, var_1_26=127, var_1_27=5, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=5, var_1_6=259, var_1_7=5, var_1_8=0, var_1_9=0] [L226] RET, EXPR property() [L226] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=254, var_1_12=5, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=1000005, var_1_1=5, var_1_21=1000005, var_1_23=4, var_1_24=0, var_1_25=127, var_1_26=127, var_1_27=5, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=5, var_1_6=259, var_1_7=5, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=254, var_1_12=5, var_1_14=-32258, var_1_15=127, var_1_16=0, var_1_17=1000005, var_1_1=5, var_1_21=1000005, var_1_23=4, var_1_24=0, var_1_25=127, var_1_26=127, var_1_27=5, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=254, var_1_5=5, var_1_6=259, var_1_7=5, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 7, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 397 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 397 mSDsluCounter, 2064 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1250 mSDsCounter, 234 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 217 IncrementalHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 234 mSolverCounterUnsat, 814 mSDtfsCounter, 217 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 355 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=218occurred in iteration=5, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 217 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1188 NumberOfCodeBlocks, 1188 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1010 ConstructedInterpolants, 0 QuantifiedInterpolants, 2818 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 7200/7200 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 16:07:00,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-99.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9a4594ea31ffbf6212ff96fe98d0ce3ce9979c812b849295a80843482179f790 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 16:07:02,308 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 16:07:02,401 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 16:07:02,406 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 16:07:02,406 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 16:07:02,438 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 16:07:02,438 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 16:07:02,438 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 16:07:02,439 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 16:07:02,443 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 16:07:02,444 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 16:07:02,444 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 16:07:02,444 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 16:07:02,445 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 16:07:02,445 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 16:07:02,445 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 16:07:02,446 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 16:07:02,446 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 16:07:02,446 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 16:07:02,447 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 16:07:02,448 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 16:07:02,448 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 16:07:02,448 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 16:07:02,449 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 16:07:02,449 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 16:07:02,450 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 16:07:02,450 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 16:07:02,450 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 16:07:02,451 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 16:07:02,451 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 16:07:02,451 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 16:07:02,452 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 16:07:02,452 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 16:07:02,452 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 16:07:02,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:07:02,453 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 16:07:02,453 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 16:07:02,453 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 16:07:02,454 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 16:07:02,454 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 16:07:02,454 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 16:07:02,455 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 16:07:02,456 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 16:07:02,456 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 16:07:02,456 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9a4594ea31ffbf6212ff96fe98d0ce3ce9979c812b849295a80843482179f790 [2024-11-16 16:07:02,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 16:07:02,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 16:07:02,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 16:07:02,796 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 16:07:02,797 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 16:07:02,798 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-99.i [2024-11-16 16:07:04,340 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 16:07:04,617 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 16:07:04,618 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-99.i [2024-11-16 16:07:04,635 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf8359b75/9660435a09a3427fb2643f906ce0a67f/FLAG9e8d6e69e [2024-11-16 16:07:04,655 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf8359b75/9660435a09a3427fb2643f906ce0a67f [2024-11-16 16:07:04,658 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 16:07:04,660 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 16:07:04,663 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 16:07:04,663 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 16:07:04,668 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 16:07:04,669 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:07:04" (1/1) ... [2024-11-16 16:07:04,670 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@184adcc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:07:04, skipping insertion in model container [2024-11-16 16:07:04,670 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:07:04" (1/1) ... [2024-11-16 16:07:04,709 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 16:07:04,905 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-99.i[916,929] [2024-11-16 16:07:05,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:07:05,027 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 16:07:05,042 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-99.i[916,929] [2024-11-16 16:07:05,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:07:05,144 INFO L204 MainTranslator]: Completed translation [2024-11-16 16:07:05,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:07:05 WrapperNode [2024-11-16 16:07:05,145 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 16:07:05,146 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 16:07:05,146 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 16:07:05,146 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 16:07:05,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:07:05" (1/1) ... [2024-11-16 16:07:05,170 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:07:05" (1/1) ... [2024-11-16 16:07:05,213 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 212 [2024-11-16 16:07:05,214 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 16:07:05,219 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 16:07:05,219 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 16:07:05,219 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 16:07:05,229 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:07:05" (1/1) ... [2024-11-16 16:07:05,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:07:05" (1/1) ... [2024-11-16 16:07:05,235 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:07:05" (1/1) ... [2024-11-16 16:07:05,256 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 16:07:05,256 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:07:05" (1/1) ... [2024-11-16 16:07:05,256 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:07:05" (1/1) ... [2024-11-16 16:07:05,277 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:07:05" (1/1) ... [2024-11-16 16:07:05,282 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:07:05" (1/1) ... [2024-11-16 16:07:05,285 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:07:05" (1/1) ... [2024-11-16 16:07:05,287 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:07:05" (1/1) ... [2024-11-16 16:07:05,290 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 16:07:05,291 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 16:07:05,291 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 16:07:05,291 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 16:07:05,296 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:07:05" (1/1) ... [2024-11-16 16:07:05,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:07:05,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:07:05,331 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 16:07:05,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 16:07:05,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 16:07:05,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 16:07:05,371 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 16:07:05,371 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 16:07:05,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 16:07:05,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 16:07:05,458 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 16:07:05,460 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 16:07:06,411 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-16 16:07:06,414 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 16:07:06,431 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 16:07:06,431 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 16:07:06,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:07:06 BoogieIcfgContainer [2024-11-16 16:07:06,432 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 16:07:06,434 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 16:07:06,434 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 16:07:06,437 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 16:07:06,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 04:07:04" (1/3) ... [2024-11-16 16:07:06,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a0eaf29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:07:06, skipping insertion in model container [2024-11-16 16:07:06,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:07:05" (2/3) ... [2024-11-16 16:07:06,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a0eaf29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:07:06, skipping insertion in model container [2024-11-16 16:07:06,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:07:06" (3/3) ... [2024-11-16 16:07:06,442 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-99.i [2024-11-16 16:07:06,456 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 16:07:06,456 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 16:07:06,509 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 16:07:06,516 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;@733c0ad6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 16:07:06,516 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 16:07:06,521 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 64 states have (on average 1.453125) internal successors, (93), 65 states have internal predecessors, (93), 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-11-16 16:07:06,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-16 16:07:06,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:07:06,537 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-11-16 16:07:06,538 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:07:06,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:07:06,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1495583437, now seen corresponding path program 1 times [2024-11-16 16:07:06,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:07:06,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [547613399] [2024-11-16 16:07:06,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:07:06,562 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:07:06,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:07:06,565 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 16:07:06,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 16:07:06,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:06,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 16:07:06,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:07:06,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 428 proven. 0 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2024-11-16 16:07:06,973 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 16:07:06,974 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 16:07:06,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [547613399] [2024-11-16 16:07:06,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [547613399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:07:06,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:07:06,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 16:07:06,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510813607] [2024-11-16 16:07:06,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:07:06,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 16:07:06,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 16:07:07,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 16:07:07,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 16:07:07,009 INFO L87 Difference]: Start difference. First operand has 92 states, 64 states have (on average 1.453125) internal successors, (93), 65 states have internal predecessors, (93), 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 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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-11-16 16:07:07,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:07:07,039 INFO L93 Difference]: Finished difference Result 180 states and 307 transitions. [2024-11-16 16:07:07,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 16:07:07,041 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (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 167 [2024-11-16 16:07:07,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:07:07,050 INFO L225 Difference]: With dead ends: 180 [2024-11-16 16:07:07,050 INFO L226 Difference]: Without dead ends: 87 [2024-11-16 16:07:07,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 16:07:07,060 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 16:07:07,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:07:07,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-16 16:07:07,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-16 16:07:07,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 60 states have (on average 1.4) internal successors, (84), 60 states have internal predecessors, (84), 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-11-16 16:07:07,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 134 transitions. [2024-11-16 16:07:07,103 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 134 transitions. Word has length 167 [2024-11-16 16:07:07,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:07:07,103 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 134 transitions. [2024-11-16 16:07:07,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (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-11-16 16:07:07,104 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 134 transitions. [2024-11-16 16:07:07,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-16 16:07:07,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:07:07,110 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, 1] [2024-11-16 16:07:07,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 16:07:07,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:07:07,311 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:07:07,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:07:07,312 INFO L85 PathProgramCache]: Analyzing trace with hash 260880510, now seen corresponding path program 1 times [2024-11-16 16:07:07,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:07:07,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [487306590] [2024-11-16 16:07:07,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:07:07,314 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:07:07,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:07:07,317 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 16:07:07,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 16:07:07,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:07,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 16:07:07,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:07:08,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-16 16:07:08,762 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 16:07:08,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 16:07:08,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [487306590] [2024-11-16 16:07:08,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [487306590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:07:08,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:07:08,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 16:07:08,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009666001] [2024-11-16 16:07:08,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:07:08,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 16:07:08,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 16:07:08,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 16:07:08,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 16:07:08,767 INFO L87 Difference]: Start difference. First operand 87 states and 134 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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-11-16 16:07:09,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:07:09,994 INFO L93 Difference]: Finished difference Result 257 states and 398 transitions. [2024-11-16 16:07:10,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 16:07:10,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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 168 [2024-11-16 16:07:10,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:07:10,015 INFO L225 Difference]: With dead ends: 257 [2024-11-16 16:07:10,017 INFO L226 Difference]: Without dead ends: 173 [2024-11-16 16:07:10,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 16:07:10,022 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 102 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-16 16:07:10,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 456 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-16 16:07:10,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-16 16:07:10,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 135. [2024-11-16 16:07:10,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 82 states have (on average 1.2926829268292683) internal successors, (106), 82 states have internal predecessors, (106), 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-11-16 16:07:10,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 206 transitions. [2024-11-16 16:07:10,065 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 206 transitions. Word has length 168 [2024-11-16 16:07:10,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:07:10,066 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 206 transitions. [2024-11-16 16:07:10,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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-11-16 16:07:10,066 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 206 transitions. [2024-11-16 16:07:10,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-16 16:07:10,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:07:10,069 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, 1, 1] [2024-11-16 16:07:10,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-16 16:07:10,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:07:10,271 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:07:10,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:07:10,272 INFO L85 PathProgramCache]: Analyzing trace with hash 676694285, now seen corresponding path program 1 times [2024-11-16 16:07:10,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:07:10,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [46285977] [2024-11-16 16:07:10,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:07:10,275 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:07:10,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:07:10,279 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 16:07:10,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 16:07:10,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:10,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 16:07:10,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:07:10,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-16 16:07:10,986 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 16:07:10,986 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 16:07:10,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [46285977] [2024-11-16 16:07:10,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [46285977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:07:10,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:07:10,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 16:07:10,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440141346] [2024-11-16 16:07:10,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:07:10,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 16:07:10,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 16:07:10,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 16:07:10,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 16:07:10,991 INFO L87 Difference]: Start difference. First operand 135 states and 206 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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-11-16 16:07:12,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:07:12,166 INFO L93 Difference]: Finished difference Result 257 states and 397 transitions. [2024-11-16 16:07:12,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 16:07:12,177 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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 169 [2024-11-16 16:07:12,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:07:12,180 INFO L225 Difference]: With dead ends: 257 [2024-11-16 16:07:12,180 INFO L226 Difference]: Without dead ends: 173 [2024-11-16 16:07:12,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 16:07:12,182 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 100 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-16 16:07:12,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 511 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-16 16:07:12,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-16 16:07:12,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 136. [2024-11-16 16:07:12,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 83 states have internal predecessors, (107), 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-11-16 16:07:12,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 207 transitions. [2024-11-16 16:07:12,227 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 207 transitions. Word has length 169 [2024-11-16 16:07:12,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:07:12,228 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 207 transitions. [2024-11-16 16:07:12,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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-11-16 16:07:12,228 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 207 transitions. [2024-11-16 16:07:12,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-16 16:07:12,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:07:12,231 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, 1, 1, 1] [2024-11-16 16:07:12,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-16 16:07:12,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:07:12,432 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:07:12,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:07:12,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1342273630, now seen corresponding path program 1 times [2024-11-16 16:07:12,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:07:12,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [993228422] [2024-11-16 16:07:12,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:07:12,434 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:07:12,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:07:12,437 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 16:07:12,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-16 16:07:12,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:12,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 16:07:12,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:07:13,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-16 16:07:13,503 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 16:07:13,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 16:07:13,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [993228422] [2024-11-16 16:07:13,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [993228422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:07:13,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:07:13,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 16:07:13,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989756065] [2024-11-16 16:07:13,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:07:13,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 16:07:13,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 16:07:13,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 16:07:13,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 16:07:13,505 INFO L87 Difference]: Start difference. First operand 136 states and 207 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 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-11-16 16:07:14,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:07:14,659 INFO L93 Difference]: Finished difference Result 257 states and 396 transitions. [2024-11-16 16:07:14,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 16:07:14,669 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 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 170 [2024-11-16 16:07:14,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:07:14,671 INFO L225 Difference]: With dead ends: 257 [2024-11-16 16:07:14,671 INFO L226 Difference]: Without dead ends: 173 [2024-11-16 16:07:14,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 16:07:14,676 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 84 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-16 16:07:14,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 443 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-16 16:07:14,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-16 16:07:14,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 137. [2024-11-16 16:07:14,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 84 states have internal predecessors, (108), 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-11-16 16:07:14,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 208 transitions. [2024-11-16 16:07:14,704 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 208 transitions. Word has length 170 [2024-11-16 16:07:14,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:07:14,705 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 208 transitions. [2024-11-16 16:07:14,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 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-11-16 16:07:14,705 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 208 transitions. [2024-11-16 16:07:14,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-16 16:07:14,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:07:14,707 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, 1, 1, 1] [2024-11-16 16:07:14,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-16 16:07:14,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:07:14,908 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:07:14,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:07:14,909 INFO L85 PathProgramCache]: Analyzing trace with hash 914637377, now seen corresponding path program 1 times [2024-11-16 16:07:14,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:07:14,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1636165028] [2024-11-16 16:07:14,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:07:14,910 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:07:14,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:07:14,914 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 16:07:14,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-16 16:07:15,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:15,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-16 16:07:15,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:07:15,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-16 16:07:15,400 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 16:07:15,400 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 16:07:15,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1636165028] [2024-11-16 16:07:15,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1636165028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:07:15,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:07:15,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 16:07:15,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526789731] [2024-11-16 16:07:15,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:07:15,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 16:07:15,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 16:07:15,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 16:07:15,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-16 16:07:15,406 INFO L87 Difference]: Start difference. First operand 137 states and 208 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 3 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-16 16:07:17,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:07:17,046 INFO L93 Difference]: Finished difference Result 326 states and 481 transitions. [2024-11-16 16:07:17,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-16 16:07:17,047 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 3 states have call predecessors, (25), 2 states have call successors, (25) Word has length 170 [2024-11-16 16:07:17,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:07:17,049 INFO L225 Difference]: With dead ends: 326 [2024-11-16 16:07:17,049 INFO L226 Difference]: Without dead ends: 242 [2024-11-16 16:07:17,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=414, Unknown=0, NotChecked=0, Total=552 [2024-11-16 16:07:17,051 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 250 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-16 16:07:17,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 713 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-16 16:07:17,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-16 16:07:17,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 163. [2024-11-16 16:07:17,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 107 states have (on average 1.2523364485981308) internal successors, (134), 107 states have internal predecessors, (134), 50 states have call successors, (50), 5 states have call predecessors, (50), 5 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-16 16:07:17,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 234 transitions. [2024-11-16 16:07:17,078 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 234 transitions. Word has length 170 [2024-11-16 16:07:17,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:07:17,079 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 234 transitions. [2024-11-16 16:07:17,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 3 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-16 16:07:17,080 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 234 transitions. [2024-11-16 16:07:17,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-16 16:07:17,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:07:17,082 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, 1, 1, 1, 1] [2024-11-16 16:07:17,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-16 16:07:17,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:07:17,283 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:07:17,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:07:17,284 INFO L85 PathProgramCache]: Analyzing trace with hash 503844268, now seen corresponding path program 1 times [2024-11-16 16:07:17,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:07:17,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [890842728] [2024-11-16 16:07:17,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:07:17,284 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:07:17,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:07:17,286 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 16:07:17,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-16 16:07:17,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:17,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 16:07:17,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:07:17,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-16 16:07:17,788 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 16:07:17,789 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 16:07:17,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [890842728] [2024-11-16 16:07:17,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [890842728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:07:17,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:07:17,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 16:07:17,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673702685] [2024-11-16 16:07:17,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:07:17,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 16:07:17,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 16:07:17,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 16:07:17,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 16:07:17,791 INFO L87 Difference]: Start difference. First operand 163 states and 234 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 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-11-16 16:07:18,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:07:18,242 INFO L93 Difference]: Finished difference Result 375 states and 542 transitions. [2024-11-16 16:07:18,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 16:07:18,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 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 171 [2024-11-16 16:07:18,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:07:18,255 INFO L225 Difference]: With dead ends: 375 [2024-11-16 16:07:18,256 INFO L226 Difference]: Without dead ends: 269 [2024-11-16 16:07:18,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 16:07:18,257 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 40 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 16:07:18,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 266 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 16:07:18,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-16 16:07:18,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 266. [2024-11-16 16:07:18,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 182 states have (on average 1.2857142857142858) internal successors, (234), 182 states have internal predecessors, (234), 75 states have call successors, (75), 8 states have call predecessors, (75), 8 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2024-11-16 16:07:18,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 384 transitions. [2024-11-16 16:07:18,301 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 384 transitions. Word has length 171 [2024-11-16 16:07:18,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:07:18,302 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 384 transitions. [2024-11-16 16:07:18,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 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-11-16 16:07:18,302 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 384 transitions. [2024-11-16 16:07:18,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-16 16:07:18,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:07:18,304 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, 1, 1, 1, 1, 1] [2024-11-16 16:07:18,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-16 16:07:18,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:07:18,507 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:07:18,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:07:18,508 INFO L85 PathProgramCache]: Analyzing trace with hash -288264063, now seen corresponding path program 1 times [2024-11-16 16:07:18,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:07:18,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2097828837] [2024-11-16 16:07:18,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:07:18,508 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:07:18,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:07:18,509 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 16:07:18,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-16 16:07:18,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:18,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-16 16:07:18,779 INFO L278 TraceCheckSpWp]: Computing forward predicates...