./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-7.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-7.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3323554ed5d8a95c631cfba7b209abf31440dbfb83bb65542e5f9a71f94c9b4b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:20:17,359 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:20:17,423 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:20:17,430 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:20:17,430 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:20:17,465 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:20:17,466 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:20:17,466 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:20:17,467 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:20:17,467 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:20:17,467 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:20:17,468 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:20:17,469 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:20:17,469 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:20:17,471 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:20:17,472 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:20:17,472 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:20:17,472 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:20:17,473 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:20:17,473 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:20:17,473 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:20:17,477 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:20:17,477 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:20:17,477 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:20:17,478 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:20:17,478 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:20:17,478 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:20:17,478 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:20:17,479 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:20:17,479 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:20:17,479 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:20:17,479 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:20:17,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:20:17,480 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:20:17,480 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:20:17,481 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:20:17,481 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:20:17,481 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:20:17,481 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:20:17,482 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:20:17,482 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:20:17,483 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:20:17,483 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3323554ed5d8a95c631cfba7b209abf31440dbfb83bb65542e5f9a71f94c9b4b [2024-10-11 11:20:17,711 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:20:17,733 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:20:17,736 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:20:17,737 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:20:17,737 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:20:17,739 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-7.i [2024-10-11 11:20:19,170 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:20:19,374 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:20:19,378 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-7.i [2024-10-11 11:20:19,396 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/527f06e4d/546629c361774f70845e51416fd92381/FLAGa1e80d831 [2024-10-11 11:20:19,410 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/527f06e4d/546629c361774f70845e51416fd92381 [2024-10-11 11:20:19,414 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:20:19,416 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:20:19,417 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:20:19,417 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:20:19,422 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:20:19,423 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:20:19" (1/1) ... [2024-10-11 11:20:19,425 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2047c1f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:19, skipping insertion in model container [2024-10-11 11:20:19,425 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:20:19" (1/1) ... [2024-10-11 11:20:19,455 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:20:19,639 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-7.i[915,928] [2024-10-11 11:20:19,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:20:19,788 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:20:19,799 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-7.i[915,928] [2024-10-11 11:20:19,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:20:19,908 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:20:19,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:19 WrapperNode [2024-10-11 11:20:19,909 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:20:19,910 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:20:19,910 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:20:19,910 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:20:19,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:19" (1/1) ... [2024-10-11 11:20:19,935 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:19" (1/1) ... [2024-10-11 11:20:19,985 INFO L138 Inliner]: procedures = 26, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 252 [2024-10-11 11:20:19,986 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:20:19,986 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:20:19,987 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:20:19,987 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:20:19,998 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:19" (1/1) ... [2024-10-11 11:20:19,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:19" (1/1) ... [2024-10-11 11:20:20,008 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:19" (1/1) ... [2024-10-11 11:20:20,043 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 11:20:20,043 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:19" (1/1) ... [2024-10-11 11:20:20,043 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:19" (1/1) ... [2024-10-11 11:20:20,067 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:19" (1/1) ... [2024-10-11 11:20:20,074 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:19" (1/1) ... [2024-10-11 11:20:20,084 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:19" (1/1) ... [2024-10-11 11:20:20,089 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:19" (1/1) ... [2024-10-11 11:20:20,098 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:20:20,100 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:20:20,100 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:20:20,101 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:20:20,101 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:19" (1/1) ... [2024-10-11 11:20:20,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:20:20,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:20:20,139 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:20:20,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:20:20,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:20:20,189 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:20:20,189 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:20:20,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:20:20,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:20:20,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:20:20,295 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:20:20,297 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:20:20,774 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-11 11:20:20,776 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:20:20,812 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:20:20,813 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:20:20,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:20:20 BoogieIcfgContainer [2024-10-11 11:20:20,813 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:20:20,816 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:20:20,817 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:20:20,820 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:20:20,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:20:19" (1/3) ... [2024-10-11 11:20:20,822 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75bba92f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:20:20, skipping insertion in model container [2024-10-11 11:20:20,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:19" (2/3) ... [2024-10-11 11:20:20,822 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75bba92f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:20:20, skipping insertion in model container [2024-10-11 11:20:20,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:20:20" (3/3) ... [2024-10-11 11:20:20,824 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-7.i [2024-10-11 11:20:20,843 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:20:20,844 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:20:20,913 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:20:20,921 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;@671235e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:20:20,922 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:20:20,926 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 65 states have (on average 1.4923076923076923) internal successors, (97), 66 states have internal predecessors, (97), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-11 11:20:20,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-11 11:20:20,943 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:20:20,944 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:20:20,944 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:20:20,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:20:20,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1715864965, now seen corresponding path program 1 times [2024-10-11 11:20:20,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:20:20,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863181830] [2024-10-11 11:20:20,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:20:20,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:20:21,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:21,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:20:21,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:21,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:20:21,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:21,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:20:21,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:21,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:20:21,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:21,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:20:21,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:21,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:20:21,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:21,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:20:21,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:21,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:20:21,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:21,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:20:21,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:21,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 11:20:21,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:21,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:20:21,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:21,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 11:20:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:21,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 11:20:21,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:21,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 11:20:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:21,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 11:20:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:21,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 11:20:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:21,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 11:20:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:21,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 11:20:21,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:21,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 11:20:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:21,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 11:20:21,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:21,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 11:20:21,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:21,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 11:20:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:21,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 11:20:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:21,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:20:21,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:21,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 11:20:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:21,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:20:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:21,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 11:20:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:21,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 11:20:21,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:21,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 11:20:21,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:21,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 11:20:21,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:21,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 11:20:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:21,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 11:20:21,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:21,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 11:20:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:21,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 11:20:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:21,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 11:20:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:21,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-11 11:20:21,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:20:21,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863181830] [2024-10-11 11:20:21,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863181830] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:20:21,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:20:21,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:20:21,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399235835] [2024-10-11 11:20:21,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:20:21,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:20:21,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:20:21,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:20:21,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:20:21,640 INFO L87 Difference]: Start difference. First operand has 103 states, 65 states have (on average 1.4923076923076923) internal successors, (97), 66 states have internal predecessors, (97), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2024-10-11 11:20:21,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:20:21,696 INFO L93 Difference]: Finished difference Result 203 states and 367 transitions. [2024-10-11 11:20:21,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:20:21,699 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) Word has length 219 [2024-10-11 11:20:21,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:20:21,706 INFO L225 Difference]: With dead ends: 203 [2024-10-11 11:20:21,706 INFO L226 Difference]: Without dead ends: 101 [2024-10-11 11:20:21,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:20:21,713 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:20:21,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:20:21,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-11 11:20:21,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-11 11:20:21,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 64 states have (on average 1.421875) internal successors, (91), 64 states have internal predecessors, (91), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-11 11:20:21,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 161 transitions. [2024-10-11 11:20:21,774 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 161 transitions. Word has length 219 [2024-10-11 11:20:21,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:20:21,775 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 161 transitions. [2024-10-11 11:20:21,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2024-10-11 11:20:21,775 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 161 transitions. [2024-10-11 11:20:21,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-11 11:20:21,780 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:20:21,780 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:20:21,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:20:21,781 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:20:21,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:20:21,786 INFO L85 PathProgramCache]: Analyzing trace with hash 251757449, now seen corresponding path program 1 times [2024-10-11 11:20:21,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:20:21,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109378712] [2024-10-11 11:20:21,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:20:21,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:20:21,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:20:22,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:20:22,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:20:22,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:20:22,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:20:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:20:22,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:20:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:20:22,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:20:22,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 11:20:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:20:22,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 11:20:22,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 11:20:22,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 11:20:22,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 11:20:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 11:20:22,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 11:20:22,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 11:20:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 11:20:22,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 11:20:22,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 11:20:22,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 11:20:22,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 11:20:22,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:20:22,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 11:20:22,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:20:22,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 11:20:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 11:20:22,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 11:20:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 11:20:22,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 11:20:22,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 11:20:22,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 11:20:22,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 11:20:22,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 11:20:22,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-11 11:20:22,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:20:22,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109378712] [2024-10-11 11:20:22,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109378712] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:20:22,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:20:22,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:20:22,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935541424] [2024-10-11 11:20:22,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:20:22,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:20:22,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:20:22,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:20:22,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:20:22,399 INFO L87 Difference]: Start difference. First operand 101 states and 161 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-11 11:20:22,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:20:22,678 INFO L93 Difference]: Finished difference Result 302 states and 482 transitions. [2024-10-11 11:20:22,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:20:22,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 219 [2024-10-11 11:20:22,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:20:22,686 INFO L225 Difference]: With dead ends: 302 [2024-10-11 11:20:22,686 INFO L226 Difference]: Without dead ends: 202 [2024-10-11 11:20:22,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:20:22,689 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 105 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:20:22,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 464 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 11:20:22,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-10-11 11:20:22,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 162. [2024-10-11 11:20:22,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 89 states have (on average 1.303370786516854) internal successors, (116), 89 states have internal predecessors, (116), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-11 11:20:22,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 256 transitions. [2024-10-11 11:20:22,734 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 256 transitions. Word has length 219 [2024-10-11 11:20:22,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:20:22,735 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 256 transitions. [2024-10-11 11:20:22,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-11 11:20:22,735 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 256 transitions. [2024-10-11 11:20:22,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-10-11 11:20:22,738 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:20:22,738 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:20:22,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 11:20:22,739 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:20:22,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:20:22,739 INFO L85 PathProgramCache]: Analyzing trace with hash 109604372, now seen corresponding path program 1 times [2024-10-11 11:20:22,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:20:22,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474720830] [2024-10-11 11:20:22,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:20:22,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:20:22,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:20:22,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:20:22,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:20:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:20:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:20:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:20:22,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:20:22,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:20:22,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:20:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 11:20:22,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:20:22,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 11:20:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 11:20:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 11:20:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 11:20:22,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 11:20:22,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 11:20:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 11:20:22,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 11:20:22,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 11:20:22,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 11:20:22,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 11:20:22,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 11:20:22,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:22,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:20:22,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:23,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 11:20:23,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:23,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:20:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:23,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 11:20:23,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:23,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 11:20:23,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:23,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 11:20:23,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:23,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 11:20:23,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:23,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 11:20:23,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:23,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 11:20:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:23,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 11:20:23,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:23,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 11:20:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:23,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 11:20:23,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:23,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-11 11:20:23,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:20:23,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474720830] [2024-10-11 11:20:23,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474720830] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:20:23,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:20:23,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:20:23,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897988116] [2024-10-11 11:20:23,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:20:23,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:20:23,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:20:23,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:20:23,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:20:23,037 INFO L87 Difference]: Start difference. First operand 162 states and 256 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-11 11:20:23,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:20:23,069 INFO L93 Difference]: Finished difference Result 262 states and 416 transitions. [2024-10-11 11:20:23,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:20:23,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 220 [2024-10-11 11:20:23,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:20:23,073 INFO L225 Difference]: With dead ends: 262 [2024-10-11 11:20:23,074 INFO L226 Difference]: Without dead ends: 162 [2024-10-11 11:20:23,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:20:23,080 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:20:23,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 309 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:20:23,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-11 11:20:23,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-10-11 11:20:23,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 89 states have (on average 1.2921348314606742) internal successors, (115), 89 states have internal predecessors, (115), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-11 11:20:23,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 255 transitions. [2024-10-11 11:20:23,115 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 255 transitions. Word has length 220 [2024-10-11 11:20:23,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:20:23,117 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 255 transitions. [2024-10-11 11:20:23,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-11 11:20:23,118 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 255 transitions. [2024-10-11 11:20:23,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-10-11 11:20:23,121 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:20:23,122 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:20:23,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 11:20:23,122 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:20:23,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:20:23,123 INFO L85 PathProgramCache]: Analyzing trace with hash -148561066, now seen corresponding path program 1 times [2024-10-11 11:20:23,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:20:23,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522762356] [2024-10-11 11:20:23,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:20:23,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:20:23,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:23,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:20:23,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:23,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:20:23,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:23,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:20:23,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:23,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:20:23,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:23,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:20:23,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:23,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:20:23,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:23,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:20:23,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:23,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:20:23,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:23,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:20:23,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:23,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 11:20:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:23,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:20:23,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:23,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 11:20:23,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:23,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 11:20:23,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:23,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 11:20:23,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:23,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 11:20:23,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:23,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 11:20:23,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:23,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 11:20:23,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:23,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 11:20:23,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:23,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 11:20:23,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:23,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 11:20:23,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:23,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 11:20:23,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:23,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 11:20:23,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:23,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 11:20:23,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:23,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:20:23,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:23,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 11:20:23,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:23,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:20:23,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:23,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 11:20:23,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:23,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 11:20:23,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:23,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 11:20:23,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:23,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 11:20:23,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:23,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 11:20:23,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:23,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 11:20:23,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:23,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 11:20:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:23,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 11:20:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:23,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 11:20:23,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:23,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-11 11:20:23,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:20:23,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522762356] [2024-10-11 11:20:23,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522762356] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:20:23,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:20:23,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:20:23,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781811957] [2024-10-11 11:20:23,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:20:23,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:20:23,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:20:23,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:20:23,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:20:23,411 INFO L87 Difference]: Start difference. First operand 162 states and 255 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-11 11:20:23,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:20:23,466 INFO L93 Difference]: Finished difference Result 262 states and 414 transitions. [2024-10-11 11:20:23,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:20:23,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 220 [2024-10-11 11:20:23,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:20:23,469 INFO L225 Difference]: With dead ends: 262 [2024-10-11 11:20:23,469 INFO L226 Difference]: Without dead ends: 162 [2024-10-11 11:20:23,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:20:23,471 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:20:23,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 290 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:20:23,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-11 11:20:23,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-10-11 11:20:23,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 89 states have (on average 1.2808988764044944) internal successors, (114), 89 states have internal predecessors, (114), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-11 11:20:23,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 254 transitions. [2024-10-11 11:20:23,489 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 254 transitions. Word has length 220 [2024-10-11 11:20:23,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:20:23,489 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 254 transitions. [2024-10-11 11:20:23,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-11 11:20:23,489 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 254 transitions. [2024-10-11 11:20:23,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-10-11 11:20:23,491 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:20:23,492 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:20:23,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 11:20:23,492 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:20:23,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:20:23,492 INFO L85 PathProgramCache]: Analyzing trace with hash -871176817, now seen corresponding path program 1 times [2024-10-11 11:20:23,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:20:23,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833774598] [2024-10-11 11:20:23,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:20:23,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:20:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:25,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:20:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:25,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:20:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:25,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:20:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:25,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:20:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:25,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:20:25,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:25,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:20:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:25,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:20:25,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:25,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:20:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:25,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:20:25,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:25,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 11:20:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:25,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:20:25,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:25,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 11:20:25,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:25,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 11:20:25,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:25,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 11:20:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:25,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 11:20:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:25,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 11:20:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:25,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 11:20:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:25,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 11:20:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:25,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 11:20:25,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:25,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 11:20:25,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:25,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 11:20:25,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:25,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 11:20:25,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:25,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 11:20:25,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:25,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:20:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:25,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 11:20:25,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:25,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:20:25,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:25,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 11:20:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:25,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 11:20:25,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:25,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 11:20:25,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:25,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 11:20:25,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:25,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 11:20:25,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:25,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 11:20:25,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:25,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 11:20:25,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:25,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 11:20:25,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:25,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 11:20:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:25,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 462 proven. 126 refuted. 0 times theorem prover too weak. 1792 trivial. 0 not checked. [2024-10-11 11:20:25,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:20:25,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833774598] [2024-10-11 11:20:25,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833774598] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:20:25,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587236507] [2024-10-11 11:20:25,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:20:25,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:20:25,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:20:25,660 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:20:25,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 11:20:25,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:25,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-11 11:20:25,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:20:28,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1668 proven. 120 refuted. 0 times theorem prover too weak. 592 trivial. 0 not checked. [2024-10-11 11:20:28,609 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:20:33,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587236507] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:20:33,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 11:20:33,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 31] total 42 [2024-10-11 11:20:33,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341805658] [2024-10-11 11:20:33,683 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 11:20:33,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-10-11 11:20:33,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:20:33,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-10-11 11:20:33,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=476, Invalid=2176, Unknown=0, NotChecked=0, Total=2652 [2024-10-11 11:20:33,691 INFO L87 Difference]: Start difference. First operand 162 states and 254 transitions. Second operand has 42 states, 41 states have (on average 2.5365853658536586) internal successors, (104), 37 states have internal predecessors, (104), 15 states have call successors, (53), 10 states have call predecessors, (53), 13 states have return successors, (53), 15 states have call predecessors, (53), 15 states have call successors, (53) [2024-10-11 11:20:47,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:20:47,438 INFO L93 Difference]: Finished difference Result 1085 states and 1486 transitions. [2024-10-11 11:20:47,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2024-10-11 11:20:47,439 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.5365853658536586) internal successors, (104), 37 states have internal predecessors, (104), 15 states have call successors, (53), 10 states have call predecessors, (53), 13 states have return successors, (53), 15 states have call predecessors, (53), 15 states have call successors, (53) Word has length 221 [2024-10-11 11:20:47,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:20:47,446 INFO L225 Difference]: With dead ends: 1085 [2024-10-11 11:20:47,446 INFO L226 Difference]: Without dead ends: 985 [2024-10-11 11:20:47,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 613 GetRequests, 365 SyntacticMatches, 1 SemanticMatches, 247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23604 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=10905, Invalid=50847, Unknown=0, NotChecked=0, Total=61752 [2024-10-11 11:20:47,470 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 2064 mSDsluCounter, 1333 mSDsCounter, 0 mSdLazyCounter, 2781 mSolverCounterSat, 1389 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2065 SdHoareTripleChecker+Valid, 1429 SdHoareTripleChecker+Invalid, 4170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1389 IncrementalHoareTripleChecker+Valid, 2781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:20:47,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2065 Valid, 1429 Invalid, 4170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1389 Valid, 2781 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-11 11:20:47,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2024-10-11 11:20:47,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 480. [2024-10-11 11:20:47,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 325 states have (on average 1.2338461538461538) internal successors, (401), 327 states have internal predecessors, (401), 121 states have call successors, (121), 33 states have call predecessors, (121), 33 states have return successors, (121), 119 states have call predecessors, (121), 121 states have call successors, (121) [2024-10-11 11:20:47,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 643 transitions. [2024-10-11 11:20:47,567 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 643 transitions. Word has length 221 [2024-10-11 11:20:47,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:20:47,568 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 643 transitions. [2024-10-11 11:20:47,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.5365853658536586) internal successors, (104), 37 states have internal predecessors, (104), 15 states have call successors, (53), 10 states have call predecessors, (53), 13 states have return successors, (53), 15 states have call predecessors, (53), 15 states have call successors, (53) [2024-10-11 11:20:47,569 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 643 transitions. [2024-10-11 11:20:47,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-10-11 11:20:47,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:20:47,571 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:20:47,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 11:20:47,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:20:47,773 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:20:47,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:20:47,773 INFO L85 PathProgramCache]: Analyzing trace with hash 2143926801, now seen corresponding path program 1 times [2024-10-11 11:20:47,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:20:47,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150600250] [2024-10-11 11:20:47,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:20:47,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:20:48,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:48,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:20:48,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:48,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:20:48,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:48,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:20:48,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:48,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:20:48,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:48,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:20:48,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:48,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:20:48,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:48,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:20:48,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:48,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:20:48,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:48,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:20:48,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:48,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 11:20:48,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:48,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:20:48,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:48,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 11:20:48,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:48,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 11:20:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:48,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 11:20:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:48,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 11:20:48,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:48,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 11:20:48,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:48,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 11:20:48,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:48,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 11:20:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:48,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 11:20:48,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:48,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 11:20:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:48,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 11:20:48,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:48,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 11:20:48,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:48,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 11:20:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:48,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:20:48,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:48,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 11:20:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:48,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:20:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:48,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 11:20:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:48,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 11:20:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:48,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 11:20:48,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:48,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 11:20:48,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:48,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 11:20:48,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:48,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 11:20:48,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:48,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 11:20:48,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:48,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 11:20:48,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:48,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 11:20:48,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:48,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 12 proven. 90 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2024-10-11 11:20:48,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:20:48,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150600250] [2024-10-11 11:20:48,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150600250] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:20:48,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359472065] [2024-10-11 11:20:48,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:20:48,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:20:48,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:20:48,468 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:20:48,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 11:20:48,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:48,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 11:20:48,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:20:49,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 554 proven. 174 refuted. 0 times theorem prover too weak. 1652 trivial. 0 not checked. [2024-10-11 11:20:49,387 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:20:49,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 12 proven. 90 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2024-10-11 11:20:49,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359472065] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 11:20:49,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 11:20:49,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 14 [2024-10-11 11:20:49,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123635563] [2024-10-11 11:20:49,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 11:20:49,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 11:20:49,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:20:49,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 11:20:49,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-10-11 11:20:49,680 INFO L87 Difference]: Start difference. First operand 480 states and 643 transitions. Second operand has 14 states, 14 states have (on average 8.928571428571429) internal successors, (125), 14 states have internal predecessors, (125), 4 states have call successors, (95), 3 states have call predecessors, (95), 5 states have return successors, (96), 4 states have call predecessors, (96), 4 states have call successors, (96) [2024-10-11 11:20:50,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:20:50,918 INFO L93 Difference]: Finished difference Result 1280 states and 1674 transitions. [2024-10-11 11:20:50,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-11 11:20:50,919 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.928571428571429) internal successors, (125), 14 states have internal predecessors, (125), 4 states have call successors, (95), 3 states have call predecessors, (95), 5 states have return successors, (96), 4 states have call predecessors, (96), 4 states have call successors, (96) Word has length 221 [2024-10-11 11:20:50,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:20:50,926 INFO L225 Difference]: With dead ends: 1280 [2024-10-11 11:20:50,926 INFO L226 Difference]: Without dead ends: 902 [2024-10-11 11:20:50,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 508 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=882, Unknown=0, NotChecked=0, Total=1260 [2024-10-11 11:20:50,928 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 251 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 1080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 11:20:50,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 761 Invalid, 1080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 11:20:50,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2024-10-11 11:20:51,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 726. [2024-10-11 11:20:51,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 475 states have (on average 1.1473684210526316) internal successors, (545), 480 states have internal predecessors, (545), 188 states have call successors, (188), 62 states have call predecessors, (188), 62 states have return successors, (188), 183 states have call predecessors, (188), 188 states have call successors, (188) [2024-10-11 11:20:51,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 921 transitions. [2024-10-11 11:20:51,153 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 921 transitions. Word has length 221 [2024-10-11 11:20:51,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:20:51,154 INFO L471 AbstractCegarLoop]: Abstraction has 726 states and 921 transitions. [2024-10-11 11:20:51,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.928571428571429) internal successors, (125), 14 states have internal predecessors, (125), 4 states have call successors, (95), 3 states have call predecessors, (95), 5 states have return successors, (96), 4 states have call predecessors, (96), 4 states have call successors, (96) [2024-10-11 11:20:51,155 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 921 transitions. [2024-10-11 11:20:51,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-10-11 11:20:51,157 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:20:51,157 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:20:51,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 11:20:51,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:20:51,362 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:20:51,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:20:51,362 INFO L85 PathProgramCache]: Analyzing trace with hash 2082788052, now seen corresponding path program 1 times [2024-10-11 11:20:51,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:20:51,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693979917] [2024-10-11 11:20:51,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:20:51,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:20:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 11:20:51,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [656149203] [2024-10-11 11:20:51,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:20:51,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:20:51,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:20:51,581 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:20:51,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 11:20:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:20:51,737 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 11:20:51,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:20:51,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 11:20:51,949 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 11:20:51,950 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 11:20:51,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 11:20:52,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:20:52,156 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:20:52,296 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 11:20:52,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:20:52 BoogieIcfgContainer [2024-10-11 11:20:52,299 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 11:20:52,300 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 11:20:52,300 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 11:20:52,300 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 11:20:52,300 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:20:20" (3/4) ... [2024-10-11 11:20:52,302 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 11:20:52,303 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 11:20:52,304 INFO L158 Benchmark]: Toolchain (without parser) took 32887.76ms. Allocated memory was 188.7MB in the beginning and 453.0MB in the end (delta: 264.2MB). Free memory was 119.9MB in the beginning and 200.1MB in the end (delta: -80.1MB). Peak memory consumption was 185.6MB. Max. memory is 16.1GB. [2024-10-11 11:20:52,304 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 113.2MB. Free memory is still 74.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:20:52,306 INFO L158 Benchmark]: CACSL2BoogieTranslator took 492.26ms. Allocated memory is still 188.7MB. Free memory was 119.7MB in the beginning and 156.2MB in the end (delta: -36.5MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. [2024-10-11 11:20:52,306 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.21ms. Allocated memory is still 188.7MB. Free memory was 155.7MB in the beginning and 149.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 11:20:52,306 INFO L158 Benchmark]: Boogie Preprocessor took 112.93ms. Allocated memory is still 188.7MB. Free memory was 149.4MB in the beginning and 138.0MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 11:20:52,306 INFO L158 Benchmark]: RCFGBuilder took 713.22ms. Allocated memory is still 188.7MB. Free memory was 138.0MB in the beginning and 100.4MB in the end (delta: 37.6MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-10-11 11:20:52,307 INFO L158 Benchmark]: TraceAbstraction took 31483.00ms. Allocated memory was 188.7MB in the beginning and 453.0MB in the end (delta: 264.2MB). Free memory was 99.6MB in the beginning and 200.1MB in the end (delta: -100.4MB). Peak memory consumption was 165.3MB. Max. memory is 16.1GB. [2024-10-11 11:20:52,307 INFO L158 Benchmark]: Witness Printer took 2.97ms. Allocated memory is still 453.0MB. Free memory is still 200.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:20:52,309 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.17ms. Allocated memory is still 113.2MB. Free memory is still 74.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 492.26ms. Allocated memory is still 188.7MB. Free memory was 119.7MB in the beginning and 156.2MB in the end (delta: -36.5MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.21ms. Allocated memory is still 188.7MB. Free memory was 155.7MB in the beginning and 149.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 112.93ms. Allocated memory is still 188.7MB. Free memory was 149.4MB in the beginning and 138.0MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 713.22ms. Allocated memory is still 188.7MB. Free memory was 138.0MB in the beginning and 100.4MB in the end (delta: 37.6MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 31483.00ms. Allocated memory was 188.7MB in the beginning and 453.0MB in the end (delta: 264.2MB). Free memory was 99.6MB in the beginning and 200.1MB in the end (delta: -100.4MB). Peak memory consumption was 165.3MB. Max. memory is 16.1GB. * Witness Printer took 2.97ms. Allocated memory is still 453.0MB. Free memory is still 200.1MB. 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 212, overapproximation of someBinaryDOUBLEComparisonOperation at line 212, overapproximation of someUnaryDOUBLEoperation at line 31. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 5; [L23] signed char var_1_6 = -8; [L24] unsigned short int var_1_7 = 16; [L25] unsigned char var_1_8 = 1; [L26] unsigned short int var_1_10 = 47037; [L27] unsigned char var_1_12 = 1; [L28] float var_1_13 = 1.2; [L29] float var_1_14 = 100000000000.25; [L30] float var_1_15 = 25.4; [L31] float var_1_16 = -0.8; [L32] float var_1_17 = 10000000.625; [L33] float var_1_18 = 0.19999999999999996; [L34] float var_1_19 = -0.25; [L35] float var_1_20 = 0.6; [L36] signed char var_1_21 = -128; [L37] signed char var_1_22 = 4; [L38] signed char var_1_23 = 10; [L39] unsigned char var_1_24 = 64; [L40] signed long int var_1_25 = 1939664001; [L41] unsigned char var_1_26 = 1; [L42] signed short int var_1_27 = 1; [L43] signed char var_1_28 = -100; [L44] signed long int var_1_30 = -2; [L45] unsigned long int var_1_31 = 64; [L46] double var_1_32 = 99.4; [L47] unsigned char var_1_33 = 128; [L48] unsigned char var_1_34 = 64; [L49] unsigned char var_1_35 = 64; [L50] unsigned char var_1_36 = 200; [L51] unsigned char var_1_37 = 2; [L52] signed char var_1_38 = -5; [L53] signed char var_1_39 = -10; [L54] signed short int last_1_var_1_27 = 1; [L55] unsigned char last_1_var_1_33 = 128; [L56] signed char last_1_var_1_38 = -5; [L216] isInitial = 1 [L217] FCALL initially() [L218] COND TRUE 1 [L219] CALL updateLastVariables() [L207] last_1_var_1_27 = var_1_27 [L208] last_1_var_1_33 = var_1_33 [L209] last_1_var_1_38 = var_1_38 [L219] RET updateLastVariables() [L220] CALL updateVariables() [L150] var_1_6 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_6 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=47037, var_1_12=1, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=47037, var_1_12=1, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L151] RET assume_abort_if_not(var_1_6 >= -127) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=47037, var_1_12=1, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L152] CALL assume_abort_if_not(var_1_6 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=47037, var_1_12=1, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=47037, var_1_12=1, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L152] RET assume_abort_if_not(var_1_6 <= 126) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=47037, var_1_12=1, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L153] var_1_8 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=47037, var_1_12=1, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=47037, var_1_12=1, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16] [L154] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=47037, var_1_12=1, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16] [L155] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=47037, var_1_12=1, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=47037, var_1_12=1, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L155] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=47037, var_1_12=1, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L156] var_1_10 = __VERIFIER_nondet_ushort() [L157] CALL assume_abort_if_not(var_1_10 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L157] RET assume_abort_if_not(var_1_10 >= 32767) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L158] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L158] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L159] var_1_12 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L160] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L161] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L161] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L162] var_1_14 = __VERIFIER_nondet_float() [L163] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L163] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L164] var_1_15 = __VERIFIER_nondet_float() [L165] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L165] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L166] var_1_16 = __VERIFIER_nondet_float() [L167] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L167] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L168] var_1_17 = __VERIFIER_nondet_float() [L169] CALL assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L169] RET assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L170] var_1_18 = __VERIFIER_nondet_float() [L171] 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_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L171] 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_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L172] var_1_19 = __VERIFIER_nondet_float() [L173] 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_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L173] 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_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L174] var_1_22 = __VERIFIER_nondet_char() [L175] CALL assume_abort_if_not(var_1_22 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L175] RET assume_abort_if_not(var_1_22 >= -1) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L176] CALL assume_abort_if_not(var_1_22 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L176] RET assume_abort_if_not(var_1_22 <= 126) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L177] var_1_23 = __VERIFIER_nondet_char() [L178] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L178] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L179] CALL assume_abort_if_not(var_1_23 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L179] RET assume_abort_if_not(var_1_23 <= 126) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L180] var_1_25 = __VERIFIER_nondet_long() [L181] CALL assume_abort_if_not(var_1_25 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L181] RET assume_abort_if_not(var_1_25 >= 1073741823) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L182] CALL assume_abort_if_not(var_1_25 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L182] RET assume_abort_if_not(var_1_25 <= 2147483647) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L183] var_1_26 = __VERIFIER_nondet_uchar() [L184] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L184] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L185] CALL assume_abort_if_not(var_1_26 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L185] RET assume_abort_if_not(var_1_26 <= 254) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L186] var_1_28 = __VERIFIER_nondet_char() [L187] CALL assume_abort_if_not(var_1_28 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L187] RET assume_abort_if_not(var_1_28 >= -128) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L188] CALL assume_abort_if_not(var_1_28 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L188] RET assume_abort_if_not(var_1_28 <= 127) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L189] CALL assume_abort_if_not(var_1_28 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L189] RET assume_abort_if_not(var_1_28 != 0) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L190] var_1_34 = __VERIFIER_nondet_uchar() [L191] CALL assume_abort_if_not(var_1_34 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=127, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=127, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L191] RET assume_abort_if_not(var_1_34 >= 63) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=127, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L192] CALL assume_abort_if_not(var_1_34 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=127, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=127, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L192] RET assume_abort_if_not(var_1_34 <= 127) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=127, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L193] var_1_35 = __VERIFIER_nondet_uchar() [L194] CALL assume_abort_if_not(var_1_35 >= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=127, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=127, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L194] RET assume_abort_if_not(var_1_35 >= 64) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=127, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L195] CALL assume_abort_if_not(var_1_35 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=127, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=127, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L195] RET assume_abort_if_not(var_1_35 <= 127) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=127, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L196] var_1_36 = __VERIFIER_nondet_uchar() [L197] CALL assume_abort_if_not(var_1_36 >= 190) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=127, var_1_35=64, var_1_36=254, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=127, var_1_35=64, var_1_36=254, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L197] RET assume_abort_if_not(var_1_36 >= 190) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=127, var_1_35=64, var_1_36=254, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L198] CALL assume_abort_if_not(var_1_36 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=127, var_1_35=64, var_1_36=254, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=127, var_1_35=64, var_1_36=254, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L198] RET assume_abort_if_not(var_1_36 <= 254) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=127, var_1_35=64, var_1_36=254, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L199] var_1_37 = __VERIFIER_nondet_uchar() [L200] CALL assume_abort_if_not(var_1_37 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=127, var_1_35=64, var_1_36=254, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=127, var_1_35=64, var_1_36=254, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L200] RET assume_abort_if_not(var_1_37 >= 0) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=127, var_1_35=64, var_1_36=254, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L201] CALL assume_abort_if_not(var_1_37 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=127, var_1_35=64, var_1_36=254, var_1_37=0, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=127, var_1_35=64, var_1_36=254, var_1_37=0, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L201] RET assume_abort_if_not(var_1_37 <= 63) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=127, var_1_35=64, var_1_36=254, var_1_37=0, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L202] var_1_39 = __VERIFIER_nondet_char() [L203] CALL assume_abort_if_not(var_1_39 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=127, var_1_35=64, var_1_36=254, var_1_37=0, var_1_38=-5, var_1_39=-63, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=127, var_1_35=64, var_1_36=254, var_1_37=0, var_1_38=-5, var_1_39=-63, var_1_6=-127, var_1_7=16, var_1_8=1] [L203] RET assume_abort_if_not(var_1_39 >= -63) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=127, var_1_35=64, var_1_36=254, var_1_37=0, var_1_38=-5, var_1_39=-63, var_1_6=-127, var_1_7=16, var_1_8=1] [L204] CALL assume_abort_if_not(var_1_39 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=127, var_1_35=64, var_1_36=254, var_1_37=0, var_1_38=-5, var_1_39=-63, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=127, var_1_35=64, var_1_36=254, var_1_37=0, var_1_38=-5, var_1_39=-63, var_1_6=-127, var_1_7=16, var_1_8=1] [L204] RET assume_abort_if_not(var_1_39 <= 63) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=127, var_1_35=64, var_1_36=254, var_1_37=0, var_1_38=-5, var_1_39=-63, var_1_6=-127, var_1_7=16, var_1_8=1] [L220] RET updateVariables() [L221] CALL step() [L60] COND TRUE -64 <= last_1_var_1_38 VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=64, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=127, var_1_35=64, var_1_36=254, var_1_37=0, var_1_38=-5, var_1_39=-63, var_1_6=-127, var_1_7=16, var_1_8=1] [L61] COND TRUE ((last_1_var_1_33 - last_1_var_1_33) / var_1_10) > (var_1_23 - (var_1_25 - last_1_var_1_27)) [L62] var_1_24 = ((((var_1_23) > (var_1_26)) ? (var_1_23) : (var_1_26))) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=0, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=127, var_1_35=64, var_1_36=254, var_1_37=0, var_1_38=-5, var_1_39=-63, var_1_6=-127, var_1_7=16, var_1_8=1] [L69] COND TRUE \read(var_1_8) [L70] var_1_20 = var_1_15 VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_15=2, var_1_1=5, var_1_20=2, var_1_21=-128, var_1_22=65, var_1_23=0, var_1_24=0, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=127, var_1_35=64, var_1_36=254, var_1_37=0, var_1_38=-5, var_1_39=-63, var_1_6=-127, var_1_7=16, var_1_8=1] [L72] COND TRUE var_1_16 >= (9.99999999999994E13f * var_1_20) [L73] var_1_21 = (var_1_22 - ((((4) > (var_1_23)) ? (4) : (var_1_23)))) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_15=2, var_1_1=5, var_1_20=2, var_1_21=61, var_1_22=65, var_1_23=0, var_1_24=0, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=127, var_1_35=64, var_1_36=254, var_1_37=0, var_1_38=-5, var_1_39=-63, var_1_6=-127, var_1_7=16, var_1_8=1] [L75] COND FALSE !((((((var_1_17) > (var_1_16)) ? (var_1_17) : (var_1_16))) * var_1_19) <= (0.25f / 5.75f)) [L82] var_1_30 = -1 VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_15=2, var_1_1=5, var_1_20=2, var_1_21=61, var_1_22=65, var_1_23=0, var_1_24=0, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-1, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=127, var_1_35=64, var_1_36=254, var_1_37=0, var_1_38=-5, var_1_39=-63, var_1_6=-127, var_1_7=16, var_1_8=1] [L84] var_1_33 = ((((((var_1_34 + var_1_35)) > ((var_1_36 - var_1_37))) ? ((var_1_34 + var_1_35)) : ((var_1_36 - var_1_37)))) - var_1_23) [L85] unsigned char stepLocal_3 = var_1_37; VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, stepLocal_3=0, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_15=2, var_1_1=5, var_1_20=2, var_1_21=61, var_1_22=65, var_1_23=0, var_1_24=0, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-1, var_1_31=64, var_1_32=497/5, var_1_33=254, var_1_34=127, var_1_35=64, var_1_36=254, var_1_37=0, var_1_38=-5, var_1_39=-63, var_1_6=-127, var_1_7=16, var_1_8=1] [L86] COND FALSE !(var_1_34 <= stepLocal_3) [L93] var_1_38 = var_1_22 VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_15=2, var_1_1=5, var_1_20=2, var_1_21=61, var_1_22=65, var_1_23=0, var_1_24=0, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-1, var_1_31=64, var_1_32=497/5, var_1_33=254, var_1_34=127, var_1_35=64, var_1_36=254, var_1_37=0, var_1_38=65, var_1_39=-63, var_1_6=-127, var_1_7=16, var_1_8=1] [L95] unsigned char stepLocal_1 = var_1_33; VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, stepLocal_1=254, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_15=2, var_1_1=5, var_1_20=2, var_1_21=61, var_1_22=65, var_1_23=0, var_1_24=0, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-1, var_1_31=64, var_1_32=497/5, var_1_33=254, var_1_34=127, var_1_35=64, var_1_36=254, var_1_37=0, var_1_38=65, var_1_39=-63, var_1_6=-127, var_1_7=16, var_1_8=1] [L96] COND FALSE !(stepLocal_1 <= var_1_30) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_15=2, var_1_1=5, var_1_20=2, var_1_21=61, var_1_22=65, var_1_23=0, var_1_24=0, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-1, var_1_31=64, var_1_32=497/5, var_1_33=254, var_1_34=127, var_1_35=64, var_1_36=254, var_1_37=0, var_1_38=65, var_1_39=-63, var_1_6=-127, var_1_7=16, var_1_8=1] [L103] COND TRUE \read(var_1_12) [L104] var_1_7 = var_1_33 VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_15=2, var_1_1=5, var_1_20=2, var_1_21=61, var_1_22=65, var_1_23=0, var_1_24=0, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-1, var_1_31=64, var_1_32=497/5, var_1_33=254, var_1_34=127, var_1_35=64, var_1_36=254, var_1_37=0, var_1_38=65, var_1_39=-63, var_1_6=-127, var_1_7=254, var_1_8=1] [L109] signed long int stepLocal_2 = - var_1_7; VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, stepLocal_2=-254, var_1_10=-32769, var_1_12=1, var_1_13=6/5, var_1_15=2, var_1_1=5, var_1_20=2, var_1_21=61, var_1_22=65, var_1_23=0, var_1_24=0, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-1, var_1_31=64, var_1_32=497/5, var_1_33=254, var_1_34=127, var_1_35=64, var_1_36=254, var_1_37=0, var_1_38=65, var_1_39=-63, var_1_6=-127, var_1_7=254, var_1_8=1] [L110] COND TRUE stepLocal_2 <= var_1_24 [L111] var_1_13 = ((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15))) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=3, var_1_14=3, var_1_15=2, var_1_1=5, var_1_20=2, var_1_21=61, var_1_22=65, var_1_23=0, var_1_24=0, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-1, var_1_31=64, var_1_32=497/5, var_1_33=254, var_1_34=127, var_1_35=64, var_1_36=254, var_1_37=0, var_1_38=65, var_1_39=-63, var_1_6=-127, var_1_7=254, var_1_8=1] [L115] COND TRUE (var_1_22 / var_1_28) == 32 [L116] var_1_31 = ((((var_1_25) < (var_1_38)) ? (var_1_25) : (var_1_38))) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=3, var_1_14=3, var_1_15=2, var_1_1=5, var_1_20=2, var_1_21=61, var_1_22=65, var_1_23=0, var_1_24=0, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-1, var_1_31=65, var_1_32=497/5, var_1_33=254, var_1_34=127, var_1_35=64, var_1_36=254, var_1_37=0, var_1_38=65, var_1_39=-63, var_1_6=-127, var_1_7=254, var_1_8=1] [L126] EXPR var_1_7 ^ var_1_33 VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=3, var_1_14=3, var_1_15=2, var_1_1=5, var_1_20=2, var_1_21=61, var_1_22=65, var_1_23=0, var_1_24=0, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-1, var_1_31=65, var_1_32=497/5, var_1_33=254, var_1_34=127, var_1_35=64, var_1_36=254, var_1_37=0, var_1_38=65, var_1_39=-63, var_1_6=-127, var_1_7=254, var_1_8=1] [L126] COND FALSE !((~ (var_1_7 ^ var_1_33)) >= var_1_7) [L129] COND TRUE \read(var_1_8) [L130] var_1_32 = var_1_19 VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=3, var_1_14=3, var_1_15=2, var_1_19=4, var_1_1=5, var_1_20=2, var_1_21=61, var_1_22=65, var_1_23=0, var_1_24=0, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-1, var_1_31=65, var_1_32=4, var_1_33=254, var_1_34=127, var_1_35=64, var_1_36=254, var_1_37=0, var_1_38=65, var_1_39=-63, var_1_6=-127, var_1_7=254, var_1_8=1] [L133] unsigned char stepLocal_0 = var_1_24; VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, stepLocal_0=0, var_1_10=-32769, var_1_12=1, var_1_13=3, var_1_14=3, var_1_15=2, var_1_19=4, var_1_1=5, var_1_20=2, var_1_21=61, var_1_22=65, var_1_23=0, var_1_24=0, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-1, var_1_31=65, var_1_32=4, var_1_33=254, var_1_34=127, var_1_35=64, var_1_36=254, var_1_37=0, var_1_38=65, var_1_39=-63, var_1_6=-127, var_1_7=254, var_1_8=1] [L134] COND FALSE !(var_1_30 > stepLocal_0) [L141] var_1_1 = var_1_6 VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=3, var_1_14=3, var_1_15=2, var_1_19=4, var_1_1=-127, var_1_20=2, var_1_21=61, var_1_22=65, var_1_23=0, var_1_24=0, var_1_25=1073741823, var_1_26=-256, var_1_27=1, var_1_28=2, var_1_30=-1, var_1_31=65, var_1_32=4, var_1_33=254, var_1_34=127, var_1_35=64, var_1_36=254, var_1_37=0, var_1_38=65, var_1_39=-63, var_1_6=-127, var_1_7=254, var_1_8=1] [L143] COND FALSE !(var_1_14 <= var_1_15) [L146] var_1_27 = var_1_30 VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=3, var_1_14=3, var_1_15=2, var_1_19=4, var_1_1=-127, var_1_20=2, var_1_21=61, var_1_22=65, var_1_23=0, var_1_24=0, var_1_25=1073741823, var_1_26=-256, var_1_27=-1, var_1_28=2, var_1_30=-1, var_1_31=65, var_1_32=4, var_1_33=254, var_1_34=127, var_1_35=64, var_1_36=254, var_1_37=0, var_1_38=65, var_1_39=-63, var_1_6=-127, var_1_7=254, var_1_8=1] [L221] RET step() [L222] CALL, EXPR property() [L212] EXPR ((((((((((var_1_30 > var_1_24) ? ((((((var_1_32) < 0 ) ? -(var_1_32) : (var_1_32))) < var_1_32) ? (var_1_1 == ((signed char) var_1_6)) : (var_1_1 == ((signed char) var_1_6))) : (var_1_1 == ((signed char) var_1_6))) && ((var_1_33 <= var_1_30) ? (var_1_8 ? (var_1_7 == ((unsigned short int) ((((var_1_33) > ((var_1_10 - var_1_24))) ? (var_1_33) : ((var_1_10 - var_1_24)))))) : (var_1_7 == ((unsigned short int) (var_1_10 - var_1_24)))) : (var_1_12 ? (var_1_7 == ((unsigned short int) var_1_33)) : (var_1_7 == ((unsigned short int) var_1_10))))) && (((- var_1_7) <= var_1_24) ? (var_1_13 == ((float) ((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15))))) : (var_1_13 == ((float) (((((var_1_16) > ((var_1_17 + var_1_18))) ? (var_1_16) : ((var_1_17 + var_1_18)))) + var_1_19))))) && (var_1_8 ? (var_1_20 == ((float) var_1_15)) : 1)) && ((var_1_16 >= (9.99999999999994E13f * var_1_20)) ? (var_1_21 == ((signed char) (var_1_22 - ((((4) > (var_1_23)) ? (4) : (var_1_23)))))) : 1)) && ((-64 <= last_1_var_1_38) ? ((((last_1_var_1_33 - last_1_var_1_33) / var_1_10) > (var_1_23 - (var_1_25 - last_1_var_1_27))) ? (var_1_24 == ((unsigned char) ((((var_1_23) > (var_1_26)) ? (var_1_23) : (var_1_26))))) : (var_1_24 == ((unsigned char) 4))) : (var_1_24 == ((unsigned char) var_1_23)))) && ((var_1_14 <= var_1_15) ? (var_1_27 == ((signed short int) (var_1_26 - ((((var_1_21) < ((var_1_23 + var_1_24))) ? (var_1_21) : ((var_1_23 + var_1_24))))))) : (var_1_27 == ((signed short int) var_1_30)))) && (((((((var_1_17) > (var_1_16)) ? (var_1_17) : (var_1_16))) * var_1_19) <= (0.25f / 5.75f)) ? (var_1_12 ? (var_1_30 == ((signed long int) var_1_26)) : (var_1_30 == ((signed long int) var_1_22))) : (var_1_30 == ((signed long int) -1)))) && (((var_1_22 / var_1_28) == 32) ? (var_1_31 == ((unsigned long int) ((((var_1_25) < (var_1_38)) ? (var_1_25) : (var_1_38))))) : (((((((- var_1_13)) < ((- var_1_19))) ? ((- var_1_13)) : ((- var_1_19)))) > 8.95f) ? ((var_1_33 <= var_1_33) ? (var_1_31 == ((unsigned long int) var_1_33)) : 1) : (var_1_31 == ((unsigned long int) var_1_33))))) && (((~ (var_1_7 ^ var_1_33)) >= var_1_7) ? (var_1_32 == ((double) var_1_15)) : (var_1_8 ? (var_1_32 == ((double) var_1_19)) : 1)) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=3, var_1_14=3, var_1_15=2, var_1_19=4, var_1_1=-127, var_1_20=2, var_1_21=61, var_1_22=65, var_1_23=0, var_1_24=0, var_1_25=1073741823, var_1_26=-256, var_1_27=-1, var_1_28=2, var_1_30=-1, var_1_31=65, var_1_32=4, var_1_33=254, var_1_34=127, var_1_35=64, var_1_36=254, var_1_37=0, var_1_38=65, var_1_39=-63, var_1_6=-127, var_1_7=254, var_1_8=1] [L212-L213] return ((((((((((((var_1_30 > var_1_24) ? ((((((var_1_32) < 0 ) ? -(var_1_32) : (var_1_32))) < var_1_32) ? (var_1_1 == ((signed char) var_1_6)) : (var_1_1 == ((signed char) var_1_6))) : (var_1_1 == ((signed char) var_1_6))) && ((var_1_33 <= var_1_30) ? (var_1_8 ? (var_1_7 == ((unsigned short int) ((((var_1_33) > ((var_1_10 - var_1_24))) ? (var_1_33) : ((var_1_10 - var_1_24)))))) : (var_1_7 == ((unsigned short int) (var_1_10 - var_1_24)))) : (var_1_12 ? (var_1_7 == ((unsigned short int) var_1_33)) : (var_1_7 == ((unsigned short int) var_1_10))))) && (((- var_1_7) <= var_1_24) ? (var_1_13 == ((float) ((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15))))) : (var_1_13 == ((float) (((((var_1_16) > ((var_1_17 + var_1_18))) ? (var_1_16) : ((var_1_17 + var_1_18)))) + var_1_19))))) && (var_1_8 ? (var_1_20 == ((float) var_1_15)) : 1)) && ((var_1_16 >= (9.99999999999994E13f * var_1_20)) ? (var_1_21 == ((signed char) (var_1_22 - ((((4) > (var_1_23)) ? (4) : (var_1_23)))))) : 1)) && ((-64 <= last_1_var_1_38) ? ((((last_1_var_1_33 - last_1_var_1_33) / var_1_10) > (var_1_23 - (var_1_25 - last_1_var_1_27))) ? (var_1_24 == ((unsigned char) ((((var_1_23) > (var_1_26)) ? (var_1_23) : (var_1_26))))) : (var_1_24 == ((unsigned char) 4))) : (var_1_24 == ((unsigned char) var_1_23)))) && ((var_1_14 <= var_1_15) ? (var_1_27 == ((signed short int) (var_1_26 - ((((var_1_21) < ((var_1_23 + var_1_24))) ? (var_1_21) : ((var_1_23 + var_1_24))))))) : (var_1_27 == ((signed short int) var_1_30)))) && (((((((var_1_17) > (var_1_16)) ? (var_1_17) : (var_1_16))) * var_1_19) <= (0.25f / 5.75f)) ? (var_1_12 ? (var_1_30 == ((signed long int) var_1_26)) : (var_1_30 == ((signed long int) var_1_22))) : (var_1_30 == ((signed long int) -1)))) && (((var_1_22 / var_1_28) == 32) ? (var_1_31 == ((unsigned long int) ((((var_1_25) < (var_1_38)) ? (var_1_25) : (var_1_38))))) : (((((((- var_1_13)) < ((- var_1_19))) ? ((- var_1_13)) : ((- var_1_19)))) > 8.95f) ? ((var_1_33 <= var_1_33) ? (var_1_31 == ((unsigned long int) var_1_33)) : 1) : (var_1_31 == ((unsigned long int) var_1_33))))) && (((~ (var_1_7 ^ var_1_33)) >= var_1_7) ? (var_1_32 == ((double) var_1_15)) : (var_1_8 ? (var_1_32 == ((double) var_1_19)) : 1))) && (var_1_33 == ((unsigned char) ((((((var_1_34 + var_1_35)) > ((var_1_36 - var_1_37))) ? ((var_1_34 + var_1_35)) : ((var_1_36 - var_1_37)))) - var_1_23)))) && ((var_1_34 <= var_1_37) ? ((var_1_20 > var_1_20) ? (var_1_38 == ((signed char) ((((((((var_1_37) > (var_1_36)) ? (var_1_37) : (var_1_36)))) > (var_1_22)) ? (((((var_1_37) > (var_1_36)) ? (var_1_37) : (var_1_36)))) : (var_1_22))))) : (var_1_38 == ((signed char) (var_1_37 + var_1_39)))) : (var_1_38 == ((signed char) var_1_22))) ; [L222] RET, EXPR property() [L222] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=3, var_1_14=3, var_1_15=2, var_1_19=4, var_1_1=-127, var_1_20=2, var_1_21=61, var_1_22=65, var_1_23=0, var_1_24=0, var_1_25=1073741823, var_1_26=-256, var_1_27=-1, var_1_28=2, var_1_30=-1, var_1_31=65, var_1_32=4, var_1_33=254, var_1_34=127, var_1_35=64, var_1_36=254, var_1_37=0, var_1_38=65, var_1_39=-63, var_1_6=-127, var_1_7=254, var_1_8=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=-32769, var_1_12=1, var_1_13=3, var_1_14=3, var_1_15=2, var_1_19=4, var_1_1=-127, var_1_20=2, var_1_21=61, var_1_22=65, var_1_23=0, var_1_24=0, var_1_25=1073741823, var_1_26=-256, var_1_27=-1, var_1_28=2, var_1_30=-1, var_1_31=65, var_1_32=4, var_1_33=254, var_1_34=127, var_1_35=64, var_1_36=254, var_1_37=0, var_1_38=65, var_1_39=-63, var_1_6=-127, var_1_7=254, var_1_8=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.3s, OverallIterations: 7, TraceHistogramMax: 35, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2423 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2420 mSDsluCounter, 3411 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2491 mSDsCounter, 1662 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3751 IncrementalHoareTripleChecker+Invalid, 5413 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1662 mSolverCounterUnsat, 920 mSDtfsCounter, 3751 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1487 GetRequests, 1198 SyntacticMatches, 3 SemanticMatches, 286 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23855 ImplicationChecksByTransitivity, 13.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=726occurred in iteration=6, InterpolantAutomatonStates: 239, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 6 MinimizatonAttempts, 721 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 12.7s InterpolantComputationTime, 2208 NumberOfCodeBlocks, 2208 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1974 ConstructedInterpolants, 0 QuantifiedInterpolants, 9049 SizeOfPredicates, 10 NumberOfNonLiveVariables, 995 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 9 InterpolantComputations, 4 PerfectInterpolantSequences, 20820/21420 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 11:20:52,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-7.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3323554ed5d8a95c631cfba7b209abf31440dbfb83bb65542e5f9a71f94c9b4b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:20:54,412 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:20:54,498 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 11:20:54,505 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:20:54,505 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:20:54,532 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:20:54,532 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:20:54,533 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:20:54,533 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:20:54,534 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:20:54,534 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:20:54,535 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:20:54,535 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:20:54,535 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:20:54,536 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:20:54,536 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:20:54,537 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:20:54,537 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:20:54,540 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:20:54,541 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:20:54,543 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:20:54,544 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:20:54,544 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:20:54,544 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 11:20:54,545 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 11:20:54,545 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:20:54,545 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 11:20:54,545 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:20:54,546 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:20:54,546 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:20:54,546 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:20:54,546 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:20:54,547 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:20:54,547 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:20:54,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:20:54,548 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:20:54,549 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:20:54,549 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:20:54,549 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 11:20:54,549 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 11:20:54,550 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:20:54,550 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:20:54,550 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:20:54,551 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:20:54,551 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 11:20:54,551 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3323554ed5d8a95c631cfba7b209abf31440dbfb83bb65542e5f9a71f94c9b4b [2024-10-11 11:20:54,864 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:20:54,889 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:20:54,893 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:20:54,894 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:20:54,895 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:20:54,897 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-7.i [2024-10-11 11:20:56,474 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:20:56,704 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:20:56,706 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-7.i [2024-10-11 11:20:56,722 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/43f1bbfa8/f6cda89bce8940f08b211bc3f743ee5b/FLAGca686295e [2024-10-11 11:20:56,737 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/43f1bbfa8/f6cda89bce8940f08b211bc3f743ee5b [2024-10-11 11:20:56,740 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:20:56,741 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:20:56,743 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:20:56,744 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:20:56,749 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:20:56,750 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:20:56" (1/1) ... [2024-10-11 11:20:56,751 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19b9844 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:56, skipping insertion in model container [2024-10-11 11:20:56,751 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:20:56" (1/1) ... [2024-10-11 11:20:56,789 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:20:56,982 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-7.i[915,928] [2024-10-11 11:20:57,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:20:57,092 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:20:57,106 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-7.i[915,928] [2024-10-11 11:20:57,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:20:57,165 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:20:57,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:57 WrapperNode [2024-10-11 11:20:57,166 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:20:57,167 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:20:57,167 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:20:57,167 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:20:57,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:57" (1/1) ... [2024-10-11 11:20:57,189 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:57" (1/1) ... [2024-10-11 11:20:57,227 INFO L138 Inliner]: procedures = 27, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 219 [2024-10-11 11:20:57,227 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:20:57,228 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:20:57,228 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:20:57,228 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:20:57,242 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:57" (1/1) ... [2024-10-11 11:20:57,244 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:57" (1/1) ... [2024-10-11 11:20:57,249 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:57" (1/1) ... [2024-10-11 11:20:57,269 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 11:20:57,270 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:57" (1/1) ... [2024-10-11 11:20:57,270 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:57" (1/1) ... [2024-10-11 11:20:57,287 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:57" (1/1) ... [2024-10-11 11:20:57,294 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:57" (1/1) ... [2024-10-11 11:20:57,297 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:57" (1/1) ... [2024-10-11 11:20:57,303 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:57" (1/1) ... [2024-10-11 11:20:57,310 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:20:57,311 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:20:57,311 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:20:57,311 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:20:57,312 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:57" (1/1) ... [2024-10-11 11:20:57,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:20:57,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:20:57,347 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:20:57,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:20:57,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:20:57,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 11:20:57,383 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:20:57,383 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:20:57,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:20:57,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:20:57,489 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:20:57,491 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:21:01,296 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 11:21:01,296 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:21:01,358 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:21:01,358 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:21:01,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:21:01 BoogieIcfgContainer [2024-10-11 11:21:01,359 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:21:01,361 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:21:01,361 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:21:01,368 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:21:01,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:20:56" (1/3) ... [2024-10-11 11:21:01,372 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a622322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:21:01, skipping insertion in model container [2024-10-11 11:21:01,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:57" (2/3) ... [2024-10-11 11:21:01,372 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a622322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:21:01, skipping insertion in model container [2024-10-11 11:21:01,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:21:01" (3/3) ... [2024-10-11 11:21:01,374 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-7.i [2024-10-11 11:21:01,390 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:21:01,391 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:21:01,485 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:21:01,492 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;@70433614, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:21:01,493 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:21:01,497 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-11 11:21:01,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-11 11:21:01,515 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:21:01,516 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:21:01,517 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:21:01,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:21:01,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1112580181, now seen corresponding path program 1 times [2024-10-11 11:21:01,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:21:01,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1012937047] [2024-10-11 11:21:01,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:21:01,538 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:21:01,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:21:01,541 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:21:01,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 11:21:02,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:21:02,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 11:21:02,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:21:02,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1028 proven. 0 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2024-10-11 11:21:02,116 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:21:02,116 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:21:02,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1012937047] [2024-10-11 11:21:02,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1012937047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:21:02,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:21:02,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:21:02,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129956366] [2024-10-11 11:21:02,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:21:02,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:21:02,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:21:02,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:21:02,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:21:02,160 INFO L87 Difference]: Start difference. First operand has 92 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-10-11 11:21:06,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:21:06,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:21:06,298 INFO L93 Difference]: Finished difference Result 181 states and 331 transitions. [2024-10-11 11:21:06,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:21:06,334 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 216 [2024-10-11 11:21:06,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:21:06,341 INFO L225 Difference]: With dead ends: 181 [2024-10-11 11:21:06,341 INFO L226 Difference]: Without dead ends: 90 [2024-10-11 11:21:06,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:21:06,349 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:21:06,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-11 11:21:06,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-11 11:21:06,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-11 11:21:06,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 53 states have (on average 1.320754716981132) internal successors, (70), 53 states have internal predecessors, (70), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-11 11:21:06,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 140 transitions. [2024-10-11 11:21:06,406 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 140 transitions. Word has length 216 [2024-10-11 11:21:06,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:21:06,406 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 140 transitions. [2024-10-11 11:21:06,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-10-11 11:21:06,407 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 140 transitions. [2024-10-11 11:21:06,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-10-11 11:21:06,412 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:21:06,412 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:21:06,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-11 11:21:06,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:21:06,613 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:21:06,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:21:06,614 INFO L85 PathProgramCache]: Analyzing trace with hash 550632147, now seen corresponding path program 1 times [2024-10-11 11:21:06,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:21:06,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1628991111] [2024-10-11 11:21:06,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:21:06,616 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:21:06,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:21:06,618 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:21:06,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 11:21:07,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:21:07,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 11:21:07,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:21:09,238 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-11 11:21:09,238 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:21:09,238 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:21:09,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1628991111] [2024-10-11 11:21:09,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1628991111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:21:09,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:21:09,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:21:09,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005451986] [2024-10-11 11:21:09,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:21:09,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:21:09,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:21:09,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:21:09,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:21:09,243 INFO L87 Difference]: Start difference. First operand 90 states and 140 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-11 11:21:13,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:21:16,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.19s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:21:21,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:21:21,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:21:21,015 INFO L93 Difference]: Finished difference Result 269 states and 419 transitions. [2024-10-11 11:21:21,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:21:21,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 217 [2024-10-11 11:21:21,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:21:21,055 INFO L225 Difference]: With dead ends: 269 [2024-10-11 11:21:21,055 INFO L226 Difference]: Without dead ends: 180 [2024-10-11 11:21:21,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:21:21,058 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 81 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 71 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2024-10-11 11:21:21,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 405 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 11 Invalid, 2 Unknown, 0 Unchecked, 11.7s Time] [2024-10-11 11:21:21,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-11 11:21:21,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 151. [2024-10-11 11:21:21,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 78 states have (on average 1.2179487179487178) internal successors, (95), 78 states have internal predecessors, (95), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-11 11:21:21,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 235 transitions. [2024-10-11 11:21:21,110 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 235 transitions. Word has length 217 [2024-10-11 11:21:21,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:21:21,111 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 235 transitions. [2024-10-11 11:21:21,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-11 11:21:21,111 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 235 transitions. [2024-10-11 11:21:21,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-10-11 11:21:21,118 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:21:21,118 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:21:21,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 11:21:21,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:21:21,319 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:21:21,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:21:21,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1606079060, now seen corresponding path program 1 times [2024-10-11 11:21:21,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:21:21,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2068796147] [2024-10-11 11:21:21,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:21:21,321 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:21:21,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:21:21,324 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:21:21,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 11:21:21,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:21:21,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 11:21:21,784 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:21:21,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-11 11:21:21,856 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:21:21,856 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:21:21,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2068796147] [2024-10-11 11:21:21,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2068796147] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:21:21,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:21:21,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:21:21,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699217756] [2024-10-11 11:21:21,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:21:21,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:21:21,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:21:21,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:21:21,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:21:21,862 INFO L87 Difference]: Start difference. First operand 151 states and 235 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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-11 11:21:26,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:21:26,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:21:26,252 INFO L93 Difference]: Finished difference Result 240 states and 374 transitions. [2024-10-11 11:21:26,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:21:26,286 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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 218 [2024-10-11 11:21:26,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:21:26,289 INFO L225 Difference]: With dead ends: 240 [2024-10-11 11:21:26,289 INFO L226 Difference]: Without dead ends: 151 [2024-10-11 11:21:26,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:21:26,291 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-11 11:21:26,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 268 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2024-10-11 11:21:26,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-11 11:21:26,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2024-10-11 11:21:26,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 78 states have (on average 1.205128205128205) internal successors, (94), 78 states have internal predecessors, (94), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-11 11:21:26,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 234 transitions. [2024-10-11 11:21:26,332 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 234 transitions. Word has length 218 [2024-10-11 11:21:26,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:21:26,333 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 234 transitions. [2024-10-11 11:21:26,333 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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-11 11:21:26,333 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 234 transitions. [2024-10-11 11:21:26,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-10-11 11:21:26,336 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:21:26,336 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:21:26,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 11:21:26,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:21:26,537 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:21:26,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:21:26,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1999106070, now seen corresponding path program 1 times [2024-10-11 11:21:26,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:21:26,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [728672335] [2024-10-11 11:21:26,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:21:26,539 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:21:26,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:21:26,541 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:21:26,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 11:21:27,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:21:27,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-11 11:21:27,077 INFO L278 TraceCheckSpWp]: Computing forward predicates...