./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-2.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_variablewrapping_normal_file-2.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 884d5b26a9a5c3e1f2ddd732744de1f7633395324aa060e9edd0f0bad2da1ac4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:02:40,760 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:02:40,811 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 16:02:40,816 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:02:40,818 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:02:40,837 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:02:40,838 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:02:40,838 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:02:40,839 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:02:40,839 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:02:40,840 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:02:40,840 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:02:40,840 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:02:40,840 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:02:40,840 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:02:40,841 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:02:40,841 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:02:40,841 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:02:40,841 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 16:02:40,841 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:02:40,841 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:02:40,841 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:02:40,841 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:02:40,841 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:02:40,842 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:02:40,842 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:02:40,842 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:02:40,842 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:02:40,842 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:02:40,842 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:02:40,842 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:02:40,842 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:02:40,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:02:40,843 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:02:40,843 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:02:40,843 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:02:40,843 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:02:40,843 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 16:02:40,843 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 16:02:40,843 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:02:40,843 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:02:40,843 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:02:40,843 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:02:40,843 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 -> 884d5b26a9a5c3e1f2ddd732744de1f7633395324aa060e9edd0f0bad2da1ac4 [2025-03-08 16:02:41,038 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:02:41,043 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:02:41,044 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:02:41,045 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:02:41,045 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:02:41,046 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-2.i [2025-03-08 16:02:42,159 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1604d714d/6e43c7b6a692410e86036e0abfa3a2b6/FLAGf3b9286c7 [2025-03-08 16:02:42,405 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:02:42,407 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-2.i [2025-03-08 16:02:42,414 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1604d714d/6e43c7b6a692410e86036e0abfa3a2b6/FLAGf3b9286c7 [2025-03-08 16:02:42,426 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1604d714d/6e43c7b6a692410e86036e0abfa3a2b6 [2025-03-08 16:02:42,430 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:02:42,431 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:02:42,432 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:02:42,433 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:02:42,435 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:02:42,436 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:02:42" (1/1) ... [2025-03-08 16:02:42,436 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c621b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:42, skipping insertion in model container [2025-03-08 16:02:42,437 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:02:42" (1/1) ... [2025-03-08 16:02:42,451 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:02:42,548 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_variablewrapping_normal_file-2.i[912,925] [2025-03-08 16:02:42,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:02:42,607 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:02:42,615 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_variablewrapping_normal_file-2.i[912,925] [2025-03-08 16:02:42,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:02:42,653 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:02:42,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:42 WrapperNode [2025-03-08 16:02:42,655 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:02:42,656 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:02:42,656 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:02:42,656 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:02:42,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:42" (1/1) ... [2025-03-08 16:02:42,668 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:42" (1/1) ... [2025-03-08 16:02:42,690 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2025-03-08 16:02:42,690 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:02:42,690 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:02:42,690 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:02:42,690 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:02:42,696 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:42" (1/1) ... [2025-03-08 16:02:42,696 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:42" (1/1) ... [2025-03-08 16:02:42,698 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:42" (1/1) ... [2025-03-08 16:02:42,714 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 16:02:42,714 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:42" (1/1) ... [2025-03-08 16:02:42,714 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:42" (1/1) ... [2025-03-08 16:02:42,723 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:42" (1/1) ... [2025-03-08 16:02:42,724 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:42" (1/1) ... [2025-03-08 16:02:42,728 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:42" (1/1) ... [2025-03-08 16:02:42,728 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:42" (1/1) ... [2025-03-08 16:02:42,730 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:02:42,731 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:02:42,731 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:02:42,731 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:02:42,734 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:42" (1/1) ... [2025-03-08 16:02:42,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:02:42,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:02:42,758 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 16:02:42,763 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 16:02:42,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:02:42,777 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:02:42,777 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:02:42,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 16:02:42,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:02:42,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:02:42,826 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:02:42,827 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:02:43,049 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L89: havoc property_#t~ite13#1;havoc property_#t~bitwise12#1;havoc property_#t~short14#1; [2025-03-08 16:02:43,068 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-08 16:02:43,068 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:02:43,082 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:02:43,083 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:02:43,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:02:43 BoogieIcfgContainer [2025-03-08 16:02:43,084 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:02:43,086 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:02:43,086 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:02:43,089 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:02:43,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:02:42" (1/3) ... [2025-03-08 16:02:43,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@229aec82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:02:43, skipping insertion in model container [2025-03-08 16:02:43,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:42" (2/3) ... [2025-03-08 16:02:43,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@229aec82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:02:43, skipping insertion in model container [2025-03-08 16:02:43,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:02:43" (3/3) ... [2025-03-08 16:02:43,092 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-2.i [2025-03-08 16:02:43,101 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:02:43,102 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-2.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:02:43,134 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:02:43,141 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;@386be966, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:02:43,142 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:02:43,145 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 16:02:43,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 16:02:43,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:02:43,150 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:02:43,150 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:02:43,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:02:43,153 INFO L85 PathProgramCache]: Analyzing trace with hash -619132711, now seen corresponding path program 1 times [2025-03-08 16:02:43,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:02:43,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123554465] [2025-03-08 16:02:43,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:02:43,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:02:43,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 16:02:43,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 16:02:43,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:02:43,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:02:43,341 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-08 16:02:43,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:02:43,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123554465] [2025-03-08 16:02:43,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123554465] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:02:43,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468588152] [2025-03-08 16:02:43,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:02:43,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:02:43,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:02:43,349 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 16:02:43,351 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 16:02:43,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 16:02:43,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 16:02:43,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:02:43,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:02:43,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:02:43,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:02:43,461 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-08 16:02:43,461 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:02:43,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468588152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:02:43,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:02:43,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 16:02:43,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207601064] [2025-03-08 16:02:43,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:02:43,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:02:43,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:02:43,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:02:43,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:02:43,483 INFO L87 Difference]: Start difference. First operand has 52 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 16:02:43,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:02:43,501 INFO L93 Difference]: Finished difference Result 96 states and 155 transitions. [2025-03-08 16:02:43,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:02:43,517 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 81 [2025-03-08 16:02:43,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:02:43,523 INFO L225 Difference]: With dead ends: 96 [2025-03-08 16:02:43,525 INFO L226 Difference]: Without dead ends: 47 [2025-03-08 16:02:43,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 82 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 16:02:43,530 INFO L435 NwaCegarLoop]: 66 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, 66 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 16:02:43,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:02:43,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-08 16:02:43,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-08 16:02:43,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 16:02:43,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 66 transitions. [2025-03-08 16:02:43,559 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 66 transitions. Word has length 81 [2025-03-08 16:02:43,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:02:43,559 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 66 transitions. [2025-03-08 16:02:43,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 16:02:43,560 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 66 transitions. [2025-03-08 16:02:43,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 16:02:43,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:02:43,563 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:02:43,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 16:02:43,767 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 16:02:43,767 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:02:43,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:02:43,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1284796859, now seen corresponding path program 1 times [2025-03-08 16:02:43,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:02:43,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156171832] [2025-03-08 16:02:43,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:02:43,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:02:43,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 16:02:43,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 16:02:43,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:02:43,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:02:44,615 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:02:44,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:02:44,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156171832] [2025-03-08 16:02:44,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156171832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:02:44,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:02:44,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:02:44,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860118259] [2025-03-08 16:02:44,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:02:44,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:02:44,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:02:44,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:02:44,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:02:44,617 INFO L87 Difference]: Start difference. First operand 47 states and 66 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:02:44,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:02:44,895 INFO L93 Difference]: Finished difference Result 110 states and 155 transitions. [2025-03-08 16:02:44,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:02:44,895 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 81 [2025-03-08 16:02:44,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:02:44,896 INFO L225 Difference]: With dead ends: 110 [2025-03-08 16:02:44,896 INFO L226 Difference]: Without dead ends: 66 [2025-03-08 16:02:44,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:02:44,897 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 22 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:02:44,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 185 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:02:44,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-08 16:02:44,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 55. [2025-03-08 16:02:44,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 16:02:44,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 79 transitions. [2025-03-08 16:02:44,905 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 79 transitions. Word has length 81 [2025-03-08 16:02:44,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:02:44,907 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 79 transitions. [2025-03-08 16:02:44,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:02:44,907 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 79 transitions. [2025-03-08 16:02:44,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 16:02:44,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:02:44,910 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:02:44,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 16:02:44,910 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:02:44,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:02:44,910 INFO L85 PathProgramCache]: Analyzing trace with hash -522657604, now seen corresponding path program 1 times [2025-03-08 16:02:44,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:02:44,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351131860] [2025-03-08 16:02:44,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:02:44,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:02:44,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 16:02:44,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 16:02:44,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:02:44,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:02:45,063 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:02:45,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:02:45,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351131860] [2025-03-08 16:02:45,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351131860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:02:45,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:02:45,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:02:45,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872257230] [2025-03-08 16:02:45,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:02:45,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:02:45,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:02:45,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:02:45,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:02:45,065 INFO L87 Difference]: Start difference. First operand 55 states and 79 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:02:45,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:02:45,126 INFO L93 Difference]: Finished difference Result 118 states and 167 transitions. [2025-03-08 16:02:45,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:02:45,127 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 81 [2025-03-08 16:02:45,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:02:45,128 INFO L225 Difference]: With dead ends: 118 [2025-03-08 16:02:45,128 INFO L226 Difference]: Without dead ends: 66 [2025-03-08 16:02:45,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 16:02:45,129 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 22 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:02:45,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 228 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:02:45,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-08 16:02:45,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 47. [2025-03-08 16:02:45,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 16:02:45,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 65 transitions. [2025-03-08 16:02:45,134 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 65 transitions. Word has length 81 [2025-03-08 16:02:45,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:02:45,134 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 65 transitions. [2025-03-08 16:02:45,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:02:45,134 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 65 transitions. [2025-03-08 16:02:45,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 16:02:45,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:02:45,135 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:02:45,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 16:02:45,136 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:02:45,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:02:45,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1350914068, now seen corresponding path program 1 times [2025-03-08 16:02:45,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:02:45,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967858074] [2025-03-08 16:02:45,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:02:45,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:02:45,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 16:02:45,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 16:02:45,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:02:45,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 16:02:45,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [164402180] [2025-03-08 16:02:45,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:02:45,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:02:45,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:02:45,185 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:02:45,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 16:02:45,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 16:02:45,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 16:02:45,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:02:45,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:02:45,255 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 16:02:45,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 16:02:45,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 16:02:45,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:02:45,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:02:45,320 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 16:02:45,320 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 16:02:45,321 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 16:02:45,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 16:02:45,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-08 16:02:45,528 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-08 16:02:45,569 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 16:02:45,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:02:45 BoogieIcfgContainer [2025-03-08 16:02:45,572 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 16:02:45,572 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 16:02:45,572 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 16:02:45,572 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 16:02:45,574 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:02:43" (3/4) ... [2025-03-08 16:02:45,576 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 16:02:45,576 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 16:02:45,577 INFO L158 Benchmark]: Toolchain (without parser) took 3146.08ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 105.2MB in the beginning and 222.8MB in the end (delta: -117.7MB). Peak memory consumption was 43.7MB. Max. memory is 16.1GB. [2025-03-08 16:02:45,578 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:02:45,578 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.61ms. Allocated memory is still 142.6MB. Free memory was 104.0MB in the beginning and 91.0MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 16:02:45,579 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.28ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 88.8MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:02:45,579 INFO L158 Benchmark]: Boogie Preprocessor took 39.95ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 84.9MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:02:45,579 INFO L158 Benchmark]: IcfgBuilder took 352.90ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 64.8MB in the end (delta: 20.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 16:02:45,580 INFO L158 Benchmark]: TraceAbstraction took 2485.86ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 63.7MB in the beginning and 224.2MB in the end (delta: -160.5MB). Peak memory consumption was 1.8MB. Max. memory is 16.1GB. [2025-03-08 16:02:45,580 INFO L158 Benchmark]: Witness Printer took 4.18ms. Allocated memory is still 302.0MB. Free memory was 224.2MB in the beginning and 222.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:02:45,581 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 222.61ms. Allocated memory is still 142.6MB. Free memory was 104.0MB in the beginning and 91.0MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.28ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 88.8MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.95ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 84.9MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 352.90ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 64.8MB in the end (delta: 20.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2485.86ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 63.7MB in the beginning and 224.2MB in the end (delta: -160.5MB). Peak memory consumption was 1.8MB. Max. memory is 16.1GB. * Witness Printer took 4.18ms. Allocated memory is still 302.0MB. Free memory was 224.2MB in the beginning and 222.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 89, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someUnaryDOUBLEoperation at line 29. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 10; [L23] unsigned short int var_1_5 = 200; [L24] unsigned short int var_1_6 = 56955; [L25] unsigned short int var_1_7 = 32; [L26] unsigned short int var_1_8 = 1; [L27] unsigned short int var_1_9 = 8; [L28] unsigned char var_1_10 = 1; [L29] float var_1_11 = -0.6; [L30] float var_1_12 = 9.125; [L31] float var_1_13 = 50.5; [L32] unsigned short int last_1_var_1_1 = 10; [L33] unsigned short int last_1_var_1_9 = 8; VAL [isInitial=0, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=200, var_1_6=56955, var_1_7=32, var_1_8=1, var_1_9=8] [L93] isInitial = 1 [L94] FCALL initially() [L95] COND TRUE 1 [L96] CALL updateLastVariables() [L85] last_1_var_1_1 = var_1_1 [L86] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=200, var_1_6=56955, var_1_7=32, var_1_8=1, var_1_9=8] [L96] RET updateLastVariables() [L97] CALL updateVariables() [L64] var_1_5 = __VERIFIER_nondet_ushort() [L65] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_6=56955, var_1_7=32, var_1_8=1, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_6=56955, var_1_7=32, var_1_8=1, var_1_9=8] [L65] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_6=56955, var_1_7=32, var_1_8=1, var_1_9=8] [L66] CALL assume_abort_if_not(var_1_5 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=56955, var_1_7=32, var_1_8=1, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=56955, var_1_7=32, var_1_8=1, var_1_9=8] [L66] RET assume_abort_if_not(var_1_5 <= 65534) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=56955, var_1_7=32, var_1_8=1, var_1_9=8] [L67] var_1_6 = __VERIFIER_nondet_ushort() [L68] CALL assume_abort_if_not(var_1_6 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32, var_1_8=1, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32, var_1_8=1, var_1_9=8] [L68] RET assume_abort_if_not(var_1_6 >= 32767) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32, var_1_8=1, var_1_9=8] [L69] CALL assume_abort_if_not(var_1_6 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32, var_1_8=1, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32, var_1_8=1, var_1_9=8] [L69] RET assume_abort_if_not(var_1_6 <= 65534) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32, var_1_8=1, var_1_9=8] [L70] var_1_7 = __VERIFIER_nondet_ushort() [L71] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_8=1, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_8=1, var_1_9=8] [L71] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_8=1, var_1_9=8] [L72] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=1, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=1, var_1_9=8] [L72] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=1, var_1_9=8] [L73] var_1_8 = __VERIFIER_nondet_ushort() [L74] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_9=8] [L74] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_9=8] [L75] CALL assume_abort_if_not(var_1_8 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=32768, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=32768, var_1_9=8] [L75] RET assume_abort_if_not(var_1_8 <= 65534) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=32768, var_1_9=8] [L76] var_1_10 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=32768, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=32768, var_1_9=8] [L77] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=32768, var_1_9=8] [L78] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=32768, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=32768, var_1_9=8] [L78] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=32768, var_1_9=8] [L79] var_1_12 = __VERIFIER_nondet_float() [L80] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=32768, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=32768, var_1_9=8] [L80] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=32768, var_1_9=8] [L81] var_1_13 = __VERIFIER_nondet_float() [L82] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=32768, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=32768, var_1_9=8] [L82] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=32768, var_1_9=8] [L97] RET updateVariables() [L98] CALL step() [L37] COND TRUE last_1_var_1_9 <= (last_1_var_1_9 * last_1_var_1_1) [L38] var_1_1 = ((((var_1_5) > ((((((var_1_6 - var_1_7)) > (var_1_8)) ? ((var_1_6 - var_1_7)) : (var_1_8))))) ? (var_1_5) : ((((((var_1_6 - var_1_7)) > (var_1_8)) ? ((var_1_6 - var_1_7)) : (var_1_8)))))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_1=32768, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=32768, var_1_9=8] [L40] COND FALSE !(var_1_10 || (var_1_6 == var_1_8)) [L51] var_1_9 = var_1_6 VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_1=32768, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=32768, var_1_9=32767] [L53] COND FALSE !(var_1_7 != var_1_6) [L60] var_1_11 = var_1_12 VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_11=2, var_1_12=2, var_1_1=32768, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=32768, var_1_9=32767] [L98] RET step() [L99] CALL, EXPR property() [L89] EXPR ((last_1_var_1_9 <= (last_1_var_1_9 * last_1_var_1_1)) ? (var_1_1 == ((unsigned short int) ((((var_1_5) > ((((((var_1_6 - var_1_7)) > (var_1_8)) ? ((var_1_6 - var_1_7)) : (var_1_8))))) ? (var_1_5) : ((((((var_1_6 - var_1_7)) > (var_1_8)) ? ((var_1_6 - var_1_7)) : (var_1_8)))))))) : 1) && ((var_1_10 || (var_1_6 == var_1_8)) ? ((var_1_6 <= (((((0) < (var_1_1)) ? (0) : (var_1_1))) << var_1_1)) ? ((var_1_10 && (var_1_1 == (var_1_6 * var_1_5))) ? (var_1_9 == ((unsigned short int) var_1_5)) : (var_1_9 == ((unsigned short int) var_1_5))) : (var_1_9 == ((unsigned short int) 2))) : (var_1_9 == ((unsigned short int) var_1_6))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_11=2, var_1_12=2, var_1_1=32768, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=32768, var_1_9=32767] [L89] EXPR (var_1_10 || (var_1_6 == var_1_8)) ? ((var_1_6 <= (((((0) < (var_1_1)) ? (0) : (var_1_1))) << var_1_1)) ? ((var_1_10 && (var_1_1 == (var_1_6 * var_1_5))) ? (var_1_9 == ((unsigned short int) var_1_5)) : (var_1_9 == ((unsigned short int) var_1_5))) : (var_1_9 == ((unsigned short int) 2))) : (var_1_9 == ((unsigned short int) var_1_6)) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_11=2, var_1_12=2, var_1_1=32768, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=32768, var_1_9=32767] [L89] EXPR ((last_1_var_1_9 <= (last_1_var_1_9 * last_1_var_1_1)) ? (var_1_1 == ((unsigned short int) ((((var_1_5) > ((((((var_1_6 - var_1_7)) > (var_1_8)) ? ((var_1_6 - var_1_7)) : (var_1_8))))) ? (var_1_5) : ((((((var_1_6 - var_1_7)) > (var_1_8)) ? ((var_1_6 - var_1_7)) : (var_1_8)))))))) : 1) && ((var_1_10 || (var_1_6 == var_1_8)) ? ((var_1_6 <= (((((0) < (var_1_1)) ? (0) : (var_1_1))) << var_1_1)) ? ((var_1_10 && (var_1_1 == (var_1_6 * var_1_5))) ? (var_1_9 == ((unsigned short int) var_1_5)) : (var_1_9 == ((unsigned short int) var_1_5))) : (var_1_9 == ((unsigned short int) 2))) : (var_1_9 == ((unsigned short int) var_1_6))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_11=2, var_1_12=2, var_1_1=32768, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=32768, var_1_9=32767] [L89-L90] return (((last_1_var_1_9 <= (last_1_var_1_9 * last_1_var_1_1)) ? (var_1_1 == ((unsigned short int) ((((var_1_5) > ((((((var_1_6 - var_1_7)) > (var_1_8)) ? ((var_1_6 - var_1_7)) : (var_1_8))))) ? (var_1_5) : ((((((var_1_6 - var_1_7)) > (var_1_8)) ? ((var_1_6 - var_1_7)) : (var_1_8)))))))) : 1) && ((var_1_10 || (var_1_6 == var_1_8)) ? ((var_1_6 <= (((((0) < (var_1_1)) ? (0) : (var_1_1))) << var_1_1)) ? ((var_1_10 && (var_1_1 == (var_1_6 * var_1_5))) ? (var_1_9 == ((unsigned short int) var_1_5)) : (var_1_9 == ((unsigned short int) var_1_5))) : (var_1_9 == ((unsigned short int) 2))) : (var_1_9 == ((unsigned short int) var_1_6)))) && ((var_1_7 != var_1_6) ? ((var_1_7 <= var_1_9) ? (var_1_11 == ((float) ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))))) : (var_1_11 == ((float) var_1_12))) : (var_1_11 == ((float) var_1_12))) ; [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_11=2, var_1_12=2, var_1_1=32768, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=32768, var_1_9=32767] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_11=2, var_1_12=2, var_1_1=32768, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=32768, var_1_9=32767] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 87 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 4, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 44 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 44 mSDsluCounter, 479 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 271 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 116 IncrementalHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 208 mSDtfsCounter, 116 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=2, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 30 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 490 NumberOfCodeBlocks, 490 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 320 ConstructedInterpolants, 0 QuantifiedInterpolants, 800 SizeOfPredicates, 0 NumberOfNonLiveVariables, 195 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 1034/1056 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 16:02:45,597 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_variablewrapping_normal_file-2.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 884d5b26a9a5c3e1f2ddd732744de1f7633395324aa060e9edd0f0bad2da1ac4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:02:47,269 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:02:47,340 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 16:02:47,345 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:02:47,345 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:02:47,363 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:02:47,364 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:02:47,364 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:02:47,364 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:02:47,364 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:02:47,364 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:02:47,364 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:02:47,364 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:02:47,364 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:02:47,365 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:02:47,365 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:02:47,365 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:02:47,365 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:02:47,365 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:02:47,365 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:02:47,365 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:02:47,365 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:02:47,365 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:02:47,365 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 16:02:47,365 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 16:02:47,365 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 16:02:47,365 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:02:47,365 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:02:47,365 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:02:47,365 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:02:47,368 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:02:47,368 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:02:47,368 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:02:47,368 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:02:47,368 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:02:47,368 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:02:47,368 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:02:47,369 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:02:47,369 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:02:47,369 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 16:02:47,369 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 16:02:47,369 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:02:47,369 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:02:47,369 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:02:47,369 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:02:47,369 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 -> 884d5b26a9a5c3e1f2ddd732744de1f7633395324aa060e9edd0f0bad2da1ac4 [2025-03-08 16:02:47,593 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:02:47,599 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:02:47,600 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:02:47,601 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:02:47,602 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:02:47,602 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-2.i [2025-03-08 16:02:48,711 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/362074ee1/42bef3bbf90a4496974dd3d2a5bfb446/FLAG35a6d5fd0 [2025-03-08 16:02:48,883 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:02:48,883 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-2.i [2025-03-08 16:02:48,889 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/362074ee1/42bef3bbf90a4496974dd3d2a5bfb446/FLAG35a6d5fd0 [2025-03-08 16:02:49,266 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/362074ee1/42bef3bbf90a4496974dd3d2a5bfb446 [2025-03-08 16:02:49,268 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:02:49,269 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:02:49,270 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:02:49,270 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:02:49,273 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:02:49,273 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:02:49" (1/1) ... [2025-03-08 16:02:49,273 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75cad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:49, skipping insertion in model container [2025-03-08 16:02:49,274 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:02:49" (1/1) ... [2025-03-08 16:02:49,283 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:02:49,366 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_variablewrapping_normal_file-2.i[912,925] [2025-03-08 16:02:49,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:02:49,396 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:02:49,403 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_variablewrapping_normal_file-2.i[912,925] [2025-03-08 16:02:49,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:02:49,425 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:02:49,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:49 WrapperNode [2025-03-08 16:02:49,427 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:02:49,428 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:02:49,428 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:02:49,428 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:02:49,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:49" (1/1) ... [2025-03-08 16:02:49,446 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:49" (1/1) ... [2025-03-08 16:02:49,462 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 92 [2025-03-08 16:02:49,466 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:02:49,466 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:02:49,467 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:02:49,467 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:02:49,472 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:49" (1/1) ... [2025-03-08 16:02:49,472 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:49" (1/1) ... [2025-03-08 16:02:49,474 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:49" (1/1) ... [2025-03-08 16:02:49,487 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 16:02:49,487 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:49" (1/1) ... [2025-03-08 16:02:49,491 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:49" (1/1) ... [2025-03-08 16:02:49,495 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:49" (1/1) ... [2025-03-08 16:02:49,500 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:49" (1/1) ... [2025-03-08 16:02:49,501 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:49" (1/1) ... [2025-03-08 16:02:49,502 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:49" (1/1) ... [2025-03-08 16:02:49,507 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:02:49,508 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:02:49,508 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:02:49,508 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:02:49,509 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:49" (1/1) ... [2025-03-08 16:02:49,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:02:49,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:02:49,534 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 16:02:49,541 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 16:02:49,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:02:49,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 16:02:49,557 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:02:49,557 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:02:49,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:02:49,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:02:49,626 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:02:49,627 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:02:49,836 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 16:02:49,836 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:02:49,843 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:02:49,843 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:02:49,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:02:49 BoogieIcfgContainer [2025-03-08 16:02:49,844 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:02:49,846 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:02:49,846 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:02:49,850 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:02:49,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:02:49" (1/3) ... [2025-03-08 16:02:49,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76ed1042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:02:49, skipping insertion in model container [2025-03-08 16:02:49,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:49" (2/3) ... [2025-03-08 16:02:49,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76ed1042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:02:49, skipping insertion in model container [2025-03-08 16:02:49,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:02:49" (3/3) ... [2025-03-08 16:02:49,853 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-2.i [2025-03-08 16:02:49,863 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:02:49,865 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-2.i that has 2 procedures, 43 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:02:49,902 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:02:49,912 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;@13ea576c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:02:49,912 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:02:49,915 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 16:02:49,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 16:02:49,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:02:49,921 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:02:49,921 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:02:49,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:02:49,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1448396943, now seen corresponding path program 1 times [2025-03-08 16:02:49,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:02:49,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1196722585] [2025-03-08 16:02:49,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:02:49,944 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 16:02:49,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:02:49,946 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 16:02:49,947 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 16:02:50,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 16:02:50,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 16:02:50,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:02:50,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:02:50,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:02:50,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:02:50,093 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2025-03-08 16:02:50,093 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:02:50,093 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:02:50,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1196722585] [2025-03-08 16:02:50,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1196722585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:02:50,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:02:50,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 16:02:50,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584171085] [2025-03-08 16:02:50,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:02:50,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:02:50,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:02:50,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:02:50,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:02:50,110 INFO L87 Difference]: Start difference. First operand has 43 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 16:02:50,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:02:50,128 INFO L93 Difference]: Finished difference Result 80 states and 131 transitions. [2025-03-08 16:02:50,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:02:50,130 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 79 [2025-03-08 16:02:50,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:02:50,134 INFO L225 Difference]: With dead ends: 80 [2025-03-08 16:02:50,135 INFO L226 Difference]: Without dead ends: 40 [2025-03-08 16:02:50,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 78 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 16:02:50,140 INFO L435 NwaCegarLoop]: 57 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, 57 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 16:02:50,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:02:50,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-08 16:02:50,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-08 16:02:50,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 16:02:50,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 57 transitions. [2025-03-08 16:02:50,174 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 57 transitions. Word has length 79 [2025-03-08 16:02:50,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:02:50,174 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 57 transitions. [2025-03-08 16:02:50,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 16:02:50,174 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 57 transitions. [2025-03-08 16:02:50,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 16:02:50,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:02:50,177 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:02:50,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 16:02:50,378 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 16:02:50,378 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:02:50,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:02:50,379 INFO L85 PathProgramCache]: Analyzing trace with hash 587809265, now seen corresponding path program 1 times [2025-03-08 16:02:50,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:02:50,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [874322765] [2025-03-08 16:02:50,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:02:50,380 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 16:02:50,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:02:50,382 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 16:02:50,383 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 16:02:50,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 16:02:50,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 16:02:50,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:02:50,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:02:50,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 16:02:50,477 INFO L279 TraceCheckSpWp]: Computing forward predicates...