./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-47.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_codestructure_steplocals_file-47.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 874b8c0685149675525220fee2d5689c1d5289515348c6c05c19ae6cc8a7fb40 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:02:28,654 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:02:28,710 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:02:28,719 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:02:28,720 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:02:28,741 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:02:28,741 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:02:28,741 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:02:28,742 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:02:28,742 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:02:28,742 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:02:28,742 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:02:28,742 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:02:28,742 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:02:28,742 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:02:28,743 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:02:28,743 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:02:28,743 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:02:28,743 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:02:28,743 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:02:28,743 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:02:28,743 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:02:28,743 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:02:28,743 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:02:28,743 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:02:28,743 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:02:28,744 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:02:28,744 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:02:28,744 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:02:28,744 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:02:28,744 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:02:28,744 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:02:28,744 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:02:28,744 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:02:28,745 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:02:28,745 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:02:28,745 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:02:28,745 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:02:28,745 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:02:28,745 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:02:28,745 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:02:28,745 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:02:28,745 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:02:28,745 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 -> 874b8c0685149675525220fee2d5689c1d5289515348c6c05c19ae6cc8a7fb40 [2025-03-03 19:02:28,946 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:02:28,953 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:02:28,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:02:28,957 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:02:28,957 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:02:28,958 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-47.i [2025-03-03 19:02:30,054 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3090f5f3d/a361431ba8574f72b02ca8d6eef741ab/FLAG7d634b4fa [2025-03-03 19:02:30,273 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:02:30,273 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-47.i [2025-03-03 19:02:30,280 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3090f5f3d/a361431ba8574f72b02ca8d6eef741ab/FLAG7d634b4fa [2025-03-03 19:02:30,290 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3090f5f3d/a361431ba8574f72b02ca8d6eef741ab [2025-03-03 19:02:30,291 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:02:30,293 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:02:30,294 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:02:30,294 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:02:30,297 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:02:30,297 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:02:30" (1/1) ... [2025-03-03 19:02:30,298 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@390b6cb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:02:30, skipping insertion in model container [2025-03-03 19:02:30,298 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:02:30" (1/1) ... [2025-03-03 19:02:30,312 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:02:30,404 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_codestructure_steplocals_file-47.i[917,930] [2025-03-03 19:02:30,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:02:30,490 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:02:30,498 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_codestructure_steplocals_file-47.i[917,930] [2025-03-03 19:02:30,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:02:30,540 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:02:30,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:02:30 WrapperNode [2025-03-03 19:02:30,540 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:02:30,542 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:02:30,542 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:02:30,542 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:02:30,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:02:30" (1/1) ... [2025-03-03 19:02:30,555 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:02:30" (1/1) ... [2025-03-03 19:02:30,595 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 209 [2025-03-03 19:02:30,599 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:02:30,599 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:02:30,599 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:02:30,601 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:02:30,608 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:02:30" (1/1) ... [2025-03-03 19:02:30,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:02:30" (1/1) ... [2025-03-03 19:02:30,617 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:02:30" (1/1) ... [2025-03-03 19:02:30,634 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-03 19:02:30,634 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:02:30" (1/1) ... [2025-03-03 19:02:30,634 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:02:30" (1/1) ... [2025-03-03 19:02:30,640 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:02:30" (1/1) ... [2025-03-03 19:02:30,641 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:02:30" (1/1) ... [2025-03-03 19:02:30,642 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:02:30" (1/1) ... [2025-03-03 19:02:30,643 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:02:30" (1/1) ... [2025-03-03 19:02:30,646 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:02:30,646 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:02:30,646 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:02:30,646 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:02:30,647 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:02:30" (1/1) ... [2025-03-03 19:02:30,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:02:30,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:02:30,674 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-03 19:02:30,676 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-03 19:02:30,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:02:30,694 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:02:30,694 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:02:30,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:02:30,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:02:30,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:02:30,759 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:02:30,760 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:02:31,040 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L136: havoc property_#t~bitwise22#1;havoc property_#t~ite24#1;havoc property_#t~bitwise23#1;havoc property_#t~short25#1; [2025-03-03 19:02:31,067 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-03 19:02:31,067 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:02:31,082 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:02:31,082 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:02:31,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:02:31 BoogieIcfgContainer [2025-03-03 19:02:31,082 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:02:31,084 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:02:31,084 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:02:31,087 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:02:31,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:02:30" (1/3) ... [2025-03-03 19:02:31,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d290f6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:02:31, skipping insertion in model container [2025-03-03 19:02:31,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:02:30" (2/3) ... [2025-03-03 19:02:31,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d290f6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:02:31, skipping insertion in model container [2025-03-03 19:02:31,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:02:31" (3/3) ... [2025-03-03 19:02:31,089 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-47.i [2025-03-03 19:02:31,099 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:02:31,101 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-47.i that has 2 procedures, 96 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:02:31,145 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:02:31,152 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;@72c7d0c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:02:31,153 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:02:31,156 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 67 states have (on average 1.4477611940298507) internal successors, (97), 68 states have internal predecessors, (97), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 19:02:31,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 19:02:31,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:02:31,168 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:02:31,168 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:02:31,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:02:31,172 INFO L85 PathProgramCache]: Analyzing trace with hash 224961965, now seen corresponding path program 1 times [2025-03-03 19:02:31,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:02:31,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688115390] [2025-03-03 19:02:31,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:02:31,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:02:31,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 19:02:31,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 19:02:31,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:02:31,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:02:31,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 19:02:31,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:02:31,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688115390] [2025-03-03 19:02:31,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688115390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:02:31,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:02:31,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 19:02:31,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231257098] [2025-03-03 19:02:31,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:02:31,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:02:31,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:02:31,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:02:31,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:02:31,516 INFO L87 Difference]: Start difference. First operand has 96 states, 67 states have (on average 1.4477611940298507) internal successors, (97), 68 states have internal predecessors, (97), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 19:02:31,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:02:31,543 INFO L93 Difference]: Finished difference Result 186 states and 319 transitions. [2025-03-03 19:02:31,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:02:31,545 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 168 [2025-03-03 19:02:31,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:02:31,551 INFO L225 Difference]: With dead ends: 186 [2025-03-03 19:02:31,551 INFO L226 Difference]: Without dead ends: 93 [2025-03-03 19:02:31,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-03 19:02:31,555 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:02:31,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:02:31,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-03 19:02:31,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-03 19:02:31,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 65 states have (on average 1.353846153846154) internal successors, (88), 65 states have internal predecessors, (88), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 19:02:31,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 140 transitions. [2025-03-03 19:02:31,588 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 140 transitions. Word has length 168 [2025-03-03 19:02:31,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:02:31,590 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 140 transitions. [2025-03-03 19:02:31,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 19:02:31,591 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 140 transitions. [2025-03-03 19:02:31,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-03 19:02:31,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:02:31,593 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:02:31,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 19:02:31,593 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:02:31,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:02:31,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1215837008, now seen corresponding path program 1 times [2025-03-03 19:02:31,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:02:31,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225617504] [2025-03-03 19:02:31,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:02:31,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:02:31,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 19:02:31,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 19:02:31,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:02:31,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:02:32,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 60 proven. 15 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-03 19:02:32,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:02:32,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225617504] [2025-03-03 19:02:32,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225617504] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:02:32,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882666561] [2025-03-03 19:02:32,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:02:32,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:02:32,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:02:32,295 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-03 19:02:32,296 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-03 19:02:32,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 19:02:32,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 19:02:32,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:02:32,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:02:32,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 19:02:32,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:02:32,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 465 proven. 15 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2025-03-03 19:02:32,556 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:02:32,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 60 proven. 15 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-03 19:02:32,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882666561] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:02:32,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:02:32,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-03 19:02:32,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516966620] [2025-03-03 19:02:32,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:02:32,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 19:02:32,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:02:32,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 19:02:32,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-03 19:02:32,763 INFO L87 Difference]: Start difference. First operand 93 states and 140 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-03 19:02:33,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:02:33,592 INFO L93 Difference]: Finished difference Result 414 states and 617 transitions. [2025-03-03 19:02:33,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 19:02:33,593 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 169 [2025-03-03 19:02:33,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:02:33,595 INFO L225 Difference]: With dead ends: 414 [2025-03-03 19:02:33,595 INFO L226 Difference]: Without dead ends: 324 [2025-03-03 19:02:33,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 335 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2025-03-03 19:02:33,599 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 407 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 19:02:33,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 983 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 19:02:33,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-03-03 19:02:33,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 217. [2025-03-03 19:02:33,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 140 states have (on average 1.2785714285714285) internal successors, (179), 142 states have internal predecessors, (179), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 19:02:33,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 323 transitions. [2025-03-03 19:02:33,648 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 323 transitions. Word has length 169 [2025-03-03 19:02:33,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:02:33,648 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 323 transitions. [2025-03-03 19:02:33,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-03 19:02:33,648 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 323 transitions. [2025-03-03 19:02:33,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-03 19:02:33,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:02:33,650 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:02:33,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 19:02:33,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:02:33,851 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:02:33,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:02:33,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1571578479, now seen corresponding path program 1 times [2025-03-03 19:02:33,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:02:33,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180522409] [2025-03-03 19:02:33,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:02:33,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:02:33,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 19:02:33,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 19:02:33,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:02:33,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:02:34,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 24 proven. 120 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked. [2025-03-03 19:02:34,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:02:34,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180522409] [2025-03-03 19:02:34,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180522409] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:02:34,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980496212] [2025-03-03 19:02:34,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:02:34,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:02:34,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:02:34,734 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-03 19:02:34,735 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-03 19:02:34,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 19:02:34,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 19:02:34,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:02:34,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:02:34,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 19:02:34,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:02:35,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 599 proven. 114 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2025-03-03 19:02:35,467 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:02:35,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 30 proven. 117 refuted. 0 times theorem prover too weak. 1153 trivial. 0 not checked. [2025-03-03 19:02:35,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980496212] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:02:35,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:02:35,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 25 [2025-03-03 19:02:35,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955199875] [2025-03-03 19:02:35,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:02:35,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 19:02:35,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:02:35,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 19:02:35,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2025-03-03 19:02:35,851 INFO L87 Difference]: Start difference. First operand 217 states and 323 transitions. Second operand has 25 states, 25 states have (on average 4.6) internal successors, (115), 25 states have internal predecessors, (115), 9 states have call successors, (74), 3 states have call predecessors, (74), 7 states have return successors, (75), 9 states have call predecessors, (75), 9 states have call successors, (75) [2025-03-03 19:02:37,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:02:37,762 INFO L93 Difference]: Finished difference Result 780 states and 1083 transitions. [2025-03-03 19:02:37,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-03 19:02:37,762 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.6) internal successors, (115), 25 states have internal predecessors, (115), 9 states have call successors, (74), 3 states have call predecessors, (74), 7 states have return successors, (75), 9 states have call predecessors, (75), 9 states have call successors, (75) Word has length 169 [2025-03-03 19:02:37,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:02:37,767 INFO L225 Difference]: With dead ends: 780 [2025-03-03 19:02:37,767 INFO L226 Difference]: Without dead ends: 599 [2025-03-03 19:02:37,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 627 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=749, Invalid=2557, Unknown=0, NotChecked=0, Total=3306 [2025-03-03 19:02:37,770 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 933 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 1320 mSolverCounterSat, 249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 937 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 1569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 1320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:02:37,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [937 Valid, 709 Invalid, 1569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 1320 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 19:02:37,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-03-03 19:02:37,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 370. [2025-03-03 19:02:37,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 251 states have (on average 1.2310756972111554) internal successors, (309), 253 states have internal predecessors, (309), 98 states have call successors, (98), 20 states have call predecessors, (98), 20 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-03 19:02:37,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 505 transitions. [2025-03-03 19:02:37,817 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 505 transitions. Word has length 169 [2025-03-03 19:02:37,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:02:37,817 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 505 transitions. [2025-03-03 19:02:37,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.6) internal successors, (115), 25 states have internal predecessors, (115), 9 states have call successors, (74), 3 states have call predecessors, (74), 7 states have return successors, (75), 9 states have call predecessors, (75), 9 states have call successors, (75) [2025-03-03 19:02:37,817 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 505 transitions. [2025-03-03 19:02:37,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 19:02:37,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:02:37,819 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:02:37,826 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-03 19:02:38,019 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,SelfDestructingSolverStorable2 [2025-03-03 19:02:38,020 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:02:38,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:02:38,020 INFO L85 PathProgramCache]: Analyzing trace with hash -113697043, now seen corresponding path program 1 times [2025-03-03 19:02:38,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:02:38,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475166523] [2025-03-03 19:02:38,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:02:38,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:02:38,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 19:02:38,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 19:02:38,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:02:38,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:02:38,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 19:02:38,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:02:38,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475166523] [2025-03-03 19:02:38,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475166523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:02:38,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:02:38,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:02:38,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030246429] [2025-03-03 19:02:38,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:02:38,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:02:38,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:02:38,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:02:38,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:02:38,089 INFO L87 Difference]: Start difference. First operand 370 states and 505 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 19:02:38,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:02:38,146 INFO L93 Difference]: Finished difference Result 886 states and 1219 transitions. [2025-03-03 19:02:38,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:02:38,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170 [2025-03-03 19:02:38,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:02:38,150 INFO L225 Difference]: With dead ends: 886 [2025-03-03 19:02:38,150 INFO L226 Difference]: Without dead ends: 568 [2025-03-03 19:02:38,151 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-03 19:02:38,152 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 126 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:02:38,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 345 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:02:38,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-03-03 19:02:38,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 370. [2025-03-03 19:02:38,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 251 states have (on average 1.2231075697211156) internal successors, (307), 253 states have internal predecessors, (307), 98 states have call successors, (98), 20 states have call predecessors, (98), 20 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-03 19:02:38,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 503 transitions. [2025-03-03 19:02:38,192 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 503 transitions. Word has length 170 [2025-03-03 19:02:38,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:02:38,194 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 503 transitions. [2025-03-03 19:02:38,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 19:02:38,195 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 503 transitions. [2025-03-03 19:02:38,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 19:02:38,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:02:38,197 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:02:38,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 19:02:38,197 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:02:38,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:02:38,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1910648402, now seen corresponding path program 1 times [2025-03-03 19:02:38,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:02:38,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230751605] [2025-03-03 19:02:38,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:02:38,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:02:38,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 19:02:38,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 19:02:38,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:02:38,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 19:02:38,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1050494928] [2025-03-03 19:02:38,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:02:38,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:02:38,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:02:38,270 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:02:38,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 19:02:38,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 19:02:38,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 19:02:38,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:02:38,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:02:38,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 19:02:38,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:02:38,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 295 proven. 66 refuted. 0 times theorem prover too weak. 939 trivial. 0 not checked. [2025-03-03 19:02:38,649 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:02:39,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:02:39,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230751605] [2025-03-03 19:02:39,048 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 19:02:39,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050494928] [2025-03-03 19:02:39,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050494928] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:02:39,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:02:39,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2025-03-03 19:02:39,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276174560] [2025-03-03 19:02:39,048 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 19:02:39,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 19:02:39,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:02:39,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 19:02:39,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-03 19:02:39,049 INFO L87 Difference]: Start difference. First operand 370 states and 503 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 19:02:39,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:02:39,317 INFO L93 Difference]: Finished difference Result 716 states and 972 transitions. [2025-03-03 19:02:39,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 19:02:39,318 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 170 [2025-03-03 19:02:39,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:02:39,320 INFO L225 Difference]: With dead ends: 716 [2025-03-03 19:02:39,320 INFO L226 Difference]: Without dead ends: 398 [2025-03-03 19:02:39,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-03 19:02:39,321 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 64 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:02:39,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 401 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 19:02:39,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2025-03-03 19:02:39,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 376. [2025-03-03 19:02:39,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 257 states have (on average 1.2295719844357977) internal successors, (316), 259 states have internal predecessors, (316), 98 states have call successors, (98), 20 states have call predecessors, (98), 20 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-03 19:02:39,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 512 transitions. [2025-03-03 19:02:39,359 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 512 transitions. Word has length 170 [2025-03-03 19:02:39,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:02:39,359 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 512 transitions. [2025-03-03 19:02:39,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 19:02:39,359 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 512 transitions. [2025-03-03 19:02:39,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 19:02:39,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:02:39,360 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:02:39,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 19:02:39,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:02:39,562 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:02:39,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:02:39,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1023144721, now seen corresponding path program 1 times [2025-03-03 19:02:39,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:02:39,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729463385] [2025-03-03 19:02:39,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:02:39,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:02:39,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 19:02:39,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 19:02:39,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:02:39,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 19:02:39,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1083023177] [2025-03-03 19:02:39,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:02:39,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:02:39,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:02:39,629 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:02:39,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 19:02:39,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 19:02:39,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 19:02:39,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:02:39,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:02:39,708 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 19:02:39,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 19:02:39,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 19:02:39,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:02:39,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:02:39,800 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 19:02:39,800 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 19:02:39,801 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 19:02:39,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 19:02:40,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:02:40,005 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-03 19:02:40,072 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 19:02:40,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 07:02:40 BoogieIcfgContainer [2025-03-03 19:02:40,077 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 19:02:40,078 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 19:02:40,078 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 19:02:40,078 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 19:02:40,079 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:02:31" (3/4) ... [2025-03-03 19:02:40,080 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 19:02:40,081 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 19:02:40,081 INFO L158 Benchmark]: Toolchain (without parser) took 9788.49ms. Allocated memory was 142.6MB in the beginning and 234.9MB in the end (delta: 92.3MB). Free memory was 114.0MB in the beginning and 150.0MB in the end (delta: -35.9MB). Peak memory consumption was 56.9MB. Max. memory is 16.1GB. [2025-03-03 19:02:40,082 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:02:40,082 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.78ms. Allocated memory is still 142.6MB. Free memory was 114.0MB in the beginning and 99.3MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 19:02:40,082 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.91ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 94.8MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:02:40,082 INFO L158 Benchmark]: Boogie Preprocessor took 46.42ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 89.0MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 19:02:40,082 INFO L158 Benchmark]: IcfgBuilder took 436.32ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 60.7MB in the end (delta: 28.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 19:02:40,083 INFO L158 Benchmark]: TraceAbstraction took 8993.35ms. Allocated memory was 142.6MB in the beginning and 234.9MB in the end (delta: 92.3MB). Free memory was 59.8MB in the beginning and 150.0MB in the end (delta: -90.3MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2025-03-03 19:02:40,083 INFO L158 Benchmark]: Witness Printer took 2.72ms. Allocated memory is still 234.9MB. Free memory was 150.0MB in the beginning and 150.0MB in the end (delta: 45.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:02:40,084 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 124.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 247.78ms. Allocated memory is still 142.6MB. Free memory was 114.0MB in the beginning and 99.3MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.91ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 94.8MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.42ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 89.0MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 436.32ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 60.7MB in the end (delta: 28.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8993.35ms. Allocated memory was 142.6MB in the beginning and 234.9MB in the end (delta: 92.3MB). Free memory was 59.8MB in the beginning and 150.0MB in the end (delta: -90.3MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. * Witness Printer took 2.72ms. Allocated memory is still 234.9MB. Free memory was 150.0MB in the beginning and 150.0MB in the end (delta: 45.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 122, overapproximation of someBinaryFLOATComparisonOperation at line 118, overapproximation of someBinaryFLOATComparisonOperation at line 120, overapproximation of someBinaryFLOATComparisonOperation at line 136, overapproximation of someBinaryDOUBLEComparisonOperation at line 136, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 47, overapproximation of someBinaryDOUBLEComparisonOperation at line 92. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 8; [L23] double var_1_2 = 50.5; [L24] double var_1_3 = 0.875; [L25] unsigned short int var_1_4 = 49926; [L26] unsigned short int var_1_5 = 500; [L27] unsigned short int var_1_6 = 10; [L28] unsigned short int var_1_7 = 2; [L29] unsigned char var_1_8 = 64; [L30] unsigned short int var_1_9 = 5; [L31] unsigned char var_1_10 = 0; [L32] unsigned char var_1_11 = 10; [L33] float var_1_12 = 0.19999999999999996; [L34] float var_1_13 = 9.2; [L35] float var_1_14 = 5.8; [L36] float var_1_15 = 31.25; [L37] unsigned char var_1_16 = 1; [L38] unsigned char var_1_17 = 0; [L39] unsigned char var_1_18 = 0; [L40] unsigned char var_1_19 = 1; [L41] unsigned short int var_1_20 = 256; [L42] unsigned short int var_1_21 = 23544; [L43] unsigned long int var_1_22 = 64; VAL [isInitial=0, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_2=101/2, var_1_3=7/8, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L140] isInitial = 1 [L141] FCALL initially() [L142] COND TRUE 1 [L143] FCALL updateLastVariables() [L144] CALL updateVariables() [L91] var_1_2 = __VERIFIER_nondet_double() [L92] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_3=7/8, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_3=7/8, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L92] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_3=7/8, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L93] var_1_3 = __VERIFIER_nondet_double() [L94] 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, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L94] 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, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L95] CALL assume_abort_if_not(var_1_3 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L95] RET assume_abort_if_not(var_1_3 != 0.0F) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L96] var_1_4 = __VERIFIER_nondet_ushort() [L97] CALL assume_abort_if_not(var_1_4 >= 49150) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L97] RET assume_abort_if_not(var_1_4 >= 49150) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L98] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L98] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L99] var_1_5 = __VERIFIER_nondet_ushort() [L100] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L100] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L101] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L101] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L102] var_1_6 = __VERIFIER_nondet_ushort() [L103] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_7=2, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_7=2, var_1_8=64, var_1_9=5] [L103] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_7=2, var_1_8=64, var_1_9=5] [L104] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=2, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=2, var_1_8=64, var_1_9=5] [L104] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=2, var_1_8=64, var_1_9=5] [L105] var_1_7 = __VERIFIER_nondet_ushort() [L106] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_8=64, var_1_9=5] [L106] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_8=64, var_1_9=5] [L107] CALL assume_abort_if_not(var_1_7 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=5] [L107] RET assume_abort_if_not(var_1_7 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=5] [L108] var_1_9 = __VERIFIER_nondet_ushort() [L109] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64] [L109] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64] [L110] CALL assume_abort_if_not(var_1_9 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L110] RET assume_abort_if_not(var_1_9 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L111] var_1_10 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L112] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L113] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L113] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L114] var_1_11 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L115] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L116] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L116] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L117] var_1_13 = __VERIFIER_nondet_float() [L118] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L118] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L119] var_1_14 = __VERIFIER_nondet_float() [L120] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L120] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L121] var_1_15 = __VERIFIER_nondet_float() [L122] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L122] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L123] var_1_17 = __VERIFIER_nondet_uchar() [L124] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L124] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L125] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L125] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L126] var_1_18 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L127] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L128] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L128] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L129] var_1_21 = __VERIFIER_nondet_ushort() [L130] CALL assume_abort_if_not(var_1_21 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L130] RET assume_abort_if_not(var_1_21 >= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L131] CALL assume_abort_if_not(var_1_21 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L131] RET assume_abort_if_not(var_1_21 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L144] RET updateVariables() [L145] CALL step() [L47] COND TRUE var_1_2 >= (1.3 / var_1_3) [L48] var_1_1 = ((var_1_4 - var_1_5) - var_1_6) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L52] signed long int stepLocal_0 = 32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))); VAL [isInitial=1, stepLocal_0=16384, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L53] COND FALSE !(var_1_5 >= stepLocal_0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L58] COND FALSE !(\read(var_1_10)) [L63] var_1_12 = var_1_14 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L65] COND FALSE !((var_1_6 + var_1_8) > (((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) + var_1_1)) [L68] var_1_16 = var_1_18 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L70] unsigned char stepLocal_1 = var_1_1 < 64; VAL [isInitial=1, stepLocal_1=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L71] COND FALSE !(\read(var_1_16)) VAL [isInitial=1, stepLocal_1=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L76] unsigned short int stepLocal_2 = var_1_4; VAL [isInitial=1, stepLocal_1=1, stepLocal_2=49150, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L77] COND TRUE var_1_6 <= stepLocal_2 VAL [isInitial=1, stepLocal_1=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L78] COND FALSE !(\read(var_1_16)) [L81] var_1_20 = 16 VAL [isInitial=1, stepLocal_1=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L86] EXPR 2 ^ var_1_1 VAL [isInitial=1, stepLocal_1=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L86] EXPR (((var_1_4 * var_1_6)) > ((2 ^ var_1_1))) ? ((var_1_4 * var_1_6)) : ((2 ^ var_1_1)) VAL [isInitial=1, stepLocal_1=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L86] COND FALSE !(var_1_8 >= (((((var_1_4 * var_1_6)) > ((2 ^ var_1_1))) ? ((var_1_4 * var_1_6)) : ((2 ^ var_1_1))))) [L145] RET step() [L146] CALL, EXPR property() [L136] EXPR (((((((var_1_2 >= (1.3 / var_1_3)) ? (var_1_1 == ((unsigned short int) ((var_1_4 - var_1_5) - var_1_6))) : (var_1_1 == ((unsigned short int) ((((var_1_7) < (var_1_4)) ? (var_1_7) : (var_1_4)))))) && ((var_1_5 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) ? (var_1_10 ? (var_1_8 == ((unsigned char) var_1_11)) : 1) : 1)) && (var_1_10 ? (((var_1_8 * var_1_7) < var_1_11) ? (var_1_12 == ((float) ((((((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) > (var_1_15)) ? (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) : (var_1_15))))) : 1) : (var_1_12 == ((float) var_1_14)))) && (((var_1_6 + var_1_8) > (((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) + var_1_1)) ? (var_1_16 == ((unsigned char) (var_1_10 || var_1_17))) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_16 ? (((var_1_1 < 64) || var_1_10) ? (var_1_19 == ((unsigned char) var_1_17)) : 1) : 1)) && ((var_1_6 <= var_1_4) ? (var_1_16 ? (var_1_20 == ((unsigned short int) (var_1_4 - ((((var_1_21 - var_1_8) < 0 ) ? -(var_1_21 - var_1_8) : (var_1_21 - var_1_8)))))) : (var_1_20 == ((unsigned short int) 16))) : (var_1_20 == ((unsigned short int) (var_1_4 - var_1_5))))) && ((var_1_8 >= (((((var_1_4 * var_1_6)) > ((2 ^ var_1_1))) ? ((var_1_4 * var_1_6)) : ((2 ^ var_1_1))))) ? (var_1_22 == ((unsigned long int) var_1_8)) : 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L136-L137] return (((((((var_1_2 >= (1.3 / var_1_3)) ? (var_1_1 == ((unsigned short int) ((var_1_4 - var_1_5) - var_1_6))) : (var_1_1 == ((unsigned short int) ((((var_1_7) < (var_1_4)) ? (var_1_7) : (var_1_4)))))) && ((var_1_5 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) ? (var_1_10 ? (var_1_8 == ((unsigned char) var_1_11)) : 1) : 1)) && (var_1_10 ? (((var_1_8 * var_1_7) < var_1_11) ? (var_1_12 == ((float) ((((((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) > (var_1_15)) ? (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) : (var_1_15))))) : 1) : (var_1_12 == ((float) var_1_14)))) && (((var_1_6 + var_1_8) > (((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) + var_1_1)) ? (var_1_16 == ((unsigned char) (var_1_10 || var_1_17))) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_16 ? (((var_1_1 < 64) || var_1_10) ? (var_1_19 == ((unsigned char) var_1_17)) : 1) : 1)) && ((var_1_6 <= var_1_4) ? (var_1_16 ? (var_1_20 == ((unsigned short int) (var_1_4 - ((((var_1_21 - var_1_8) < 0 ) ? -(var_1_21 - var_1_8) : (var_1_21 - var_1_8)))))) : (var_1_20 == ((unsigned short int) 16))) : (var_1_20 == ((unsigned short int) (var_1_4 - var_1_5))))) && ((var_1_8 >= (((((var_1_4 * var_1_6)) > ((2 ^ var_1_1))) ? ((var_1_4 * var_1_6)) : ((2 ^ var_1_1))))) ? (var_1_22 == ((unsigned long int) var_1_8)) : 1) ; [L146] RET, EXPR property() [L146] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=16383, var_1_6=-32769, var_1_7=32831, var_1_8=64, var_1_9=-49124] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.9s, OverallIterations: 6, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1603 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1530 mSDsluCounter, 2574 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1805 mSDsCounter, 373 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2416 IncrementalHoareTripleChecker+Invalid, 2789 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 373 mSolverCounterUnsat, 769 mSDtfsCounter, 2416 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 952 GetRequests, 859 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=376occurred in iteration=5, InterpolantAutomatonStates: 81, 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, 5 MinimizatonAttempts, 556 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 1694 NumberOfCodeBlocks, 1694 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1513 ConstructedInterpolants, 1 QuantifiedInterpolants, 5138 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1109 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 9 InterpolantComputations, 2 PerfectInterpolantSequences, 11238/11700 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-03 19:02:40,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_codestructure_steplocals_file-47.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 874b8c0685149675525220fee2d5689c1d5289515348c6c05c19ae6cc8a7fb40 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:02:41,866 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:02:41,940 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 19:02:41,944 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:02:41,945 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:02:41,964 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:02:41,964 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:02:41,965 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:02:41,965 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:02:41,968 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:02:41,969 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:02:41,969 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:02:41,969 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:02:41,969 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:02:41,969 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:02:41,969 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:02:41,969 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:02:41,969 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:02:41,969 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:02:41,969 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:02:41,969 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:02:41,969 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:02:41,969 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:02:41,969 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 19:02:41,969 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 19:02:41,970 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 19:02:41,970 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:02:41,970 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:02:41,970 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:02:41,970 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:02:41,970 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:02:41,970 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:02:41,970 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:02:41,970 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:02:41,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:02:41,970 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:02:41,970 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:02:41,970 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:02:41,970 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:02:41,970 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 19:02:41,970 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 19:02:41,970 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:02:41,970 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:02:41,970 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:02:41,970 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:02:41,970 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 -> 874b8c0685149675525220fee2d5689c1d5289515348c6c05c19ae6cc8a7fb40 [2025-03-03 19:02:42,199 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:02:42,204 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:02:42,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:02:42,208 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:02:42,208 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:02:42,209 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-47.i [2025-03-03 19:02:43,377 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05affe29c/72d7e3ce7624486c8f964d92956607a4/FLAGb427a5c2f [2025-03-03 19:02:43,524 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:02:43,525 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-47.i [2025-03-03 19:02:43,534 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05affe29c/72d7e3ce7624486c8f964d92956607a4/FLAGb427a5c2f [2025-03-03 19:02:43,554 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05affe29c/72d7e3ce7624486c8f964d92956607a4 [2025-03-03 19:02:43,555 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:02:43,558 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:02:43,559 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:02:43,559 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:02:43,562 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:02:43,563 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:02:43" (1/1) ... [2025-03-03 19:02:43,565 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e27d069 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:02:43, skipping insertion in model container [2025-03-03 19:02:43,565 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:02:43" (1/1) ... [2025-03-03 19:02:43,582 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:02:43,684 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_codestructure_steplocals_file-47.i[917,930] [2025-03-03 19:02:43,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:02:43,755 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:02:43,765 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_codestructure_steplocals_file-47.i[917,930] [2025-03-03 19:02:43,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:02:43,805 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:02:43,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:02:43 WrapperNode [2025-03-03 19:02:43,806 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:02:43,806 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:02:43,806 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:02:43,806 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:02:43,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:02:43" (1/1) ... [2025-03-03 19:02:43,817 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:02:43" (1/1) ... [2025-03-03 19:02:43,833 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 150 [2025-03-03 19:02:43,833 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:02:43,834 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:02:43,834 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:02:43,834 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:02:43,842 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:02:43" (1/1) ... [2025-03-03 19:02:43,842 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:02:43" (1/1) ... [2025-03-03 19:02:43,844 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:02:43" (1/1) ... [2025-03-03 19:02:43,859 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-03 19:02:43,860 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:02:43" (1/1) ... [2025-03-03 19:02:43,860 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:02:43" (1/1) ... [2025-03-03 19:02:43,873 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:02:43" (1/1) ... [2025-03-03 19:02:43,874 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:02:43" (1/1) ... [2025-03-03 19:02:43,876 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:02:43" (1/1) ... [2025-03-03 19:02:43,877 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:02:43" (1/1) ... [2025-03-03 19:02:43,878 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:02:43,879 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:02:43,879 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:02:43,879 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:02:43,880 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:02:43" (1/1) ... [2025-03-03 19:02:43,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:02:43,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:02:43,906 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-03 19:02:43,912 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-03 19:02:43,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:02:43,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 19:02:43,928 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:02:43,928 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:02:43,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:02:43,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:02:43,994 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:02:43,996 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:02:57,052 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-03 19:02:57,052 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:02:57,059 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:02:57,059 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:02:57,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:02:57 BoogieIcfgContainer [2025-03-03 19:02:57,060 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:02:57,061 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:02:57,061 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:02:57,064 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:02:57,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:02:43" (1/3) ... [2025-03-03 19:02:57,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@203ad31e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:02:57, skipping insertion in model container [2025-03-03 19:02:57,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:02:43" (2/3) ... [2025-03-03 19:02:57,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@203ad31e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:02:57, skipping insertion in model container [2025-03-03 19:02:57,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:02:57" (3/3) ... [2025-03-03 19:02:57,069 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-47.i [2025-03-03 19:02:57,078 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:02:57,079 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-47.i that has 2 procedures, 73 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:02:57,117 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:02:57,124 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;@63738990, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:02:57,124 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:02:57,127 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 19:02:57,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 19:02:57,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:02:57,135 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:02:57,135 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:02:57,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:02:57,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1365747795, now seen corresponding path program 1 times [2025-03-03 19:02:57,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:02:57,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1010166277] [2025-03-03 19:02:57,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:02:57,148 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-03 19:02:57,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:02:57,150 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-03 19:02:57,151 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-03 19:02:57,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 19:02:57,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 19:02:57,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:02:57,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:02:57,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:02:57,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:02:57,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 506 proven. 0 refuted. 0 times theorem prover too weak. 794 trivial. 0 not checked. [2025-03-03 19:02:57,954 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:02:57,955 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:02:57,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1010166277] [2025-03-03 19:02:57,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1010166277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:02:57,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:02:57,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 19:02:57,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568689153] [2025-03-03 19:02:57,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:02:57,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:02:57,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:02:57,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:02:57,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:02:57,975 INFO L87 Difference]: Start difference. First operand has 73 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 19:02:57,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:02:57,992 INFO L93 Difference]: Finished difference Result 140 states and 243 transitions. [2025-03-03 19:02:57,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:02:57,993 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 164 [2025-03-03 19:02:57,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:02:57,997 INFO L225 Difference]: With dead ends: 140 [2025-03-03 19:02:57,997 INFO L226 Difference]: Without dead ends: 70 [2025-03-03 19:02:58,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:02:58,001 INFO L435 NwaCegarLoop]: 106 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, 106 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-03 19:02:58,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:02:58,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-03 19:02:58,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-03-03 19:02:58,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 19:02:58,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 106 transitions. [2025-03-03 19:02:58,035 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 106 transitions. Word has length 164 [2025-03-03 19:02:58,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:02:58,035 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 106 transitions. [2025-03-03 19:02:58,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 19:02:58,036 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 106 transitions. [2025-03-03 19:02:58,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 19:02:58,039 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:02:58,039 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:02:58,062 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-03 19:02:58,240 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-03 19:02:58,241 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:02:58,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:02:58,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1505071305, now seen corresponding path program 1 times [2025-03-03 19:02:58,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:02:58,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1187169428] [2025-03-03 19:02:58,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:02:58,243 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-03 19:02:58,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:02:58,245 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-03 19:02:58,245 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-03 19:02:58,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 19:02:58,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 19:02:58,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:02:58,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:02:59,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 19:02:59,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:03:00,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 465 proven. 15 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2025-03-03 19:03:00,103 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:03:01,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 60 proven. 15 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-03 19:03:01,894 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:03:01,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1187169428] [2025-03-03 19:03:01,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1187169428] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:03:01,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 19:03:01,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2025-03-03 19:03:01,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658633664] [2025-03-03 19:03:01,895 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 19:03:01,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 19:03:01,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:03:01,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 19:03:01,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 19:03:01,897 INFO L87 Difference]: Start difference. First operand 70 states and 106 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-03 19:03:09,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:03:13,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:03:17,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:03:18,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:03:20,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:03:25,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:03:25,880 INFO L93 Difference]: Finished difference Result 322 states and 481 transitions. [2025-03-03 19:03:25,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 19:03:25,884 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 164 [2025-03-03 19:03:25,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:03:25,886 INFO L225 Difference]: With dead ends: 322 [2025-03-03 19:03:25,886 INFO L226 Difference]: Without dead ends: 255 [2025-03-03 19:03:25,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 320 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2025-03-03 19:03:25,890 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 192 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 79 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.5s IncrementalHoareTripleChecker+Time [2025-03-03 19:03:25,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 622 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 668 Invalid, 3 Unknown, 0 Unchecked, 22.5s Time] [2025-03-03 19:03:25,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-03-03 19:03:25,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 171. [2025-03-03 19:03:25,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 94 states have (on average 1.1808510638297873) internal successors, (111), 96 states have internal predecessors, (111), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 19:03:25,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 255 transitions. [2025-03-03 19:03:25,930 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 255 transitions. Word has length 164 [2025-03-03 19:03:25,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:03:25,931 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 255 transitions. [2025-03-03 19:03:25,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-03 19:03:25,931 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 255 transitions. [2025-03-03 19:03:25,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 19:03:25,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:03:25,933 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:03:25,951 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-03 19:03:26,133 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-03 19:03:26,133 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:03:26,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:03:26,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1701584810, now seen corresponding path program 1 times [2025-03-03 19:03:26,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:03:26,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1688006267] [2025-03-03 19:03:26,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:03:26,134 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-03 19:03:26,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:03:26,136 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-03 19:03:26,137 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-03 19:03:26,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 19:03:26,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 19:03:26,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:03:26,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:03:26,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 19:03:26,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:03:31,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 599 proven. 114 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2025-03-03 19:03:31,593 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:03:33,451 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:03:33,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1688006267] [2025-03-03 19:03:33,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1688006267] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:03:33,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1325007548] [2025-03-03 19:03:33,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:03:33,451 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 19:03:33,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 19:03:33,468 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 19:03:33,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-03-03 19:03:33,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 19:03:35,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 19:03:35,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:03:35,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:03:35,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 19:03:35,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:03:39,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 599 proven. 114 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2025-03-03 19:03:39,727 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:03:41,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1325007548] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:03:41,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 19:03:41,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2025-03-03 19:03:41,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992541614] [2025-03-03 19:03:41,135 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 19:03:41,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 19:03:41,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:03:41,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 19:03:41,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-03 19:03:41,136 INFO L87 Difference]: Start difference. First operand 171 states and 255 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2025-03-03 19:03:48,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:03:52,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:03:53,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:03:57,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.51s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:03:59,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:04:04,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:04:05,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:04:05,506 INFO L93 Difference]: Finished difference Result 342 states and 484 transitions. [2025-03-03 19:04:05,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 19:04:05,587 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 164 [2025-03-03 19:04:05,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:04:05,591 INFO L225 Difference]: With dead ends: 342 [2025-03-03 19:04:05,591 INFO L226 Difference]: Without dead ends: 207 [2025-03-03 19:04:05,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 539 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2025-03-03 19:04:05,593 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 61 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 22 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.8s IncrementalHoareTripleChecker+Time [2025-03-03 19:04:05,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 230 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 312 Invalid, 3 Unknown, 0 Unchecked, 23.8s Time] [2025-03-03 19:04:05,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-03 19:04:05,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 195. [2025-03-03 19:04:05,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 112 states have (on average 1.125) internal successors, (126), 114 states have internal predecessors, (126), 72 states have call successors, (72), 10 states have call predecessors, (72), 10 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 19:04:05,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 270 transitions. [2025-03-03 19:04:05,620 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 270 transitions. Word has length 164 [2025-03-03 19:04:05,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:04:05,621 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 270 transitions. [2025-03-03 19:04:05,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2025-03-03 19:04:05,621 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 270 transitions. [2025-03-03 19:04:05,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 19:04:05,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:04:05,626 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:04:05,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-03-03 19:04:05,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2025-03-03 19:04:06,027 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,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-03 19:04:06,027 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:04:06,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:04:06,028 INFO L85 PathProgramCache]: Analyzing trace with hash -263774513, now seen corresponding path program 1 times [2025-03-03 19:04:06,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:04:06,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1377480885] [2025-03-03 19:04:06,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:04:06,029 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-03 19:04:06,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:04:06,031 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-03 19:04:06,032 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-03 19:04:06,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 19:04:06,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 19:04:06,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:04:06,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:04:06,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 19:04:06,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:04:07,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 255 proven. 6 refuted. 0 times theorem prover too weak. 1039 trivial. 0 not checked. [2025-03-03 19:04:07,450 INFO L312 TraceCheckSpWp]: Computing backward predicates...