./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-50.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_fillercode_fillercodestructure_filler-pe-co_file-50.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 1d54cda1e1849769fc331dfdba9fcfb2e9b4fcf52bd0d43d6f8a699ed6598582 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 12:04:43,212 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 12:04:43,266 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 12:04:43,273 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 12:04:43,274 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 12:04:43,288 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 12:04:43,289 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 12:04:43,289 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 12:04:43,289 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 12:04:43,289 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 12:04:43,290 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 12:04:43,290 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 12:04:43,290 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 12:04:43,290 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 12:04:43,290 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 12:04:43,290 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 12:04:43,290 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 12:04:43,290 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 12:04:43,290 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 12:04:43,291 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 12:04:43,291 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 12:04:43,291 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 12:04:43,291 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 12:04:43,291 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 12:04:43,291 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 12:04:43,291 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 12:04:43,291 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 12:04:43,291 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 12:04:43,291 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 12:04:43,291 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 12:04:43,292 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 12:04:43,292 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 12:04:43,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:04:43,292 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 12:04:43,292 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 12:04:43,292 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 12:04:43,292 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 12:04:43,292 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 12:04:43,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 12:04:43,292 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 12:04:43,293 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 12:04:43,293 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 12:04:43,293 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 12:04:43,293 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 -> 1d54cda1e1849769fc331dfdba9fcfb2e9b4fcf52bd0d43d6f8a699ed6598582 [2025-03-08 12:04:43,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 12:04:43,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 12:04:43,537 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 12:04:43,538 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 12:04:43,539 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 12:04:43,540 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-50.i [2025-03-08 12:04:44,712 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb6e4cc7f/6aaf136d43024bd5b49390af6f7213ab/FLAG614991c43 [2025-03-08 12:04:44,992 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 12:04:44,992 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-50.i [2025-03-08 12:04:44,999 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb6e4cc7f/6aaf136d43024bd5b49390af6f7213ab/FLAG614991c43 [2025-03-08 12:04:45,014 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb6e4cc7f/6aaf136d43024bd5b49390af6f7213ab [2025-03-08 12:04:45,016 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 12:04:45,017 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 12:04:45,019 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 12:04:45,020 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 12:04:45,023 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 12:04:45,025 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:04:45" (1/1) ... [2025-03-08 12:04:45,026 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18f645dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:04:45, skipping insertion in model container [2025-03-08 12:04:45,027 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:04:45" (1/1) ... [2025-03-08 12:04:45,052 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 12:04:45,161 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-50.i[919,932] [2025-03-08 12:04:45,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:04:45,260 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 12:04:45,270 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-50.i[919,932] [2025-03-08 12:04:45,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:04:45,328 INFO L204 MainTranslator]: Completed translation [2025-03-08 12:04:45,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:04:45 WrapperNode [2025-03-08 12:04:45,330 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 12:04:45,330 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 12:04:45,331 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 12:04:45,331 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 12:04:45,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:04:45" (1/1) ... [2025-03-08 12:04:45,349 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:04:45" (1/1) ... [2025-03-08 12:04:45,390 INFO L138 Inliner]: procedures = 26, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 241 [2025-03-08 12:04:45,390 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 12:04:45,391 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 12:04:45,391 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 12:04:45,391 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 12:04:45,401 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:04:45" (1/1) ... [2025-03-08 12:04:45,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:04:45" (1/1) ... [2025-03-08 12:04:45,405 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:04:45" (1/1) ... [2025-03-08 12:04:45,432 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 12:04:45,435 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:04:45" (1/1) ... [2025-03-08 12:04:45,436 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:04:45" (1/1) ... [2025-03-08 12:04:45,447 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:04:45" (1/1) ... [2025-03-08 12:04:45,448 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:04:45" (1/1) ... [2025-03-08 12:04:45,449 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:04:45" (1/1) ... [2025-03-08 12:04:45,455 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:04:45" (1/1) ... [2025-03-08 12:04:45,457 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 12:04:45,458 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 12:04:45,458 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 12:04:45,458 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 12:04:45,459 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:04:45" (1/1) ... [2025-03-08 12:04:45,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:04:45,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:04:45,485 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 12:04:45,487 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 12:04:45,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 12:04:45,506 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 12:04:45,506 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 12:04:45,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 12:04:45,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 12:04:45,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 12:04:45,580 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 12:04:45,582 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 12:04:45,983 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-08 12:04:45,983 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 12:04:45,998 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 12:04:45,999 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-08 12:04:45,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:04:45 BoogieIcfgContainer [2025-03-08 12:04:45,999 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 12:04:46,002 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 12:04:46,002 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 12:04:46,005 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 12:04:46,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:04:45" (1/3) ... [2025-03-08 12:04:46,006 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4383e4b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:04:46, skipping insertion in model container [2025-03-08 12:04:46,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:04:45" (2/3) ... [2025-03-08 12:04:46,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4383e4b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:04:46, skipping insertion in model container [2025-03-08 12:04:46,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:04:45" (3/3) ... [2025-03-08 12:04:46,009 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-50.i [2025-03-08 12:04:46,021 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 12:04:46,023 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-50.i that has 2 procedures, 107 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 12:04:46,069 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 12:04:46,077 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;@4e3f37fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 12:04:46,077 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 12:04:46,080 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 69 states have (on average 1.3768115942028984) internal successors, (95), 70 states have internal predecessors, (95), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-08 12:04:46,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-08 12:04:46,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:04:46,096 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:04:46,096 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:04:46,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:04:46,101 INFO L85 PathProgramCache]: Analyzing trace with hash 479704144, now seen corresponding path program 1 times [2025-03-08 12:04:46,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:04:46,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756419552] [2025-03-08 12:04:46,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:04:46,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:04:46,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-08 12:04:46,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-08 12:04:46,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:04:46,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:04:46,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 2312 trivial. 0 not checked. [2025-03-08 12:04:46,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:04:46,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756419552] [2025-03-08 12:04:46,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756419552] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:04:46,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957682800] [2025-03-08 12:04:46,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:04:46,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:04:46,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:04:46,462 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 12:04:46,462 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 12:04:46,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-08 12:04:46,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-08 12:04:46,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:04:46,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:04:46,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 12:04:46,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:04:46,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 2312 trivial. 0 not checked. [2025-03-08 12:04:46,697 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:04:46,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957682800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:04:46,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 12:04:46,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 12:04:46,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336825710] [2025-03-08 12:04:46,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:04:46,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 12:04:46,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:04:46,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 12:04:46,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:04:46,720 INFO L87 Difference]: Start difference. First operand has 107 states, 69 states have (on average 1.3768115942028984) internal successors, (95), 70 states have internal predecessors, (95), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-08 12:04:46,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:04:46,743 INFO L93 Difference]: Finished difference Result 207 states and 359 transitions. [2025-03-08 12:04:46,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 12:04:46,745 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) Word has length 226 [2025-03-08 12:04:46,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:04:46,750 INFO L225 Difference]: With dead ends: 207 [2025-03-08 12:04:46,750 INFO L226 Difference]: Without dead ends: 103 [2025-03-08 12:04:46,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 227 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 12:04:46,757 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:04:46,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:04:46,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-08 12:04:46,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-03-08 12:04:46,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 66 states have internal predecessors, (87), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-08 12:04:46,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 157 transitions. [2025-03-08 12:04:46,799 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 157 transitions. Word has length 226 [2025-03-08 12:04:46,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:04:46,800 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 157 transitions. [2025-03-08 12:04:46,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-08 12:04:46,800 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 157 transitions. [2025-03-08 12:04:46,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-08 12:04:46,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:04:46,803 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:04:46,810 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 12:04:47,003 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 12:04:47,004 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:04:47,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:04:47,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1194738647, now seen corresponding path program 1 times [2025-03-08 12:04:47,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:04:47,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785128150] [2025-03-08 12:04:47,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:04:47,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:04:47,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-08 12:04:47,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-08 12:04:47,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:04:47,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:04:47,243 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-08 12:04:47,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:04:47,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785128150] [2025-03-08 12:04:47,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785128150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:04:47,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:04:47,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:04:47,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836083732] [2025-03-08 12:04:47,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:04:47,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:04:47,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:04:47,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:04:47,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:04:47,249 INFO L87 Difference]: Start difference. First operand 103 states and 157 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 12:04:47,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:04:47,282 INFO L93 Difference]: Finished difference Result 204 states and 313 transitions. [2025-03-08 12:04:47,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:04:47,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 226 [2025-03-08 12:04:47,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:04:47,287 INFO L225 Difference]: With dead ends: 204 [2025-03-08 12:04:47,287 INFO L226 Difference]: Without dead ends: 104 [2025-03-08 12:04:47,287 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 12:04:47,288 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:04:47,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 301 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:04:47,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-08 12:04:47,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-08 12:04:47,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 67 states have internal predecessors, (88), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-08 12:04:47,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 158 transitions. [2025-03-08 12:04:47,302 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 158 transitions. Word has length 226 [2025-03-08 12:04:47,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:04:47,303 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 158 transitions. [2025-03-08 12:04:47,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 12:04:47,304 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 158 transitions. [2025-03-08 12:04:47,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-08 12:04:47,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:04:47,309 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:04:47,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 12:04:47,309 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:04:47,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:04:47,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1645451696, now seen corresponding path program 1 times [2025-03-08 12:04:47,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:04:47,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902473132] [2025-03-08 12:04:47,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:04:47,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:04:47,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-08 12:04:47,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-08 12:04:47,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:04:47,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:04:47,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-08 12:04:47,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:04:47,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902473132] [2025-03-08 12:04:47,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902473132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:04:47,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:04:47,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:04:47,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819936642] [2025-03-08 12:04:47,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:04:47,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:04:47,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:04:47,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:04:47,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:04:47,552 INFO L87 Difference]: Start difference. First operand 104 states and 158 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 12:04:47,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:04:47,607 INFO L93 Difference]: Finished difference Result 271 states and 416 transitions. [2025-03-08 12:04:47,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:04:47,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 227 [2025-03-08 12:04:47,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:04:47,612 INFO L225 Difference]: With dead ends: 271 [2025-03-08 12:04:47,613 INFO L226 Difference]: Without dead ends: 170 [2025-03-08 12:04:47,614 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 12:04:47,614 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 134 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:04:47,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 351 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:04:47,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-08 12:04:47,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 104. [2025-03-08 12:04:47,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 67 states have (on average 1.2985074626865671) internal successors, (87), 67 states have internal predecessors, (87), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-08 12:04:47,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 157 transitions. [2025-03-08 12:04:47,633 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 157 transitions. Word has length 227 [2025-03-08 12:04:47,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:04:47,634 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 157 transitions. [2025-03-08 12:04:47,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 12:04:47,634 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 157 transitions. [2025-03-08 12:04:47,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-08 12:04:47,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:04:47,638 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:04:47,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 12:04:47,639 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:04:47,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:04:47,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1644528175, now seen corresponding path program 1 times [2025-03-08 12:04:47,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:04:47,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589252849] [2025-03-08 12:04:47,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:04:47,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:04:47,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-08 12:04:47,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-08 12:04:47,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:04:47,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:04:47,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-08 12:04:47,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:04:47,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589252849] [2025-03-08 12:04:47,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589252849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:04:47,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:04:47,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 12:04:47,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869887366] [2025-03-08 12:04:47,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:04:47,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 12:04:47,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:04:47,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 12:04:47,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 12:04:47,881 INFO L87 Difference]: Start difference. First operand 104 states and 157 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 12:04:48,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:04:48,101 INFO L93 Difference]: Finished difference Result 205 states and 311 transitions. [2025-03-08 12:04:48,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 12:04:48,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 227 [2025-03-08 12:04:48,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:04:48,105 INFO L225 Difference]: With dead ends: 205 [2025-03-08 12:04:48,105 INFO L226 Difference]: Without dead ends: 104 [2025-03-08 12:04:48,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:04:48,105 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 149 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 12:04:48,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 211 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 12:04:48,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-08 12:04:48,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-08 12:04:48,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 67 states have (on average 1.2835820895522387) internal successors, (86), 67 states have internal predecessors, (86), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-08 12:04:48,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 156 transitions. [2025-03-08 12:04:48,123 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 156 transitions. Word has length 227 [2025-03-08 12:04:48,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:04:48,123 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 156 transitions. [2025-03-08 12:04:48,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 12:04:48,123 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 156 transitions. [2025-03-08 12:04:48,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-08 12:04:48,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:04:48,125 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:04:48,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 12:04:48,125 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:04:48,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:04:48,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1805967250, now seen corresponding path program 1 times [2025-03-08 12:04:48,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:04:48,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278878897] [2025-03-08 12:04:48,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:04:48,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:04:48,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-08 12:04:48,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-08 12:04:48,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:04:48,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:04:51,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 69 proven. 129 refuted. 0 times theorem prover too weak. 2182 trivial. 0 not checked. [2025-03-08 12:04:51,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:04:51,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278878897] [2025-03-08 12:04:51,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278878897] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:04:51,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941864122] [2025-03-08 12:04:51,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:04:51,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:04:51,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:04:51,828 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 12:04:51,829 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 12:04:51,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-08 12:04:52,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-08 12:04:52,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:04:52,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:04:52,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-08 12:04:52,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:04:57,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1473 proven. 300 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2025-03-08 12:04:57,352 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:05:08,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 135 proven. 255 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2025-03-08 12:05:08,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941864122] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 12:05:08,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 12:05:08,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 20, 19] total 46 [2025-03-08 12:05:08,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139827044] [2025-03-08 12:05:08,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 12:05:08,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-08 12:05:08,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:05:08,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-08 12:05:08,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=450, Invalid=1620, Unknown=0, NotChecked=0, Total=2070 [2025-03-08 12:05:08,066 INFO L87 Difference]: Start difference. First operand 104 states and 156 transitions. Second operand has 46 states, 45 states have (on average 3.4) internal successors, (153), 45 states have internal predecessors, (153), 12 states have call successors, (91), 6 states have call predecessors, (91), 13 states have return successors, (91), 11 states have call predecessors, (91), 12 states have call successors, (91) [2025-03-08 12:05:15,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 12:05:19,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 12:05:27,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.33s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0]