./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-13.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_fillercode_fillercodestructure_filler-ps-ci_file-13.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 062a802759b4aa2a0cbcb5cdde30f3437c09c950e76bee485cf882952e2d339f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:34:34,056 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:34:34,097 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 21:34:34,102 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:34:34,103 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:34:34,127 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:34:34,127 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:34:34,127 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:34:34,128 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:34:34,128 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:34:34,128 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:34:34,128 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:34:34,128 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:34:34,128 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:34:34,128 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:34:34,128 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:34:34,128 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:34:34,128 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:34:34,128 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 21:34:34,128 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:34:34,129 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:34:34,129 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:34:34,129 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:34:34,129 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:34:34,129 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:34:34,129 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:34:34,129 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:34:34,129 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:34:34,129 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:34:34,129 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:34:34,129 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:34:34,129 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:34:34,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:34:34,129 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:34:34,131 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:34:34,131 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:34:34,131 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:34:34,131 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 21:34:34,131 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 21:34:34,131 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:34:34,131 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:34:34,131 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:34:34,131 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:34:34,131 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 -> 062a802759b4aa2a0cbcb5cdde30f3437c09c950e76bee485cf882952e2d339f [2025-03-03 21:34:34,384 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:34:34,391 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:34:34,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:34:34,396 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:34:34,396 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:34:34,397 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-13.i [2025-03-03 21:34:35,603 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5653597b6/b9ee49a16a7d4759b6e5a22da7b535be/FLAGcf9ae154c [2025-03-03 21:34:35,881 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:34:35,886 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-13.i [2025-03-03 21:34:35,895 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5653597b6/b9ee49a16a7d4759b6e5a22da7b535be/FLAGcf9ae154c [2025-03-03 21:34:36,178 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5653597b6/b9ee49a16a7d4759b6e5a22da7b535be [2025-03-03 21:34:36,180 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:34:36,182 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:34:36,183 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:34:36,184 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:34:36,188 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:34:36,189 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:34:36" (1/1) ... [2025-03-03 21:34:36,189 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22e7e16d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:36, skipping insertion in model container [2025-03-03 21:34:36,189 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:34:36" (1/1) ... [2025-03-03 21:34:36,207 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:34:36,326 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-13.i[919,932] [2025-03-03 21:34:36,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:34:36,432 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:34:36,440 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-13.i[919,932] [2025-03-03 21:34:36,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:34:36,500 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:34:36,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:36 WrapperNode [2025-03-03 21:34:36,500 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:34:36,501 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:34:36,501 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:34:36,501 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:34:36,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:36" (1/1) ... [2025-03-03 21:34:36,522 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:36" (1/1) ... [2025-03-03 21:34:36,563 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 189 [2025-03-03 21:34:36,564 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:34:36,565 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:34:36,565 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:34:36,565 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:34:36,571 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:36" (1/1) ... [2025-03-03 21:34:36,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:36" (1/1) ... [2025-03-03 21:34:36,581 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:36" (1/1) ... [2025-03-03 21:34:36,599 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 21:34:36,599 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:36" (1/1) ... [2025-03-03 21:34:36,600 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:36" (1/1) ... [2025-03-03 21:34:36,609 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:36" (1/1) ... [2025-03-03 21:34:36,613 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:36" (1/1) ... [2025-03-03 21:34:36,614 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:36" (1/1) ... [2025-03-03 21:34:36,618 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:36" (1/1) ... [2025-03-03 21:34:36,621 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:34:36,623 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:34:36,625 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:34:36,625 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:34:36,626 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:36" (1/1) ... [2025-03-03 21:34:36,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:34:36,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:34:36,655 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 21:34:36,658 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 21:34:36,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:34:36,677 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:34:36,677 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:34:36,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 21:34:36,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:34:36,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:34:36,744 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:34:36,746 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:34:37,088 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L165: havoc property_#t~bitwise18#1; [2025-03-03 21:34:37,117 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-03 21:34:37,118 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:34:37,137 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:34:37,138 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:34:37,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:34:37 BoogieIcfgContainer [2025-03-03 21:34:37,139 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:34:37,141 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:34:37,141 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:34:37,145 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:34:37,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:34:36" (1/3) ... [2025-03-03 21:34:37,146 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c3e0245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:34:37, skipping insertion in model container [2025-03-03 21:34:37,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:36" (2/3) ... [2025-03-03 21:34:37,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c3e0245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:34:37, skipping insertion in model container [2025-03-03 21:34:37,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:34:37" (3/3) ... [2025-03-03 21:34:37,148 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-13.i [2025-03-03 21:34:37,159 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:34:37,161 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-13.i that has 2 procedures, 82 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:34:37,202 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:34:37,211 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;@3639d915, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:34:37,211 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:34:37,217 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 60 states have internal predecessors, (87), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 21:34:37,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 21:34:37,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:34:37,229 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:34:37,229 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:34:37,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:34:37,234 INFO L85 PathProgramCache]: Analyzing trace with hash -717297767, now seen corresponding path program 1 times [2025-03-03 21:34:37,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:34:37,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102843095] [2025-03-03 21:34:37,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:34:37,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:34:37,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 21:34:37,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 21:34:37,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:34:37,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:34:37,526 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-03 21:34:37,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:34:37,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102843095] [2025-03-03 21:34:37,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102843095] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:34:37,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470766762] [2025-03-03 21:34:37,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:34:37,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:34:37,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:34:37,533 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 21:34:37,536 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 21:34:37,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 21:34:37,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 21:34:37,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:34:37,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:34:37,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:34:37,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:34:37,722 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-03 21:34:37,725 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:34:37,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470766762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:34:37,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:34:37,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 21:34:37,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041689477] [2025-03-03 21:34:37,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:34:37,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:34:37,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:34:37,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:34:37,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:34:37,750 INFO L87 Difference]: Start difference. First operand has 82 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 60 states have internal predecessors, (87), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 21:34:37,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:34:37,777 INFO L93 Difference]: Finished difference Result 158 states and 269 transitions. [2025-03-03 21:34:37,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:34:37,780 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 140 [2025-03-03 21:34:37,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:34:37,785 INFO L225 Difference]: With dead ends: 158 [2025-03-03 21:34:37,786 INFO L226 Difference]: Without dead ends: 79 [2025-03-03 21:34:37,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 141 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 21:34:37,791 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:34:37,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:34:37,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-03 21:34:37,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-03 21:34:37,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 57 states have internal predecessors, (80), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 21:34:37,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 120 transitions. [2025-03-03 21:34:37,820 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 120 transitions. Word has length 140 [2025-03-03 21:34:37,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:34:37,820 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 120 transitions. [2025-03-03 21:34:37,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 21:34:37,820 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 120 transitions. [2025-03-03 21:34:37,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 21:34:37,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:34:37,825 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:34:37,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 21:34:38,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 21:34:38,028 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:34:38,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:34:38,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1543560733, now seen corresponding path program 1 times [2025-03-03 21:34:38,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:34:38,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457334442] [2025-03-03 21:34:38,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:34:38,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:34:38,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 21:34:38,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 21:34:38,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:34:38,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:34:38,220 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 21:34:38,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:34:38,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457334442] [2025-03-03 21:34:38,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457334442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:34:38,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:34:38,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:34:38,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282654842] [2025-03-03 21:34:38,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:34:38,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:34:38,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:34:38,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:34:38,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:34:38,225 INFO L87 Difference]: Start difference. First operand 79 states and 120 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:34:38,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:34:38,292 INFO L93 Difference]: Finished difference Result 206 states and 313 transitions. [2025-03-03 21:34:38,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:34:38,295 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2025-03-03 21:34:38,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:34:38,296 INFO L225 Difference]: With dead ends: 206 [2025-03-03 21:34:38,296 INFO L226 Difference]: Without dead ends: 130 [2025-03-03 21:34:38,297 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 21:34:38,298 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 66 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:34:38,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 276 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:34:38,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-03 21:34:38,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2025-03-03 21:34:38,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 98 states have (on average 1.4285714285714286) internal successors, (140), 99 states have internal predecessors, (140), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 21:34:38,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 192 transitions. [2025-03-03 21:34:38,320 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 192 transitions. Word has length 140 [2025-03-03 21:34:38,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:34:38,322 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 192 transitions. [2025-03-03 21:34:38,323 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:34:38,323 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 192 transitions. [2025-03-03 21:34:38,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 21:34:38,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:34:38,325 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:34:38,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 21:34:38,325 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:34:38,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:34:38,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1243854754, now seen corresponding path program 1 times [2025-03-03 21:34:38,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:34:38,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92620962] [2025-03-03 21:34:38,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:34:38,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:34:38,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 21:34:38,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 21:34:38,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:34:38,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:34:38,805 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 21:34:38,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:34:38,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92620962] [2025-03-03 21:34:38,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92620962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:34:38,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:34:38,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 21:34:38,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511232103] [2025-03-03 21:34:38,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:34:38,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 21:34:38,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:34:38,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 21:34:38,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 21:34:38,809 INFO L87 Difference]: Start difference. First operand 127 states and 192 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:34:39,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:34:39,128 INFO L93 Difference]: Finished difference Result 365 states and 557 transitions. [2025-03-03 21:34:39,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 21:34:39,128 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2025-03-03 21:34:39,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:34:39,131 INFO L225 Difference]: With dead ends: 365 [2025-03-03 21:34:39,133 INFO L226 Difference]: Without dead ends: 241 [2025-03-03 21:34:39,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-03 21:34:39,135 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 119 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:34:39,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 430 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:34:39,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-03-03 21:34:39,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 195. [2025-03-03 21:34:39,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 145 states have (on average 1.4413793103448276) internal successors, (209), 146 states have internal predecessors, (209), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-03 21:34:39,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 301 transitions. [2025-03-03 21:34:39,162 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 301 transitions. Word has length 140 [2025-03-03 21:34:39,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:34:39,163 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 301 transitions. [2025-03-03 21:34:39,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:34:39,163 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 301 transitions. [2025-03-03 21:34:39,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-03 21:34:39,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:34:39,167 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:34:39,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 21:34:39,167 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:34:39,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:34:39,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1757918904, now seen corresponding path program 1 times [2025-03-03 21:34:39,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:34:39,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370600051] [2025-03-03 21:34:39,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:34:39,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:34:39,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 21:34:39,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 21:34:39,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:34:39,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:34:39,327 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 21:34:39,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:34:39,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370600051] [2025-03-03 21:34:39,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370600051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:34:39,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:34:39,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:34:39,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99250272] [2025-03-03 21:34:39,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:34:39,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:34:39,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:34:39,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:34:39,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:34:39,329 INFO L87 Difference]: Start difference. First operand 195 states and 301 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:34:39,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:34:39,396 INFO L93 Difference]: Finished difference Result 449 states and 687 transitions. [2025-03-03 21:34:39,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:34:39,397 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 141 [2025-03-03 21:34:39,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:34:39,399 INFO L225 Difference]: With dead ends: 449 [2025-03-03 21:34:39,400 INFO L226 Difference]: Without dead ends: 319 [2025-03-03 21:34:39,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:34:39,401 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 77 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:34:39,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 306 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:34:39,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-03-03 21:34:39,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 317. [2025-03-03 21:34:39,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 239 states have (on average 1.4267782426778242) internal successors, (341), 241 states have internal predecessors, (341), 72 states have call successors, (72), 5 states have call predecessors, (72), 5 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 21:34:39,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 485 transitions. [2025-03-03 21:34:39,441 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 485 transitions. Word has length 141 [2025-03-03 21:34:39,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:34:39,442 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 485 transitions. [2025-03-03 21:34:39,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:34:39,443 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 485 transitions. [2025-03-03 21:34:39,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 21:34:39,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:34:39,446 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:34:39,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 21:34:39,446 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:34:39,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:34:39,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1189780128, now seen corresponding path program 1 times [2025-03-03 21:34:39,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:34:39,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036686062] [2025-03-03 21:34:39,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:34:39,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:34:39,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 21:34:39,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 21:34:39,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:34:39,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:34:39,654 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 21:34:39,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:34:39,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036686062] [2025-03-03 21:34:39,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036686062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:34:39,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:34:39,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 21:34:39,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993550136] [2025-03-03 21:34:39,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:34:39,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:34:39,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:34:39,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:34:39,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:34:39,656 INFO L87 Difference]: Start difference. First operand 317 states and 485 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:34:39,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:34:39,826 INFO L93 Difference]: Finished difference Result 645 states and 973 transitions. [2025-03-03 21:34:39,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:34:39,826 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-03-03 21:34:39,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:34:39,829 INFO L225 Difference]: With dead ends: 645 [2025-03-03 21:34:39,829 INFO L226 Difference]: Without dead ends: 399 [2025-03-03 21:34:39,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 21:34:39,830 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 131 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:34:39,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 175 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:34:39,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-03-03 21:34:39,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 329. [2025-03-03 21:34:39,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 251 states have (on average 1.4143426294820718) internal successors, (355), 253 states have internal predecessors, (355), 72 states have call successors, (72), 5 states have call predecessors, (72), 5 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 21:34:39,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 499 transitions. [2025-03-03 21:34:39,870 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 499 transitions. Word has length 143 [2025-03-03 21:34:39,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:34:39,870 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 499 transitions. [2025-03-03 21:34:39,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:34:39,870 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 499 transitions. [2025-03-03 21:34:39,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 21:34:39,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:34:39,872 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:34:39,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 21:34:39,872 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:34:39,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:34:39,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1483183135, now seen corresponding path program 1 times [2025-03-03 21:34:39,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:34:39,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699855629] [2025-03-03 21:34:39,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:34:39,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:34:39,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 21:34:39,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 21:34:39,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:34:39,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:34:40,138 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 21:34:40,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:34:40,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699855629] [2025-03-03 21:34:40,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699855629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:34:40,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:34:40,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 21:34:40,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055787779] [2025-03-03 21:34:40,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:34:40,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 21:34:40,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:34:40,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 21:34:40,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 21:34:40,141 INFO L87 Difference]: Start difference. First operand 329 states and 499 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:34:40,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:34:40,434 INFO L93 Difference]: Finished difference Result 739 states and 1096 transitions. [2025-03-03 21:34:40,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 21:34:40,434 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-03-03 21:34:40,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:34:40,438 INFO L225 Difference]: With dead ends: 739 [2025-03-03 21:34:40,438 INFO L226 Difference]: Without dead ends: 479 [2025-03-03 21:34:40,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-03 21:34:40,439 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 182 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:34:40,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 400 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:34:40,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-03-03 21:34:40,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 381. [2025-03-03 21:34:40,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 303 states have (on average 1.4125412541254125) internal successors, (428), 305 states have internal predecessors, (428), 72 states have call successors, (72), 5 states have call predecessors, (72), 5 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 21:34:40,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 572 transitions. [2025-03-03 21:34:40,474 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 572 transitions. Word has length 143 [2025-03-03 21:34:40,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:34:40,474 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 572 transitions. [2025-03-03 21:34:40,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:34:40,474 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 572 transitions. [2025-03-03 21:34:40,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 21:34:40,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:34:40,476 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:34:40,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 21:34:40,476 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:34:40,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:34:40,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1074358910, now seen corresponding path program 1 times [2025-03-03 21:34:40,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:34:40,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338214821] [2025-03-03 21:34:40,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:34:40,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:34:40,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 21:34:40,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 21:34:40,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:34:40,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:34:40,828 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 30 proven. 27 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-03 21:34:40,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:34:40,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338214821] [2025-03-03 21:34:40,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338214821] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:34:40,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354294913] [2025-03-03 21:34:40,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:34:40,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:34:40,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:34:40,831 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 21:34:40,833 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 21:34:40,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 21:34:40,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 21:34:40,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:34:40,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:34:40,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 21:34:40,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:34:41,264 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 417 proven. 78 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-03-03 21:34:41,264 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:34:41,661 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 30 proven. 81 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2025-03-03 21:34:41,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354294913] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:34:41,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 21:34:41,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-03-03 21:34:41,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087464664] [2025-03-03 21:34:41,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 21:34:41,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 21:34:41,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:34:41,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 21:34:41,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2025-03-03 21:34:41,663 INFO L87 Difference]: Start difference. First operand 381 states and 572 transitions. Second operand has 18 states, 18 states have (on average 6.0) internal successors, (108), 18 states have internal predecessors, (108), 7 states have call successors, (58), 3 states have call predecessors, (58), 7 states have return successors, (59), 7 states have call predecessors, (59), 7 states have call successors, (59) [2025-03-03 21:34:42,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:34:42,385 INFO L93 Difference]: Finished difference Result 829 states and 1196 transitions. [2025-03-03 21:34:42,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-03 21:34:42,385 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.0) internal successors, (108), 18 states have internal predecessors, (108), 7 states have call successors, (58), 3 states have call predecessors, (58), 7 states have return successors, (59), 7 states have call predecessors, (59), 7 states have call successors, (59) Word has length 143 [2025-03-03 21:34:42,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:34:42,388 INFO L225 Difference]: With dead ends: 829 [2025-03-03 21:34:42,388 INFO L226 Difference]: Without dead ends: 499 [2025-03-03 21:34:42,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=333, Invalid=927, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 21:34:42,390 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 509 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 21:34:42,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 304 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 21:34:42,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2025-03-03 21:34:42,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 407. [2025-03-03 21:34:42,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 321 states have (on average 1.3333333333333333) internal successors, (428), 323 states have internal predecessors, (428), 72 states have call successors, (72), 13 states have call predecessors, (72), 13 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 21:34:42,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 572 transitions. [2025-03-03 21:34:42,427 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 572 transitions. Word has length 143 [2025-03-03 21:34:42,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:34:42,427 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 572 transitions. [2025-03-03 21:34:42,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.0) internal successors, (108), 18 states have internal predecessors, (108), 7 states have call successors, (58), 3 states have call predecessors, (58), 7 states have return successors, (59), 7 states have call predecessors, (59), 7 states have call successors, (59) [2025-03-03 21:34:42,428 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 572 transitions. [2025-03-03 21:34:42,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 21:34:42,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:34:42,429 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:34:42,436 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 21:34:42,629 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,SelfDestructingSolverStorable6 [2025-03-03 21:34:42,630 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:34:42,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:34:42,630 INFO L85 PathProgramCache]: Analyzing trace with hash 612562215, now seen corresponding path program 1 times [2025-03-03 21:34:42,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:34:42,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139622244] [2025-03-03 21:34:42,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:34:42,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:34:42,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 21:34:42,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 21:34:42,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:34:42,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 21:34:42,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1204506484] [2025-03-03 21:34:42,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:34:42,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:34:42,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:34:42,749 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 21:34:42,751 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 21:34:42,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 21:34:42,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 21:34:42,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:34:42,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:34:42,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 21:34:42,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:34:43,308 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 415 proven. 81 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 21:34:43,308 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:34:43,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:34:43,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139622244] [2025-03-03 21:34:43,462 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 21:34:43,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204506484] [2025-03-03 21:34:43,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204506484] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:34:43,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:34:43,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2025-03-03 21:34:43,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003741834] [2025-03-03 21:34:43,462 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 21:34:43,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 21:34:43,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:34:43,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 21:34:43,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-03-03 21:34:43,464 INFO L87 Difference]: Start difference. First operand 407 states and 572 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 4 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-03 21:34:43,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:34:43,743 INFO L93 Difference]: Finished difference Result 797 states and 1096 transitions. [2025-03-03 21:34:43,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 21:34:43,744 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 4 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 144 [2025-03-03 21:34:43,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:34:43,746 INFO L225 Difference]: With dead ends: 797 [2025-03-03 21:34:43,746 INFO L226 Difference]: Without dead ends: 449 [2025-03-03 21:34:43,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2025-03-03 21:34:43,748 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 129 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:34:43,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 274 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:34:43,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-03-03 21:34:43,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 439. [2025-03-03 21:34:43,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 345 states have (on average 1.2927536231884058) internal successors, (446), 347 states have internal predecessors, (446), 72 states have call successors, (72), 21 states have call predecessors, (72), 21 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 21:34:43,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 590 transitions. [2025-03-03 21:34:43,779 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 590 transitions. Word has length 144 [2025-03-03 21:34:43,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:34:43,780 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 590 transitions. [2025-03-03 21:34:43,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 4 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-03 21:34:43,780 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 590 transitions. [2025-03-03 21:34:43,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-03 21:34:43,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:34:43,781 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:34:43,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 21:34:43,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:34:43,982 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:34:43,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:34:43,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1538775671, now seen corresponding path program 1 times [2025-03-03 21:34:43,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:34:43,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530556935] [2025-03-03 21:34:43,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:34:43,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:34:43,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 21:34:44,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 21:34:44,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:34:44,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 21:34:44,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [364894529] [2025-03-03 21:34:44,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:34:44,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:34:44,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:34:44,062 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 21:34:44,064 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 21:34:44,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 21:34:44,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 21:34:44,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:34:44,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 21:34:44,247 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 21:34:44,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 21:34:44,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 21:34:44,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:34:44,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 21:34:44,367 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 21:34:44,367 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 21:34:44,368 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 21:34:44,377 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 21:34:44,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:34:44,572 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:34:44,663 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 21:34:44,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:34:44 BoogieIcfgContainer [2025-03-03 21:34:44,666 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 21:34:44,667 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 21:34:44,667 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 21:34:44,667 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 21:34:44,669 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:34:37" (3/4) ... [2025-03-03 21:34:44,670 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 21:34:44,671 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 21:34:44,671 INFO L158 Benchmark]: Toolchain (without parser) took 8489.75ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 112.5MB in the beginning and 74.7MB in the end (delta: 37.8MB). Peak memory consumption was 115.1MB. Max. memory is 16.1GB. [2025-03-03 21:34:44,671 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:34:44,671 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.20ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 96.7MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 21:34:44,672 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.85ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 92.2MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:34:44,672 INFO L158 Benchmark]: Boogie Preprocessor took 58.29ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 86.1MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 21:34:44,673 INFO L158 Benchmark]: IcfgBuilder took 515.19ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 57.8MB in the end (delta: 28.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 21:34:44,673 INFO L158 Benchmark]: TraceAbstraction took 7524.88ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 57.4MB in the beginning and 74.7MB in the end (delta: -17.3MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. [2025-03-03 21:34:44,673 INFO L158 Benchmark]: Witness Printer took 4.00ms. Allocated memory is still 218.1MB. Free memory was 74.7MB in the beginning and 74.7MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:34:44,675 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.21ms. Allocated memory is still 201.3MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 317.20ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 96.7MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.85ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 92.2MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 58.29ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 86.1MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 515.19ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 57.8MB in the end (delta: 28.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7524.88ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 57.4MB in the beginning and 74.7MB in the end (delta: -17.3MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. * Witness Printer took 4.00ms. Allocated memory is still 218.1MB. Free memory was 74.7MB in the beginning and 74.7MB in the end (delta: 42.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 someUnaryDOUBLEoperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 158, overapproximation of someBinaryDOUBLEComparisonOperation at line 156, overapproximation of someBinaryDOUBLEComparisonOperation at line 165, overapproximation of someBinaryDOUBLEComparisonOperation at line 62, overapproximation of someBinaryDOUBLEComparisonOperation at line 152, overapproximation of someBinaryDOUBLEComparisonOperation at line 154, overapproximation of someBinaryDOUBLEComparisonOperation at line 109, overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 55. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 32; [L23] signed char var_1_4 = 16; [L24] unsigned char var_1_5 = 1; [L25] unsigned char var_1_6 = 1; [L26] unsigned char var_1_8 = 1; [L27] unsigned char var_1_9 = 0; [L28] unsigned char var_1_10 = 128; [L29] unsigned char var_1_11 = 64; [L30] signed char var_1_12 = -10; [L31] signed char var_1_13 = -10; [L32] signed char var_1_14 = -25; [L33] double var_1_15 = 64.875; [L34] double var_1_17 = 1.625; [L35] double var_1_18 = 32.2; [L36] double var_1_19 = 8.6; [L37] double var_1_20 = 10.5; [L38] signed short int var_1_21 = -64; [L39] unsigned char var_1_22 = 25; [L40] unsigned char var_1_23 = 0; [L41] unsigned long int var_1_24 = 5; [L42] double var_1_25 = 0.75; [L43] unsigned char var_1_27 = 4; [L44] signed short int var_1_35 = -64; [L45] signed char var_1_36 = -10; [L46] signed long int var_1_39 = 256; [L47] double var_1_40 = 31.6; [L48] signed short int var_1_42 = 5; [L49] signed short int last_1_var_1_21 = -64; [L50] unsigned char last_1_var_1_22 = 25; VAL [isInitial=0, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=16, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L169] isInitial = 1 [L170] FCALL initially() [L171] COND TRUE 1 [L172] CALL updateLastVariables() [L161] last_1_var_1_21 = var_1_21 [L162] last_1_var_1_22 = var_1_22 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=16, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L172] RET updateLastVariables() [L173] CALL updateVariables() [L127] var_1_4 = __VERIFIER_nondet_char() [L128] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L128] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L129] CALL assume_abort_if_not(var_1_4 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L129] RET assume_abort_if_not(var_1_4 <= 32) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L130] var_1_5 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_6=1, var_1_8=1, var_1_9=0] [L131] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_6=1, var_1_8=1, var_1_9=0] [L132] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L132] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L133] var_1_6 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_8=1, var_1_9=0] [L134] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_8=1, var_1_9=0] [L135] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L135] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L136] var_1_9 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1] [L137] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1] [L138] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L138] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L139] var_1_10 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L140] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L141] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L141] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L142] var_1_11 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_11 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L143] RET assume_abort_if_not(var_1_11 >= 63) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L144] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L144] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L145] var_1_13 = __VERIFIER_nondet_char() [L146] CALL assume_abort_if_not(var_1_13 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L146] RET assume_abort_if_not(var_1_13 >= -31) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L147] CALL assume_abort_if_not(var_1_13 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L147] RET assume_abort_if_not(var_1_13 <= 31) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L148] var_1_14 = __VERIFIER_nondet_char() [L149] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L149] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L150] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L150] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L151] var_1_17 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L152] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L153] var_1_18 = __VERIFIER_nondet_double() [L154] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L154] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L155] var_1_19 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_19 >= -230584.3009213691390e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 2305843.009213691390e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L156] RET assume_abort_if_not((var_1_19 >= -230584.3009213691390e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 2305843.009213691390e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L157] var_1_20 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_20 >= -230584.3009213691390e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 2305843.009213691390e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L158] RET assume_abort_if_not((var_1_20 >= -230584.3009213691390e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 2305843.009213691390e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L173] RET updateVariables() [L174] CALL step() [L54] var_1_25 = var_1_19 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_19=2, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=2, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L55] COND FALSE !((var_1_20 >= var_1_18) && (var_1_11 >= var_1_22)) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_19=2, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=2, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L62] COND FALSE !(var_1_20 > var_1_18) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_19=2, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=2, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L67] COND TRUE var_1_11 >= (var_1_11 % ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_19=2, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=2, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L68] COND FALSE !(var_1_11 < var_1_4) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_19=2, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=2, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L74] COND TRUE var_1_1 > var_1_4 [L75] var_1_39 = ((((var_1_1) < (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? (var_1_1) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_19=2, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=2, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=32, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L77] COND FALSE !(var_1_21 < ((((var_1_4) < (-64)) ? (var_1_4) : (-64)))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_19=2, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=2, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=32, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L80] EXPR var_1_11 | var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_19=2, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=2, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=32, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L80] COND TRUE (var_1_11 | var_1_4) < (8 + var_1_11) [L81] var_1_40 = (((((((((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) > (var_1_19)) ? (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) : (var_1_19))) < 0 ) ? -((((((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) > (var_1_19)) ? (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) : (var_1_19))) : ((((((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) > (var_1_19)) ? (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) : (var_1_19))))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_18=0, var_1_19=2, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=2, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=32, var_1_40=3, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L84] var_1_42 = var_1_22 [L85] signed long int stepLocal_1 = ~ last_1_var_1_21; [L86] unsigned char stepLocal_0 = var_1_5; VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, stepLocal_0=1, stepLocal_1=63, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_18=0, var_1_19=2, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=2, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=32, var_1_40=3, var_1_42=25, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L87] EXPR last_1_var_1_22 >> var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, stepLocal_0=1, stepLocal_1=63, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_18=0, var_1_19=2, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=2, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=32, var_1_40=3, var_1_42=25, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L87] COND TRUE stepLocal_1 != (last_1_var_1_22 >> var_1_4) [L88] COND TRUE stepLocal_0 || var_1_6 [L89] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_18=0, var_1_19=2, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=2, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=32, var_1_40=3, var_1_42=25, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L96] COND FALSE !(\read(var_1_9)) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_18=0, var_1_19=2, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=2, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=32, var_1_40=3, var_1_42=25, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L99] unsigned short int stepLocal_3 = var_1_1; VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, stepLocal_3=0, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_18=0, var_1_19=2, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=2, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=32, var_1_40=3, var_1_42=25, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L100] COND FALSE !(var_1_4 > stepLocal_3) [L103] var_1_15 = var_1_17 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=4, var_1_17=4, var_1_18=0, var_1_19=2, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=2, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=32, var_1_40=3, var_1_42=25, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L105] COND TRUE ((- var_1_11) < 8) || var_1_9 [L106] var_1_22 = (var_1_4 + ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=4, var_1_17=4, var_1_18=0, var_1_19=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=0, var_1_24=5, var_1_25=2, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=32, var_1_40=3, var_1_42=25, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L108] var_1_23 = (var_1_11 + var_1_4) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=4, var_1_17=4, var_1_18=0, var_1_19=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=5, var_1_25=2, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=32, var_1_40=3, var_1_42=25, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L109] COND TRUE var_1_18 <= var_1_20 [L110] var_1_24 = ((((var_1_8) < ((var_1_8 + var_1_11))) ? (var_1_8) : ((var_1_8 + var_1_11)))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=4, var_1_17=4, var_1_18=0, var_1_19=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_25=2, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=32, var_1_40=3, var_1_42=25, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L116] COND FALSE !(var_1_6 || var_1_9) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=4, var_1_17=4, var_1_18=0, var_1_19=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_25=2, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=32, var_1_40=3, var_1_42=25, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L121] signed short int stepLocal_2 = var_1_21; VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, stepLocal_2=-64, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=4, var_1_17=4, var_1_18=0, var_1_19=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_25=2, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=32, var_1_40=3, var_1_42=25, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L122] COND TRUE var_1_10 > stepLocal_2 [L123] var_1_12 = ((var_1_4 + var_1_13) + var_1_14) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=0, var_1_13=31, var_1_14=-31, var_1_15=4, var_1_17=4, var_1_18=0, var_1_19=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_25=2, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=32, var_1_40=3, var_1_42=25, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L174] RET step() [L175] CALL, EXPR property() [L165] EXPR last_1_var_1_22 >> var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=0, var_1_13=31, var_1_14=-31, var_1_15=4, var_1_17=4, var_1_18=0, var_1_19=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_25=2, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=32, var_1_40=3, var_1_42=25, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L165-L166] return (((((((((~ last_1_var_1_21) != (last_1_var_1_22 >> var_1_4)) ? ((var_1_5 || var_1_6) ? (var_1_1 == ((unsigned short int) var_1_4)) : (var_1_1 == ((unsigned short int) last_1_var_1_22))) : (var_1_1 == ((unsigned short int) 100))) && (var_1_9 ? (var_1_8 == ((unsigned char) (var_1_10 - (var_1_11 - var_1_4)))) : 1)) && ((var_1_10 > var_1_21) ? (var_1_12 == ((signed char) ((var_1_4 + var_1_13) + var_1_14))) : 1)) && ((var_1_4 > var_1_1) ? (var_1_15 == ((double) ((var_1_17 - var_1_18) + (((((var_1_19) > (499.25)) ? (var_1_19) : (499.25))) + var_1_20)))) : (var_1_15 == ((double) var_1_17)))) && ((var_1_6 || var_1_9) ? (((var_1_24 % var_1_10) > var_1_22) ? (var_1_21 == ((signed short int) (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) + var_1_14))) : 1) : 1)) && ((((- var_1_11) < 8) || var_1_9) ? (var_1_22 == ((unsigned char) (var_1_4 + ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) : 1)) && (var_1_23 == ((unsigned char) (var_1_11 + var_1_4)))) && ((var_1_18 <= var_1_20) ? (var_1_24 == ((unsigned long int) ((((var_1_8) < ((var_1_8 + var_1_11))) ? (var_1_8) : ((var_1_8 + var_1_11)))))) : ((9.99999999999998E13 < var_1_20) ? (var_1_24 == ((unsigned long int) var_1_1)) : 1)) ; [L175] RET, EXPR property() [L175] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=0, var_1_13=31, var_1_14=-31, var_1_15=4, var_1_17=4, var_1_18=0, var_1_19=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_25=2, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=32, var_1_40=3, var_1_42=25, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=0, var_1_13=31, var_1_14=-31, var_1_15=4, var_1_17=4, var_1_18=0, var_1_19=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_25=2, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=32, var_1_40=3, var_1_42=25, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 82 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.4s, OverallIterations: 9, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1223 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1213 mSDsluCounter, 2282 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1457 mSDsCounter, 290 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1525 IncrementalHoareTripleChecker+Invalid, 1815 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 290 mSolverCounterUnsat, 825 mSDtfsCounter, 1525 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 716 GetRequests, 647 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=439occurred in iteration=8, InterpolantAutomatonStates: 68, 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, 8 MinimizatonAttempts, 321 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1851 NumberOfCodeBlocks, 1851 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1549 ConstructedInterpolants, 0 QuantifiedInterpolants, 5768 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1051 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 11 InterpolantComputations, 6 PerfectInterpolantSequences, 8055/8360 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 21:34:44,703 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_fillercode_fillercodestructure_filler-ps-ci_file-13.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 062a802759b4aa2a0cbcb5cdde30f3437c09c950e76bee485cf882952e2d339f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:34:46,486 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:34:46,560 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 21:34:46,566 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:34:46,566 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:34:46,590 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:34:46,591 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:34:46,591 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:34:46,591 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:34:46,591 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:34:46,592 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:34:46,592 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:34:46,592 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:34:46,592 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:34:46,592 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:34:46,592 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:34:46,592 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:34:46,592 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:34:46,592 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:34:46,592 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:34:46,593 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:34:46,593 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:34:46,593 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:34:46,593 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 21:34:46,593 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 21:34:46,593 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 21:34:46,593 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:34:46,593 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:34:46,593 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:34:46,593 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:34:46,593 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:34:46,593 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:34:46,593 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:34:46,593 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:34:46,593 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:34:46,593 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:34:46,593 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:34:46,593 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:34:46,593 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:34:46,593 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 21:34:46,593 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 21:34:46,594 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:34:46,594 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:34:46,594 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:34:46,594 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:34:46,594 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 -> 062a802759b4aa2a0cbcb5cdde30f3437c09c950e76bee485cf882952e2d339f [2025-03-03 21:34:46,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:34:46,864 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:34:46,867 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:34:46,869 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:34:46,869 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:34:46,870 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-13.i [2025-03-03 21:34:48,013 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31786b672/25b1179fe3254cdea4d7b85b5a8813be/FLAGc26525137 [2025-03-03 21:34:48,237 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:34:48,240 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-13.i [2025-03-03 21:34:48,247 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31786b672/25b1179fe3254cdea4d7b85b5a8813be/FLAGc26525137 [2025-03-03 21:34:48,263 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31786b672/25b1179fe3254cdea4d7b85b5a8813be [2025-03-03 21:34:48,265 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:34:48,268 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:34:48,269 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:34:48,269 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:34:48,273 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:34:48,273 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:34:48" (1/1) ... [2025-03-03 21:34:48,275 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2112f4e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:48, skipping insertion in model container [2025-03-03 21:34:48,275 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:34:48" (1/1) ... [2025-03-03 21:34:48,294 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:34:48,397 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-13.i[919,932] [2025-03-03 21:34:48,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:34:48,484 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:34:48,495 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-13.i[919,932] [2025-03-03 21:34:48,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:34:48,548 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:34:48,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:48 WrapperNode [2025-03-03 21:34:48,549 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:34:48,550 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:34:48,550 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:34:48,550 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:34:48,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:48" (1/1) ... [2025-03-03 21:34:48,571 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:48" (1/1) ... [2025-03-03 21:34:48,596 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 163 [2025-03-03 21:34:48,600 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:34:48,600 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:34:48,600 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:34:48,603 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:34:48,610 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:48" (1/1) ... [2025-03-03 21:34:48,610 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:48" (1/1) ... [2025-03-03 21:34:48,614 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:48" (1/1) ... [2025-03-03 21:34:48,630 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 21:34:48,631 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:48" (1/1) ... [2025-03-03 21:34:48,631 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:48" (1/1) ... [2025-03-03 21:34:48,643 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:48" (1/1) ... [2025-03-03 21:34:48,647 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:48" (1/1) ... [2025-03-03 21:34:48,649 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:48" (1/1) ... [2025-03-03 21:34:48,653 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:48" (1/1) ... [2025-03-03 21:34:48,659 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:34:48,660 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:34:48,660 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:34:48,660 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:34:48,660 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:48" (1/1) ... [2025-03-03 21:34:48,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:34:48,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:34:48,686 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 21:34:48,691 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 21:34:48,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:34:48,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 21:34:48,706 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:34:48,706 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:34:48,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:34:48,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:34:48,774 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:34:48,775 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:34:55,385 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-03 21:34:55,386 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:34:55,395 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:34:55,396 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:34:55,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:34:55 BoogieIcfgContainer [2025-03-03 21:34:55,397 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:34:55,399 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:34:55,399 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:34:55,402 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:34:55,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:34:48" (1/3) ... [2025-03-03 21:34:55,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c266362 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:34:55, skipping insertion in model container [2025-03-03 21:34:55,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:48" (2/3) ... [2025-03-03 21:34:55,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c266362 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:34:55, skipping insertion in model container [2025-03-03 21:34:55,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:34:55" (3/3) ... [2025-03-03 21:34:55,406 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-13.i [2025-03-03 21:34:55,415 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:34:55,417 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-13.i that has 2 procedures, 74 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:34:55,463 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:34:55,470 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;@2d328741, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:34:55,471 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:34:55,474 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 52 states have internal predecessors, (75), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 21:34:55,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 21:34:55,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:34:55,484 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:34:55,485 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:34:55,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:34:55,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1054764576, now seen corresponding path program 1 times [2025-03-03 21:34:55,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:34:55,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1739881917] [2025-03-03 21:34:55,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:34:55,498 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 21:34:55,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:34:55,500 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 21:34:55,502 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 21:34:55,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 21:34:55,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 21:34:55,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:34:55,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:34:55,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:34:55,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:34:55,864 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2025-03-03 21:34:55,864 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:34:55,864 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:34:55,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1739881917] [2025-03-03 21:34:55,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1739881917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:34:55,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:34:55,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 21:34:55,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570912488] [2025-03-03 21:34:55,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:34:55,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:34:55,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:34:55,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:34:55,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:34:55,885 INFO L87 Difference]: Start difference. First operand has 74 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 52 states have internal predecessors, (75), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 21:34:55,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:34:55,902 INFO L93 Difference]: Finished difference Result 142 states and 245 transitions. [2025-03-03 21:34:55,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:34:55,903 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 137 [2025-03-03 21:34:55,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:34:55,907 INFO L225 Difference]: With dead ends: 142 [2025-03-03 21:34:55,907 INFO L226 Difference]: Without dead ends: 71 [2025-03-03 21:34:55,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 136 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 21:34:55,910 INFO L435 NwaCegarLoop]: 107 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, 107 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 21:34:55,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:34:55,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-03 21:34:55,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-03 21:34:55,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 49 states have internal predecessors, (67), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 21:34:55,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 107 transitions. [2025-03-03 21:34:55,938 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 107 transitions. Word has length 137 [2025-03-03 21:34:55,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:34:55,939 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 107 transitions. [2025-03-03 21:34:55,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 21:34:55,939 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 107 transitions. [2025-03-03 21:34:55,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-03 21:34:55,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:34:55,942 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:34:55,953 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 21:34:56,142 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 21:34:56,143 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:34:56,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:34:56,143 INFO L85 PathProgramCache]: Analyzing trace with hash 647573002, now seen corresponding path program 1 times [2025-03-03 21:34:56,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:34:56,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2075701743] [2025-03-03 21:34:56,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:34:56,145 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 21:34:56,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:34:56,147 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 21:34:56,148 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 21:34:56,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-03 21:34:56,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-03 21:34:56,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:34:56,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:34:56,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 21:34:56,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:34:57,732 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 19 proven. 57 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-03 21:34:57,732 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:34:58,921 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 21:34:58,921 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:34:58,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2075701743] [2025-03-03 21:34:58,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2075701743] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 21:34:58,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:34:58,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-03 21:34:58,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387007669] [2025-03-03 21:34:58,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:34:58,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:34:58,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:34:58,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:34:58,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-03 21:34:58,923 INFO L87 Difference]: Start difference. First operand 71 states and 107 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 21:35:03,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:35:06,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:35:10,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:35:10,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:35:10,456 INFO L93 Difference]: Finished difference Result 229 states and 346 transitions. [2025-03-03 21:35:10,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:35:10,458 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 138 [2025-03-03 21:35:10,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:35:10,460 INFO L225 Difference]: With dead ends: 229 [2025-03-03 21:35:10,460 INFO L226 Difference]: Without dead ends: 161 [2025-03-03 21:35:10,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-03 21:35:10,461 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 174 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 23 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2025-03-03 21:35:10,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 197 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 43 Invalid, 1 Unknown, 0 Unchecked, 11.5s Time] [2025-03-03 21:35:10,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-03 21:35:10,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 143. [2025-03-03 21:35:10,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 100 states have (on average 1.39) internal successors, (139), 100 states have internal predecessors, (139), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 21:35:10,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 219 transitions. [2025-03-03 21:35:10,482 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 219 transitions. Word has length 138 [2025-03-03 21:35:10,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:35:10,482 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 219 transitions. [2025-03-03 21:35:10,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 21:35:10,483 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 219 transitions. [2025-03-03 21:35:10,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-03 21:35:10,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:35:10,484 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:35:10,498 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 21:35:10,685 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 21:35:10,685 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:35:10,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:35:10,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1222220512, now seen corresponding path program 1 times [2025-03-03 21:35:10,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:35:10,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1218198004] [2025-03-03 21:35:10,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:35:10,686 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 21:35:10,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:35:10,688 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 21:35:10,690 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 21:35:10,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 21:35:11,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 21:35:11,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:35:11,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:35:11,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 21:35:11,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:35:12,638 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 21:35:12,638 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:35:12,638 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:35:12,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1218198004] [2025-03-03 21:35:12,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1218198004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:35:12,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:35:12,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:35:12,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697980647] [2025-03-03 21:35:12,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:35:12,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:35:12,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:35:12,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:35:12,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:35:12,640 INFO L87 Difference]: Start difference. First operand 143 states and 219 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:35:15,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.52s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:35:18,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.91s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:35:18,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:35:18,730 INFO L93 Difference]: Finished difference Result 359 states and 548 transitions. [2025-03-03 21:35:18,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:35:18,731 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 139 [2025-03-03 21:35:18,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:35:18,733 INFO L225 Difference]: With dead ends: 359 [2025-03-03 21:35:18,733 INFO L226 Difference]: Without dead ends: 219 [2025-03-03 21:35:18,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:35:18,734 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 83 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:35:18,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 346 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2025-03-03 21:35:18,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-03 21:35:18,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 193. [2025-03-03 21:35:18,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 129 states have (on average 1.3565891472868217) internal successors, (175), 129 states have internal predecessors, (175), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-03 21:35:18,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 295 transitions. [2025-03-03 21:35:18,765 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 295 transitions. Word has length 139 [2025-03-03 21:35:18,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:35:18,765 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 295 transitions. [2025-03-03 21:35:18,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:35:18,766 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 295 transitions. [2025-03-03 21:35:18,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 21:35:18,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:35:18,770 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:35:18,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-03 21:35:18,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:35:18,970 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:35:18,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:35:18,971 INFO L85 PathProgramCache]: Analyzing trace with hash 2110537513, now seen corresponding path program 1 times [2025-03-03 21:35:18,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:35:18,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [465291374] [2025-03-03 21:35:18,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:35:18,971 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 21:35:18,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:35:18,974 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 21:35:18,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-03 21:35:19,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 21:35:19,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 21:35:19,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:35:19,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:35:19,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 21:35:19,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:35:20,584 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 410 proven. 48 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2025-03-03 21:35:20,585 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:35:21,189 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:35:21,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [465291374] [2025-03-03 21:35:21,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [465291374] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:35:21,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1249370600] [2025-03-03 21:35:21,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:35:21,189 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 21:35:21,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 21:35:21,191 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 21:35:21,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-03-03 21:35:21,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 21:35:21,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 21:35:21,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:35:21,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:35:21,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 21:35:21,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:35:21,608 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 21:35:21,608 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:35:21,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1249370600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:35:21,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:35:21,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2025-03-03 21:35:21,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183632832] [2025-03-03 21:35:21,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:35:21,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:35:21,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:35:21,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:35:21,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2025-03-03 21:35:21,610 INFO L87 Difference]: Start difference. First operand 193 states and 295 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:35:24,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:35:24,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:35:24,143 INFO L93 Difference]: Finished difference Result 433 states and 660 transitions. [2025-03-03 21:35:24,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:35:24,143 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2025-03-03 21:35:24,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:35:24,146 INFO L225 Difference]: With dead ends: 433 [2025-03-03 21:35:24,146 INFO L226 Difference]: Without dead ends: 293 [2025-03-03 21:35:24,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 339 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2025-03-03 21:35:24,150 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 53 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 21:35:24,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 243 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 21:35:24,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-03-03 21:35:24,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 289. [2025-03-03 21:35:24,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 211 states have (on average 1.3838862559241707) internal successors, (292), 213 states have internal predecessors, (292), 72 states have call successors, (72), 5 states have call predecessors, (72), 5 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 21:35:24,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 436 transitions. [2025-03-03 21:35:24,180 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 436 transitions. Word has length 140 [2025-03-03 21:35:24,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:35:24,181 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 436 transitions. [2025-03-03 21:35:24,181 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:35:24,181 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 436 transitions. [2025-03-03 21:35:24,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 21:35:24,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:35:24,184 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:35:24,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-03 21:35:24,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2025-03-03 21:35:24,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-03 21:35:24,585 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:35:24,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:35:24,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1817134506, now seen corresponding path program 1 times [2025-03-03 21:35:24,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:35:24,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1080026929] [2025-03-03 21:35:24,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:35:24,586 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 21:35:24,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:35:24,588 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 21:35:24,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-03 21:35:24,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 21:35:24,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 21:35:24,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:35:24,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:35:24,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 21:35:24,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:35:25,833 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 410 proven. 48 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2025-03-03 21:35:25,833 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:35:26,381 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:35:26,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1080026929] [2025-03-03 21:35:26,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1080026929] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:35:26,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1319625788] [2025-03-03 21:35:26,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:35:26,382 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 21:35:26,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 21:35:26,384 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 21:35:26,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2025-03-03 21:35:26,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 21:35:27,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 21:35:27,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:35:27,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:35:27,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 21:35:27,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:35:29,712 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 21:35:29,712 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:35:29,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1319625788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:35:29,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:35:29,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 16 [2025-03-03 21:35:29,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382768059] [2025-03-03 21:35:29,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:35:29,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 21:35:29,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:35:29,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 21:35:29,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2025-03-03 21:35:29,714 INFO L87 Difference]: Start difference. First operand 289 states and 436 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:35:35,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.99s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 21:35:38,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 21:35:42,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:35:47,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 21:35:48,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 21:35:53,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 21:35:54,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 21:35:56,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:35:56,067 INFO L93 Difference]: Finished difference Result 862 states and 1256 transitions. [2025-03-03 21:35:56,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 21:35:56,069 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2025-03-03 21:35:56,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:35:56,073 INFO L225 Difference]: With dead ends: 862 [2025-03-03 21:35:56,073 INFO L226 Difference]: Without dead ends: 636 [2025-03-03 21:35:56,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 333 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=185, Invalid=807, Unknown=0, NotChecked=0, Total=992 [2025-03-03 21:35:56,075 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 351 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 115 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:35:56,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 593 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 557 Invalid, 2 Unknown, 0 Unchecked, 25.0s Time] [2025-03-03 21:35:56,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2025-03-03 21:35:56,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 446. [2025-03-03 21:35:56,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 317 states have (on average 1.3406940063091484) internal successors, (425), 323 states have internal predecessors, (425), 118 states have call successors, (118), 10 states have call predecessors, (118), 10 states have return successors, (118), 112 states have call predecessors, (118), 118 states have call successors, (118) [2025-03-03 21:35:56,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 661 transitions. [2025-03-03 21:35:56,126 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 661 transitions. Word has length 140 [2025-03-03 21:35:56,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:35:56,126 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 661 transitions. [2025-03-03 21:35:56,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:35:56,127 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 661 transitions. [2025-03-03 21:35:56,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 21:35:56,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:35:56,128 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:35:56,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-03 21:35:56,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2025-03-03 21:35:56,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-03 21:35:56,529 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:35:56,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:35:56,529 INFO L85 PathProgramCache]: Analyzing trace with hash 20183147, now seen corresponding path program 1 times [2025-03-03 21:35:56,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:35:56,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [286390304] [2025-03-03 21:35:56,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:35:56,530 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 21:35:56,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:35:56,533 INFO L229 MonitoredProcess]: Starting monitored process 9 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 21:35:56,534 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 (9)] Waiting until timeout for monitored process [2025-03-03 21:35:56,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 21:35:56,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 21:35:56,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:35:56,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:35:56,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 21:35:56,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:35:58,186 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 410 proven. 48 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2025-03-03 21:35:58,187 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:35:58,921 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:35:58,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [286390304] [2025-03-03 21:35:58,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [286390304] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:35:58,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1123315151] [2025-03-03 21:35:58,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:35:58,921 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 21:35:58,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 21:35:58,923 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 21:35:58,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2025-03-03 21:35:58,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 21:35:59,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 21:35:59,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:35:59,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:35:59,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 21:35:59,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:36:00,628 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 399 proven. 27 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2025-03-03 21:36:00,628 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:36:00,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1123315151] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:36:00,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 21:36:00,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 9 [2025-03-03 21:36:00,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492388802] [2025-03-03 21:36:00,899 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 21:36:00,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 21:36:00,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:36:00,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 21:36:00,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2025-03-03 21:36:00,900 INFO L87 Difference]: Start difference. First operand 446 states and 661 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 3 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2025-03-03 21:36:04,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:36:08,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.61s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:36:10,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:36:10,251 INFO L93 Difference]: Finished difference Result 883 states and 1301 transitions. [2025-03-03 21:36:10,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 21:36:10,252 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 3 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) Word has length 140 [2025-03-03 21:36:10,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:36:10,255 INFO L225 Difference]: With dead ends: 883 [2025-03-03 21:36:10,255 INFO L226 Difference]: Without dead ends: 494 [2025-03-03 21:36:10,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 414 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=240, Invalid=462, Unknown=0, NotChecked=0, Total=702 [2025-03-03 21:36:10,257 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 145 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2025-03-03 21:36:10,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 718 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 8.8s Time] [2025-03-03 21:36:10,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2025-03-03 21:36:10,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 451. [2025-03-03 21:36:10,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 320 states have (on average 1.33125) internal successors, (426), 326 states have internal predecessors, (426), 118 states have call successors, (118), 12 states have call predecessors, (118), 12 states have return successors, (118), 112 states have call predecessors, (118), 118 states have call successors, (118) [2025-03-03 21:36:10,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 662 transitions. [2025-03-03 21:36:10,293 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 662 transitions. Word has length 140 [2025-03-03 21:36:10,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:36:10,293 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 662 transitions. [2025-03-03 21:36:10,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 3 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2025-03-03 21:36:10,294 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 662 transitions. [2025-03-03 21:36:10,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-03 21:36:10,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:36:10,295 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:36:10,310 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 (9)] Ended with exit code 0 [2025-03-03 21:36:10,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0