./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-71.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-71.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 6d3b9aeb878380bdc771becb29ac1261e3f51b87c750ca0ae0ce079e64216b40 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:24:36,773 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:24:36,831 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 14:24:36,837 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:24:36,838 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:24:36,859 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:24:36,860 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:24:36,860 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:24:36,860 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:24:36,861 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:24:36,861 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:24:36,862 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:24:36,862 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:24:36,862 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:24:36,862 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:24:36,862 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:24:36,862 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:24:36,862 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:24:36,862 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 14:24:36,863 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:24:36,863 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:24:36,863 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:24:36,863 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:24:36,863 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:24:36,863 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:24:36,863 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:24:36,863 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:24:36,863 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:24:36,863 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:24:36,863 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:24:36,863 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:24:36,863 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:24:36,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:24:36,864 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:24:36,864 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:24:36,864 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:24:36,864 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:24:36,864 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 14:24:36,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 14:24:36,865 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:24:36,865 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:24:36,865 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:24:36,865 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:24:36,865 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 -> 6d3b9aeb878380bdc771becb29ac1261e3f51b87c750ca0ae0ce079e64216b40 [2025-03-08 14:24:37,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:24:37,099 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:24:37,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:24:37,102 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:24:37,102 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:24:37,104 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-71.i [2025-03-08 14:24:38,231 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/304530b4f/7825d95a0fbe47c98b7a4dc29b8c32da/FLAGad13f1a81 [2025-03-08 14:24:38,443 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:24:38,447 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-71.i [2025-03-08 14:24:38,456 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/304530b4f/7825d95a0fbe47c98b7a4dc29b8c32da/FLAGad13f1a81 [2025-03-08 14:24:38,790 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/304530b4f/7825d95a0fbe47c98b7a4dc29b8c32da [2025-03-08 14:24:38,792 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:24:38,793 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:24:38,794 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:24:38,794 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:24:38,797 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:24:38,797 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:24:38" (1/1) ... [2025-03-08 14:24:38,798 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65f93a33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:38, skipping insertion in model container [2025-03-08 14:24:38,798 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:24:38" (1/1) ... [2025-03-08 14:24:38,813 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:24:38,914 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-71.i[915,928] [2025-03-08 14:24:38,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:24:38,968 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:24:38,976 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-71.i[915,928] [2025-03-08 14:24:39,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:24:39,017 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:24:39,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:39 WrapperNode [2025-03-08 14:24:39,018 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:24:39,019 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:24:39,019 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:24:39,019 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:24:39,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:39" (1/1) ... [2025-03-08 14:24:39,029 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:39" (1/1) ... [2025-03-08 14:24:39,062 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 127 [2025-03-08 14:24:39,065 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:24:39,065 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:24:39,065 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:24:39,065 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:24:39,071 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:39" (1/1) ... [2025-03-08 14:24:39,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:39" (1/1) ... [2025-03-08 14:24:39,074 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:39" (1/1) ... [2025-03-08 14:24:39,095 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 14:24:39,095 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:39" (1/1) ... [2025-03-08 14:24:39,098 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:39" (1/1) ... [2025-03-08 14:24:39,107 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:39" (1/1) ... [2025-03-08 14:24:39,108 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:39" (1/1) ... [2025-03-08 14:24:39,109 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:39" (1/1) ... [2025-03-08 14:24:39,109 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:39" (1/1) ... [2025-03-08 14:24:39,111 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:24:39,112 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:24:39,112 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:24:39,112 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:24:39,112 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:39" (1/1) ... [2025-03-08 14:24:39,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:24:39,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:24:39,145 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 14:24:39,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 14:24:39,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:24:39,165 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:24:39,165 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:24:39,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 14:24:39,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:24:39,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:24:39,221 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:24:39,223 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:24:39,445 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L95: havoc property_#t~bitwise14#1;havoc property_#t~short15#1; [2025-03-08 14:24:39,469 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-08 14:24:39,472 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:24:39,484 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:24:39,486 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:24:39,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:24:39 BoogieIcfgContainer [2025-03-08 14:24:39,486 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:24:39,488 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:24:39,488 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:24:39,491 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:24:39,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:24:38" (1/3) ... [2025-03-08 14:24:39,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62af209e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:24:39, skipping insertion in model container [2025-03-08 14:24:39,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:39" (2/3) ... [2025-03-08 14:24:39,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62af209e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:24:39, skipping insertion in model container [2025-03-08 14:24:39,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:24:39" (3/3) ... [2025-03-08 14:24:39,494 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-71.i [2025-03-08 14:24:39,505 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:24:39,506 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-71.i that has 2 procedures, 55 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:24:39,547 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:24:39,556 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;@3ae3aa72, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:24:39,557 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:24:39,560 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 38 states have internal predecessors, (49), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 14:24:39,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 14:24:39,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:24:39,568 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:24:39,568 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:24:39,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:24:39,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1267902943, now seen corresponding path program 1 times [2025-03-08 14:24:39,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:24:39,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122446658] [2025-03-08 14:24:39,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:24:39,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:24:39,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 14:24:39,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 14:24:39,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:24:39,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:24:39,763 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-08 14:24:39,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:24:39,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122446658] [2025-03-08 14:24:39,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122446658] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:24:39,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493082689] [2025-03-08 14:24:39,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:24:39,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:24:39,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:24:39,768 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:24:39,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 14:24:39,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 14:24:39,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 14:24:39,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:24:39,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:24:39,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:24:39,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:24:39,901 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-08 14:24:39,902 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:24:39,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493082689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:24:39,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:24:39,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 14:24:39,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984242530] [2025-03-08 14:24:39,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:24:39,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:24:39,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:24:39,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:24:39,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:24:39,923 INFO L87 Difference]: Start difference. First operand has 55 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 38 states have internal predecessors, (49), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 14:24:39,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:24:39,947 INFO L93 Difference]: Finished difference Result 107 states and 170 transitions. [2025-03-08 14:24:39,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:24:39,950 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 99 [2025-03-08 14:24:39,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:24:39,955 INFO L225 Difference]: With dead ends: 107 [2025-03-08 14:24:39,955 INFO L226 Difference]: Without dead ends: 52 [2025-03-08 14:24:39,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:24:39,960 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:24:39,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:24:39,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-08 14:24:39,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-08 14:24:39,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 35 states have internal predecessors, (44), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 14:24:40,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 74 transitions. [2025-03-08 14:24:40,002 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 74 transitions. Word has length 99 [2025-03-08 14:24:40,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:24:40,002 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 74 transitions. [2025-03-08 14:24:40,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 14:24:40,003 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 74 transitions. [2025-03-08 14:24:40,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 14:24:40,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:24:40,005 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:24:40,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 14:24:40,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 14:24:40,210 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:24:40,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:24:40,211 INFO L85 PathProgramCache]: Analyzing trace with hash 2086253886, now seen corresponding path program 1 times [2025-03-08 14:24:40,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:24:40,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484597163] [2025-03-08 14:24:40,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:24:40,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:24:40,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 14:24:40,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 14:24:40,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:24:40,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:24:40,590 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 14:24:40,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:24:40,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484597163] [2025-03-08 14:24:40,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484597163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:24:40,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:24:40,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 14:24:40,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125552290] [2025-03-08 14:24:40,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:24:40,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 14:24:40,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:24:40,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 14:24:40,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 14:24:40,592 INFO L87 Difference]: Start difference. First operand 52 states and 74 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 14:24:40,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:24:40,669 INFO L93 Difference]: Finished difference Result 106 states and 150 transitions. [2025-03-08 14:24:40,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 14:24:40,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2025-03-08 14:24:40,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:24:40,671 INFO L225 Difference]: With dead ends: 106 [2025-03-08 14:24:40,672 INFO L226 Difference]: Without dead ends: 57 [2025-03-08 14:24:40,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 14:24:40,674 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 32 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 14:24:40,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 147 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 14:24:40,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-08 14:24:40,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-08 14:24:40,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 14:24:40,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 78 transitions. [2025-03-08 14:24:40,689 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 78 transitions. Word has length 99 [2025-03-08 14:24:40,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:24:40,690 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 78 transitions. [2025-03-08 14:24:40,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 14:24:40,690 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 78 transitions. [2025-03-08 14:24:40,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 14:24:40,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:24:40,694 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:24:40,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 14:24:40,695 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:24:40,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:24:40,695 INFO L85 PathProgramCache]: Analyzing trace with hash -570760498, now seen corresponding path program 1 times [2025-03-08 14:24:40,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:24:40,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491334859] [2025-03-08 14:24:40,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:24:40,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:24:40,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 14:24:40,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 14:24:40,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:24:40,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:24:41,253 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 14:24:41,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:24:41,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491334859] [2025-03-08 14:24:41,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491334859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:24:41,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:24:41,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 14:24:41,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403862311] [2025-03-08 14:24:41,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:24:41,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 14:24:41,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:24:41,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 14:24:41,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 14:24:41,257 INFO L87 Difference]: Start difference. First operand 57 states and 78 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 14:24:41,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:24:41,408 INFO L93 Difference]: Finished difference Result 130 states and 177 transitions. [2025-03-08 14:24:41,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 14:24:41,410 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 100 [2025-03-08 14:24:41,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:24:41,411 INFO L225 Difference]: With dead ends: 130 [2025-03-08 14:24:41,411 INFO L226 Difference]: Without dead ends: 76 [2025-03-08 14:24:41,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 14:24:41,412 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 17 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 14:24:41,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 182 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 14:24:41,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-08 14:24:41,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2025-03-08 14:24:41,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 47 states have internal predecessors, (59), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 14:24:41,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 89 transitions. [2025-03-08 14:24:41,423 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 89 transitions. Word has length 100 [2025-03-08 14:24:41,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:24:41,423 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 89 transitions. [2025-03-08 14:24:41,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 14:24:41,423 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 89 transitions. [2025-03-08 14:24:41,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 14:24:41,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:24:41,428 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:24:41,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 14:24:41,428 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:24:41,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:24:41,428 INFO L85 PathProgramCache]: Analyzing trace with hash 840118454, now seen corresponding path program 1 times [2025-03-08 14:24:41,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:24:41,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085070162] [2025-03-08 14:24:41,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:24:41,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:24:41,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 14:24:41,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 14:24:41,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:24:41,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:24:41,772 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 14:24:41,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:24:41,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085070162] [2025-03-08 14:24:41,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085070162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:24:41,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:24:41,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 14:24:41,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956769335] [2025-03-08 14:24:41,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:24:41,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 14:24:41,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:24:41,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 14:24:41,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 14:24:41,774 INFO L87 Difference]: Start difference. First operand 65 states and 89 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 14:24:41,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:24:41,864 INFO L93 Difference]: Finished difference Result 157 states and 211 transitions. [2025-03-08 14:24:41,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 14:24:41,865 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2025-03-08 14:24:41,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:24:41,866 INFO L225 Difference]: With dead ends: 157 [2025-03-08 14:24:41,866 INFO L226 Difference]: Without dead ends: 95 [2025-03-08 14:24:41,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-08 14:24:41,867 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 43 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 14:24:41,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 280 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 14:24:41,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-08 14:24:41,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 65. [2025-03-08 14:24:41,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 47 states have internal predecessors, (59), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 14:24:41,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 89 transitions. [2025-03-08 14:24:41,879 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 89 transitions. Word has length 101 [2025-03-08 14:24:41,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:24:41,879 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 89 transitions. [2025-03-08 14:24:41,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 14:24:41,880 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 89 transitions. [2025-03-08 14:24:41,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 14:24:41,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:24:41,882 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:24:41,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 14:24:41,882 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:24:41,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:24:41,883 INFO L85 PathProgramCache]: Analyzing trace with hash 2070592146, now seen corresponding path program 1 times [2025-03-08 14:24:41,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:24:41,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407414670] [2025-03-08 14:24:41,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:24:41,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:24:41,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 14:24:41,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 14:24:41,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:24:41,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:24:41,934 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 14:24:41,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:24:41,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407414670] [2025-03-08 14:24:41,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407414670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:24:41,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:24:41,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 14:24:41,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436791072] [2025-03-08 14:24:41,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:24:41,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 14:24:41,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:24:41,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 14:24:41,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:24:41,936 INFO L87 Difference]: Start difference. First operand 65 states and 89 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 14:24:41,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:24:41,973 INFO L93 Difference]: Finished difference Result 161 states and 218 transitions. [2025-03-08 14:24:41,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 14:24:41,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2025-03-08 14:24:41,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:24:41,975 INFO L225 Difference]: With dead ends: 161 [2025-03-08 14:24:41,975 INFO L226 Difference]: Without dead ends: 99 [2025-03-08 14:24:41,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:24:41,976 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 46 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:24:41,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 170 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:24:41,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-08 14:24:41,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2025-03-08 14:24:41,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 66 states have (on average 1.196969696969697) internal successors, (79), 67 states have internal predecessors, (79), 25 states have call successors, (25), 4 states have call predecessors, (25), 4 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 14:24:41,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 129 transitions. [2025-03-08 14:24:41,997 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 129 transitions. Word has length 102 [2025-03-08 14:24:41,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:24:41,997 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 129 transitions. [2025-03-08 14:24:41,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 14:24:41,997 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 129 transitions. [2025-03-08 14:24:41,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 14:24:41,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:24:41,998 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:24:41,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 14:24:41,998 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:24:41,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:24:41,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1336871469, now seen corresponding path program 1 times [2025-03-08 14:24:41,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:24:41,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432706225] [2025-03-08 14:24:41,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:24:41,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:24:42,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 14:24:42,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 14:24:42,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:24:42,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:24:42,525 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 14:24:42,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:24:42,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432706225] [2025-03-08 14:24:42,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432706225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:24:42,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:24:42,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 14:24:42,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677655815] [2025-03-08 14:24:42,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:24:42,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 14:24:42,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:24:42,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 14:24:42,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 14:24:42,527 INFO L87 Difference]: Start difference. First operand 96 states and 129 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 14:24:42,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:24:42,681 INFO L93 Difference]: Finished difference Result 210 states and 279 transitions. [2025-03-08 14:24:42,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 14:24:42,681 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2025-03-08 14:24:42,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:24:42,683 INFO L225 Difference]: With dead ends: 210 [2025-03-08 14:24:42,683 INFO L226 Difference]: Without dead ends: 117 [2025-03-08 14:24:42,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 14:24:42,684 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 77 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 14:24:42,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 384 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 14:24:42,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-08 14:24:42,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 96. [2025-03-08 14:24:42,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 66 states have (on average 1.1818181818181819) internal successors, (78), 67 states have internal predecessors, (78), 25 states have call successors, (25), 4 states have call predecessors, (25), 4 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 14:24:42,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 128 transitions. [2025-03-08 14:24:42,696 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 128 transitions. Word has length 102 [2025-03-08 14:24:42,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:24:42,697 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 128 transitions. [2025-03-08 14:24:42,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 14:24:42,697 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 128 transitions. [2025-03-08 14:24:42,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 14:24:42,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:24:42,699 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:24:42,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 14:24:42,699 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:24:42,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:24:42,700 INFO L85 PathProgramCache]: Analyzing trace with hash 428576076, now seen corresponding path program 1 times [2025-03-08 14:24:42,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:24:42,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222836644] [2025-03-08 14:24:42,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:24:42,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:24:42,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 14:24:42,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 14:24:42,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:24:42,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:24:42,728 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 14:24:42,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 14:24:42,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 14:24:42,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:24:42,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:24:42,773 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 14:24:42,773 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 14:24:42,774 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 14:24:42,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 14:24:42,777 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:24:42,832 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 14:24:42,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:24:42 BoogieIcfgContainer [2025-03-08 14:24:42,834 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 14:24:42,835 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 14:24:42,835 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 14:24:42,835 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 14:24:42,836 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:24:39" (3/4) ... [2025-03-08 14:24:42,837 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 14:24:42,838 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 14:24:42,838 INFO L158 Benchmark]: Toolchain (without parser) took 4045.49ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 111.5MB in the beginning and 129.4MB in the end (delta: -17.9MB). Peak memory consumption was 128.5MB. Max. memory is 16.1GB. [2025-03-08 14:24:42,838 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:24:42,839 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.48ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 98.6MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:24:42,839 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.08ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 95.2MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:24:42,839 INFO L158 Benchmark]: Boogie Preprocessor took 45.85ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 92.9MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:24:42,839 INFO L158 Benchmark]: IcfgBuilder took 374.53ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 73.9MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 14:24:42,839 INFO L158 Benchmark]: TraceAbstraction took 3346.37ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 73.4MB in the beginning and 129.5MB in the end (delta: -56.1MB). Peak memory consumption was 86.5MB. Max. memory is 16.1GB. [2025-03-08 14:24:42,840 INFO L158 Benchmark]: Witness Printer took 2.85ms. Allocated memory is still 285.2MB. Free memory was 129.5MB in the beginning and 129.4MB in the end (delta: 87.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:24:42,840 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 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 224.48ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 98.6MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.08ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 95.2MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.85ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 92.9MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 374.53ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 73.9MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3346.37ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 73.4MB in the beginning and 129.5MB in the end (delta: -56.1MB). Peak memory consumption was 86.5MB. Max. memory is 16.1GB. * Witness Printer took 2.85ms. Allocated memory is still 285.2MB. Free memory was 129.5MB in the beginning and 129.4MB in the end (delta: 87.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 95, overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 88, overapproximation of someBinaryFLOATComparisonOperation at line 86, overapproximation of someBinaryArithmeticFLOAToperation at line 58. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 16; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 8; [L25] unsigned char var_1_4 = 8; [L26] unsigned char var_1_5 = 32; [L27] unsigned char var_1_6 = 0; [L28] unsigned char var_1_7 = 1; [L29] float var_1_8 = 1.8; [L30] float var_1_9 = 9999999999999.75; [L31] float var_1_10 = 8.75; [L32] float var_1_11 = 255.75; [L33] unsigned short int var_1_12 = 10; [L34] unsigned char var_1_13 = 2; [L35] unsigned short int var_1_14 = 4; VAL [isInitial=0, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=0, var_1_3=8, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L99] isInitial = 1 [L100] FCALL initially() [L101] int k_loop; [L102] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=0, var_1_3=8, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L102] COND TRUE k_loop < 1 [L103] FCALL updateLastVariables() [L104] CALL updateVariables() [L67] var_1_2 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_3=8, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_3=8, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L68] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_3=8, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L69] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=8, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=8, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L69] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=8, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L70] var_1_3 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L71] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L72] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L72] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L73] var_1_4 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L74] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L75] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=51, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=51, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L75] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=51, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L76] var_1_5 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=51, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=51, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L77] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=51, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L78] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=51, var_1_5=254, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=51, var_1_5=254, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L78] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=51, var_1_5=254, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L79] var_1_6 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=51, var_1_5=254, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=51, var_1_5=254, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L80] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=51, var_1_5=254, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L81] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=51, var_1_5=254, var_1_6=-255, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=51, var_1_5=254, var_1_6=-255, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L81] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=51, var_1_5=254, var_1_6=-255, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L82] var_1_7 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=51, var_1_5=254, var_1_6=-255, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=51, var_1_5=254, var_1_6=-255, var_1_8=9/5, var_1_9=39999999999999/4] [L83] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=51, var_1_5=254, var_1_6=-255, var_1_8=9/5, var_1_9=39999999999999/4] [L84] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=51, var_1_5=254, var_1_6=-255, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=51, var_1_5=254, var_1_6=-255, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L84] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=51, var_1_5=254, var_1_6=-255, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L85] var_1_9 = __VERIFIER_nondet_float() [L86] CALL assume_abort_if_not((var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=51, var_1_5=254, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=51, var_1_5=254, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L86] RET assume_abort_if_not((var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=51, var_1_5=254, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L87] var_1_10 = __VERIFIER_nondet_float() [L88] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=51, var_1_5=254, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=51, var_1_5=254, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L88] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=51, var_1_5=254, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L89] var_1_11 = __VERIFIER_nondet_float() [L90] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=51, var_1_5=254, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=51, var_1_5=254, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L90] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=51, var_1_5=254, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L104] RET updateVariables() [L105] CALL step() [L39] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, stepLocal_0=-255, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=51, var_1_5=254, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L40] COND TRUE \read(var_1_2) [L41] var_1_1 = (((((((((var_1_3 + var_1_4)) > (50)) ? ((var_1_3 + var_1_4)) : (50)))) > (var_1_5)) ? ((((((var_1_3 + var_1_4)) > (50)) ? ((var_1_3 + var_1_4)) : (50)))) : (var_1_5))) VAL [isInitial=1, stepLocal_0=-255, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=254, var_1_2=1, var_1_3=0, var_1_4=51, var_1_5=254, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L53] var_1_12 = 100 [L54] var_1_13 = var_1_3 [L55] var_1_14 = var_1_3 VAL [isInitial=1, stepLocal_0=-255, var_1_12=100, var_1_13=0, var_1_14=0, var_1_1=254, var_1_2=1, var_1_3=0, var_1_4=51, var_1_5=254, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L56] EXPR var_1_13 >> var_1_3 VAL [isInitial=1, stepLocal_0=-255, var_1_12=100, var_1_13=0, var_1_14=0, var_1_1=254, var_1_2=1, var_1_3=0, var_1_4=51, var_1_5=254, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L56] COND TRUE (var_1_13 >> var_1_3) <= var_1_5 [L57] COND TRUE (25 > var_1_13) && var_1_7 [L58] var_1_8 = (var_1_9 + ((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11)))) VAL [isInitial=1, stepLocal_0=-255, var_1_12=100, var_1_13=0, var_1_14=0, var_1_1=254, var_1_2=1, var_1_3=0, var_1_4=51, var_1_5=254, var_1_6=-255, var_1_7=1] [L105] RET step() [L106] CALL, EXPR property() [L95] EXPR (var_1_2 ? (var_1_1 == ((unsigned char) (((((((((var_1_3 + var_1_4)) > (50)) ? ((var_1_3 + var_1_4)) : (50)))) > (var_1_5)) ? ((((((var_1_3 + var_1_4)) > (50)) ? ((var_1_3 + var_1_4)) : (50)))) : (var_1_5))))) : ((var_1_6 && var_1_7) ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_7 ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_1 == ((unsigned char) var_1_3))))) && (((var_1_13 >> var_1_3) <= var_1_5) ? (((25 > var_1_13) && var_1_7) ? (var_1_8 == ((float) (var_1_9 + ((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11)))))) : (var_1_8 == ((float) var_1_9))) : (var_1_8 == ((float) var_1_9))) VAL [isInitial=1, var_1_12=100, var_1_13=0, var_1_14=0, var_1_1=254, var_1_2=1, var_1_3=0, var_1_4=51, var_1_5=254, var_1_6=-255, var_1_7=1] [L95] EXPR var_1_13 >> var_1_3 VAL [isInitial=1, var_1_12=100, var_1_13=0, var_1_14=0, var_1_1=254, var_1_2=1, var_1_3=0, var_1_4=51, var_1_5=254, var_1_6=-255, var_1_7=1] [L95] EXPR (var_1_2 ? (var_1_1 == ((unsigned char) (((((((((var_1_3 + var_1_4)) > (50)) ? ((var_1_3 + var_1_4)) : (50)))) > (var_1_5)) ? ((((((var_1_3 + var_1_4)) > (50)) ? ((var_1_3 + var_1_4)) : (50)))) : (var_1_5))))) : ((var_1_6 && var_1_7) ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_7 ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_1 == ((unsigned char) var_1_3))))) && (((var_1_13 >> var_1_3) <= var_1_5) ? (((25 > var_1_13) && var_1_7) ? (var_1_8 == ((float) (var_1_9 + ((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11)))))) : (var_1_8 == ((float) var_1_9))) : (var_1_8 == ((float) var_1_9))) VAL [isInitial=1, var_1_12=100, var_1_13=0, var_1_14=0, var_1_1=254, var_1_2=1, var_1_3=0, var_1_4=51, var_1_5=254, var_1_6=-255, var_1_7=1] [L95-L96] return ((((var_1_2 ? (var_1_1 == ((unsigned char) (((((((((var_1_3 + var_1_4)) > (50)) ? ((var_1_3 + var_1_4)) : (50)))) > (var_1_5)) ? ((((((var_1_3 + var_1_4)) > (50)) ? ((var_1_3 + var_1_4)) : (50)))) : (var_1_5))))) : ((var_1_6 && var_1_7) ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_7 ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_1 == ((unsigned char) var_1_3))))) && (((var_1_13 >> var_1_3) <= var_1_5) ? (((25 > var_1_13) && var_1_7) ? (var_1_8 == ((float) (var_1_9 + ((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11)))))) : (var_1_8 == ((float) var_1_9))) : (var_1_8 == ((float) var_1_9)))) && (var_1_12 == ((unsigned short int) 100))) && (var_1_13 == ((unsigned char) var_1_3))) && (var_1_14 == ((unsigned short int) var_1_3)) ; [L106] RET, EXPR property() [L106] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_12=100, var_1_13=0, var_1_14=0, var_1_1=254, var_1_2=1, var_1_3=0, var_1_4=51, var_1_5=254, var_1_6=-255, var_1_7=1] [L19] reach_error() VAL [isInitial=1, var_1_12=100, var_1_13=0, var_1_14=0, var_1_1=254, var_1_2=1, var_1_3=0, var_1_4=51, var_1_5=254, var_1_6=-255, var_1_7=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 94 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 7, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 215 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 215 mSDsluCounter, 1238 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 741 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 304 IncrementalHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 497 mSDtfsCounter, 304 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 137 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=5, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 65 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 804 NumberOfCodeBlocks, 804 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 695 ConstructedInterpolants, 0 QuantifiedInterpolants, 1439 SizeOfPredicates, 0 NumberOfNonLiveVariables, 232 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 2912/2940 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 14:24:42,854 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_loopvsstraightlinecode_25-1loop_file-71.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 6d3b9aeb878380bdc771becb29ac1261e3f51b87c750ca0ae0ce079e64216b40 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:24:44,664 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:24:44,749 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 14:24:44,755 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:24:44,756 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:24:44,777 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:24:44,778 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:24:44,778 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:24:44,778 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:24:44,778 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:24:44,779 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:24:44,779 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:24:44,779 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:24:44,779 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:24:44,779 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:24:44,779 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:24:44,779 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:24:44,779 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:24:44,779 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:24:44,779 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:24:44,779 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:24:44,779 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:24:44,780 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:24:44,780 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 14:24:44,780 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 14:24:44,780 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 14:24:44,780 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:24:44,780 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:24:44,780 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:24:44,780 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:24:44,780 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:24:44,780 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:24:44,780 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:24:44,780 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:24:44,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:24:44,780 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:24:44,780 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:24:44,780 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:24:44,780 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:24:44,780 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 14:24:44,780 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 14:24:44,780 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:24:44,780 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:24:44,781 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:24:44,781 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:24:44,781 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 -> 6d3b9aeb878380bdc771becb29ac1261e3f51b87c750ca0ae0ce079e64216b40 [2025-03-08 14:24:45,022 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:24:45,030 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:24:45,031 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:24:45,032 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:24:45,032 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:24:45,033 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-71.i [2025-03-08 14:24:46,206 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11538517b/e1e6093d8a974162ae66ac612968582d/FLAGd6180483f [2025-03-08 14:24:46,388 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:24:46,388 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-71.i [2025-03-08 14:24:46,394 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11538517b/e1e6093d8a974162ae66ac612968582d/FLAGd6180483f [2025-03-08 14:24:46,406 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11538517b/e1e6093d8a974162ae66ac612968582d [2025-03-08 14:24:46,408 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:24:46,410 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:24:46,411 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:24:46,411 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:24:46,414 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:24:46,415 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:24:46" (1/1) ... [2025-03-08 14:24:46,415 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27b9fb95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:46, skipping insertion in model container [2025-03-08 14:24:46,415 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:24:46" (1/1) ... [2025-03-08 14:24:46,428 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:24:46,532 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-71.i[915,928] [2025-03-08 14:24:46,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:24:46,592 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:24:46,601 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-71.i[915,928] [2025-03-08 14:24:46,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:24:46,641 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:24:46,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:46 WrapperNode [2025-03-08 14:24:46,643 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:24:46,643 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:24:46,643 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:24:46,644 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:24:46,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:46" (1/1) ... [2025-03-08 14:24:46,656 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:46" (1/1) ... [2025-03-08 14:24:46,675 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2025-03-08 14:24:46,676 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:24:46,676 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:24:46,676 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:24:46,676 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:24:46,682 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:46" (1/1) ... [2025-03-08 14:24:46,683 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:46" (1/1) ... [2025-03-08 14:24:46,691 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:46" (1/1) ... [2025-03-08 14:24:46,699 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 14:24:46,699 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:46" (1/1) ... [2025-03-08 14:24:46,699 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:46" (1/1) ... [2025-03-08 14:24:46,706 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:46" (1/1) ... [2025-03-08 14:24:46,707 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:46" (1/1) ... [2025-03-08 14:24:46,708 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:46" (1/1) ... [2025-03-08 14:24:46,709 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:46" (1/1) ... [2025-03-08 14:24:46,710 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:24:46,711 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:24:46,711 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:24:46,711 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:24:46,712 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:46" (1/1) ... [2025-03-08 14:24:46,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:24:46,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:24:46,735 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 14:24:46,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 14:24:46,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:24:46,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 14:24:46,755 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:24:46,756 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:24:46,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:24:46,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:24:46,811 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:24:46,812 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:24:47,084 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-08 14:24:47,085 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:24:47,092 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:24:47,092 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:24:47,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:24:47 BoogieIcfgContainer [2025-03-08 14:24:47,092 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:24:47,094 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:24:47,094 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:24:47,098 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:24:47,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:24:46" (1/3) ... [2025-03-08 14:24:47,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13a2f7c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:24:47, skipping insertion in model container [2025-03-08 14:24:47,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:46" (2/3) ... [2025-03-08 14:24:47,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13a2f7c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:24:47, skipping insertion in model container [2025-03-08 14:24:47,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:24:47" (3/3) ... [2025-03-08 14:24:47,101 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-71.i [2025-03-08 14:24:47,111 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:24:47,112 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-71.i that has 2 procedures, 48 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:24:47,152 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:24:47,161 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;@6e6984bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:24:47,161 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:24:47,165 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 14:24:47,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 14:24:47,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:24:47,172 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:24:47,172 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:24:47,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:24:47,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1738624977, now seen corresponding path program 1 times [2025-03-08 14:24:47,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:24:47,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2097873445] [2025-03-08 14:24:47,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:24:47,184 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:24:47,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:24:47,186 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:24:47,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 14:24:47,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 14:24:47,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 14:24:47,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:24:47,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:24:47,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:24:47,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:24:47,353 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2025-03-08 14:24:47,353 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:24:47,354 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:24:47,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2097873445] [2025-03-08 14:24:47,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2097873445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:24:47,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:24:47,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 14:24:47,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346275422] [2025-03-08 14:24:47,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:24:47,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:24:47,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:24:47,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:24:47,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:24:47,378 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 14:24:47,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:24:47,397 INFO L93 Difference]: Finished difference Result 93 states and 150 transitions. [2025-03-08 14:24:47,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:24:47,400 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 96 [2025-03-08 14:24:47,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:24:47,404 INFO L225 Difference]: With dead ends: 93 [2025-03-08 14:24:47,404 INFO L226 Difference]: Without dead ends: 45 [2025-03-08 14:24:47,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:24:47,412 INFO L435 NwaCegarLoop]: 67 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, 67 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:24:47,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:24:47,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-08 14:24:47,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-08 14:24:47,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 14:24:47,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 64 transitions. [2025-03-08 14:24:47,464 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 64 transitions. Word has length 96 [2025-03-08 14:24:47,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:24:47,464 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 64 transitions. [2025-03-08 14:24:47,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 14:24:47,464 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 64 transitions. [2025-03-08 14:24:47,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 14:24:47,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:24:47,468 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:24:47,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-08 14:24:47,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:24:47,669 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:24:47,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:24:47,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1251635756, now seen corresponding path program 1 times [2025-03-08 14:24:47,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:24:47,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1494097652] [2025-03-08 14:24:47,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:24:47,671 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:24:47,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:24:47,673 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:24:47,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 14:24:47,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 14:24:47,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 14:24:47,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:24:47,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:24:47,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 14:24:47,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:24:48,692 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 134 proven. 6 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-03-08 14:24:48,692 INFO L312 TraceCheckSpWp]: Computing backward predicates...