./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-33.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-33.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 207d54556929a93aa39d246b1f9a7e7f3ed779038a85bd758d97838d975fbe31 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:04:36,797 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:04:36,849 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 16:04:36,855 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:04:36,855 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:04:36,869 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:04:36,870 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:04:36,870 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:04:36,870 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:04:36,871 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:04:36,871 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:04:36,871 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:04:36,872 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:04:36,872 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:04:36,872 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:04:36,872 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:04:36,872 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:04:36,872 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:04:36,872 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 16:04:36,872 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:04:36,872 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:04:36,872 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:04:36,873 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:04:36,873 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:04:36,873 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:04:36,873 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:04:36,873 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:04:36,873 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:04:36,873 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:04:36,873 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:04:36,873 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:04:36,873 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:04:36,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:04:36,874 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:04:36,874 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:04:36,874 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:04:36,874 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:04:36,874 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 16:04:36,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 16:04:36,874 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:04:36,875 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:04:36,875 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:04:36,875 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:04:36,875 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 -> 207d54556929a93aa39d246b1f9a7e7f3ed779038a85bd758d97838d975fbe31 [2025-03-08 16:04:37,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:04:37,120 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:04:37,123 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:04:37,124 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:04:37,124 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:04:37,125 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-33.i [2025-03-08 16:04:38,319 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e77f88234/f1505ed629b7485b9071e80cbbcc8975/FLAGa5cd473da [2025-03-08 16:04:38,534 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:04:38,535 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-33.i [2025-03-08 16:04:38,547 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e77f88234/f1505ed629b7485b9071e80cbbcc8975/FLAGa5cd473da [2025-03-08 16:04:38,561 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e77f88234/f1505ed629b7485b9071e80cbbcc8975 [2025-03-08 16:04:38,579 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:04:38,590 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:04:38,591 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:04:38,591 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:04:38,599 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:04:38,600 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:04:38" (1/1) ... [2025-03-08 16:04:38,605 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@261c242d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:04:38, skipping insertion in model container [2025-03-08 16:04:38,607 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:04:38" (1/1) ... [2025-03-08 16:04:38,623 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:04:38,714 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-33.i[913,926] [2025-03-08 16:04:38,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:04:38,745 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:04:38,751 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-33.i[913,926] [2025-03-08 16:04:38,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:04:38,772 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:04:38,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:04:38 WrapperNode [2025-03-08 16:04:38,772 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:04:38,773 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:04:38,773 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:04:38,773 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:04:38,777 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:04:38" (1/1) ... [2025-03-08 16:04:38,783 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:04:38" (1/1) ... [2025-03-08 16:04:38,803 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 151 [2025-03-08 16:04:38,803 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:04:38,804 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:04:38,804 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:04:38,804 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:04:38,809 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:04:38" (1/1) ... [2025-03-08 16:04:38,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:04:38" (1/1) ... [2025-03-08 16:04:38,811 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:04:38" (1/1) ... [2025-03-08 16:04:38,819 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:04:38,819 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:04:38" (1/1) ... [2025-03-08 16:04:38,820 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:04:38" (1/1) ... [2025-03-08 16:04:38,825 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:04:38" (1/1) ... [2025-03-08 16:04:38,832 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:04:38" (1/1) ... [2025-03-08 16:04:38,833 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:04:38" (1/1) ... [2025-03-08 16:04:38,834 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:04:38" (1/1) ... [2025-03-08 16:04:38,835 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:04:38,839 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:04:38,839 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:04:38,839 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:04:38,840 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:04:38" (1/1) ... [2025-03-08 16:04:38,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:04:38,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:04:38,867 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:04:38,870 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:04:38,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:04:38,888 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:04:38,889 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:04:38,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 16:04:38,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:04:38,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:04:38,944 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:04:38,945 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:04:39,164 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L84: havoc property_#t~bitwise13#1;havoc property_#t~bitwise14#1;havoc property_#t~bitwise15#1;havoc property_#t~short16#1; [2025-03-08 16:04:39,179 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-03-08 16:04:39,179 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:04:39,204 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:04:39,207 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:04:39,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:04:39 BoogieIcfgContainer [2025-03-08 16:04:39,207 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:04:39,209 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:04:39,209 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:04:39,212 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:04:39,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:04:38" (1/3) ... [2025-03-08 16:04:39,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a636715 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:04:39, skipping insertion in model container [2025-03-08 16:04:39,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:04:38" (2/3) ... [2025-03-08 16:04:39,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a636715 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:04:39, skipping insertion in model container [2025-03-08 16:04:39,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:04:39" (3/3) ... [2025-03-08 16:04:39,214 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-33.i [2025-03-08 16:04:39,223 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:04:39,224 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-33.i that has 2 procedures, 65 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:04:39,267 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:04:39,276 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;@73accde7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:04:39,276 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:04:39,279 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 54 states have internal predecessors, (77), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 16:04:39,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 16:04:39,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:04:39,284 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:39,284 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:04:39,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:04:39,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1292168479, now seen corresponding path program 1 times [2025-03-08 16:04:39,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:04:39,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474911517] [2025-03-08 16:04:39,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:04:39,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:04:39,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 16:04:39,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 16:04:39,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:04:39,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:04:39,467 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-08 16:04:39,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:04:39,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474911517] [2025-03-08 16:04:39,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474911517] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:04:39,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538229955] [2025-03-08 16:04:39,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:04:39,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:04:39,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:04:39,471 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:04:39,473 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:04:39,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 16:04:39,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 16:04:39,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:04:39,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:04:39,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:04:39,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:04:39,593 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-08 16:04:39,593 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:04:39,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538229955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:04:39,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:04:39,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 16:04:39,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113882622] [2025-03-08 16:04:39,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:04:39,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:04:39,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:04:39,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:04:39,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:04:39,617 INFO L87 Difference]: Start difference. First operand has 65 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 54 states have internal predecessors, (77), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 16:04:39,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:04:39,646 INFO L93 Difference]: Finished difference Result 124 states and 194 transitions. [2025-03-08 16:04:39,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:04:39,648 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 74 [2025-03-08 16:04:39,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:04:39,654 INFO L225 Difference]: With dead ends: 124 [2025-03-08 16:04:39,655 INFO L226 Difference]: Without dead ends: 62 [2025-03-08 16:04:39,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 75 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:04:39,679 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:04:39,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:04:39,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-08 16:04:39,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-08 16:04:39,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 51 states have (on average 1.411764705882353) internal successors, (72), 51 states have internal predecessors, (72), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 16:04:39,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 90 transitions. [2025-03-08 16:04:39,708 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 90 transitions. Word has length 74 [2025-03-08 16:04:39,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:04:39,709 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 90 transitions. [2025-03-08 16:04:39,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 16:04:39,709 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 90 transitions. [2025-03-08 16:04:39,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 16:04:39,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:04:39,712 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:39,718 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:04:39,912 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:04:39,912 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:04:39,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:04:39,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1558803902, now seen corresponding path program 1 times [2025-03-08 16:04:39,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:04:39,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281210655] [2025-03-08 16:04:39,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:04:39,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:04:39,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 16:04:39,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 16:04:39,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:04:39,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:04:40,102 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 16:04:40,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:04:40,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281210655] [2025-03-08 16:04:40,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281210655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:04:40,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:04:40,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:04:40,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318971375] [2025-03-08 16:04:40,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:04:40,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:04:40,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:04:40,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:04:40,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:04:40,105 INFO L87 Difference]: Start difference. First operand 62 states and 90 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:04:40,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:04:40,145 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2025-03-08 16:04:40,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:04:40,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 74 [2025-03-08 16:04:40,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:04:40,146 INFO L225 Difference]: With dead ends: 122 [2025-03-08 16:04:40,147 INFO L226 Difference]: Without dead ends: 63 [2025-03-08 16:04:40,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:04:40,147 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:04:40,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:04:40,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-08 16:04:40,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-08 16:04:40,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 16:04:40,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 91 transitions. [2025-03-08 16:04:40,157 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 91 transitions. Word has length 74 [2025-03-08 16:04:40,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:04:40,158 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 91 transitions. [2025-03-08 16:04:40,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:04:40,158 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 91 transitions. [2025-03-08 16:04:40,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 16:04:40,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:04:40,161 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:40,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 16:04:40,161 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:04:40,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:04:40,162 INFO L85 PathProgramCache]: Analyzing trace with hash 928708931, now seen corresponding path program 1 times [2025-03-08 16:04:40,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:04:40,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363538770] [2025-03-08 16:04:40,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:04:40,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:04:40,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 16:04:40,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 16:04:40,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:04:40,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:04:40,317 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 16:04:40,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:04:40,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363538770] [2025-03-08 16:04:40,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363538770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:04:40,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:04:40,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:04:40,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713038913] [2025-03-08 16:04:40,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:04:40,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:04:40,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:04:40,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:04:40,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:04:40,319 INFO L87 Difference]: Start difference. First operand 63 states and 91 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:04:40,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:04:40,450 INFO L93 Difference]: Finished difference Result 148 states and 214 transitions. [2025-03-08 16:04:40,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:04:40,451 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 74 [2025-03-08 16:04:40,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:04:40,453 INFO L225 Difference]: With dead ends: 148 [2025-03-08 16:04:40,453 INFO L226 Difference]: Without dead ends: 88 [2025-03-08 16:04:40,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:04:40,455 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 85 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:04:40,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 269 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:04:40,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-08 16:04:40,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 65. [2025-03-08 16:04:40,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 54 states have internal predecessors, (75), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 16:04:40,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 93 transitions. [2025-03-08 16:04:40,462 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 93 transitions. Word has length 74 [2025-03-08 16:04:40,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:04:40,462 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 93 transitions. [2025-03-08 16:04:40,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:04:40,462 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 93 transitions. [2025-03-08 16:04:40,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 16:04:40,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:04:40,464 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:40,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 16:04:40,464 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:04:40,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:04:40,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1057791650, now seen corresponding path program 1 times [2025-03-08 16:04:40,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:04:40,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487537672] [2025-03-08 16:04:40,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:04:40,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:04:40,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 16:04:40,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 16:04:40,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:04:40,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:04:41,985 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 16:04:41,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:04:41,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487537672] [2025-03-08 16:04:41,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487537672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:04:41,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:04:41,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:04:41,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298817215] [2025-03-08 16:04:41,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:04:41,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:04:41,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:04:41,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:04:41,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:04:41,988 INFO L87 Difference]: Start difference. First operand 65 states and 93 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:04:42,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:04:42,501 INFO L93 Difference]: Finished difference Result 268 states and 388 transitions. [2025-03-08 16:04:42,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:04:42,503 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 74 [2025-03-08 16:04:42,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:04:42,504 INFO L225 Difference]: With dead ends: 268 [2025-03-08 16:04:42,504 INFO L226 Difference]: Without dead ends: 206 [2025-03-08 16:04:42,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:04:42,505 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 444 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:04:42,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 305 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:04:42,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-03-08 16:04:42,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 89. [2025-03-08 16:04:42,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.4230769230769231) internal successors, (111), 78 states have internal predecessors, (111), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 16:04:42,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 129 transitions. [2025-03-08 16:04:42,518 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 129 transitions. Word has length 74 [2025-03-08 16:04:42,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:04:42,520 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 129 transitions. [2025-03-08 16:04:42,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:04:42,520 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 129 transitions. [2025-03-08 16:04:42,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 16:04:42,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:04:42,522 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:42,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 16:04:42,522 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:04:42,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:04:42,523 INFO L85 PathProgramCache]: Analyzing trace with hash 60719297, now seen corresponding path program 1 times [2025-03-08 16:04:42,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:04:42,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283700381] [2025-03-08 16:04:42,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:04:42,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:04:42,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 16:04:42,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 16:04:42,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:04:42,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:04:42,840 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 16:04:42,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:04:42,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283700381] [2025-03-08 16:04:42,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283700381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:04:42,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:04:42,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:04:42,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277325542] [2025-03-08 16:04:42,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:04:42,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:04:42,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:04:42,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:04:42,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:04:42,842 INFO L87 Difference]: Start difference. First operand 89 states and 129 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:04:43,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:04:43,096 INFO L93 Difference]: Finished difference Result 242 states and 351 transitions. [2025-03-08 16:04:43,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:04:43,097 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 74 [2025-03-08 16:04:43,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:04:43,098 INFO L225 Difference]: With dead ends: 242 [2025-03-08 16:04:43,098 INFO L226 Difference]: Without dead ends: 156 [2025-03-08 16:04:43,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:04:43,099 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 140 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:04:43,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 369 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:04:43,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-08 16:04:43,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 91. [2025-03-08 16:04:43,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.425) internal successors, (114), 80 states have internal predecessors, (114), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 16:04:43,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 132 transitions. [2025-03-08 16:04:43,103 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 132 transitions. Word has length 74 [2025-03-08 16:04:43,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:04:43,104 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 132 transitions. [2025-03-08 16:04:43,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:04:43,104 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 132 transitions. [2025-03-08 16:04:43,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 16:04:43,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:04:43,105 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:43,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 16:04:43,105 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:04:43,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:04:43,105 INFO L85 PathProgramCache]: Analyzing trace with hash -435846101, now seen corresponding path program 1 times [2025-03-08 16:04:43,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:04:43,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215205486] [2025-03-08 16:04:43,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:04:43,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:04:43,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 16:04:43,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 16:04:43,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:04:43,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:04:43,132 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 16:04:43,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:04:43,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215205486] [2025-03-08 16:04:43,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215205486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:04:43,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:04:43,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:04:43,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578723469] [2025-03-08 16:04:43,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:04:43,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:04:43,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:04:43,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:04:43,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:04:43,134 INFO L87 Difference]: Start difference. First operand 91 states and 132 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:04:43,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:04:43,174 INFO L93 Difference]: Finished difference Result 234 states and 341 transitions. [2025-03-08 16:04:43,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:04:43,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 75 [2025-03-08 16:04:43,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:04:43,176 INFO L225 Difference]: With dead ends: 234 [2025-03-08 16:04:43,176 INFO L226 Difference]: Without dead ends: 146 [2025-03-08 16:04:43,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:04:43,177 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 54 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:04:43,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 175 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:04:43,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-08 16:04:43,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 111. [2025-03-08 16:04:43,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 100 states have (on average 1.41) internal successors, (141), 100 states have internal predecessors, (141), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 16:04:43,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2025-03-08 16:04:43,182 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 75 [2025-03-08 16:04:43,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:04:43,182 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2025-03-08 16:04:43,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:04:43,182 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2025-03-08 16:04:43,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 16:04:43,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:04:43,183 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:43,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 16:04:43,183 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:04:43,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:04:43,184 INFO L85 PathProgramCache]: Analyzing trace with hash 144135984, now seen corresponding path program 1 times [2025-03-08 16:04:43,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:04:43,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60335455] [2025-03-08 16:04:43,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:04:43,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:04:43,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 16:04:43,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 16:04:43,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:04:43,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:04:43,214 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 16:04:43,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:04:43,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60335455] [2025-03-08 16:04:43,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60335455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:04:43,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:04:43,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:04:43,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044005286] [2025-03-08 16:04:43,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:04:43,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:04:43,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:04:43,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:04:43,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:04:43,216 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:04:43,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:04:43,254 INFO L93 Difference]: Finished difference Result 254 states and 363 transitions. [2025-03-08 16:04:43,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:04:43,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 75 [2025-03-08 16:04:43,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:04:43,257 INFO L225 Difference]: With dead ends: 254 [2025-03-08 16:04:43,257 INFO L226 Difference]: Without dead ends: 146 [2025-03-08 16:04:43,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:04:43,258 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 75 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:04:43,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 145 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:04:43,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-08 16:04:43,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 94. [2025-03-08 16:04:43,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 16:04:43,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 131 transitions. [2025-03-08 16:04:43,265 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 131 transitions. Word has length 75 [2025-03-08 16:04:43,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:04:43,265 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 131 transitions. [2025-03-08 16:04:43,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:04:43,265 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 131 transitions. [2025-03-08 16:04:43,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 16:04:43,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:04:43,269 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:43,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 16:04:43,269 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:04:43,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:04:43,270 INFO L85 PathProgramCache]: Analyzing trace with hash 519688401, now seen corresponding path program 1 times [2025-03-08 16:04:43,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:04:43,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301373389] [2025-03-08 16:04:43,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:04:43,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:04:43,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 16:04:43,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 16:04:43,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:04:43,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:04:43,791 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 16:04:43,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:04:43,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301373389] [2025-03-08 16:04:43,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301373389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:04:43,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:04:43,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:04:43,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623313148] [2025-03-08 16:04:43,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:04:43,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:04:43,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:04:43,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:04:43,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:04:43,792 INFO L87 Difference]: Start difference. First operand 94 states and 131 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:04:44,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:04:44,265 INFO L93 Difference]: Finished difference Result 370 states and 512 transitions. [2025-03-08 16:04:44,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:04:44,267 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 75 [2025-03-08 16:04:44,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:04:44,268 INFO L225 Difference]: With dead ends: 370 [2025-03-08 16:04:44,268 INFO L226 Difference]: Without dead ends: 279 [2025-03-08 16:04:44,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:04:44,269 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 272 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:04:44,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 380 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:04:44,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-03-08 16:04:44,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 129. [2025-03-08 16:04:44,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 118 states have (on average 1.3728813559322033) internal successors, (162), 118 states have internal predecessors, (162), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 16:04:44,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 180 transitions. [2025-03-08 16:04:44,282 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 180 transitions. Word has length 75 [2025-03-08 16:04:44,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:04:44,283 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 180 transitions. [2025-03-08 16:04:44,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:04:44,283 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 180 transitions. [2025-03-08 16:04:44,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 16:04:44,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:04:44,284 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:44,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 16:04:44,284 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:04:44,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:04:44,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1305599325, now seen corresponding path program 1 times [2025-03-08 16:04:44,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:04:44,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621732602] [2025-03-08 16:04:44,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:04:44,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:04:44,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 16:04:44,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 16:04:44,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:04:44,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:04:44,361 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 16:04:44,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:04:44,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621732602] [2025-03-08 16:04:44,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621732602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:04:44,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:04:44,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:04:44,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503327735] [2025-03-08 16:04:44,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:04:44,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:04:44,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:04:44,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:04:44,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:04:44,363 INFO L87 Difference]: Start difference. First operand 129 states and 180 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:04:44,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:04:44,533 INFO L93 Difference]: Finished difference Result 381 states and 527 transitions. [2025-03-08 16:04:44,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:04:44,534 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 76 [2025-03-08 16:04:44,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:04:44,535 INFO L225 Difference]: With dead ends: 381 [2025-03-08 16:04:44,535 INFO L226 Difference]: Without dead ends: 255 [2025-03-08 16:04:44,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:04:44,536 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 201 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:04:44,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 314 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:04:44,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-03-08 16:04:44,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 248. [2025-03-08 16:04:44,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 223 states have (on average 1.3497757847533631) internal successors, (301), 225 states have internal predecessors, (301), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 16:04:44,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 341 transitions. [2025-03-08 16:04:44,545 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 341 transitions. Word has length 76 [2025-03-08 16:04:44,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:04:44,545 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 341 transitions. [2025-03-08 16:04:44,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:04:44,546 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 341 transitions. [2025-03-08 16:04:44,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 16:04:44,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:04:44,546 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:44,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 16:04:44,547 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:04:44,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:04:44,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1012196318, now seen corresponding path program 1 times [2025-03-08 16:04:44,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:04:44,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514048941] [2025-03-08 16:04:44,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:04:44,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:04:44,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 16:04:44,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 16:04:44,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:04:44,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:04:45,059 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 16:04:45,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:04:45,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514048941] [2025-03-08 16:04:45,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514048941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:04:45,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:04:45,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 16:04:45,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793654842] [2025-03-08 16:04:45,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:04:45,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 16:04:45,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:04:45,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 16:04:45,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:04:45,061 INFO L87 Difference]: Start difference. First operand 248 states and 341 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:04:45,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:04:45,648 INFO L93 Difference]: Finished difference Result 570 states and 776 transitions. [2025-03-08 16:04:45,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:04:45,649 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 76 [2025-03-08 16:04:45,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:04:45,652 INFO L225 Difference]: With dead ends: 570 [2025-03-08 16:04:45,652 INFO L226 Difference]: Without dead ends: 329 [2025-03-08 16:04:45,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2025-03-08 16:04:45,654 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 201 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:04:45,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 473 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:04:45,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-03-08 16:04:45,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 258. [2025-03-08 16:04:45,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 233 states have (on average 1.3476394849785407) internal successors, (314), 235 states have internal predecessors, (314), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 16:04:45,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 354 transitions. [2025-03-08 16:04:45,687 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 354 transitions. Word has length 76 [2025-03-08 16:04:45,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:04:45,687 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 354 transitions. [2025-03-08 16:04:45,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:04:45,687 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 354 transitions. [2025-03-08 16:04:45,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 16:04:45,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:04:45,688 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:45,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 16:04:45,688 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:04:45,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:04:45,689 INFO L85 PathProgramCache]: Analyzing trace with hash 603372093, now seen corresponding path program 1 times [2025-03-08 16:04:45,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:04:45,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138497544] [2025-03-08 16:04:45,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:04:45,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:04:45,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 16:04:45,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 16:04:45,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:04:45,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:04:45,739 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 16:04:45,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:04:45,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138497544] [2025-03-08 16:04:45,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138497544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:04:45,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:04:45,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:04:45,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784270989] [2025-03-08 16:04:45,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:04:45,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:04:45,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:04:45,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:04:45,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:04:45,742 INFO L87 Difference]: Start difference. First operand 258 states and 354 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:04:45,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:04:45,806 INFO L93 Difference]: Finished difference Result 660 states and 908 transitions. [2025-03-08 16:04:45,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:04:45,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 76 [2025-03-08 16:04:45,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:04:45,808 INFO L225 Difference]: With dead ends: 660 [2025-03-08 16:04:45,808 INFO L226 Difference]: Without dead ends: 409 [2025-03-08 16:04:45,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:04:45,809 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 61 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:04:45,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 164 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:04:45,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2025-03-08 16:04:45,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 305. [2025-03-08 16:04:45,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 269 states have (on average 1.3345724907063197) internal successors, (359), 271 states have internal predecessors, (359), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-08 16:04:45,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 417 transitions. [2025-03-08 16:04:45,821 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 417 transitions. Word has length 76 [2025-03-08 16:04:45,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:04:45,821 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 417 transitions. [2025-03-08 16:04:45,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:04:45,821 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 417 transitions. [2025-03-08 16:04:45,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 16:04:45,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:04:45,822 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:45,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 16:04:45,822 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:04:45,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:04:45,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1707120714, now seen corresponding path program 1 times [2025-03-08 16:04:45,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:04:45,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531101534] [2025-03-08 16:04:45,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:04:45,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:04:45,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 16:04:45,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 16:04:45,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:04:45,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:04:45,906 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-08 16:04:45,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:04:45,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531101534] [2025-03-08 16:04:45,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531101534] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:04:45,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705347661] [2025-03-08 16:04:45,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:04:45,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:04:45,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:04:45,909 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:04:45,910 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:04:45,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 16:04:45,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 16:04:45,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:04:45,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:04:45,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 16:04:45,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:04:46,122 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-08 16:04:46,123 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:04:46,243 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-08 16:04:46,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705347661] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 16:04:46,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 16:04:46,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 16 [2025-03-08 16:04:46,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677664088] [2025-03-08 16:04:46,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 16:04:46,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 16:04:46,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:04:46,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 16:04:46,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-03-08 16:04:46,246 INFO L87 Difference]: Start difference. First operand 305 states and 417 transitions. Second operand has 16 states, 15 states have (on average 4.466666666666667) internal successors, (67), 16 states have internal predecessors, (67), 6 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 6 states have call successors, (27) [2025-03-08 16:04:46,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:04:46,698 INFO L93 Difference]: Finished difference Result 939 states and 1247 transitions. [2025-03-08 16:04:46,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-08 16:04:46,698 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.466666666666667) internal successors, (67), 16 states have internal predecessors, (67), 6 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 6 states have call successors, (27) Word has length 77 [2025-03-08 16:04:46,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:04:46,701 INFO L225 Difference]: With dead ends: 939 [2025-03-08 16:04:46,701 INFO L226 Difference]: Without dead ends: 790 [2025-03-08 16:04:46,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=327, Invalid=933, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 16:04:46,703 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 782 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 790 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:04:46,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [790 Valid, 590 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:04:46,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2025-03-08 16:04:46,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 323. [2025-03-08 16:04:46,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 265 states have (on average 1.2754716981132075) internal successors, (338), 266 states have internal predecessors, (338), 45 states have call successors, (45), 12 states have call predecessors, (45), 12 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-08 16:04:46,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 428 transitions. [2025-03-08 16:04:46,745 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 428 transitions. Word has length 77 [2025-03-08 16:04:46,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:04:46,745 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 428 transitions. [2025-03-08 16:04:46,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.466666666666667) internal successors, (67), 16 states have internal predecessors, (67), 6 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 6 states have call successors, (27) [2025-03-08 16:04:46,746 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 428 transitions. [2025-03-08 16:04:46,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 16:04:46,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:04:46,746 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:46,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 16:04:46,947 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,SelfDestructingSolverStorable11 [2025-03-08 16:04:46,947 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:04:46,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:04:46,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1918471627, now seen corresponding path program 1 times [2025-03-08 16:04:46,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:04:46,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921346615] [2025-03-08 16:04:46,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:04:46,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:04:46,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 16:04:46,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 16:04:46,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:04:46,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:04:46,962 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 16:04:46,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 16:04:46,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 16:04:46,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:04:46,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:04:46,990 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 16:04:46,990 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 16:04:46,991 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 16:04:46,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 16:04:46,994 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:04:47,023 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 16:04:47,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:04:47 BoogieIcfgContainer [2025-03-08 16:04:47,025 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 16:04:47,026 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 16:04:47,026 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 16:04:47,026 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 16:04:47,027 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:04:39" (3/4) ... [2025-03-08 16:04:47,028 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 16:04:47,028 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 16:04:47,029 INFO L158 Benchmark]: Toolchain (without parser) took 8440.12ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 109.9MB in the beginning and 299.2MB in the end (delta: -189.2MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. [2025-03-08 16:04:47,029 INFO L158 Benchmark]: CDTParser took 1.28ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:04:47,029 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.50ms. Allocated memory is still 142.6MB. Free memory was 109.9MB in the beginning and 97.3MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 16:04:47,030 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.02ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 95.0MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 16:04:47,030 INFO L158 Benchmark]: Boogie Preprocessor took 31.68ms. Allocated memory is still 142.6MB. Free memory was 95.0MB in the beginning and 92.0MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:04:47,030 INFO L158 Benchmark]: IcfgBuilder took 367.83ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 68.8MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 16:04:47,030 INFO L158 Benchmark]: TraceAbstraction took 7816.80ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 68.8MB in the beginning and 299.3MB in the end (delta: -230.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:04:47,030 INFO L158 Benchmark]: Witness Printer took 2.57ms. Allocated memory is still 352.3MB. Free memory was 299.3MB in the beginning and 299.2MB in the end (delta: 106.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:04:47,031 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.28ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 181.50ms. Allocated memory is still 142.6MB. Free memory was 109.9MB in the beginning and 97.3MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.02ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 95.0MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.68ms. Allocated memory is still 142.6MB. Free memory was 95.0MB in the beginning and 92.0MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 367.83ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 68.8MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7816.80ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 68.8MB in the beginning and 299.3MB in the end (delta: -230.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.57ms. Allocated memory is still 352.3MB. Free memory was 299.3MB in the beginning and 299.2MB in the end (delta: 106.2kB). 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 84, overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someBinaryFLOATComparisonOperation at line 75, overapproximation of someBinaryFLOATComparisonOperation at line 84, overapproximation of someBinaryFLOATComparisonOperation at line 71, overapproximation of someUnaryDOUBLEoperation at line 27. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -10; [L23] signed short int var_1_5 = 4; [L24] unsigned char var_1_7 = 200; [L25] unsigned char var_1_8 = 32; [L26] float var_1_9 = 256.5; [L27] float var_1_10 = -0.25; [L28] float var_1_11 = 0.30000000000000004; [L29] float var_1_12 = 49.5; [L30] signed long int var_1_13 = -8; [L31] unsigned char var_1_14 = 0; [L32] float var_1_15 = 0.4; [L33] signed long int var_1_16 = -256; [L34] signed long int last_1_var_1_13 = -8; VAL [isInitial=0, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=4, var_1_7=200, var_1_8=32, var_1_9=513/2] [L88] isInitial = 1 [L89] FCALL initially() [L90] COND TRUE 1 [L91] CALL updateLastVariables() [L81] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=4, var_1_7=200, var_1_8=32, var_1_9=513/2] [L91] RET updateLastVariables() [L92] CALL updateVariables() [L64] var_1_5 = __VERIFIER_nondet_short() [L65] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=32, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=32, var_1_9=513/2] [L65] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=32, var_1_9=513/2] [L66] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=32, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=32, var_1_9=513/2] [L66] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=32, var_1_9=513/2] [L67] var_1_8 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_9=513/2] [L68] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_9=513/2] [L69] CALL assume_abort_if_not(var_1_8 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L69] RET assume_abort_if_not(var_1_8 <= 127) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L70] var_1_10 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L71] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L72] var_1_11 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L73] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-8, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L74] var_1_12 = __VERIFIER_nondet_float() [L75] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L75] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L76] var_1_14 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L77] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L78] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L78] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L92] RET updateVariables() [L93] CALL step() [L38] COND FALSE !(var_1_5 < last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L41] var_1_16 = var_1_7 [L42] unsigned char stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=200, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L43] COND TRUE ! var_1_14 [L44] var_1_13 = var_1_8 VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_13=0, var_1_14=0, var_1_15=2/5, var_1_16=200, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L52] var_1_15 = var_1_11 VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L53] EXPR var_1_13 ^ var_1_7 VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L53] signed long int stepLocal_0 = (var_1_13 ^ var_1_7) + var_1_16; [L54] COND FALSE !(stepLocal_0 < -1) [L57] var_1_1 = (128 - (var_1_7 + var_1_7)) VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L59] EXPR var_1_7 | var_1_16 VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L59] EXPR var_1_13 & (var_1_7 | var_1_16) VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L59] COND FALSE !(var_1_7 < (var_1_13 & (var_1_7 | var_1_16))) [L93] RET step() [L94] CALL, EXPR property() [L84] EXPR var_1_13 ^ var_1_7 VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84] EXPR (((((var_1_13 ^ var_1_7) + var_1_16) < -1) ? (var_1_1 == ((signed short int) 8)) : (var_1_1 == ((signed short int) (128 - (var_1_7 + var_1_7))))) && ((var_1_5 < last_1_var_1_13) ? (var_1_7 == ((unsigned char) (var_1_8 + 1))) : 1)) && ((var_1_7 < (var_1_13 & (var_1_7 | var_1_16))) ? (var_1_9 == ((float) ((((var_1_10 + (var_1_11 - var_1_12)) < 0 ) ? -(var_1_10 + (var_1_11 - var_1_12)) : (var_1_10 + (var_1_11 - var_1_12)))))) : 1) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84] EXPR var_1_7 | var_1_16 VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84] EXPR var_1_13 & (var_1_7 | var_1_16) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84] EXPR (((((var_1_13 ^ var_1_7) + var_1_16) < -1) ? (var_1_1 == ((signed short int) 8)) : (var_1_1 == ((signed short int) (128 - (var_1_7 + var_1_7))))) && ((var_1_5 < last_1_var_1_13) ? (var_1_7 == ((unsigned char) (var_1_8 + 1))) : 1)) && ((var_1_7 < (var_1_13 & (var_1_7 | var_1_16))) ? (var_1_9 == ((float) ((((var_1_10 + (var_1_11 - var_1_12)) < 0 ) ? -(var_1_10 + (var_1_11 - var_1_12)) : (var_1_10 + (var_1_11 - var_1_12)))))) : 1) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84-L85] return ((((((((var_1_13 ^ var_1_7) + var_1_16) < -1) ? (var_1_1 == ((signed short int) 8)) : (var_1_1 == ((signed short int) (128 - (var_1_7 + var_1_7))))) && ((var_1_5 < last_1_var_1_13) ? (var_1_7 == ((unsigned char) (var_1_8 + 1))) : 1)) && ((var_1_7 < (var_1_13 & (var_1_7 | var_1_16))) ? (var_1_9 == ((float) ((((var_1_10 + (var_1_11 - var_1_12)) < 0 ) ? -(var_1_10 + (var_1_11 - var_1_12)) : (var_1_10 + (var_1_11 - var_1_12)))))) : 1)) && ((! var_1_14) ? (var_1_13 == ((signed long int) var_1_8)) : ((var_1_7 > (var_1_7 + var_1_7)) ? (var_1_13 == ((signed long int) var_1_7)) : (var_1_13 == ((signed long int) var_1_16))))) && (var_1_15 == ((float) var_1_11))) && (var_1_16 == ((signed long int) var_1_7)) ; [L94] RET, EXPR property() [L94] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 65 locations, 104 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.7s, OverallIterations: 13, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2323 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2315 mSDsluCounter, 3429 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2392 mSDsCounter, 135 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2691 IncrementalHoareTripleChecker+Invalid, 2826 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 135 mSolverCounterUnsat, 1037 mSDtfsCounter, 2691 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 350 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=323occurred in iteration=12, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 1091 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1128 NumberOfCodeBlocks, 1128 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1113 ConstructedInterpolants, 0 QuantifiedInterpolants, 5246 SizeOfPredicates, 4 NumberOfNonLiveVariables, 389 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 15 InterpolantComputations, 11 PerfectInterpolantSequences, 2072/2160 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:04:47,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-33.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 207d54556929a93aa39d246b1f9a7e7f3ed779038a85bd758d97838d975fbe31 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:04:48,763 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:04:48,843 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 16:04:48,849 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:04:48,849 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:04:48,872 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:04:48,872 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:04:48,873 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:04:48,873 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:04:48,873 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:04:48,874 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:04:48,874 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:04:48,874 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:04:48,874 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:04:48,875 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:04:48,875 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:04:48,875 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:04:48,875 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:04:48,875 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:04:48,875 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:04:48,875 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:04:48,875 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:04:48,875 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:04:48,875 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 16:04:48,875 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 16:04:48,875 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 16:04:48,875 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:04:48,875 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:04:48,875 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:04:48,875 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:04:48,875 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:04:48,875 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:04:48,876 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:04:48,876 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:04:48,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:04:48,876 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:04:48,876 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:04:48,876 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:04:48,876 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:04:48,876 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 16:04:48,876 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 16:04:48,876 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:04:48,876 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:04:48,876 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:04:48,876 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:04:48,876 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 -> 207d54556929a93aa39d246b1f9a7e7f3ed779038a85bd758d97838d975fbe31 [2025-03-08 16:04:49,111 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:04:49,116 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:04:49,117 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:04:49,118 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:04:49,118 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:04:49,119 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-33.i [2025-03-08 16:04:50,281 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b19f6f57/f7b7f50ab9a64a58bbd816628b0fb6cc/FLAGf1a1b95ea [2025-03-08 16:04:50,458 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:04:50,459 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-33.i [2025-03-08 16:04:50,466 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b19f6f57/f7b7f50ab9a64a58bbd816628b0fb6cc/FLAGf1a1b95ea [2025-03-08 16:04:50,840 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b19f6f57/f7b7f50ab9a64a58bbd816628b0fb6cc [2025-03-08 16:04:50,842 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:04:50,843 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:04:50,844 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:04:50,844 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:04:50,846 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:04:50,847 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:04:50" (1/1) ... [2025-03-08 16:04:50,847 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b022879 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:04:50, skipping insertion in model container [2025-03-08 16:04:50,847 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:04:50" (1/1) ... [2025-03-08 16:04:50,859 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:04:50,941 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-33.i[913,926] [2025-03-08 16:04:50,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:04:50,974 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:04:50,981 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-33.i[913,926] [2025-03-08 16:04:50,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:04:51,001 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:04:51,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:04:51 WrapperNode [2025-03-08 16:04:51,002 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:04:51,003 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:04:51,003 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:04:51,004 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:04:51,008 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:04:51" (1/1) ... [2025-03-08 16:04:51,013 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:04:51" (1/1) ... [2025-03-08 16:04:51,030 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 88 [2025-03-08 16:04:51,031 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:04:51,031 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:04:51,031 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:04:51,031 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:04:51,038 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:04:51" (1/1) ... [2025-03-08 16:04:51,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:04:51" (1/1) ... [2025-03-08 16:04:51,042 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:04:51" (1/1) ... [2025-03-08 16:04:51,059 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:04:51,059 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:04:51" (1/1) ... [2025-03-08 16:04:51,059 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:04:51" (1/1) ... [2025-03-08 16:04:51,068 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:04:51" (1/1) ... [2025-03-08 16:04:51,072 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:04:51" (1/1) ... [2025-03-08 16:04:51,074 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:04:51" (1/1) ... [2025-03-08 16:04:51,074 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:04:51" (1/1) ... [2025-03-08 16:04:51,080 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:04:51,080 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:04:51,081 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:04:51,081 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:04:51,081 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:04:51" (1/1) ... [2025-03-08 16:04:51,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:04:51,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:04:51,111 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:04:51,114 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:04:51,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:04:51,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 16:04:51,132 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:04:51,132 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:04:51,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:04:51,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:04:51,196 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:04:51,198 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:04:51,786 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-08 16:04:51,787 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:04:51,792 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:04:51,792 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:04:51,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:04:51 BoogieIcfgContainer [2025-03-08 16:04:51,793 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:04:51,794 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:04:51,794 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:04:51,797 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:04:51,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:04:50" (1/3) ... [2025-03-08 16:04:51,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16d193fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:04:51, skipping insertion in model container [2025-03-08 16:04:51,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:04:51" (2/3) ... [2025-03-08 16:04:51,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16d193fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:04:51, skipping insertion in model container [2025-03-08 16:04:51,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:04:51" (3/3) ... [2025-03-08 16:04:51,799 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-33.i [2025-03-08 16:04:51,808 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:04:51,809 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-33.i that has 2 procedures, 40 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:04:51,843 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:04:51,850 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;@46806227, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:04:51,850 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:04:51,852 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 16:04:51,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 16:04:51,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:04:51,857 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:51,857 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:04:51,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:04:51,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1522814032, now seen corresponding path program 1 times [2025-03-08 16:04:51,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:04:51,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [260957423] [2025-03-08 16:04:51,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:04:51,867 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:04:51,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:04:51,869 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:04:51,870 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:04:51,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 16:04:52,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 16:04:52,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:04:52,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:04:52,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:04:52,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:04:52,048 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-08 16:04:52,049 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:04:52,049 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:04:52,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [260957423] [2025-03-08 16:04:52,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [260957423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:04:52,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:04:52,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 16:04:52,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853730190] [2025-03-08 16:04:52,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:04:52,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:04:52,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:04:52,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:04:52,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:04:52,068 INFO L87 Difference]: Start difference. First operand has 40 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 16:04:52,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:04:52,080 INFO L93 Difference]: Finished difference Result 74 states and 114 transitions. [2025-03-08 16:04:52,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:04:52,081 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 66 [2025-03-08 16:04:52,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:04:52,085 INFO L225 Difference]: With dead ends: 74 [2025-03-08 16:04:52,085 INFO L226 Difference]: Without dead ends: 37 [2025-03-08 16:04:52,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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:04:52,090 INFO L435 NwaCegarLoop]: 50 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, 50 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:04:52,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:04:52,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-08 16:04:52,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-08 16:04:52,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 16:04:52,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2025-03-08 16:04:52,115 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 66 [2025-03-08 16:04:52,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:04:52,116 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2025-03-08 16:04:52,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 16:04:52,116 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2025-03-08 16:04:52,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 16:04:52,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:04:52,118 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:52,124 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:04:52,318 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:04:52,318 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:04:52,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:04:52,319 INFO L85 PathProgramCache]: Analyzing trace with hash 15383667, now seen corresponding path program 1 times [2025-03-08 16:04:52,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:04:52,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2066611623] [2025-03-08 16:04:52,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:04:52,320 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:04:52,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:04:52,322 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:04:52,324 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:04:52,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 16:04:52,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 16:04:52,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:04:52,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:04:52,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 16:04:52,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:04:52,932 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-08 16:04:52,932 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:04:53,054 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:04:53,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2066611623] [2025-03-08 16:04:53,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2066611623] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:04:53,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [213524424] [2025-03-08 16:04:53,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:04:53,055 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 16:04:53,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 16:04:53,059 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 16:04:53,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-03-08 16:04:53,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 16:04:53,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 16:04:53,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:04:53,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:04:53,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 16:04:53,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:04:53,458 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 16:04:53,458 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:04:53,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [213524424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:04:53,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:04:53,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2025-03-08 16:04:53,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377863126] [2025-03-08 16:04:53,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:04:53,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:04:53,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:04:53,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:04:53,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:04:53,460 INFO L87 Difference]: Start difference. First operand 37 states and 50 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:04:53,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:04:53,934 INFO L93 Difference]: Finished difference Result 96 states and 133 transitions. [2025-03-08 16:04:53,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:04:53,935 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 66 [2025-03-08 16:04:53,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:04:53,937 INFO L225 Difference]: With dead ends: 96 [2025-03-08 16:04:53,937 INFO L226 Difference]: Without dead ends: 62 [2025-03-08 16:04:53,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:04:53,938 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 64 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:04:53,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 179 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:04:53,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-08 16:04:53,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 37. [2025-03-08 16:04:53,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 16:04:53,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2025-03-08 16:04:53,944 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 66 [2025-03-08 16:04:53,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:04:53,946 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2025-03-08 16:04:53,946 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:04:53,946 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2025-03-08 16:04:53,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 16:04:53,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:04:53,948 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:53,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2025-03-08 16:04:54,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 16:04:54,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:04:54,349 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:04:54,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:04:54,350 INFO L85 PathProgramCache]: Analyzing trace with hash 44936339, now seen corresponding path program 1 times [2025-03-08 16:04:54,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:04:54,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1302875472] [2025-03-08 16:04:54,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:04:54,350 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:04:54,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:04:54,352 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:04:54,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-08 16:04:54,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 16:04:54,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 16:04:54,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:04:54,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:04:54,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 16:04:54,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:04:54,737 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-08 16:04:54,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:04:54,841 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:04:54,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1302875472] [2025-03-08 16:04:54,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1302875472] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:04:54,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1164493311] [2025-03-08 16:04:54,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:04:54,842 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 16:04:54,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 16:04:54,844 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 16:04:54,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-03-08 16:04:54,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 16:04:55,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 16:04:55,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:04:55,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:04:55,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 16:04:55,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:04:55,374 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-08 16:04:55,375 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:04:55,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1164493311] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:04:55,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 16:04:55,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2025-03-08 16:04:55,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141440832] [2025-03-08 16:04:55,453 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 16:04:55,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:04:55,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:04:55,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:04:55,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:04:55,455 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 16:04:56,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:04:56,133 INFO L93 Difference]: Finished difference Result 112 states and 144 transitions. [2025-03-08 16:04:56,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:04:56,138 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 66 [2025-03-08 16:04:56,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:04:56,139 INFO L225 Difference]: With dead ends: 112 [2025-03-08 16:04:56,139 INFO L226 Difference]: Without dead ends: 78 [2025-03-08 16:04:56,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2025-03-08 16:04:56,140 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 49 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 16:04:56,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 166 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 16:04:56,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-08 16:04:56,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 63. [2025-03-08 16:04:56,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 16:04:56,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 81 transitions. [2025-03-08 16:04:56,149 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 81 transitions. Word has length 66 [2025-03-08 16:04:56,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:04:56,149 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 81 transitions. [2025-03-08 16:04:56,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 16:04:56,149 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 81 transitions. [2025-03-08 16:04:56,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 16:04:56,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:04:56,150 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:56,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-08 16:04:56,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2025-03-08 16:04:56,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-08 16:04:56,554 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:04:56,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:04:56,555 INFO L85 PathProgramCache]: Analyzing trace with hash -151577166, now seen corresponding path program 1 times [2025-03-08 16:04:56,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:04:56,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1957966292] [2025-03-08 16:04:56,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:04:56,555 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:04:56,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:04:56,557 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:04:56,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-08 16:04:56,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 16:04:56,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 16:04:56,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:04:56,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:04:56,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 16:04:56,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:05:43,804 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 86 proven. 39 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 16:05:43,804 INFO L312 TraceCheckSpWp]: Computing backward predicates...