./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c -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 a82391ebb044799bad480df1878c271ded14d474016d9ad90c3e7a554ae5460f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:30:18,279 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:30:18,328 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:30:18,334 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:30:18,335 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:30:18,356 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:30:18,357 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:30:18,357 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:30:18,357 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:30:18,357 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:30:18,358 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:30:18,358 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:30:18,358 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:30:18,358 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:30:18,358 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:30:18,358 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:30:18,358 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:30:18,358 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:30:18,358 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:30:18,358 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:30:18,358 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:30:18,359 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:30:18,359 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:30:18,359 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:30:18,359 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:30:18,359 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:30:18,359 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:30:18,359 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:30:18,359 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:30:18,359 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:30:18,359 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:30:18,359 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:30:18,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:30:18,359 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:30:18,359 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:30:18,359 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:30:18,359 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:30:18,359 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:30:18,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:30:18,359 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:30:18,359 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:30:18,359 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:30:18,359 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:30:18,360 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 -> a82391ebb044799bad480df1878c271ded14d474016d9ad90c3e7a554ae5460f [2025-03-16 19:30:18,580 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:30:18,587 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:30:18,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:30:18,591 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:30:18,591 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:30:18,593 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2025-03-16 19:30:19,733 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d60278fa/a439b307a1f74f91977153a604260685/FLAG1846b1d07 [2025-03-16 19:30:20,002 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:30:20,004 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2025-03-16 19:30:20,011 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d60278fa/a439b307a1f74f91977153a604260685/FLAG1846b1d07 [2025-03-16 19:30:20,300 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d60278fa/a439b307a1f74f91977153a604260685 [2025-03-16 19:30:20,302 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:30:20,303 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:30:20,304 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:30:20,304 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:30:20,307 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:30:20,307 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:30:20" (1/1) ... [2025-03-16 19:30:20,308 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30296b30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:30:20, skipping insertion in model container [2025-03-16 19:30:20,308 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:30:20" (1/1) ... [2025-03-16 19:30:20,321 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:30:20,450 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/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[4067,4080] [2025-03-16 19:30:20,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:30:20,479 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:30:20,506 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/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[4067,4080] [2025-03-16 19:30:20,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:30:20,533 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:30:20,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:30:20 WrapperNode [2025-03-16 19:30:20,534 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:30:20,535 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:30:20,535 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:30:20,535 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:30:20,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:30:20" (1/1) ... [2025-03-16 19:30:20,548 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:30:20" (1/1) ... [2025-03-16 19:30:20,567 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 295 [2025-03-16 19:30:20,567 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:30:20,568 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:30:20,568 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:30:20,568 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:30:20,579 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:30:20" (1/1) ... [2025-03-16 19:30:20,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:30:20" (1/1) ... [2025-03-16 19:30:20,585 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:30:20" (1/1) ... [2025-03-16 19:30:20,601 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-16 19:30:20,601 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:30:20" (1/1) ... [2025-03-16 19:30:20,601 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:30:20" (1/1) ... [2025-03-16 19:30:20,605 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:30:20" (1/1) ... [2025-03-16 19:30:20,605 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:30:20" (1/1) ... [2025-03-16 19:30:20,606 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:30:20" (1/1) ... [2025-03-16 19:30:20,607 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:30:20" (1/1) ... [2025-03-16 19:30:20,608 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:30:20,608 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:30:20,608 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:30:20,608 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:30:20,609 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:30:20" (1/1) ... [2025-03-16 19:30:20,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:30:20,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:30:20,634 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-16 19:30:20,636 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-16 19:30:20,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:30:20,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:30:20,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:30:20,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:30:20,727 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:30:20,728 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:30:20,980 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L308: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-16 19:30:20,980 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L203: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-16 19:30:20,980 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L353: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-16 19:30:20,980 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-16 19:30:20,980 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L156: havoc main_~node3__m3~0#1; [2025-03-16 19:30:20,980 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L141: havoc main_~node2__m2~0#1; [2025-03-16 19:30:20,980 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L125: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-16 19:30:20,993 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-03-16 19:30:20,994 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:30:21,001 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:30:21,001 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:30:21,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:30:21 BoogieIcfgContainer [2025-03-16 19:30:21,002 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:30:21,003 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:30:21,004 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:30:21,007 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:30:21,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:30:20" (1/3) ... [2025-03-16 19:30:21,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45fab6c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:30:21, skipping insertion in model container [2025-03-16 19:30:21,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:30:20" (2/3) ... [2025-03-16 19:30:21,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45fab6c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:30:21, skipping insertion in model container [2025-03-16 19:30:21,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:30:21" (3/3) ... [2025-03-16 19:30:21,009 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2025-03-16 19:30:21,020 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:30:21,021 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c that has 1 procedures, 61 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-16 19:30:21,063 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:30:21,074 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;@3f0def3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:30:21,074 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:30:21,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 59 states have (on average 1.728813559322034) internal successors, (102), 60 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:21,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-16 19:30:21,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:21,083 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:30:21,083 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:21,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:21,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1580752250, now seen corresponding path program 1 times [2025-03-16 19:30:21,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:21,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104310539] [2025-03-16 19:30:21,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:21,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:21,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-16 19:30:21,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-16 19:30:21,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:21,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:21,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:30:21,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:21,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104310539] [2025-03-16 19:30:21,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104310539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:21,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:21,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:30:21,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578157382] [2025-03-16 19:30:21,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:21,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:30:21,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:21,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:30:21,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:30:21,380 INFO L87 Difference]: Start difference. First operand has 61 states, 59 states have (on average 1.728813559322034) internal successors, (102), 60 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:21,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:21,414 INFO L93 Difference]: Finished difference Result 139 states and 223 transitions. [2025-03-16 19:30:21,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:30:21,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-16 19:30:21,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:21,423 INFO L225 Difference]: With dead ends: 139 [2025-03-16 19:30:21,423 INFO L226 Difference]: Without dead ends: 90 [2025-03-16 19:30:21,426 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-16 19:30:21,428 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 68 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:21,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 214 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:30:21,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-16 19:30:21,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2025-03-16 19:30:21,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.4827586206896552) internal successors, (129), 87 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:21,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 129 transitions. [2025-03-16 19:30:21,455 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 129 transitions. Word has length 35 [2025-03-16 19:30:21,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:21,455 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 129 transitions. [2025-03-16 19:30:21,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:21,456 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 129 transitions. [2025-03-16 19:30:21,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 19:30:21,456 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:21,457 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:30:21,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:30:21,457 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:21,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:21,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1047895779, now seen corresponding path program 1 times [2025-03-16 19:30:21,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:21,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001350071] [2025-03-16 19:30:21,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:21,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:21,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 19:30:21,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 19:30:21,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:21,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:21,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:30:21,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:21,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001350071] [2025-03-16 19:30:21,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001350071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:21,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:21,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:30:21,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996190755] [2025-03-16 19:30:21,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:21,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:30:21,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:21,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:30:21,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:30:21,578 INFO L87 Difference]: Start difference. First operand 88 states and 129 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:21,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:21,599 INFO L93 Difference]: Finished difference Result 212 states and 325 transitions. [2025-03-16 19:30:21,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:30:21,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-16 19:30:21,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:21,602 INFO L225 Difference]: With dead ends: 212 [2025-03-16 19:30:21,603 INFO L226 Difference]: Without dead ends: 142 [2025-03-16 19:30:21,603 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-16 19:30:21,603 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 48 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:21,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 181 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:30:21,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-16 19:30:21,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2025-03-16 19:30:21,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 1.5179856115107915) internal successors, (211), 139 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:21,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 211 transitions. [2025-03-16 19:30:21,615 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 211 transitions. Word has length 36 [2025-03-16 19:30:21,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:21,617 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 211 transitions. [2025-03-16 19:30:21,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:21,618 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 211 transitions. [2025-03-16 19:30:21,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-16 19:30:21,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:21,618 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:30:21,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:30:21,618 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:21,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:21,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1242730349, now seen corresponding path program 1 times [2025-03-16 19:30:21,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:21,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306533623] [2025-03-16 19:30:21,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:21,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:21,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 19:30:21,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 19:30:21,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:21,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:21,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:30:21,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:21,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306533623] [2025-03-16 19:30:21,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306533623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:21,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:21,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:30:21,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021227586] [2025-03-16 19:30:21,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:21,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:30:21,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:21,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:30:21,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:30:21,715 INFO L87 Difference]: Start difference. First operand 140 states and 211 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:21,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:21,734 INFO L93 Difference]: Finished difference Result 352 states and 545 transitions. [2025-03-16 19:30:21,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:30:21,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-16 19:30:21,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:21,735 INFO L225 Difference]: With dead ends: 352 [2025-03-16 19:30:21,735 INFO L226 Difference]: Without dead ends: 230 [2025-03-16 19:30:21,736 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-16 19:30:21,736 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 43 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:21,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 177 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:30:21,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-03-16 19:30:21,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2025-03-16 19:30:21,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.52863436123348) internal successors, (347), 227 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:21,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 347 transitions. [2025-03-16 19:30:21,746 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 347 transitions. Word has length 37 [2025-03-16 19:30:21,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:21,746 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 347 transitions. [2025-03-16 19:30:21,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:21,746 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 347 transitions. [2025-03-16 19:30:21,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-16 19:30:21,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:21,747 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:30:21,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:30:21,747 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:21,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:21,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1915283850, now seen corresponding path program 1 times [2025-03-16 19:30:21,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:21,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662088377] [2025-03-16 19:30:21,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:21,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:21,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-16 19:30:21,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-16 19:30:21,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:21,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:21,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:30:21,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:21,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662088377] [2025-03-16 19:30:21,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662088377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:21,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:21,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:30:21,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880076352] [2025-03-16 19:30:21,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:21,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:30:21,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:21,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:30:21,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:30:21,873 INFO L87 Difference]: Start difference. First operand 228 states and 347 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:21,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:21,994 INFO L93 Difference]: Finished difference Result 1488 states and 2321 transitions. [2025-03-16 19:30:21,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:30:21,996 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-16 19:30:21,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:22,004 INFO L225 Difference]: With dead ends: 1488 [2025-03-16 19:30:22,004 INFO L226 Difference]: Without dead ends: 1278 [2025-03-16 19:30:22,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:30:22,005 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 374 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:22,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 534 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:30:22,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2025-03-16 19:30:22,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 436. [2025-03-16 19:30:22,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 435 states have (on average 1.5149425287356322) internal successors, (659), 435 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:22,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 659 transitions. [2025-03-16 19:30:22,042 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 659 transitions. Word has length 38 [2025-03-16 19:30:22,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:22,047 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 659 transitions. [2025-03-16 19:30:22,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:22,047 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 659 transitions. [2025-03-16 19:30:22,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-16 19:30:22,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:22,047 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:30:22,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:30:22,048 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:22,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:22,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1914306701, now seen corresponding path program 1 times [2025-03-16 19:30:22,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:22,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914146485] [2025-03-16 19:30:22,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:22,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:22,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-16 19:30:22,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-16 19:30:22,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:22,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:22,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:30:22,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:22,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914146485] [2025-03-16 19:30:22,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914146485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:22,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:22,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:30:22,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456170226] [2025-03-16 19:30:22,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:22,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:30:22,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:22,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:30:22,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:30:22,139 INFO L87 Difference]: Start difference. First operand 436 states and 659 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:22,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:22,158 INFO L93 Difference]: Finished difference Result 1054 states and 1603 transitions. [2025-03-16 19:30:22,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:30:22,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-03-16 19:30:22,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:22,160 INFO L225 Difference]: With dead ends: 1054 [2025-03-16 19:30:22,160 INFO L226 Difference]: Without dead ends: 636 [2025-03-16 19:30:22,161 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-16 19:30:22,165 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 34 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:22,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 153 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:30:22,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2025-03-16 19:30:22,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 634. [2025-03-16 19:30:22,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 633 states have (on average 1.4992101105845181) internal successors, (949), 633 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:22,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 949 transitions. [2025-03-16 19:30:22,177 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 949 transitions. Word has length 40 [2025-03-16 19:30:22,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:22,177 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 949 transitions. [2025-03-16 19:30:22,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:22,178 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 949 transitions. [2025-03-16 19:30:22,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-16 19:30:22,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:22,180 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:30:22,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:30:22,180 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:22,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:22,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1913144852, now seen corresponding path program 1 times [2025-03-16 19:30:22,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:22,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129396808] [2025-03-16 19:30:22,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:22,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:22,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-16 19:30:22,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-16 19:30:22,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:22,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:22,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:30:22,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:22,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129396808] [2025-03-16 19:30:22,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129396808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:22,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:22,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:30:22,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462197062] [2025-03-16 19:30:22,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:22,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:30:22,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:22,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:30:22,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:30:22,356 INFO L87 Difference]: Start difference. First operand 634 states and 949 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:22,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:22,418 INFO L93 Difference]: Finished difference Result 1250 states and 1879 transitions. [2025-03-16 19:30:22,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:30:22,418 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-03-16 19:30:22,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:22,420 INFO L225 Difference]: With dead ends: 1250 [2025-03-16 19:30:22,420 INFO L226 Difference]: Without dead ends: 636 [2025-03-16 19:30:22,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:30:22,423 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 82 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:22,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 194 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:30:22,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2025-03-16 19:30:22,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 634. [2025-03-16 19:30:22,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 633 states have (on average 1.4802527646129542) internal successors, (937), 633 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:22,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 937 transitions. [2025-03-16 19:30:22,438 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 937 transitions. Word has length 40 [2025-03-16 19:30:22,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:22,439 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 937 transitions. [2025-03-16 19:30:22,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:22,440 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 937 transitions. [2025-03-16 19:30:22,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-16 19:30:22,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:22,455 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:30:22,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:30:22,456 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:22,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:22,457 INFO L85 PathProgramCache]: Analyzing trace with hash 823007099, now seen corresponding path program 1 times [2025-03-16 19:30:22,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:22,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653311858] [2025-03-16 19:30:22,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:22,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:22,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-16 19:30:22,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-16 19:30:22,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:22,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:22,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:30:22,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:22,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653311858] [2025-03-16 19:30:22,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653311858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:22,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:22,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:30:22,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021154857] [2025-03-16 19:30:22,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:22,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:30:22,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:22,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:30:22,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:30:22,635 INFO L87 Difference]: Start difference. First operand 634 states and 937 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:22,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:22,656 INFO L93 Difference]: Finished difference Result 668 states and 986 transitions. [2025-03-16 19:30:22,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:30:22,656 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-03-16 19:30:22,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:22,659 INFO L225 Difference]: With dead ends: 668 [2025-03-16 19:30:22,659 INFO L226 Difference]: Without dead ends: 666 [2025-03-16 19:30:22,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:30:22,659 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:22,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 300 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:30:22,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2025-03-16 19:30:22,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 666. [2025-03-16 19:30:22,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 665 states have (on average 1.4511278195488722) internal successors, (965), 665 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:22,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 965 transitions. [2025-03-16 19:30:22,672 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 965 transitions. Word has length 41 [2025-03-16 19:30:22,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:22,672 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 965 transitions. [2025-03-16 19:30:22,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:22,672 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 965 transitions. [2025-03-16 19:30:22,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-16 19:30:22,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:22,676 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:30:22,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:30:22,676 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:22,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:22,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1481788164, now seen corresponding path program 1 times [2025-03-16 19:30:22,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:22,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31145527] [2025-03-16 19:30:22,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:22,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:22,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 19:30:22,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 19:30:22,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:22,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:22,800 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 19:30:22,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:22,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31145527] [2025-03-16 19:30:22,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31145527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:22,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:22,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:30:22,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068096705] [2025-03-16 19:30:22,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:22,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:30:22,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:22,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:30:22,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:30:22,803 INFO L87 Difference]: Start difference. First operand 666 states and 965 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:22,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:22,864 INFO L93 Difference]: Finished difference Result 2538 states and 3697 transitions. [2025-03-16 19:30:22,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:30:22,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-03-16 19:30:22,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:22,871 INFO L225 Difference]: With dead ends: 2538 [2025-03-16 19:30:22,871 INFO L226 Difference]: Without dead ends: 2088 [2025-03-16 19:30:22,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:30:22,873 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 211 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:22,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 372 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:30:22,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2088 states. [2025-03-16 19:30:22,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2088 to 1214. [2025-03-16 19:30:22,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 1213 states have (on average 1.4484748557295961) internal successors, (1757), 1213 states have internal predecessors, (1757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:22,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1757 transitions. [2025-03-16 19:30:22,901 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1757 transitions. Word has length 59 [2025-03-16 19:30:22,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:22,901 INFO L471 AbstractCegarLoop]: Abstraction has 1214 states and 1757 transitions. [2025-03-16 19:30:22,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:22,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1757 transitions. [2025-03-16 19:30:22,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-16 19:30:22,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:22,902 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:30:22,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:30:22,902 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:22,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:22,903 INFO L85 PathProgramCache]: Analyzing trace with hash 669931676, now seen corresponding path program 1 times [2025-03-16 19:30:22,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:22,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313014169] [2025-03-16 19:30:22,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:22,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:22,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 19:30:22,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 19:30:22,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:22,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:22,990 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 19:30:22,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:22,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313014169] [2025-03-16 19:30:22,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313014169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:22,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:22,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:30:22,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108538122] [2025-03-16 19:30:22,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:22,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:30:22,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:22,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:30:22,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:30:22,991 INFO L87 Difference]: Start difference. First operand 1214 states and 1757 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:23,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:23,053 INFO L93 Difference]: Finished difference Result 3182 states and 4633 transitions. [2025-03-16 19:30:23,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:30:23,054 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-03-16 19:30:23,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:23,061 INFO L225 Difference]: With dead ends: 3182 [2025-03-16 19:30:23,061 INFO L226 Difference]: Without dead ends: 2536 [2025-03-16 19:30:23,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:30:23,062 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 212 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:23,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 355 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:30:23,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2536 states. [2025-03-16 19:30:23,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2536 to 2082. [2025-03-16 19:30:23,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2082 states, 2081 states have (on average 1.4459394521864488) internal successors, (3009), 2081 states have internal predecessors, (3009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:23,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 2082 states and 3009 transitions. [2025-03-16 19:30:23,101 INFO L78 Accepts]: Start accepts. Automaton has 2082 states and 3009 transitions. Word has length 59 [2025-03-16 19:30:23,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:23,102 INFO L471 AbstractCegarLoop]: Abstraction has 2082 states and 3009 transitions. [2025-03-16 19:30:23,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:23,102 INFO L276 IsEmpty]: Start isEmpty. Operand 2082 states and 3009 transitions. [2025-03-16 19:30:23,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-16 19:30:23,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:23,103 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:30:23,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:30:23,103 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:23,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:23,104 INFO L85 PathProgramCache]: Analyzing trace with hash 877775932, now seen corresponding path program 1 times [2025-03-16 19:30:23,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:23,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694015144] [2025-03-16 19:30:23,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:23,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:23,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 19:30:23,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 19:30:23,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:23,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:23,206 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 19:30:23,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:23,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694015144] [2025-03-16 19:30:23,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694015144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:23,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:23,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:30:23,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340651584] [2025-03-16 19:30:23,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:23,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:30:23,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:23,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:30:23,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:30:23,207 INFO L87 Difference]: Start difference. First operand 2082 states and 3009 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:23,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:23,273 INFO L93 Difference]: Finished difference Result 3826 states and 5565 transitions. [2025-03-16 19:30:23,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:30:23,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-03-16 19:30:23,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:23,282 INFO L225 Difference]: With dead ends: 3826 [2025-03-16 19:30:23,283 INFO L226 Difference]: Without dead ends: 3180 [2025-03-16 19:30:23,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:30:23,285 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 217 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:23,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 365 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:30:23,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3180 states. [2025-03-16 19:30:23,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3180 to 2726. [2025-03-16 19:30:23,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2726 states, 2725 states have (on average 1.4462385321100917) internal successors, (3941), 2725 states have internal predecessors, (3941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:23,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2726 states to 2726 states and 3941 transitions. [2025-03-16 19:30:23,337 INFO L78 Accepts]: Start accepts. Automaton has 2726 states and 3941 transitions. Word has length 59 [2025-03-16 19:30:23,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:23,338 INFO L471 AbstractCegarLoop]: Abstraction has 2726 states and 3941 transitions. [2025-03-16 19:30:23,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:23,338 INFO L276 IsEmpty]: Start isEmpty. Operand 2726 states and 3941 transitions. [2025-03-16 19:30:23,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-16 19:30:23,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:23,339 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:30:23,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:30:23,339 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:23,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:23,340 INFO L85 PathProgramCache]: Analyzing trace with hash -2018268354, now seen corresponding path program 1 times [2025-03-16 19:30:23,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:23,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103184797] [2025-03-16 19:30:23,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:23,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:23,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-16 19:30:23,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-16 19:30:23,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:23,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:23,556 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:30:23,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:23,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103184797] [2025-03-16 19:30:23,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103184797] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:30:23,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015718351] [2025-03-16 19:30:23,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:23,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:30:23,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:30:23,559 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-16 19:30:23,561 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-16 19:30:23,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-16 19:30:23,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-16 19:30:23,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:23,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:23,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-16 19:30:23,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:30:23,879 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:30:23,880 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:30:24,219 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:30:24,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015718351] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:30:24,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:30:24,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 17 [2025-03-16 19:30:24,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404910753] [2025-03-16 19:30:24,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:30:24,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-16 19:30:24,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:24,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-16 19:30:24,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:30:24,221 INFO L87 Difference]: Start difference. First operand 2726 states and 3941 transitions. Second operand has 17 states, 17 states have (on average 10.058823529411764) internal successors, (171), 17 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:27,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:27,225 INFO L93 Difference]: Finished difference Result 27773 states and 39985 transitions. [2025-03-16 19:30:27,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2025-03-16 19:30:27,226 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 10.058823529411764) internal successors, (171), 17 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-16 19:30:27,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:27,283 INFO L225 Difference]: With dead ends: 27773 [2025-03-16 19:30:27,283 INFO L226 Difference]: Without dead ends: 24747 [2025-03-16 19:30:27,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4994 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1902, Invalid=10754, Unknown=0, NotChecked=0, Total=12656 [2025-03-16 19:30:27,295 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 2347 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 2097 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2347 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 2187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 2097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:27,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2347 Valid, 1082 Invalid, 2187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 2097 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:30:27,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24747 states. [2025-03-16 19:30:27,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24747 to 20506. [2025-03-16 19:30:27,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20506 states, 20505 states have (on average 1.409704950012192) internal successors, (28906), 20505 states have internal predecessors, (28906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:27,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20506 states to 20506 states and 28906 transitions. [2025-03-16 19:30:27,667 INFO L78 Accepts]: Start accepts. Automaton has 20506 states and 28906 transitions. Word has length 60 [2025-03-16 19:30:27,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:27,667 INFO L471 AbstractCegarLoop]: Abstraction has 20506 states and 28906 transitions. [2025-03-16 19:30:27,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 10.058823529411764) internal successors, (171), 17 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:27,667 INFO L276 IsEmpty]: Start isEmpty. Operand 20506 states and 28906 transitions. [2025-03-16 19:30:27,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 19:30:27,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:27,668 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:30:27,675 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-16 19:30:27,873 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,SelfDestructingSolverStorable10 [2025-03-16 19:30:27,873 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:27,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:27,873 INFO L85 PathProgramCache]: Analyzing trace with hash 488033720, now seen corresponding path program 1 times [2025-03-16 19:30:27,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:27,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419300998] [2025-03-16 19:30:27,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:27,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:27,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 19:30:27,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 19:30:27,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:27,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:28,052 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:30:28,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:28,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419300998] [2025-03-16 19:30:28,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419300998] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:30:28,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982245891] [2025-03-16 19:30:28,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:28,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:30:28,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:30:28,054 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-16 19:30:28,056 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-16 19:30:28,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 19:30:28,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 19:30:28,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:28,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:28,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-16 19:30:28,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:30:28,981 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:30:28,981 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:30:29,602 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:30:29,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982245891] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:30:29,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:30:29,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 13] total 32 [2025-03-16 19:30:29,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760554235] [2025-03-16 19:30:29,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:30:29,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-16 19:30:29,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:29,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-16 19:30:29,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=927, Unknown=0, NotChecked=0, Total=1056 [2025-03-16 19:30:29,604 INFO L87 Difference]: Start difference. First operand 20506 states and 28906 transitions. Second operand has 33 states, 33 states have (on average 5.0606060606060606) internal successors, (167), 32 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:37,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:37,866 INFO L93 Difference]: Finished difference Result 274972 states and 387424 transitions. [2025-03-16 19:30:37,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2025-03-16 19:30:37,923 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 5.0606060606060606) internal successors, (167), 32 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-16 19:30:37,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:38,373 INFO L225 Difference]: With dead ends: 274972 [2025-03-16 19:30:38,373 INFO L226 Difference]: Without dead ends: 254486 [2025-03-16 19:30:38,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22430 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=7657, Invalid=48275, Unknown=0, NotChecked=0, Total=55932 [2025-03-16 19:30:38,421 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 9365 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 1723 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9365 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 1866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 1723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:38,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9365 Valid, 1022 Invalid, 1866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 1723 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:30:38,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254486 states. [2025-03-16 19:30:40,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254486 to 130961. [2025-03-16 19:30:40,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130961 states, 130960 states have (on average 1.3789324984728162) internal successors, (180585), 130960 states have internal predecessors, (180585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:40,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130961 states to 130961 states and 180585 transitions. [2025-03-16 19:30:40,983 INFO L78 Accepts]: Start accepts. Automaton has 130961 states and 180585 transitions. Word has length 61 [2025-03-16 19:30:40,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:40,983 INFO L471 AbstractCegarLoop]: Abstraction has 130961 states and 180585 transitions. [2025-03-16 19:30:40,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 5.0606060606060606) internal successors, (167), 32 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:40,984 INFO L276 IsEmpty]: Start isEmpty. Operand 130961 states and 180585 transitions. [2025-03-16 19:30:40,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 19:30:40,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:40,986 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:30:40,992 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-16 19:30:41,186 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-16 19:30:41,186 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:41,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:41,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1274581566, now seen corresponding path program 1 times [2025-03-16 19:30:41,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:41,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282789071] [2025-03-16 19:30:41,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:41,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:41,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 19:30:41,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 19:30:41,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:41,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:41,211 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 19:30:41,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:41,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282789071] [2025-03-16 19:30:41,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282789071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:41,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:41,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:30:41,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134757326] [2025-03-16 19:30:41,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:41,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:30:41,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:41,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:30:41,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:30:41,213 INFO L87 Difference]: Start difference. First operand 130961 states and 180585 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:41,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:41,746 INFO L93 Difference]: Finished difference Result 208514 states and 287902 transitions. [2025-03-16 19:30:41,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:30:41,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-16 19:30:41,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:41,825 INFO L225 Difference]: With dead ends: 208514 [2025-03-16 19:30:41,825 INFO L226 Difference]: Without dead ends: 77573 [2025-03-16 19:30:41,864 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-16 19:30:41,865 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 57 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:41,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 104 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:30:41,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77573 states. [2025-03-16 19:30:42,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77573 to 77573. [2025-03-16 19:30:42,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77573 states, 77572 states have (on average 1.3569715876862785) internal successors, (105263), 77572 states have internal predecessors, (105263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:42,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77573 states to 77573 states and 105263 transitions. [2025-03-16 19:30:42,730 INFO L78 Accepts]: Start accepts. Automaton has 77573 states and 105263 transitions. Word has length 62 [2025-03-16 19:30:42,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:42,730 INFO L471 AbstractCegarLoop]: Abstraction has 77573 states and 105263 transitions. [2025-03-16 19:30:42,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:42,730 INFO L276 IsEmpty]: Start isEmpty. Operand 77573 states and 105263 transitions. [2025-03-16 19:30:42,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 19:30:42,731 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:42,731 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:30:42,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:30:42,732 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:42,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:42,732 INFO L85 PathProgramCache]: Analyzing trace with hash -30103056, now seen corresponding path program 1 times [2025-03-16 19:30:42,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:42,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974949184] [2025-03-16 19:30:42,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:42,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:42,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 19:30:42,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 19:30:42,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:42,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:43,816 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:30:43,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:43,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974949184] [2025-03-16 19:30:43,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974949184] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:30:43,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49895653] [2025-03-16 19:30:43,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:43,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:30:43,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:30:43,818 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:30:43,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 19:30:43,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 19:30:43,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 19:30:43,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:43,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:43,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-16 19:30:43,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:30:45,662 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:30:45,663 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:30:46,675 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:30:46,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49895653] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:30:46,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:30:46,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17, 16] total 52 [2025-03-16 19:30:46,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706416062] [2025-03-16 19:30:46,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:30:46,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-16 19:30:46,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:46,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-16 19:30:46,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=2437, Unknown=0, NotChecked=0, Total=2652 [2025-03-16 19:30:46,677 INFO L87 Difference]: Start difference. First operand 77573 states and 105263 transitions. Second operand has 52 states, 52 states have (on average 3.326923076923077) internal successors, (173), 52 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:24,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:24,320 INFO L93 Difference]: Finished difference Result 403414 states and 540109 transitions. [2025-03-16 19:31:24,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 389 states. [2025-03-16 19:31:24,321 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.326923076923077) internal successors, (173), 52 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-16 19:31:24,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:24,787 INFO L225 Difference]: With dead ends: 403414 [2025-03-16 19:31:24,787 INFO L226 Difference]: Without dead ends: 344513 [2025-03-16 19:31:24,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 435 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84912 ImplicationChecksByTransitivity, 35.3s TimeCoverageRelationStatistics Valid=29155, Invalid=161377, Unknown=0, NotChecked=0, Total=190532 [2025-03-16 19:31:24,944 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 8808 mSDsluCounter, 3843 mSDsCounter, 0 mSdLazyCounter, 4469 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8808 SdHoareTripleChecker+Valid, 3949 SdHoareTripleChecker+Invalid, 4570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 4469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:24,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8808 Valid, 3949 Invalid, 4570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 4469 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-16 19:31:25,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344513 states. [2025-03-16 19:31:27,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344513 to 173161. [2025-03-16 19:31:27,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173161 states, 173160 states have (on average 1.3522349272349272) internal successors, (234153), 173160 states have internal predecessors, (234153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:28,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173161 states to 173161 states and 234153 transitions. [2025-03-16 19:31:28,120 INFO L78 Accepts]: Start accepts. Automaton has 173161 states and 234153 transitions. Word has length 62 [2025-03-16 19:31:28,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:28,120 INFO L471 AbstractCegarLoop]: Abstraction has 173161 states and 234153 transitions. [2025-03-16 19:31:28,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.326923076923077) internal successors, (173), 52 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:28,121 INFO L276 IsEmpty]: Start isEmpty. Operand 173161 states and 234153 transitions. [2025-03-16 19:31:28,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 19:31:28,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:28,122 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:31:28,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 19:31:28,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:31:28,323 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:31:28,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:28,325 INFO L85 PathProgramCache]: Analyzing trace with hash 760410619, now seen corresponding path program 1 times [2025-03-16 19:31:28,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:28,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737949044] [2025-03-16 19:31:28,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:28,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:28,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 19:31:28,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 19:31:28,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:28,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:28,354 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 19:31:28,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:28,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737949044] [2025-03-16 19:31:28,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737949044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:28,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:28,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:31:28,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138776449] [2025-03-16 19:31:28,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:28,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:31:28,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:28,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:31:28,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:31:28,355 INFO L87 Difference]: Start difference. First operand 173161 states and 234153 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:28,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:28,933 INFO L93 Difference]: Finished difference Result 313106 states and 423890 transitions. [2025-03-16 19:31:28,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:31:28,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-16 19:31:28,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:29,108 INFO L225 Difference]: With dead ends: 313106 [2025-03-16 19:31:29,109 INFO L226 Difference]: Without dead ends: 139965 [2025-03-16 19:31:29,209 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-16 19:31:29,209 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 51 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:29,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 89 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:31:29,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139965 states. [2025-03-16 19:31:30,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139965 to 139965. [2025-03-16 19:31:30,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139965 states, 139964 states have (on average 1.3349004029607614) internal successors, (186838), 139964 states have internal predecessors, (186838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:30,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139965 states to 139965 states and 186838 transitions. [2025-03-16 19:31:30,981 INFO L78 Accepts]: Start accepts. Automaton has 139965 states and 186838 transitions. Word has length 63 [2025-03-16 19:31:30,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:30,981 INFO L471 AbstractCegarLoop]: Abstraction has 139965 states and 186838 transitions. [2025-03-16 19:31:30,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:30,981 INFO L276 IsEmpty]: Start isEmpty. Operand 139965 states and 186838 transitions. [2025-03-16 19:31:30,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 19:31:30,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:30,982 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:31:30,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:31:30,982 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:31:30,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:30,983 INFO L85 PathProgramCache]: Analyzing trace with hash 538553745, now seen corresponding path program 1 times [2025-03-16 19:31:30,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:30,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300340037] [2025-03-16 19:31:30,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:30,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:30,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 19:31:30,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 19:31:30,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:30,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:31,007 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 19:31:31,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:31,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300340037] [2025-03-16 19:31:31,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300340037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:31,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:31,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:31:31,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162578347] [2025-03-16 19:31:31,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:31,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:31:31,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:31,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:31:31,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:31:31,009 INFO L87 Difference]: Start difference. First operand 139965 states and 186838 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:31,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:31,692 INFO L93 Difference]: Finished difference Result 268959 states and 359274 transitions. [2025-03-16 19:31:31,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:31:31,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-16 19:31:31,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:31,830 INFO L225 Difference]: With dead ends: 268959 [2025-03-16 19:31:31,830 INFO L226 Difference]: Without dead ends: 129014 [2025-03-16 19:31:31,903 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-16 19:31:31,904 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 45 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:31,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 72 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:31:31,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129014 states. [2025-03-16 19:31:33,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129014 to 129014. [2025-03-16 19:31:33,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129014 states, 129013 states have (on average 1.3182625006782263) internal successors, (170073), 129013 states have internal predecessors, (170073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:33,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129014 states to 129014 states and 170073 transitions. [2025-03-16 19:31:33,630 INFO L78 Accepts]: Start accepts. Automaton has 129014 states and 170073 transitions. Word has length 64 [2025-03-16 19:31:33,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:33,631 INFO L471 AbstractCegarLoop]: Abstraction has 129014 states and 170073 transitions. [2025-03-16 19:31:33,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:33,631 INFO L276 IsEmpty]: Start isEmpty. Operand 129014 states and 170073 transitions. [2025-03-16 19:31:33,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-16 19:31:33,633 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:33,633 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:31:33,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:31:33,633 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:31:33,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:33,634 INFO L85 PathProgramCache]: Analyzing trace with hash 863450332, now seen corresponding path program 1 times [2025-03-16 19:31:33,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:33,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481060165] [2025-03-16 19:31:33,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:33,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:33,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 19:31:33,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 19:31:33,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:33,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:33,680 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 19:31:33,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:33,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481060165] [2025-03-16 19:31:33,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481060165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:33,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:33,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:31:33,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577503422] [2025-03-16 19:31:33,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:33,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:31:33,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:33,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:31:33,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:31:33,682 INFO L87 Difference]: Start difference. First operand 129014 states and 170073 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)