./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-15.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-15.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9bbe13ecce95df27b2722f410096981490ce7740fe6889f9893c48afb2768e7c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:36:30,957 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:36:31,013 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 11:36:31,021 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:36:31,021 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:36:31,042 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:36:31,043 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:36:31,043 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:36:31,044 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:36:31,044 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:36:31,044 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:36:31,044 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:36:31,044 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:36:31,045 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:36:31,045 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:36:31,045 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:36:31,045 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:36:31,046 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:36:31,046 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 11:36:31,046 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:36:31,046 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:36:31,046 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:36:31,046 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:36:31,046 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:36:31,046 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:36:31,046 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:36:31,046 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:36:31,046 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:36:31,046 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:36:31,046 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:36:31,047 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:36:31,047 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:36:31,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:36:31,047 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:36:31,047 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:36:31,047 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:36:31,047 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:36:31,047 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 11:36:31,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 11:36:31,048 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:36:31,048 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:36:31,048 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:36:31,048 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:36:31,048 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9bbe13ecce95df27b2722f410096981490ce7740fe6889f9893c48afb2768e7c [2025-03-08 11:36:31,259 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:36:31,268 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:36:31,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:36:31,271 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:36:31,271 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:36:31,272 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-15.i [2025-03-08 11:36:32,467 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/525ca8143/26138f0095c74284adc84ccf8608ca97/FLAGc34b197a3 [2025-03-08 11:36:32,725 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:36:32,726 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-15.i [2025-03-08 11:36:32,733 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/525ca8143/26138f0095c74284adc84ccf8608ca97/FLAGc34b197a3 [2025-03-08 11:36:33,041 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/525ca8143/26138f0095c74284adc84ccf8608ca97 [2025-03-08 11:36:33,043 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:36:33,044 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:36:33,045 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:36:33,045 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:36:33,048 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:36:33,048 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:36:33" (1/1) ... [2025-03-08 11:36:33,049 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b129ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:36:33, skipping insertion in model container [2025-03-08 11:36:33,049 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:36:33" (1/1) ... [2025-03-08 11:36:33,061 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:36:33,161 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-15.i[919,932] [2025-03-08 11:36:33,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:36:33,219 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:36:33,227 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-15.i[919,932] [2025-03-08 11:36:33,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:36:33,261 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:36:33,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:36:33 WrapperNode [2025-03-08 11:36:33,263 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:36:33,264 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:36:33,264 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:36:33,264 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:36:33,268 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:36:33" (1/1) ... [2025-03-08 11:36:33,277 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:36:33" (1/1) ... [2025-03-08 11:36:33,301 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 196 [2025-03-08 11:36:33,301 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:36:33,302 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:36:33,302 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:36:33,302 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:36:33,309 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:36:33" (1/1) ... [2025-03-08 11:36:33,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:36:33" (1/1) ... [2025-03-08 11:36:33,311 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:36:33" (1/1) ... [2025-03-08 11:36:33,319 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]. [2025-03-08 11:36:33,319 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:36:33" (1/1) ... [2025-03-08 11:36:33,320 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:36:33" (1/1) ... [2025-03-08 11:36:33,325 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:36:33" (1/1) ... [2025-03-08 11:36:33,325 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:36:33" (1/1) ... [2025-03-08 11:36:33,326 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:36:33" (1/1) ... [2025-03-08 11:36:33,327 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:36:33" (1/1) ... [2025-03-08 11:36:33,328 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:36:33,329 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:36:33,329 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:36:33,329 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:36:33,330 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:36:33" (1/1) ... [2025-03-08 11:36:33,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:36:33,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:36:33,358 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 11:36:33,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 11:36:33,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:36:33,374 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:36:33,374 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:36:33,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 11:36:33,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:36:33,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:36:33,424 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:36:33,425 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:36:33,686 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-08 11:36:33,686 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:36:33,695 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:36:33,696 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:36:33,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:36:33 BoogieIcfgContainer [2025-03-08 11:36:33,696 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:36:33,698 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:36:33,698 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:36:33,701 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:36:33,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:36:33" (1/3) ... [2025-03-08 11:36:33,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5feccae4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:36:33, skipping insertion in model container [2025-03-08 11:36:33,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:36:33" (2/3) ... [2025-03-08 11:36:33,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5feccae4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:36:33, skipping insertion in model container [2025-03-08 11:36:33,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:36:33" (3/3) ... [2025-03-08 11:36:33,704 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-15.i [2025-03-08 11:36:33,714 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:36:33,716 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-15.i that has 2 procedures, 84 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:36:33,764 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:36:33,773 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;@b46afa4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:36:33,773 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:36:33,776 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 59 states have internal predecessors, (84), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 11:36:33,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 11:36:33,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:36:33,786 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:36:33,786 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:36:33,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:36:33,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1716558334, now seen corresponding path program 1 times [2025-03-08 11:36:33,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:36:33,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125917502] [2025-03-08 11:36:33,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:36:33,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:36:33,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 11:36:33,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 11:36:33,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:36:33,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:36:34,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-08 11:36:34,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:36:34,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125917502] [2025-03-08 11:36:34,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125917502] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:36:34,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435437022] [2025-03-08 11:36:34,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:36:34,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:36:34,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:36:34,066 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:36:34,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 11:36:34,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 11:36:34,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 11:36:34,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:36:34,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:36:34,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:36:34,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:36:34,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-08 11:36:34,220 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:36:34,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435437022] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:36:34,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:36:34,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 11:36:34,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829479905] [2025-03-08 11:36:34,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:36:34,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:36:34,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:36:34,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:36:34,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:36:34,240 INFO L87 Difference]: Start difference. First operand has 84 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 59 states have internal predecessors, (84), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 11:36:34,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:36:34,257 INFO L93 Difference]: Finished difference Result 160 states and 274 transitions. [2025-03-08 11:36:34,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:36:34,263 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 156 [2025-03-08 11:36:34,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:36:34,268 INFO L225 Difference]: With dead ends: 160 [2025-03-08 11:36:34,268 INFO L226 Difference]: Without dead ends: 79 [2025-03-08 11:36:34,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:36:34,287 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:36:34,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:36:34,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-08 11:36:34,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-08 11:36:34,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 11:36:34,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 120 transitions. [2025-03-08 11:36:34,320 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 120 transitions. Word has length 156 [2025-03-08 11:36:34,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:36:34,321 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 120 transitions. [2025-03-08 11:36:34,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 11:36:34,321 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 120 transitions. [2025-03-08 11:36:34,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 11:36:34,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:36:34,327 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:36:34,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 11:36:34,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 11:36:34,529 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:36:34,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:36:34,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1755002023, now seen corresponding path program 1 times [2025-03-08 11:36:34,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:36:34,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314833769] [2025-03-08 11:36:34,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:36:34,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:36:34,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 11:36:34,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 11:36:34,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:36:34,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:36:34,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 11:36:34,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:36:34,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314833769] [2025-03-08 11:36:34,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314833769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:36:34,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:36:34,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:36:34,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044428047] [2025-03-08 11:36:34,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:36:34,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:36:34,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:36:34,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:36:34,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:36:34,788 INFO L87 Difference]: Start difference. First operand 79 states and 120 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 11:36:34,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:36:34,834 INFO L93 Difference]: Finished difference Result 198 states and 297 transitions. [2025-03-08 11:36:34,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:36:34,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 156 [2025-03-08 11:36:34,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:36:34,837 INFO L225 Difference]: With dead ends: 198 [2025-03-08 11:36:34,837 INFO L226 Difference]: Without dead ends: 122 [2025-03-08 11:36:34,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:36:34,840 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 65 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:36:34,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 228 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:36:34,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-08 11:36:34,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119. [2025-03-08 11:36:34,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 79 states have (on average 1.2784810126582278) internal successors, (101), 80 states have internal predecessors, (101), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-08 11:36:34,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 175 transitions. [2025-03-08 11:36:34,869 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 175 transitions. Word has length 156 [2025-03-08 11:36:34,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:36:34,869 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 175 transitions. [2025-03-08 11:36:34,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 11:36:34,870 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 175 transitions. [2025-03-08 11:36:34,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-08 11:36:34,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:36:34,871 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:36:34,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 11:36:34,871 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:36:34,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:36:34,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1365760574, now seen corresponding path program 1 times [2025-03-08 11:36:34,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:36:34,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779673635] [2025-03-08 11:36:34,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:36:34,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:36:34,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-08 11:36:34,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-08 11:36:34,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:36:34,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:36:35,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 11:36:35,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:36:35,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779673635] [2025-03-08 11:36:35,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779673635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:36:35,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:36:35,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:36:35,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341960379] [2025-03-08 11:36:35,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:36:35,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:36:35,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:36:35,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:36:35,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:36:35,152 INFO L87 Difference]: Start difference. First operand 119 states and 175 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 11:36:35,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:36:35,310 INFO L93 Difference]: Finished difference Result 329 states and 483 transitions. [2025-03-08 11:36:35,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:36:35,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 157 [2025-03-08 11:36:35,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:36:35,316 INFO L225 Difference]: With dead ends: 329 [2025-03-08 11:36:35,318 INFO L226 Difference]: Without dead ends: 213 [2025-03-08 11:36:35,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:36:35,320 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 80 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:36:35,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 329 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:36:35,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-03-08 11:36:35,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 168. [2025-03-08 11:36:35,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 103 states have (on average 1.2135922330097086) internal successors, (125), 104 states have internal predecessors, (125), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-08 11:36:35,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 245 transitions. [2025-03-08 11:36:35,346 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 245 transitions. Word has length 157 [2025-03-08 11:36:35,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:36:35,347 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 245 transitions. [2025-03-08 11:36:35,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 11:36:35,348 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 245 transitions. [2025-03-08 11:36:35,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-08 11:36:35,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:36:35,351 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:36:35,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 11:36:35,351 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:36:35,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:36:35,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1872203453, now seen corresponding path program 1 times [2025-03-08 11:36:35,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:36:35,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187193086] [2025-03-08 11:36:35,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:36:35,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:36:35,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 11:36:35,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 11:36:35,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:36:35,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:36:35,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-08 11:36:35,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:36:35,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187193086] [2025-03-08 11:36:35,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187193086] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:36:35,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924244430] [2025-03-08 11:36:35,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:36:35,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:36:35,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:36:35,611 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:36:35,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 11:36:35,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 11:36:35,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 11:36:35,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:36:35,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:36:35,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 11:36:35,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:36:35,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 472 proven. 21 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2025-03-08 11:36:35,868 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:36:36,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-08 11:36:36,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924244430] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:36:36,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 11:36:36,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-08 11:36:36,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350386892] [2025-03-08 11:36:36,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 11:36:36,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 11:36:36,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:36:36,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 11:36:36,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:36:36,080 INFO L87 Difference]: Start difference. First operand 168 states and 245 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 11:36:36,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:36:36,264 INFO L93 Difference]: Finished difference Result 257 states and 366 transitions. [2025-03-08 11:36:36,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 11:36:36,265 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 158 [2025-03-08 11:36:36,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:36:36,268 INFO L225 Difference]: With dead ends: 257 [2025-03-08 11:36:36,268 INFO L226 Difference]: Without dead ends: 141 [2025-03-08 11:36:36,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 313 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-03-08 11:36:36,269 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 104 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:36:36,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 192 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:36:36,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-08 11:36:36,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2025-03-08 11:36:36,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 84 states have (on average 1.1547619047619047) internal successors, (97), 84 states have internal predecessors, (97), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-08 11:36:36,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 189 transitions. [2025-03-08 11:36:36,291 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 189 transitions. Word has length 158 [2025-03-08 11:36:36,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:36:36,292 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 189 transitions. [2025-03-08 11:36:36,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 11:36:36,292 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 189 transitions. [2025-03-08 11:36:36,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-08 11:36:36,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:36:36,294 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:36:36,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 11:36:36,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-08 11:36:36,499 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:36:36,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:36:36,500 INFO L85 PathProgramCache]: Analyzing trace with hash -962242464, now seen corresponding path program 1 times [2025-03-08 11:36:36,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:36:36,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784243197] [2025-03-08 11:36:36,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:36:36,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:36:36,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 11:36:36,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 11:36:36,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:36:36,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:36:36,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 11:36:36,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:36:36,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784243197] [2025-03-08 11:36:36,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784243197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:36:36,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:36:36,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:36:36,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829336159] [2025-03-08 11:36:36,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:36:36,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:36:36,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:36:36,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:36:36,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:36:36,779 INFO L87 Difference]: Start difference. First operand 137 states and 189 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 11:36:36,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:36:36,898 INFO L93 Difference]: Finished difference Result 318 states and 439 transitions. [2025-03-08 11:36:36,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:36:36,899 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 159 [2025-03-08 11:36:36,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:36:36,900 INFO L225 Difference]: With dead ends: 318 [2025-03-08 11:36:36,901 INFO L226 Difference]: Without dead ends: 231 [2025-03-08 11:36:36,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:36:36,901 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 137 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:36:36,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 257 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:36:36,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-03-08 11:36:36,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 143. [2025-03-08 11:36:36,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 90 states have (on average 1.1666666666666667) internal successors, (105), 90 states have internal predecessors, (105), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-08 11:36:36,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 197 transitions. [2025-03-08 11:36:36,932 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 197 transitions. Word has length 159 [2025-03-08 11:36:36,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:36:36,933 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 197 transitions. [2025-03-08 11:36:36,933 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 11:36:36,933 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 197 transitions. [2025-03-08 11:36:36,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-08 11:36:36,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:36:36,935 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:36:36,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 11:36:36,935 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:36:36,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:36:36,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1959314817, now seen corresponding path program 1 times [2025-03-08 11:36:36,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:36:36,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494668420] [2025-03-08 11:36:36,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:36:36,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:36:36,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 11:36:36,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 11:36:36,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:36:36,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:36:37,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 11:36:37,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:36:37,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494668420] [2025-03-08 11:36:37,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494668420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:36:37,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:36:37,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:36:37,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957097863] [2025-03-08 11:36:37,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:36:37,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:36:37,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:36:37,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:36:37,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:36:37,015 INFO L87 Difference]: Start difference. First operand 143 states and 197 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 11:36:37,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:36:37,053 INFO L93 Difference]: Finished difference Result 231 states and 319 transitions. [2025-03-08 11:36:37,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:36:37,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 159 [2025-03-08 11:36:37,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:36:37,057 INFO L225 Difference]: With dead ends: 231 [2025-03-08 11:36:37,057 INFO L226 Difference]: Without dead ends: 144 [2025-03-08 11:36:37,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:36:37,058 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 93 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:36:37,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 110 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:36:37,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-08 11:36:37,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 137. [2025-03-08 11:36:37,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 84 states have (on average 1.119047619047619) internal successors, (94), 84 states have internal predecessors, (94), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-08 11:36:37,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 186 transitions. [2025-03-08 11:36:37,085 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 186 transitions. Word has length 159 [2025-03-08 11:36:37,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:36:37,085 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 186 transitions. [2025-03-08 11:36:37,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 11:36:37,086 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 186 transitions. [2025-03-08 11:36:37,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-08 11:36:37,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:36:37,087 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:36:37,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 11:36:37,087 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:36:37,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:36:37,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1071811136, now seen corresponding path program 1 times [2025-03-08 11:36:37,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:36:37,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183417832] [2025-03-08 11:36:37,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:36:37,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:36:37,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 11:36:37,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 11:36:37,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:36:37,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 11:36:37,165 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 11:36:37,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 11:36:37,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 11:36:37,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:36:37,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 11:36:37,256 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 11:36:37,256 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 11:36:37,257 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 11:36:37,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 11:36:37,260 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:36:37,363 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 11:36:37,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 11:36:37 BoogieIcfgContainer [2025-03-08 11:36:37,371 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 11:36:37,372 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 11:36:37,372 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 11:36:37,372 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 11:36:37,373 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:36:33" (3/4) ... [2025-03-08 11:36:37,375 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 11:36:37,375 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 11:36:37,376 INFO L158 Benchmark]: Toolchain (without parser) took 4331.55ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 40.9MB in the end (delta: 81.1MB). Peak memory consumption was 76.1MB. Max. memory is 16.1GB. [2025-03-08 11:36:37,376 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 11:36:37,377 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.06ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 106.8MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 11:36:37,377 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.91ms. Allocated memory is still 167.8MB. Free memory was 106.8MB in the beginning and 104.3MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 11:36:37,377 INFO L158 Benchmark]: Boogie Preprocessor took 26.33ms. Allocated memory is still 167.8MB. Free memory was 104.3MB in the beginning and 101.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 11:36:37,377 INFO L158 Benchmark]: IcfgBuilder took 367.64ms. Allocated memory is still 167.8MB. Free memory was 101.8MB in the beginning and 80.4MB in the end (delta: 21.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 11:36:37,378 INFO L158 Benchmark]: TraceAbstraction took 3672.96ms. Allocated memory is still 167.8MB. Free memory was 79.6MB in the beginning and 41.0MB in the end (delta: 38.7MB). Peak memory consumption was 34.2MB. Max. memory is 16.1GB. [2025-03-08 11:36:37,378 INFO L158 Benchmark]: Witness Printer took 3.29ms. Allocated memory is still 167.8MB. Free memory was 41.0MB in the beginning and 40.9MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 11:36:37,379 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.20ms. Allocated memory is still 201.3MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 218.06ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 106.8MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.91ms. Allocated memory is still 167.8MB. Free memory was 106.8MB in the beginning and 104.3MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.33ms. Allocated memory is still 167.8MB. Free memory was 104.3MB in the beginning and 101.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 367.64ms. Allocated memory is still 167.8MB. Free memory was 101.8MB in the beginning and 80.4MB in the end (delta: 21.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3672.96ms. Allocated memory is still 167.8MB. Free memory was 79.6MB in the beginning and 41.0MB in the end (delta: 38.7MB). Peak memory consumption was 34.2MB. Max. memory is 16.1GB. * Witness Printer took 3.29ms. Allocated memory is still 167.8MB. Free memory was 41.0MB in the beginning and 40.9MB in the end (delta: 50.8kB). 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 someBinaryArithmeticDOUBLEoperation at line 64, overapproximation of someBinaryFLOATComparisonOperation at line 170, overapproximation of someBinaryFLOATComparisonOperation at line 63, overapproximation of someBinaryFLOATComparisonOperation at line 196, overapproximation of someBinaryFLOATComparisonOperation at line 154, overapproximation of someBinaryFLOATComparisonOperation at line 152, overapproximation of someBinaryFLOATComparisonOperation at line 168, overapproximation of someUnaryDOUBLEoperation at line 64, overapproximation of someBinaryDOUBLEComparisonOperation at line 196, overapproximation of someBinaryDOUBLEComparisonOperation at line 172, overapproximation of someBinaryDOUBLEComparisonOperation at line 174, overapproximation of someBinaryDOUBLEComparisonOperation at line 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 127, overapproximation of someBinaryDOUBLEComparisonOperation at line 64, overapproximation of someBinaryDOUBLEComparisonOperation at line 185. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -10; [L23] float var_1_3 = 32.4; [L24] float var_1_4 = 49.2; [L25] signed short int var_1_7 = 10; [L26] signed short int var_1_8 = 64; [L27] signed short int var_1_9 = 256; [L28] signed char var_1_10 = -5; [L29] signed char var_1_11 = 5; [L30] double var_1_12 = 256.4; [L31] float var_1_13 = 2.6; [L32] float var_1_14 = 128.125; [L33] double var_1_15 = 32.5; [L34] double var_1_16 = 10000000000.25; [L35] signed char var_1_17 = -5; [L36] unsigned char var_1_19 = 0; [L37] unsigned char var_1_20 = 0; [L38] signed long int var_1_21 = 1; [L39] signed short int var_1_22 = 17178; [L40] signed short int var_1_23 = 5; [L41] signed long int var_1_25 = -4; [L42] signed short int var_1_26 = 10; [L43] signed long int var_1_34 = -10; [L44] double var_1_36 = 4.85; [L45] double var_1_38 = 15.75; [L46] signed char var_1_39 = -100; [L47] signed short int var_1_41 = -32; [L48] signed char var_1_42 = 4; [L49] signed char var_1_43 = -8; [L50] signed short int var_1_44 = -25; [L51] signed char last_1_var_1_10 = -5; [L52] signed long int last_1_var_1_21 = 1; [L53] signed long int last_1_var_1_25 = -4; VAL [isInitial=0, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_3=162/5, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L200] isInitial = 1 [L201] FCALL initially() [L202] COND TRUE 1 [L203] CALL updateLastVariables() [L191] last_1_var_1_10 = var_1_10 [L192] last_1_var_1_21 = var_1_21 [L193] last_1_var_1_25 = var_1_25 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_3=162/5, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L203] RET updateLastVariables() [L204] CALL updateVariables() [L151] var_1_3 = __VERIFIER_nondet_float() [L152] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L152] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L153] var_1_4 = __VERIFIER_nondet_float() [L154] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=10, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=10, var_1_8=64, var_1_9=256] [L154] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=10, var_1_8=64, var_1_9=256] [L155] var_1_7 = __VERIFIER_nondet_short() [L156] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=64, var_1_9=256] [L156] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=64, var_1_9=256] [L157] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=64, var_1_9=256] [L157] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=64, var_1_9=256] [L158] var_1_8 = __VERIFIER_nondet_short() [L159] CALL assume_abort_if_not(var_1_8 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=256] [L159] RET assume_abort_if_not(var_1_8 >= -1) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=256] [L160] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=256] [L160] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=256] [L161] var_1_9 = __VERIFIER_nondet_short() [L162] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L162] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L163] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L163] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L164] var_1_11 = __VERIFIER_nondet_char() [L165] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L165] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L166] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L166] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L167] var_1_13 = __VERIFIER_nondet_float() [L168] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L168] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L169] var_1_14 = __VERIFIER_nondet_float() [L170] CALL assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L170] RET assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L171] var_1_15 = __VERIFIER_nondet_double() [L172] CALL assume_abort_if_not((var_1_15 >= 0.0F && 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_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L172] RET assume_abort_if_not((var_1_15 >= 0.0F && 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_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L173] var_1_16 = __VERIFIER_nondet_double() [L174] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L174] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L175] var_1_20 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L176] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L177] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L177] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L178] var_1_22 = __VERIFIER_nondet_short() [L179] CALL assume_abort_if_not(var_1_22 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L179] RET assume_abort_if_not(var_1_22 >= 16383) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L180] CALL assume_abort_if_not(var_1_22 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L180] RET assume_abort_if_not(var_1_22 <= 32767) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L181] var_1_23 = __VERIFIER_nondet_short() [L182] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16383, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16383, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L182] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16383, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L183] CALL assume_abort_if_not(var_1_23 <= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16383, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16383, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L183] RET assume_abort_if_not(var_1_23 <= 16384) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16383, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L184] var_1_38 = __VERIFIER_nondet_double() [L185] CALL assume_abort_if_not((var_1_38 >= 0.0F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 2305843.009213691390e+12F && var_1_38 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16383, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16383, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L185] RET assume_abort_if_not((var_1_38 >= 0.0F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 2305843.009213691390e+12F && var_1_38 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16383, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L186] var_1_43 = __VERIFIER_nondet_char() [L187] CALL assume_abort_if_not(var_1_43 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16383, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16383, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L187] RET assume_abort_if_not(var_1_43 >= -126) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16383, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L188] CALL assume_abort_if_not(var_1_43 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16383, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16383, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L188] RET assume_abort_if_not(var_1_43 <= 126) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16383, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L204] RET updateVariables() [L205] CALL step() [L57] COND TRUE last_1_var_1_10 < last_1_var_1_25 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16383, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L58] COND TRUE var_1_11 <= last_1_var_1_25 [L59] var_1_19 = var_1_20 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16383, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L62] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16383, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L63] COND TRUE var_1_4 >= (var_1_3 * (var_1_13 + var_1_14)) [L64] var_1_12 = (((((var_1_15 - var_1_16)) < (-0.85)) ? ((var_1_15 - var_1_16)) : (-0.85))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16383, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L68] unsigned char stepLocal_1 = var_1_19; VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16383, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L69] COND FALSE !(var_1_12 <= ((((var_1_12) < (var_1_12)) ? (var_1_12) : (var_1_12)))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16383, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L76] COND FALSE !(\read(var_1_19)) [L79] var_1_25 = var_1_10 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16383, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L81] unsigned char stepLocal_0 = var_1_12 > var_1_12; VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_0=1, stepLocal_1=0, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16383, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L82] COND TRUE var_1_19 || stepLocal_0 [L83] var_1_1 = (var_1_17 + var_1_17) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16383, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L87] signed long int stepLocal_3 = var_1_22 + var_1_11; [L88] signed long int stepLocal_2 = (var_1_22 - var_1_23) - var_1_9; VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-8377, stepLocal_3=16379, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16383, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L89] COND FALSE !(\read(var_1_20)) [L102] var_1_21 = var_1_9 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-8377, stepLocal_3=16379, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=8377, var_1_22=16383, var_1_23=16383, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L104] COND TRUE ! var_1_20 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-8377, stepLocal_3=16379, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=8377, var_1_22=16383, var_1_23=16383, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L105] COND FALSE !(\read(var_1_20)) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-8377, stepLocal_3=16379, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=8377, var_1_22=16383, var_1_23=16383, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L108] COND FALSE !(var_1_11 >= 25) [L119] var_1_26 = var_1_11 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-8377, stepLocal_3=16379, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=8377, var_1_22=16383, var_1_23=16383, var_1_25=-4, var_1_26=-4, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L123] var_1_34 = ((((128) < (((((var_1_22) > ((-5 + var_1_10))) ? (var_1_22) : ((-5 + var_1_10)))))) ? (128) : (((((var_1_22) > ((-5 + var_1_10))) ? (var_1_22) : ((-5 + var_1_10))))))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-8377, stepLocal_3=16379, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=8377, var_1_22=16383, var_1_23=16383, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L124] COND FALSE !(\read(var_1_20)) [L127] var_1_36 = ((((var_1_16) > (var_1_38)) ? (var_1_16) : (var_1_38))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-8377, stepLocal_3=16379, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_16=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=8377, var_1_22=16383, var_1_23=16383, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L129] var_1_39 = var_1_11 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-8377, stepLocal_3=16379, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_16=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=8377, var_1_22=16383, var_1_23=16383, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L130] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-8377, stepLocal_3=16379, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_16=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=8377, var_1_22=16383, var_1_23=16383, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L133] COND TRUE var_1_23 <= var_1_22 [L134] var_1_42 = ((((var_1_43) < 0 ) ? -(var_1_43) : (var_1_43))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-8377, stepLocal_3=16379, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_16=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=8377, var_1_22=16383, var_1_23=16383, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=126, var_1_43=126, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L136] COND TRUE (! var_1_20) || var_1_20 [L137] var_1_44 = var_1_23 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-8377, stepLocal_3=16379, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_16=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=8377, var_1_22=16383, var_1_23=16383, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=126, var_1_43=126, var_1_44=16383, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L205] RET step() [L206] CALL, EXPR property() [L196-L197] return (((((((var_1_19 || (var_1_12 > var_1_12)) ? (var_1_1 == ((signed short int) (var_1_17 + var_1_17))) : (var_1_1 == ((signed short int) ((((((var_1_7 + 1)) < (var_1_8)) ? ((var_1_7 + 1)) : (var_1_8))) - (24762 - var_1_9))))) && (var_1_10 == ((signed char) var_1_11))) && ((var_1_4 >= (var_1_3 * (var_1_13 + var_1_14))) ? (var_1_12 == ((double) (((((var_1_15 - var_1_16)) < (-0.85)) ? ((var_1_15 - var_1_16)) : (-0.85))))) : (var_1_12 == ((double) var_1_16)))) && ((var_1_12 <= ((((var_1_12) < (var_1_12)) ? (var_1_12) : (var_1_12)))) ? ((var_1_19 || var_1_19) ? (var_1_17 == ((signed char) var_1_11)) : (var_1_17 == ((signed char) var_1_11))) : 1)) && ((last_1_var_1_10 < last_1_var_1_25) ? ((var_1_11 <= last_1_var_1_25) ? (var_1_19 == ((unsigned char) var_1_20)) : 1) : 1)) && (var_1_20 ? ((var_1_10 < ((var_1_22 - var_1_23) - var_1_9)) ? (var_1_19 ? ((last_1_var_1_21 == (var_1_22 + var_1_11)) ? (var_1_21 == ((signed long int) var_1_1)) : 1) : (var_1_21 == ((signed long int) var_1_10))) : (var_1_21 == ((signed long int) var_1_11))) : (var_1_21 == ((signed long int) var_1_9)))) && (var_1_19 ? (var_1_25 == ((signed long int) (var_1_17 + ((((var_1_17) < (((((var_1_8) < (var_1_17)) ? (var_1_8) : (var_1_17))))) ? (var_1_17) : (((((var_1_8) < (var_1_17)) ? (var_1_8) : (var_1_17))))))))) : (var_1_25 == ((signed long int) var_1_10))) ; VAL [\result=0, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_16=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=8377, var_1_22=16383, var_1_23=16383, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=126, var_1_43=126, var_1_44=16383, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L206] RET, EXPR property() [L206] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_16=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=8377, var_1_22=16383, var_1_23=16383, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=126, var_1_43=126, var_1_44=16383, var_1_7=16383, var_1_8=32766, var_1_9=8377] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_16=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=8377, var_1_22=16383, var_1_23=16383, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=126, var_1_43=126, var_1_44=16383, var_1_7=16383, var_1_8=32766, var_1_9=8377] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 84 locations, 153 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 7, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 493 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 479 mSDsluCounter, 1236 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 552 mSDsCounter, 121 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 266 IncrementalHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 121 mSolverCounterUnsat, 684 mSDtfsCounter, 266 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 497 GetRequests, 481 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=168occurred in iteration=3, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 147 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1418 NumberOfCodeBlocks, 1418 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1408 ConstructedInterpolants, 0 QuantifiedInterpolants, 2202 SizeOfPredicates, 1 NumberOfNonLiveVariables, 759 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 9001/9108 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 11:36:37,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-15.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9bbe13ecce95df27b2722f410096981490ce7740fe6889f9893c48afb2768e7c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:36:39,291 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:36:39,374 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 11:36:39,382 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:36:39,382 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:36:39,406 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:36:39,406 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:36:39,406 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:36:39,407 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:36:39,407 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:36:39,407 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:36:39,407 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:36:39,408 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:36:39,408 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:36:39,408 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:36:39,408 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:36:39,409 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:36:39,409 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:36:39,409 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:36:39,409 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:36:39,409 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:36:39,409 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:36:39,409 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:36:39,409 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 11:36:39,409 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 11:36:39,409 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 11:36:39,409 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:36:39,409 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:36:39,409 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:36:39,409 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:36:39,410 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:36:39,410 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:36:39,410 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:36:39,410 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:36:39,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:36:39,410 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:36:39,410 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:36:39,410 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:36:39,410 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:36:39,410 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 11:36:39,410 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 11:36:39,410 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:36:39,410 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:36:39,410 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:36:39,410 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:36:39,410 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9bbe13ecce95df27b2722f410096981490ce7740fe6889f9893c48afb2768e7c [2025-03-08 11:36:39,642 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:36:39,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:36:39,650 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:36:39,651 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:36:39,651 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:36:39,652 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-15.i [2025-03-08 11:36:40,800 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2fa8daf6/427321c294bf44a1b4fc0ba49a008808/FLAG20fe4a204 [2025-03-08 11:36:40,991 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:36:40,993 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-15.i [2025-03-08 11:36:41,001 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2fa8daf6/427321c294bf44a1b4fc0ba49a008808/FLAG20fe4a204 [2025-03-08 11:36:41,376 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2fa8daf6/427321c294bf44a1b4fc0ba49a008808 [2025-03-08 11:36:41,378 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:36:41,379 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:36:41,380 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:36:41,380 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:36:41,382 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:36:41,383 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:36:41" (1/1) ... [2025-03-08 11:36:41,384 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7584b942 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:36:41, skipping insertion in model container [2025-03-08 11:36:41,384 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:36:41" (1/1) ... [2025-03-08 11:36:41,399 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:36:41,502 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-15.i[919,932] [2025-03-08 11:36:41,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:36:41,573 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:36:41,581 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-15.i[919,932] [2025-03-08 11:36:41,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:36:41,627 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:36:41,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:36:41 WrapperNode [2025-03-08 11:36:41,629 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:36:41,629 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:36:41,629 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:36:41,630 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:36:41,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:36:41" (1/1) ... [2025-03-08 11:36:41,648 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:36:41" (1/1) ... [2025-03-08 11:36:41,672 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 189 [2025-03-08 11:36:41,674 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:36:41,674 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:36:41,674 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:36:41,674 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:36:41,680 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:36:41" (1/1) ... [2025-03-08 11:36:41,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:36:41" (1/1) ... [2025-03-08 11:36:41,683 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:36:41" (1/1) ... [2025-03-08 11:36:41,697 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]. [2025-03-08 11:36:41,697 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:36:41" (1/1) ... [2025-03-08 11:36:41,697 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:36:41" (1/1) ... [2025-03-08 11:36:41,703 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:36:41" (1/1) ... [2025-03-08 11:36:41,704 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:36:41" (1/1) ... [2025-03-08 11:36:41,706 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:36:41" (1/1) ... [2025-03-08 11:36:41,706 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:36:41" (1/1) ... [2025-03-08 11:36:41,708 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:36:41,712 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:36:41,712 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:36:41,712 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:36:41,713 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:36:41" (1/1) ... [2025-03-08 11:36:41,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:36:41,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:36:41,744 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 11:36:41,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 11:36:41,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:36:41,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 11:36:41,766 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:36:41,766 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:36:41,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:36:41,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:36:41,841 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:36:41,843 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:36:48,043 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-08 11:36:48,044 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:36:48,051 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:36:48,051 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:36:48,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:36:48 BoogieIcfgContainer [2025-03-08 11:36:48,052 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:36:48,053 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:36:48,054 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:36:48,057 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:36:48,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:36:41" (1/3) ... [2025-03-08 11:36:48,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27b83196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:36:48, skipping insertion in model container [2025-03-08 11:36:48,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:36:41" (2/3) ... [2025-03-08 11:36:48,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27b83196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:36:48, skipping insertion in model container [2025-03-08 11:36:48,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:36:48" (3/3) ... [2025-03-08 11:36:48,059 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-15.i [2025-03-08 11:36:48,070 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:36:48,072 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-15.i that has 2 procedures, 84 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:36:48,110 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:36:48,119 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;@38e24101, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:36:48,119 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:36:48,122 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 59 states have internal predecessors, (84), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 11:36:48,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 11:36:48,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:36:48,130 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:36:48,130 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:36:48,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:36:48,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1716558334, now seen corresponding path program 1 times [2025-03-08 11:36:48,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:36:48,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1649627643] [2025-03-08 11:36:48,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:36:48,142 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 [2025-03-08 11:36:48,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:36:48,144 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 11:36:48,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 11:36:48,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 11:36:48,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 11:36:48,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:36:48,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:36:48,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:36:48,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:36:48,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 384 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2025-03-08 11:36:48,690 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:36:48,691 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:36:48,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1649627643] [2025-03-08 11:36:48,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1649627643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:36:48,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:36:48,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 11:36:48,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915532321] [2025-03-08 11:36:48,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:36:48,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:36:48,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 11:36:48,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:36:48,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:36:48,708 INFO L87 Difference]: Start difference. First operand has 84 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 59 states have internal predecessors, (84), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) 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, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 11:36:48,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:36:48,725 INFO L93 Difference]: Finished difference Result 160 states and 274 transitions. [2025-03-08 11:36:48,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:36:48,727 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, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 156 [2025-03-08 11:36:48,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:36:48,732 INFO L225 Difference]: With dead ends: 160 [2025-03-08 11:36:48,732 INFO L226 Difference]: Without dead ends: 79 [2025-03-08 11:36:48,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:36:48,738 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:36:48,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:36:48,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-08 11:36:48,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-08 11:36:48,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 11:36:48,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 120 transitions. [2025-03-08 11:36:48,767 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 120 transitions. Word has length 156 [2025-03-08 11:36:48,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:36:48,768 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 120 transitions. [2025-03-08 11:36:48,768 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, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 11:36:48,768 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 120 transitions. [2025-03-08 11:36:48,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 11:36:48,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:36:48,770 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:36:48,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 11:36:48,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:36:48,971 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:36:48,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:36:48,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1755002023, now seen corresponding path program 1 times [2025-03-08 11:36:48,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:36:48,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311482813] [2025-03-08 11:36:48,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:36:48,972 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 [2025-03-08 11:36:48,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:36:48,974 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 11:36:48,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 11:36:49,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 11:36:49,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 11:36:49,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:36:49,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:36:49,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 11:36:49,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:36:50,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 11:36:50,797 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:36:50,797 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:36:50,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311482813] [2025-03-08 11:36:50,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [311482813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:36:50,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:36:50,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:36:50,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597386541] [2025-03-08 11:36:50,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:36:50,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:36:50,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 11:36:50,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:36:50,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:36:50,799 INFO L87 Difference]: Start difference. First operand 79 states and 120 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 11:36:53,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:36:53,024 INFO L93 Difference]: Finished difference Result 232 states and 355 transitions. [2025-03-08 11:36:53,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:36:53,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 156 [2025-03-08 11:36:53,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:36:53,045 INFO L225 Difference]: With dead ends: 232 [2025-03-08 11:36:53,045 INFO L226 Difference]: Without dead ends: 156 [2025-03-08 11:36:53,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:36:53,047 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 75 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:36:53,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 334 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-08 11:36:53,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-08 11:36:53,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 124. [2025-03-08 11:36:53,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 75 states have internal predecessors, (95), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-08 11:36:53,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 187 transitions. [2025-03-08 11:36:53,079 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 187 transitions. Word has length 156 [2025-03-08 11:36:53,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:36:53,079 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 187 transitions. [2025-03-08 11:36:53,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 11:36:53,080 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 187 transitions. [2025-03-08 11:36:53,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-08 11:36:53,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:36:53,083 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:36:53,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 11:36:53,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:36:53,283 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:36:53,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:36:53,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1096362242, now seen corresponding path program 1 times [2025-03-08 11:36:53,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:36:53,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [73682611] [2025-03-08 11:36:53,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:36:53,285 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 [2025-03-08 11:36:53,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:36:53,287 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 11:36:53,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 11:36:53,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-08 11:36:53,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-08 11:36:53,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:36:53,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:36:53,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 11:36:53,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:36:55,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 11:36:55,548 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:36:55,548 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:36:55,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [73682611] [2025-03-08 11:36:55,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [73682611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:36:55,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:36:55,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:36:55,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466552141] [2025-03-08 11:36:55,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:36:55,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:36:55,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 11:36:55,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:36:55,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:36:55,550 INFO L87 Difference]: Start difference. First operand 124 states and 187 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 11:36:56,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 11:37:00,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 11:37:04,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.78s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 11:37:06,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 11:37:09,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.85s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 11:37:19,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 11:37:20,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 11:37:21,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:37:21,021 INFO L93 Difference]: Finished difference Result 276 states and 421 transitions. [2025-03-08 11:37:21,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:37:21,037 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 157 [2025-03-08 11:37:21,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:37:21,040 INFO L225 Difference]: With dead ends: 276 [2025-03-08 11:37:21,040 INFO L226 Difference]: Without dead ends: 200 [2025-03-08 11:37:21,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:37:21,041 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 119 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.8s IncrementalHoareTripleChecker+Time [2025-03-08 11:37:21,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 306 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 24.8s Time] [2025-03-08 11:37:21,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-08 11:37:21,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 126. [2025-03-08 11:37:21,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 77 states have (on average 1.2597402597402598) internal successors, (97), 77 states have internal predecessors, (97), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-08 11:37:21,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 189 transitions. [2025-03-08 11:37:21,069 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 189 transitions. Word has length 157 [2025-03-08 11:37:21,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:37:21,069 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 189 transitions. [2025-03-08 11:37:21,069 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 11:37:21,069 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 189 transitions. [2025-03-08 11:37:21,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-08 11:37:21,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:37:21,071 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:37:21,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-08 11:37:21,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:37:21,272 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:37:21,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:37:21,272 INFO L85 PathProgramCache]: Analyzing trace with hash 251890371, now seen corresponding path program 1 times [2025-03-08 11:37:21,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:37:21,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2036815315] [2025-03-08 11:37:21,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:37:21,273 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 [2025-03-08 11:37:21,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:37:21,277 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 11:37:21,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-08 11:37:21,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-08 11:37:21,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-08 11:37:21,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:37:21,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:37:21,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 11:37:21,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:37:22,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 39 proven. 504 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2025-03-08 11:37:22,977 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:37:23,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 39 proven. 27 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-08 11:37:23,810 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:37:23,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2036815315] [2025-03-08 11:37:23,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2036815315] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:37:23,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 11:37:23,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-03-08 11:37:23,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533305674] [2025-03-08 11:37:23,811 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 11:37:23,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 11:37:23,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 11:37:23,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 11:37:23,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-08 11:37:23,812 INFO L87 Difference]: Start difference. First operand 126 states and 189 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 4 states have call successors, (46), 3 states have call predecessors, (46), 5 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) [2025-03-08 11:37:26,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 11:37:28,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 11:37:31,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 11:37:35,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.61s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 11:37:37,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 11:37:38,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:37:38,518 INFO L93 Difference]: Finished difference Result 296 states and 437 transitions. [2025-03-08 11:37:38,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 11:37:38,532 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 4 states have call successors, (46), 3 states have call predecessors, (46), 5 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) Word has length 157 [2025-03-08 11:37:38,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:37:38,534 INFO L225 Difference]: With dead ends: 296 [2025-03-08 11:37:38,534 INFO L226 Difference]: Without dead ends: 218 [2025-03-08 11:37:38,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=196, Invalid=404, Unknown=0, NotChecked=0, Total=600 [2025-03-08 11:37:38,535 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 529 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.8s IncrementalHoareTripleChecker+Time [2025-03-08 11:37:38,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 392 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 13.8s Time] [2025-03-08 11:37:38,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-03-08 11:37:38,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 132. [2025-03-08 11:37:38,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 81 states have (on average 1.2345679012345678) internal successors, (100), 81 states have internal predecessors, (100), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-08 11:37:38,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 192 transitions. [2025-03-08 11:37:38,566 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 192 transitions. Word has length 157 [2025-03-08 11:37:38,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:37:38,567 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 192 transitions. [2025-03-08 11:37:38,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 4 states have call successors, (46), 3 states have call predecessors, (46), 5 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) [2025-03-08 11:37:38,567 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 192 transitions. [2025-03-08 11:37:38,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-08 11:37:38,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:37:38,571 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:37:38,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-08 11:37:38,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:37:38,772 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:37:38,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:37:38,772 INFO L85 PathProgramCache]: Analyzing trace with hash -499705755, now seen corresponding path program 1 times [2025-03-08 11:37:38,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:37:38,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [324093902] [2025-03-08 11:37:38,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:37:38,773 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 [2025-03-08 11:37:38,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:37:38,776 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 11:37:38,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-08 11:37:38,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 11:37:39,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 11:37:39,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:37:39,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:37:39,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 11:37:39,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:37:39,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 472 proven. 21 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2025-03-08 11:37:39,470 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:37:39,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-08 11:37:39,835 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:37:39,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [324093902] [2025-03-08 11:37:39,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [324093902] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:37:39,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 11:37:39,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2025-03-08 11:37:39,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74639224] [2025-03-08 11:37:39,835 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 11:37:39,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 11:37:39,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 11:37:39,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 11:37:39,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 11:37:39,836 INFO L87 Difference]: Start difference. First operand 132 states and 192 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 11:37:43,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.59s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 11:37:43,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:37:43,865 INFO L93 Difference]: Finished difference Result 225 states and 319 transitions. [2025-03-08 11:37:43,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 11:37:43,886 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 158 [2025-03-08 11:37:43,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:37:43,887 INFO L225 Difference]: With dead ends: 225 [2025-03-08 11:37:43,887 INFO L226 Difference]: Without dead ends: 145 [2025-03-08 11:37:43,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 307 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-03-08 11:37:43,888 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 158 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-03-08 11:37:43,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 188 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-03-08 11:37:43,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-08 11:37:43,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 137. [2025-03-08 11:37:43,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 84 states have (on average 1.0952380952380953) internal successors, (92), 84 states have internal predecessors, (92), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-08 11:37:43,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 184 transitions. [2025-03-08 11:37:43,911 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 184 transitions. Word has length 158 [2025-03-08 11:37:43,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:37:43,912 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 184 transitions. [2025-03-08 11:37:43,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 11:37:43,912 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 184 transitions. [2025-03-08 11:37:43,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 11:37:43,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:37:43,913 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:37:43,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-08 11:37:44,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:37:44,114 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:37:44,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:37:44,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1860663844, now seen corresponding path program 1 times [2025-03-08 11:37:44,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:37:44,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [266015291] [2025-03-08 11:37:44,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:37:44,115 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 [2025-03-08 11:37:44,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:37:44,117 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 11:37:44,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-08 11:37:44,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 11:37:44,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 11:37:44,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:37:44,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:37:44,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 11:37:44,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:37:44,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 472 proven. 21 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2025-03-08 11:37:44,858 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:37:45,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-08 11:37:45,442 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:37:45,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [266015291] [2025-03-08 11:37:45,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [266015291] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:37:45,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 11:37:45,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2025-03-08 11:37:45,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307736914] [2025-03-08 11:37:45,442 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 11:37:45,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 11:37:45,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 11:37:45,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 11:37:45,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 11:37:45,443 INFO L87 Difference]: Start difference. First operand 137 states and 184 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 11:37:48,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 11:37:48,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:37:48,591 INFO L93 Difference]: Finished difference Result 226 states and 300 transitions. [2025-03-08 11:37:48,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 11:37:48,612 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 160 [2025-03-08 11:37:48,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:37:48,613 INFO L225 Difference]: With dead ends: 226 [2025-03-08 11:37:48,613 INFO L226 Difference]: Without dead ends: 145 [2025-03-08 11:37:48,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 311 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-03-08 11:37:48,614 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 151 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-08 11:37:48,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 190 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-08 11:37:48,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-08 11:37:48,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 137. [2025-03-08 11:37:48,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 84 states have (on average 1.0833333333333333) internal successors, (91), 84 states have internal predecessors, (91), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-08 11:37:48,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 183 transitions. [2025-03-08 11:37:48,635 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 183 transitions. Word has length 160 [2025-03-08 11:37:48,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:37:48,635 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 183 transitions. [2025-03-08 11:37:48,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 11:37:48,635 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 183 transitions. [2025-03-08 11:37:48,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 11:37:48,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:37:48,636 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:37:48,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-08 11:37:48,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:37:48,840 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:37:48,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:37:48,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1350129667, now seen corresponding path program 1 times [2025-03-08 11:37:48,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:37:48,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1829303505] [2025-03-08 11:37:48,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:37:48,841 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 [2025-03-08 11:37:48,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:37:48,843 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 11:37:48,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-08 11:37:48,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 11:37:49,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 11:37:49,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:37:49,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:37:49,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 11:37:49,150 INFO L279 TraceCheckSpWp]: Computing forward predicates...