./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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.UNBOUNDED.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 17c1b3adab900925d0968acf284c9fae9bc7d0ec39197e53dc7bd6b93c5a8558 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:11:42,415 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:11:42,468 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:11:42,474 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:11:42,475 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:11:42,488 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:11:42,488 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:11:42,489 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:11:42,489 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:11:42,489 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:11:42,489 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:11:42,489 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:11:42,489 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:11:42,489 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:11:42,489 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:11:42,489 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:11:42,489 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:11:42,489 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:11:42,489 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:11:42,490 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:11:42,490 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:11:42,490 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:11:42,490 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:11:42,490 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:11:42,490 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:11:42,490 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:11:42,490 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:11:42,490 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:11:42,490 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:11:42,490 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:11:42,490 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:11:42,490 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:11:42,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:11:42,490 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:11:42,490 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:11:42,491 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:11:42,491 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:11:42,491 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:11:42,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:11:42,491 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:11:42,491 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:11:42,491 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:11:42,491 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:11:42,491 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 -> 17c1b3adab900925d0968acf284c9fae9bc7d0ec39197e53dc7bd6b93c5a8558 [2025-03-03 15:11:42,722 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:11:42,729 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:11:42,731 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:11:42,732 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:11:42,732 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:11:42,733 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.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-03 15:11:43,876 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8803bd60f/c3459142885b468da902c89a79ae9638/FLAG0a4b7779d [2025-03-03 15:11:44,134 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:11:44,134 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-03 15:11:44,140 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8803bd60f/c3459142885b468da902c89a79ae9638/FLAG0a4b7779d [2025-03-03 15:11:44,446 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8803bd60f/c3459142885b468da902c89a79ae9638 [2025-03-03 15:11:44,448 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:11:44,449 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:11:44,450 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:11:44,450 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:11:44,452 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:11:44,453 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:11:44" (1/1) ... [2025-03-03 15:11:44,453 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18185998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:11:44, skipping insertion in model container [2025-03-03 15:11:44,454 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:11:44" (1/1) ... [2025-03-03 15:11:44,469 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:11:44,578 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.UNBOUNDED.pals.c.v+cfa-reducer.c[4105,4118] [2025-03-03 15:11:44,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:11:44,606 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:11:44,629 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.UNBOUNDED.pals.c.v+cfa-reducer.c[4105,4118] [2025-03-03 15:11:44,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:11:44,648 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:11:44,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:11:44 WrapperNode [2025-03-03 15:11:44,649 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:11:44,649 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:11:44,649 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:11:44,649 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:11:44,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:11:44" (1/1) ... [2025-03-03 15:11:44,658 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:11:44" (1/1) ... [2025-03-03 15:11:44,676 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 290 [2025-03-03 15:11:44,676 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:11:44,676 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:11:44,676 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:11:44,676 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:11:44,683 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:11:44" (1/1) ... [2025-03-03 15:11:44,683 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:11:44" (1/1) ... [2025-03-03 15:11:44,688 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:11:44" (1/1) ... [2025-03-03 15:11:44,699 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 15:11:44,700 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:11:44" (1/1) ... [2025-03-03 15:11:44,700 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:11:44" (1/1) ... [2025-03-03 15:11:44,705 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:11:44" (1/1) ... [2025-03-03 15:11:44,706 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:11:44" (1/1) ... [2025-03-03 15:11:44,707 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:11:44" (1/1) ... [2025-03-03 15:11:44,708 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:11:44" (1/1) ... [2025-03-03 15:11:44,709 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:11:44,712 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:11:44,713 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:11:44,713 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:11:44,714 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:11:44" (1/1) ... [2025-03-03 15:11:44,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:11:44,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:11:44,742 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-03 15:11:44,745 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-03 15:11:44,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:11:44,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:11:44,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:11:44,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:11:44,842 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:11:44,843 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:11:45,107 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L308: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-03 15:11:45,107 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L143: havoc main_~node2__m2~0#1; [2025-03-03 15:11:45,108 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L358: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-03 15:11:45,108 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L194: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-03 15:11:45,108 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-03 15:11:45,108 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L123: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-03 15:11:45,108 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L158: havoc main_~node3__m3~0#1; [2025-03-03 15:11:45,132 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2025-03-03 15:11:45,132 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:11:45,144 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:11:45,145 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:11:45,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:11:45 BoogieIcfgContainer [2025-03-03 15:11:45,146 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:11:45,150 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:11:45,150 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:11:45,153 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:11:45,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:11:44" (1/3) ... [2025-03-03 15:11:45,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd03162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:11:45, skipping insertion in model container [2025-03-03 15:11:45,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:11:44" (2/3) ... [2025-03-03 15:11:45,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd03162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:11:45, skipping insertion in model container [2025-03-03 15:11:45,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:11:45" (3/3) ... [2025-03-03 15:11:45,155 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-03 15:11:45,166 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:11:45,167 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c that has 1 procedures, 64 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 15:11:45,204 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:11:45,214 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;@20b2ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:11:45,215 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 15:11:45,218 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 62 states have (on average 1.6935483870967742) internal successors, (105), 63 states have internal predecessors, (105), 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-03 15:11:45,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 15:11:45,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:45,223 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-03 15:11:45,223 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:11:45,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:45,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1344899626, now seen corresponding path program 1 times [2025-03-03 15:11:45,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:45,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773026037] [2025-03-03 15:11:45,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:45,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:45,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 15:11:45,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 15:11:45,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:45,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:45,504 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-03 15:11:45,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:45,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773026037] [2025-03-03 15:11:45,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773026037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:45,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:45,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:11:45,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218914416] [2025-03-03 15:11:45,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:45,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:11:45,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:45,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:11:45,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:11:45,526 INFO L87 Difference]: Start difference. First operand has 64 states, 62 states have (on average 1.6935483870967742) internal successors, (105), 63 states have internal predecessors, (105), 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 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-03 15:11:45,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:45,568 INFO L93 Difference]: Finished difference Result 146 states and 230 transitions. [2025-03-03 15:11:45,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:11:45,570 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-03 15:11:45,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:45,576 INFO L225 Difference]: With dead ends: 146 [2025-03-03 15:11:45,577 INFO L226 Difference]: Without dead ends: 95 [2025-03-03 15:11:45,579 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-03 15:11:45,583 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 61 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:45,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 211 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:11:45,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-03 15:11:45,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2025-03-03 15:11:45,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.4782608695652173) internal successors, (136), 92 states have internal predecessors, (136), 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-03 15:11:45,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 136 transitions. [2025-03-03 15:11:45,614 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 136 transitions. Word has length 37 [2025-03-03 15:11:45,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:45,614 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 136 transitions. [2025-03-03 15:11:45,614 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-03 15:11:45,614 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 136 transitions. [2025-03-03 15:11:45,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 15:11:45,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:45,615 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-03 15:11:45,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:11:45,615 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:11:45,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:45,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1859915076, now seen corresponding path program 1 times [2025-03-03 15:11:45,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:45,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713062185] [2025-03-03 15:11:45,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:45,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:45,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 15:11:45,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 15:11:45,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:45,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:45,731 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-03 15:11:45,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:45,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713062185] [2025-03-03 15:11:45,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713062185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:45,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:45,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:11:45,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133004561] [2025-03-03 15:11:45,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:45,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:11:45,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:45,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:11:45,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:11:45,733 INFO L87 Difference]: Start difference. First operand 93 states and 136 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 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-03 15:11:45,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:45,759 INFO L93 Difference]: Finished difference Result 225 states and 344 transitions. [2025-03-03 15:11:45,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:11:45,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 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-03 15:11:45,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:45,760 INFO L225 Difference]: With dead ends: 225 [2025-03-03 15:11:45,760 INFO L226 Difference]: Without dead ends: 151 [2025-03-03 15:11:45,761 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-03 15:11:45,761 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 46 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:45,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 176 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:11:45,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-03 15:11:45,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2025-03-03 15:11:45,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 1.5135135135135136) internal successors, (224), 148 states have internal predecessors, (224), 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-03 15:11:45,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 224 transitions. [2025-03-03 15:11:45,770 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 224 transitions. Word has length 38 [2025-03-03 15:11:45,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:45,770 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 224 transitions. [2025-03-03 15:11:45,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 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-03 15:11:45,770 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 224 transitions. [2025-03-03 15:11:45,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 15:11:45,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:45,774 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] [2025-03-03 15:11:45,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:11:45,774 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:11:45,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:45,775 INFO L85 PathProgramCache]: Analyzing trace with hash -37573565, now seen corresponding path program 1 times [2025-03-03 15:11:45,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:45,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446553499] [2025-03-03 15:11:45,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:45,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:45,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 15:11:45,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 15:11:45,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:45,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:45,933 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-03 15:11:45,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:45,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446553499] [2025-03-03 15:11:45,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446553499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:45,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:45,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:11:45,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636657564] [2025-03-03 15:11:45,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:45,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:11:45,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:45,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:11:45,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:11:45,934 INFO L87 Difference]: Start difference. First operand 149 states and 224 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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-03 15:11:46,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:46,070 INFO L93 Difference]: Finished difference Result 929 states and 1454 transitions. [2025-03-03 15:11:46,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:11:46,071 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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 39 [2025-03-03 15:11:46,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:46,074 INFO L225 Difference]: With dead ends: 929 [2025-03-03 15:11:46,077 INFO L226 Difference]: Without dead ends: 799 [2025-03-03 15:11:46,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:11:46,079 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 368 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:46,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 611 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:11:46,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2025-03-03 15:11:46,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 277. [2025-03-03 15:11:46,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.5217391304347827) internal successors, (420), 276 states have internal predecessors, (420), 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-03 15:11:46,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 420 transitions. [2025-03-03 15:11:46,108 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 420 transitions. Word has length 39 [2025-03-03 15:11:46,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:46,108 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 420 transitions. [2025-03-03 15:11:46,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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-03 15:11:46,108 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 420 transitions. [2025-03-03 15:11:46,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-03 15:11:46,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:46,109 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-03 15:11:46,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:11:46,109 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:11:46,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:46,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1709576148, now seen corresponding path program 1 times [2025-03-03 15:11:46,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:46,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484996561] [2025-03-03 15:11:46,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:46,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:46,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-03 15:11:46,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-03 15:11:46,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:46,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:46,231 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-03 15:11:46,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:46,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484996561] [2025-03-03 15:11:46,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484996561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:46,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:46,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:11:46,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767189468] [2025-03-03 15:11:46,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:46,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:11:46,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:46,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:11:46,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:11:46,232 INFO L87 Difference]: Start difference. First operand 277 states and 420 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 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-03 15:11:46,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:46,256 INFO L93 Difference]: Finished difference Result 749 states and 1146 transitions. [2025-03-03 15:11:46,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:11:46,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 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-03 15:11:46,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:46,258 INFO L225 Difference]: With dead ends: 749 [2025-03-03 15:11:46,258 INFO L226 Difference]: Without dead ends: 491 [2025-03-03 15:11:46,259 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-03 15:11:46,259 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 36 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:46,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 141 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:11:46,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2025-03-03 15:11:46,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 481. [2025-03-03 15:11:46,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 480 states have (on average 1.4916666666666667) internal successors, (716), 480 states have internal predecessors, (716), 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-03 15:11:46,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 716 transitions. [2025-03-03 15:11:46,279 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 716 transitions. Word has length 41 [2025-03-03 15:11:46,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:46,280 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 716 transitions. [2025-03-03 15:11:46,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 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-03 15:11:46,280 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 716 transitions. [2025-03-03 15:11:46,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-03 15:11:46,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:46,281 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-03 15:11:46,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:11:46,281 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:11:46,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:46,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1708414299, now seen corresponding path program 1 times [2025-03-03 15:11:46,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:46,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454163718] [2025-03-03 15:11:46,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:46,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:46,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-03 15:11:46,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-03 15:11:46,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:46,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:46,456 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-03 15:11:46,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:46,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454163718] [2025-03-03 15:11:46,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454163718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:46,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:46,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:11:46,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071892848] [2025-03-03 15:11:46,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:46,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:11:46,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:46,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:11:46,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:11:46,457 INFO L87 Difference]: Start difference. First operand 481 states and 716 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-03 15:11:46,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:46,515 INFO L93 Difference]: Finished difference Result 945 states and 1414 transitions. [2025-03-03 15:11:46,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:11:46,515 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-03 15:11:46,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:46,517 INFO L225 Difference]: With dead ends: 945 [2025-03-03 15:11:46,517 INFO L226 Difference]: Without dead ends: 483 [2025-03-03 15:11:46,517 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-03 15:11:46,518 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 46 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:46,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 267 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:11:46,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2025-03-03 15:11:46,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 481. [2025-03-03 15:11:46,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 480 states have (on average 1.475) internal successors, (708), 480 states have internal predecessors, (708), 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-03 15:11:46,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 708 transitions. [2025-03-03 15:11:46,528 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 708 transitions. Word has length 41 [2025-03-03 15:11:46,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:46,528 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 708 transitions. [2025-03-03 15:11:46,528 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-03 15:11:46,528 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 708 transitions. [2025-03-03 15:11:46,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-03 15:11:46,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:46,530 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, 1] [2025-03-03 15:11:46,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:11:46,530 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:11:46,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:46,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1420280412, now seen corresponding path program 1 times [2025-03-03 15:11:46,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:46,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729287909] [2025-03-03 15:11:46,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:46,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:46,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-03 15:11:46,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-03 15:11:46,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:46,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:46,760 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-03 15:11:46,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:46,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729287909] [2025-03-03 15:11:46,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729287909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:46,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:46,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:11:46,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681752905] [2025-03-03 15:11:46,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:46,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:11:46,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:46,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:11:46,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:11:46,761 INFO L87 Difference]: Start difference. First operand 481 states and 708 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-03 15:11:46,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:46,782 INFO L93 Difference]: Finished difference Result 499 states and 733 transitions. [2025-03-03 15:11:46,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:11:46,783 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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 42 [2025-03-03 15:11:46,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:46,784 INFO L225 Difference]: With dead ends: 499 [2025-03-03 15:11:46,784 INFO L226 Difference]: Without dead ends: 497 [2025-03-03 15:11:46,785 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-03 15:11:46,785 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:46,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 317 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:11:46,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-03-03 15:11:46,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 497. [2025-03-03 15:11:46,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 496 states have (on average 1.4516129032258065) internal successors, (720), 496 states have internal predecessors, (720), 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-03 15:11:46,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 720 transitions. [2025-03-03 15:11:46,796 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 720 transitions. Word has length 42 [2025-03-03 15:11:46,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:46,797 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 720 transitions. [2025-03-03 15:11:46,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-03 15:11:46,797 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 720 transitions. [2025-03-03 15:11:46,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-03 15:11:46,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:46,798 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, 1] [2025-03-03 15:11:46,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:11:46,798 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:11:46,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:46,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1539887404, now seen corresponding path program 1 times [2025-03-03 15:11:46,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:46,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705803762] [2025-03-03 15:11:46,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:46,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:46,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-03 15:11:46,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-03 15:11:46,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:46,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:46,840 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-03 15:11:46,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:46,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705803762] [2025-03-03 15:11:46,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705803762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:46,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:46,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:11:46,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944719620] [2025-03-03 15:11:46,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:46,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:11:46,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:46,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:11:46,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:11:46,841 INFO L87 Difference]: Start difference. First operand 497 states and 720 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-03 15:11:46,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:46,856 INFO L93 Difference]: Finished difference Result 968 states and 1422 transitions. [2025-03-03 15:11:46,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:11:46,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 42 [2025-03-03 15:11:46,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:46,858 INFO L225 Difference]: With dead ends: 968 [2025-03-03 15:11:46,858 INFO L226 Difference]: Without dead ends: 693 [2025-03-03 15:11:46,858 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-03 15:11:46,859 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 53 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:46,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 188 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:11:46,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2025-03-03 15:11:46,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 691. [2025-03-03 15:11:46,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 690 states have (on average 1.4463768115942028) internal successors, (998), 690 states have internal predecessors, (998), 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-03 15:11:46,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 998 transitions. [2025-03-03 15:11:46,877 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 998 transitions. Word has length 42 [2025-03-03 15:11:46,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:46,877 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 998 transitions. [2025-03-03 15:11:46,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-03 15:11:46,877 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 998 transitions. [2025-03-03 15:11:46,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 15:11:46,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:46,878 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 15:11:46,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:11:46,878 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:11:46,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:46,878 INFO L85 PathProgramCache]: Analyzing trace with hash 547068278, now seen corresponding path program 1 times [2025-03-03 15:11:46,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:46,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498650622] [2025-03-03 15:11:46,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:46,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:46,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 15:11:46,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 15:11:46,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:46,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:47,010 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 15:11:47,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:47,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498650622] [2025-03-03 15:11:47,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498650622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:47,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:47,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:11:47,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176433555] [2025-03-03 15:11:47,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:47,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:11:47,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:47,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:11:47,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:11:47,012 INFO L87 Difference]: Start difference. First operand 691 states and 998 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-03 15:11:47,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:47,078 INFO L93 Difference]: Finished difference Result 2835 states and 4114 transitions. [2025-03-03 15:11:47,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:11:47,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-03 15:11:47,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:47,085 INFO L225 Difference]: With dead ends: 2835 [2025-03-03 15:11:47,085 INFO L226 Difference]: Without dead ends: 2165 [2025-03-03 15:11:47,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-03 15:11:47,087 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 224 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:47,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 379 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:11:47,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2165 states. [2025-03-03 15:11:47,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2165 to 1359. [2025-03-03 15:11:47,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1359 states, 1358 states have (on average 1.4447717231222386) internal successors, (1962), 1358 states have internal predecessors, (1962), 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-03 15:11:47,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 1962 transitions. [2025-03-03 15:11:47,114 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 1962 transitions. Word has length 61 [2025-03-03 15:11:47,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:47,114 INFO L471 AbstractCegarLoop]: Abstraction has 1359 states and 1962 transitions. [2025-03-03 15:11:47,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-03 15:11:47,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 1962 transitions. [2025-03-03 15:11:47,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 15:11:47,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:47,115 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 15:11:47,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:11:47,115 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:11:47,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:47,116 INFO L85 PathProgramCache]: Analyzing trace with hash 754912534, now seen corresponding path program 1 times [2025-03-03 15:11:47,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:47,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032784114] [2025-03-03 15:11:47,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:47,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:47,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 15:11:47,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 15:11:47,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:47,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:47,216 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 15:11:47,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:47,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032784114] [2025-03-03 15:11:47,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032784114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:47,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:47,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:11:47,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844288684] [2025-03-03 15:11:47,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:47,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:11:47,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:47,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:11:47,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:11:47,219 INFO L87 Difference]: Start difference. First operand 1359 states and 1962 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-03 15:11:47,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:47,278 INFO L93 Difference]: Finished difference Result 3503 states and 5078 transitions. [2025-03-03 15:11:47,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:11:47,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-03 15:11:47,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:47,285 INFO L225 Difference]: With dead ends: 3503 [2025-03-03 15:11:47,286 INFO L226 Difference]: Without dead ends: 2833 [2025-03-03 15:11:47,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-03 15:11:47,289 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 231 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:47,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 365 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:11:47,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2833 states. [2025-03-03 15:11:47,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2833 to 2363. [2025-03-03 15:11:47,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2363 states, 2362 states have (on average 1.4386113463166808) internal successors, (3398), 2362 states have internal predecessors, (3398), 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-03 15:11:47,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 3398 transitions. [2025-03-03 15:11:47,333 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 3398 transitions. Word has length 61 [2025-03-03 15:11:47,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:47,333 INFO L471 AbstractCegarLoop]: Abstraction has 2363 states and 3398 transitions. [2025-03-03 15:11:47,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-03 15:11:47,333 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3398 transitions. [2025-03-03 15:11:47,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 15:11:47,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:47,334 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-03 15:11:47,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:11:47,335 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:11:47,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:47,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1180042331, now seen corresponding path program 1 times [2025-03-03 15:11:47,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:47,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643998677] [2025-03-03 15:11:47,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:47,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:47,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 15:11:47,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 15:11:47,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:47,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:47,436 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-03 15:11:47,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:47,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643998677] [2025-03-03 15:11:47,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643998677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:47,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:47,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:11:47,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642192901] [2025-03-03 15:11:47,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:47,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:11:47,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:47,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:11:47,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:11:47,437 INFO L87 Difference]: Start difference. First operand 2363 states and 3398 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-03 15:11:47,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:47,499 INFO L93 Difference]: Finished difference Result 3763 states and 5466 transitions. [2025-03-03 15:11:47,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:11:47,500 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-03 15:11:47,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:47,508 INFO L225 Difference]: With dead ends: 3763 [2025-03-03 15:11:47,508 INFO L226 Difference]: Without dead ends: 3297 [2025-03-03 15:11:47,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-03 15:11:47,510 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 219 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:47,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 394 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:11:47,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3297 states. [2025-03-03 15:11:47,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3297 to 2827. [2025-03-03 15:11:47,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2827 states, 2826 states have (on average 1.443029016277424) internal successors, (4078), 2826 states have internal predecessors, (4078), 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-03 15:11:47,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2827 states to 2827 states and 4078 transitions. [2025-03-03 15:11:47,564 INFO L78 Accepts]: Start accepts. Automaton has 2827 states and 4078 transitions. Word has length 62 [2025-03-03 15:11:47,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:47,564 INFO L471 AbstractCegarLoop]: Abstraction has 2827 states and 4078 transitions. [2025-03-03 15:11:47,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-03 15:11:47,564 INFO L276 IsEmpty]: Start isEmpty. Operand 2827 states and 4078 transitions. [2025-03-03 15:11:47,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 15:11:47,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:47,565 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-03-03 15:11:47,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:11:47,565 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:11:47,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:47,567 INFO L85 PathProgramCache]: Analyzing trace with hash 511764370, now seen corresponding path program 1 times [2025-03-03 15:11:47,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:47,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854627852] [2025-03-03 15:11:47,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:47,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:47,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 15:11:47,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 15:11:47,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:47,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:47,650 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:47,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:47,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854627852] [2025-03-03 15:11:47,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854627852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:47,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:47,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:11:47,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673138017] [2025-03-03 15:11:47,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:47,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:11:47,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:47,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:11:47,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:11:47,651 INFO L87 Difference]: Start difference. First operand 2827 states and 4078 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-03 15:11:47,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:47,679 INFO L93 Difference]: Finished difference Result 4945 states and 7173 transitions. [2025-03-03 15:11:47,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:11:47,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-03 15:11:47,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:47,685 INFO L225 Difference]: With dead ends: 4945 [2025-03-03 15:11:47,685 INFO L226 Difference]: Without dead ends: 2139 [2025-03-03 15:11:47,688 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-03 15:11:47,688 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 40 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:47,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 178 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:11:47,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2025-03-03 15:11:47,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 2137. [2025-03-03 15:11:47,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2137 states, 2136 states have (on average 1.4410112359550562) internal successors, (3078), 2136 states have internal predecessors, (3078), 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-03 15:11:47,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 2137 states and 3078 transitions. [2025-03-03 15:11:47,728 INFO L78 Accepts]: Start accepts. Automaton has 2137 states and 3078 transitions. Word has length 63 [2025-03-03 15:11:47,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:47,728 INFO L471 AbstractCegarLoop]: Abstraction has 2137 states and 3078 transitions. [2025-03-03 15:11:47,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-03 15:11:47,728 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 3078 transitions. [2025-03-03 15:11:47,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 15:11:47,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:47,729 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, 1, 1, 1] [2025-03-03 15:11:47,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:11:47,729 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:11:47,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:47,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1105901695, now seen corresponding path program 1 times [2025-03-03 15:11:47,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:47,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962912834] [2025-03-03 15:11:47,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:47,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:47,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 15:11:47,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 15:11:47,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:47,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:48,132 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:48,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:48,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962912834] [2025-03-03 15:11:48,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962912834] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:11:48,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277583815] [2025-03-03 15:11:48,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:48,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:11:48,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:11:48,137 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-03 15:11:48,140 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-03 15:11:48,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 15:11:48,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 15:11:48,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:48,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:48,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 15:11:48,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:11:48,388 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 15:11:48,389 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:11:48,547 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 15:11:48,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277583815] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:11:48,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:11:48,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 4] total 19 [2025-03-03 15:11:48,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553292715] [2025-03-03 15:11:48,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:11:48,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 15:11:48,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:48,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 15:11:48,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:11:48,549 INFO L87 Difference]: Start difference. First operand 2137 states and 3078 transitions. Second operand has 19 states, 19 states have (on average 9.210526315789474) internal successors, (175), 19 states have internal predecessors, (175), 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-03 15:11:50,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:50,396 INFO L93 Difference]: Finished difference Result 16285 states and 23116 transitions. [2025-03-03 15:11:50,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-03-03 15:11:50,397 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 9.210526315789474) internal successors, (175), 19 states have internal predecessors, (175), 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-03 15:11:50,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:50,429 INFO L225 Difference]: With dead ends: 16285 [2025-03-03 15:11:50,429 INFO L226 Difference]: Without dead ends: 14171 [2025-03-03 15:11:50,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2064 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1082, Invalid=5238, Unknown=0, NotChecked=0, Total=6320 [2025-03-03 15:11:50,434 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 2671 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2671 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:50,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2671 Valid, 764 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:11:50,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14171 states. [2025-03-03 15:11:50,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14171 to 11203. [2025-03-03 15:11:50,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11203 states, 11202 states have (on average 1.3713622567398678) internal successors, (15362), 11202 states have internal predecessors, (15362), 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-03 15:11:50,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11203 states to 11203 states and 15362 transitions. [2025-03-03 15:11:50,604 INFO L78 Accepts]: Start accepts. Automaton has 11203 states and 15362 transitions. Word has length 63 [2025-03-03 15:11:50,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:50,604 INFO L471 AbstractCegarLoop]: Abstraction has 11203 states and 15362 transitions. [2025-03-03 15:11:50,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 9.210526315789474) internal successors, (175), 19 states have internal predecessors, (175), 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-03 15:11:50,604 INFO L276 IsEmpty]: Start isEmpty. Operand 11203 states and 15362 transitions. [2025-03-03 15:11:50,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 15:11:50,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:50,605 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, 1, 1] [2025-03-03 15:11:50,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 15:11:50,805 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,SelfDestructingSolverStorable11 [2025-03-03 15:11:50,806 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:11:50,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:50,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1293370985, now seen corresponding path program 1 times [2025-03-03 15:11:50,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:50,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532921610] [2025-03-03 15:11:50,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:50,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:50,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 15:11:50,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 15:11:50,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:50,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:51,072 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-03 15:11:51,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:51,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532921610] [2025-03-03 15:11:51,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532921610] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:11:51,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733163330] [2025-03-03 15:11:51,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:51,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:11:51,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:11:51,075 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-03 15:11:51,076 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-03 15:11:51,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 15:11:51,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 15:11:51,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:51,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:51,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 15:11:51,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:11:51,454 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-03 15:11:51,454 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:11:51,886 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-03 15:11:51,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733163330] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:11:51,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:11:51,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-03 15:11:51,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823264693] [2025-03-03 15:11:51,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:11:51,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 15:11:51,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:51,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 15:11:51,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:11:51,888 INFO L87 Difference]: Start difference. First operand 11203 states and 15362 transitions. Second operand has 21 states, 21 states have (on average 7.095238095238095) internal successors, (149), 20 states have internal predecessors, (149), 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-03 15:11:52,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:52,589 INFO L93 Difference]: Finished difference Result 53793 states and 74268 transitions. [2025-03-03 15:11:52,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 15:11:52,590 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 7.095238095238095) internal successors, (149), 20 states have internal predecessors, (149), 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-03 15:11:52,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:52,661 INFO L225 Difference]: With dead ends: 53793 [2025-03-03 15:11:52,662 INFO L226 Difference]: Without dead ends: 42624 [2025-03-03 15:11:52,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=428, Invalid=1294, Unknown=0, NotChecked=0, Total=1722 [2025-03-03 15:11:52,679 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 1047 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1047 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:52,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1047 Valid, 480 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:11:52,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42624 states. [2025-03-03 15:11:53,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42624 to 26066. [2025-03-03 15:11:53,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26066 states, 26065 states have (on average 1.3551889507001726) internal successors, (35323), 26065 states have internal predecessors, (35323), 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-03 15:11:53,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26066 states to 26066 states and 35323 transitions. [2025-03-03 15:11:53,109 INFO L78 Accepts]: Start accepts. Automaton has 26066 states and 35323 transitions. Word has length 64 [2025-03-03 15:11:53,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:53,110 INFO L471 AbstractCegarLoop]: Abstraction has 26066 states and 35323 transitions. [2025-03-03 15:11:53,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.095238095238095) internal successors, (149), 20 states have internal predecessors, (149), 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-03 15:11:53,110 INFO L276 IsEmpty]: Start isEmpty. Operand 26066 states and 35323 transitions. [2025-03-03 15:11:53,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 15:11:53,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:53,113 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, 1, 1] [2025-03-03 15:11:53,121 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-03 15:11:53,317 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,SelfDestructingSolverStorable12 [2025-03-03 15:11:53,317 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:11:53,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:53,318 INFO L85 PathProgramCache]: Analyzing trace with hash 837970135, now seen corresponding path program 1 times [2025-03-03 15:11:53,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:53,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711664376] [2025-03-03 15:11:53,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:53,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:53,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 15:11:53,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 15:11:53,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:53,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:53,546 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-03 15:11:53,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:53,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711664376] [2025-03-03 15:11:53,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711664376] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:11:53,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892372393] [2025-03-03 15:11:53,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:53,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:11:53,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:11:53,548 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-03 15:11:53,550 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-03 15:11:53,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 15:11:53,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 15:11:53,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:53,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:53,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 15:11:53,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:11:54,415 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-03 15:11:54,415 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:11:54,935 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-03 15:11:54,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892372393] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:11:54,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:11:54,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 30 [2025-03-03 15:11:54,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697245483] [2025-03-03 15:11:54,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:11:54,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-03 15:11:54,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:54,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-03 15:11:54,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=781, Unknown=0, NotChecked=0, Total=870 [2025-03-03 15:11:54,937 INFO L87 Difference]: Start difference. First operand 26066 states and 35323 transitions. Second operand has 30 states, 30 states have (on average 5.566666666666666) internal successors, (167), 30 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-03 15:12:00,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:00,729 INFO L93 Difference]: Finished difference Result 150697 states and 203787 transitions. [2025-03-03 15:12:00,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2025-03-03 15:12:00,730 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.566666666666666) internal successors, (167), 30 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 64 [2025-03-03 15:12:00,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:00,871 INFO L225 Difference]: With dead ends: 150697 [2025-03-03 15:12:00,871 INFO L226 Difference]: Without dead ends: 124687 [2025-03-03 15:12:00,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10412 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=4116, Invalid=24954, Unknown=0, NotChecked=0, Total=29070 [2025-03-03 15:12:00,915 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 4230 mSDsluCounter, 1301 mSDsCounter, 0 mSdLazyCounter, 1959 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4230 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 2010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:00,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4230 Valid, 1387 Invalid, 2010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1959 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:12:00,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124687 states. [2025-03-03 15:12:01,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124687 to 58647. [2025-03-03 15:12:01,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58647 states, 58646 states have (on average 1.3335777376121134) internal successors, (78209), 58646 states have internal predecessors, (78209), 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-03 15:12:02,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58647 states to 58647 states and 78209 transitions. [2025-03-03 15:12:02,033 INFO L78 Accepts]: Start accepts. Automaton has 58647 states and 78209 transitions. Word has length 64 [2025-03-03 15:12:02,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:02,033 INFO L471 AbstractCegarLoop]: Abstraction has 58647 states and 78209 transitions. [2025-03-03 15:12:02,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.566666666666666) internal successors, (167), 30 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-03 15:12:02,033 INFO L276 IsEmpty]: Start isEmpty. Operand 58647 states and 78209 transitions. [2025-03-03 15:12:02,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 15:12:02,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:02,035 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, 1, 1, 1] [2025-03-03 15:12:02,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 15:12:02,235 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-03 15:12:02,236 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:12:02,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:02,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1916335568, now seen corresponding path program 1 times [2025-03-03 15:12:02,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:02,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470142105] [2025-03-03 15:12:02,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:02,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:02,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 15:12:02,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 15:12:02,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:02,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:02,275 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-03 15:12:02,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:02,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470142105] [2025-03-03 15:12:02,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470142105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:12:02,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:12:02,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:12:02,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410891279] [2025-03-03 15:12:02,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:12:02,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:12:02,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:02,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:12:02,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:12:02,277 INFO L87 Difference]: Start difference. First operand 58647 states and 78209 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-03 15:12:02,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:02,593 INFO L93 Difference]: Finished difference Result 99732 states and 133154 transitions. [2025-03-03 15:12:02,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:12:02,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 65 [2025-03-03 15:12:02,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:02,641 INFO L225 Difference]: With dead ends: 99732 [2025-03-03 15:12:02,641 INFO L226 Difference]: Without dead ends: 41218 [2025-03-03 15:12:02,678 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-03 15:12:02,678 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 60 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 110 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-03 15:12:02,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 110 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:12:02,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41218 states. [2025-03-03 15:12:03,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41218 to 41218. [2025-03-03 15:12:03,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41218 states, 41217 states have (on average 1.318024116262707) internal successors, (54325), 41217 states have internal predecessors, (54325), 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-03 15:12:03,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41218 states to 41218 states and 54325 transitions. [2025-03-03 15:12:03,454 INFO L78 Accepts]: Start accepts. Automaton has 41218 states and 54325 transitions. Word has length 65 [2025-03-03 15:12:03,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:03,454 INFO L471 AbstractCegarLoop]: Abstraction has 41218 states and 54325 transitions. [2025-03-03 15:12:03,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-03 15:12:03,454 INFO L276 IsEmpty]: Start isEmpty. Operand 41218 states and 54325 transitions. [2025-03-03 15:12:03,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 15:12:03,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:03,455 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, 1, 1, 1] [2025-03-03 15:12:03,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:12:03,456 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:12:03,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:03,456 INFO L85 PathProgramCache]: Analyzing trace with hash 580925875, now seen corresponding path program 1 times [2025-03-03 15:12:03,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:03,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310879525] [2025-03-03 15:12:03,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:03,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:03,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 15:12:03,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 15:12:03,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:03,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:03,865 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-03 15:12:03,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:03,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310879525] [2025-03-03 15:12:03,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310879525] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:12:03,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246384561] [2025-03-03 15:12:03,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:03,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:12:03,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:12:03,868 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:12:03,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 15:12:03,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 15:12:03,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 15:12:03,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:03,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:03,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-03 15:12:03,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:12:05,046 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-03 15:12:05,046 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:12:05,918 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-03 15:12:05,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246384561] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:12:05,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:12:05,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 15] total 41 [2025-03-03 15:12:05,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59165396] [2025-03-03 15:12:05,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:12:05,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-03 15:12:05,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:05,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-03 15:12:05,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1428, Unknown=0, NotChecked=0, Total=1640 [2025-03-03 15:12:05,920 INFO L87 Difference]: Start difference. First operand 41218 states and 54325 transitions. Second operand has 41 states, 41 states have (on average 4.146341463414634) internal successors, (170), 41 states have internal predecessors, (170), 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-03 15:12:20,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:20,129 INFO L93 Difference]: Finished difference Result 143038 states and 188790 transitions. [2025-03-03 15:12:20,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 269 states. [2025-03-03 15:12:20,130 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 4.146341463414634) internal successors, (170), 41 states have internal predecessors, (170), 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 65 [2025-03-03 15:12:20,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:20,238 INFO L225 Difference]: With dead ends: 143038 [2025-03-03 15:12:20,238 INFO L226 Difference]: Without dead ends: 112202 [2025-03-03 15:12:20,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 305 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39119 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=13801, Invalid=80141, Unknown=0, NotChecked=0, Total=93942 [2025-03-03 15:12:20,282 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 7275 mSDsluCounter, 1959 mSDsCounter, 0 mSdLazyCounter, 1966 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7275 SdHoareTripleChecker+Valid, 2070 SdHoareTripleChecker+Invalid, 2027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:20,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7275 Valid, 2070 Invalid, 2027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1966 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 15:12:20,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112202 states. [2025-03-03 15:12:20,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112202 to 51512. [2025-03-03 15:12:20,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51512 states, 51511 states have (on average 1.3244161441245559) internal successors, (68222), 51511 states have internal predecessors, (68222), 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-03 15:12:20,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51512 states to 51512 states and 68222 transitions. [2025-03-03 15:12:20,962 INFO L78 Accepts]: Start accepts. Automaton has 51512 states and 68222 transitions. Word has length 65 [2025-03-03 15:12:20,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:20,962 INFO L471 AbstractCegarLoop]: Abstraction has 51512 states and 68222 transitions. [2025-03-03 15:12:20,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 4.146341463414634) internal successors, (170), 41 states have internal predecessors, (170), 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-03 15:12:20,963 INFO L276 IsEmpty]: Start isEmpty. Operand 51512 states and 68222 transitions. [2025-03-03 15:12:20,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 15:12:20,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:20,964 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, 1, 1, 1] [2025-03-03 15:12:20,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 15:12:21,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 15:12:21,164 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:12:21,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:21,165 INFO L85 PathProgramCache]: Analyzing trace with hash 415786240, now seen corresponding path program 1 times [2025-03-03 15:12:21,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:21,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110951228] [2025-03-03 15:12:21,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:21,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:21,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 15:12:21,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 15:12:21,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:21,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:21,192 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-03 15:12:21,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:21,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110951228] [2025-03-03 15:12:21,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110951228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:12:21,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:12:21,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:12:21,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115672307] [2025-03-03 15:12:21,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:12:21,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:12:21,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:21,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:12:21,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:12:21,193 INFO L87 Difference]: Start difference. First operand 51512 states and 68222 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-03 15:12:21,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:21,344 INFO L93 Difference]: Finished difference Result 96321 states and 127925 transitions. [2025-03-03 15:12:21,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:12:21,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 67 [2025-03-03 15:12:21,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:21,386 INFO L225 Difference]: With dead ends: 96321 [2025-03-03 15:12:21,386 INFO L226 Difference]: Without dead ends: 44878 [2025-03-03 15:12:21,415 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-03 15:12:21,415 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 49 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:21,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 77 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:12:21,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44878 states. [2025-03-03 15:12:21,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44878 to 44878. [2025-03-03 15:12:21,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44878 states, 44877 states have (on average 1.3137910288120864) internal successors, (58959), 44877 states have internal predecessors, (58959), 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-03 15:12:21,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44878 states to 44878 states and 58959 transitions. [2025-03-03 15:12:21,776 INFO L78 Accepts]: Start accepts. Automaton has 44878 states and 58959 transitions. Word has length 67 [2025-03-03 15:12:21,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:21,776 INFO L471 AbstractCegarLoop]: Abstraction has 44878 states and 58959 transitions. [2025-03-03 15:12:21,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-03 15:12:21,776 INFO L276 IsEmpty]: Start isEmpty. Operand 44878 states and 58959 transitions. [2025-03-03 15:12:21,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 15:12:21,777 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:21,777 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, 1, 1, 1, 1] [2025-03-03 15:12:21,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:12:21,777 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:12:21,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:21,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1644087435, now seen corresponding path program 1 times [2025-03-03 15:12:21,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:21,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874201084] [2025-03-03 15:12:21,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:21,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:21,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 15:12:21,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 15:12:21,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:21,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:21,798 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-03 15:12:21,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:21,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874201084] [2025-03-03 15:12:21,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874201084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:12:21,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:12:21,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:12:21,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968722625] [2025-03-03 15:12:21,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:12:21,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:12:21,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:21,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:12:21,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:12:21,799 INFO L87 Difference]: Start difference. First operand 44878 states and 58959 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-03 15:12:21,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:21,924 INFO L93 Difference]: Finished difference Result 80564 states and 105979 transitions. [2025-03-03 15:12:21,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:12:21,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 67 [2025-03-03 15:12:21,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:21,959 INFO L225 Difference]: With dead ends: 80564 [2025-03-03 15:12:21,959 INFO L226 Difference]: Without dead ends: 35780 [2025-03-03 15:12:21,982 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-03 15:12:21,982 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 53 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:21,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 92 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:12:21,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35780 states. [2025-03-03 15:12:22,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35780 to 35780. [2025-03-03 15:12:22,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35780 states, 35779 states have (on average 1.2950054501243746) internal successors, (46334), 35779 states have internal predecessors, (46334), 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-03 15:12:22,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35780 states to 35780 states and 46334 transitions. [2025-03-03 15:12:22,274 INFO L78 Accepts]: Start accepts. Automaton has 35780 states and 46334 transitions. Word has length 67 [2025-03-03 15:12:22,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:22,274 INFO L471 AbstractCegarLoop]: Abstraction has 35780 states and 46334 transitions. [2025-03-03 15:12:22,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-03 15:12:22,274 INFO L276 IsEmpty]: Start isEmpty. Operand 35780 states and 46334 transitions. [2025-03-03 15:12:22,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 15:12:22,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:22,275 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, 1, 1, 1, 1] [2025-03-03 15:12:22,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:12:22,276 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:12:22,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:22,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1176059418, now seen corresponding path program 1 times [2025-03-03 15:12:22,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:22,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973793365] [2025-03-03 15:12:22,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:22,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:22,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 15:12:22,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 15:12:22,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:22,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:22,348 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 12 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:22,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:22,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973793365] [2025-03-03 15:12:22,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973793365] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:12:22,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124398004] [2025-03-03 15:12:22,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:22,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:12:22,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:12:22,351 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:12:22,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 15:12:22,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 15:12:22,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 15:12:22,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:22,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:22,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 15:12:22,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:12:22,561 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 12 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:22,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:12:22,646 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 12 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:22,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124398004] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:12:22,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:12:22,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-03 15:12:22,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253686358] [2025-03-03 15:12:22,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:12:22,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 15:12:22,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:22,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 15:12:22,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:12:22,647 INFO L87 Difference]: Start difference. First operand 35780 states and 46334 transitions. Second operand has 11 states, 11 states have (on average 14.272727272727273) internal successors, (157), 10 states have internal predecessors, (157), 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-03 15:12:22,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:22,818 INFO L93 Difference]: Finished difference Result 64084 states and 83209 transitions. [2025-03-03 15:12:22,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:12:22,818 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 14.272727272727273) internal successors, (157), 10 states have internal predecessors, (157), 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 88 [2025-03-03 15:12:22,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:22,852 INFO L225 Difference]: With dead ends: 64084 [2025-03-03 15:12:22,853 INFO L226 Difference]: Without dead ends: 36674 [2025-03-03 15:12:22,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 166 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-03-03 15:12:22,876 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 352 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:22,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 214 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:12:22,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36674 states. [2025-03-03 15:12:23,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36674 to 33800. [2025-03-03 15:12:23,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33800 states, 33799 states have (on average 1.2949495547205538) internal successors, (43768), 33799 states have internal predecessors, (43768), 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-03 15:12:23,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33800 states to 33800 states and 43768 transitions. [2025-03-03 15:12:23,150 INFO L78 Accepts]: Start accepts. Automaton has 33800 states and 43768 transitions. Word has length 88 [2025-03-03 15:12:23,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:23,150 INFO L471 AbstractCegarLoop]: Abstraction has 33800 states and 43768 transitions. [2025-03-03 15:12:23,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.272727272727273) internal successors, (157), 10 states have internal predecessors, (157), 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-03 15:12:23,150 INFO L276 IsEmpty]: Start isEmpty. Operand 33800 states and 43768 transitions. [2025-03-03 15:12:23,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 15:12:23,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:23,154 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2025-03-03 15:12:23,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 15:12:23,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:12:23,355 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:12:23,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:23,355 INFO L85 PathProgramCache]: Analyzing trace with hash 982156909, now seen corresponding path program 1 times [2025-03-03 15:12:23,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:23,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141278135] [2025-03-03 15:12:23,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:23,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:23,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:12:23,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:12:23,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:23,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:23,425 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 74 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 15:12:23,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:23,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141278135] [2025-03-03 15:12:23,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141278135] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:12:23,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341690196] [2025-03-03 15:12:23,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:23,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:12:23,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:12:23,427 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:12:23,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 15:12:23,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:12:23,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:12:23,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:23,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:23,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 15:12:23,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:12:23,728 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 34 proven. 48 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 15:12:23,728 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:12:23,835 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 34 proven. 48 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 15:12:23,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341690196] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:12:23,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:12:23,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2025-03-03 15:12:23,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848228311] [2025-03-03 15:12:23,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:12:23,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 15:12:23,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:23,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 15:12:23,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:12:23,837 INFO L87 Difference]: Start difference. First operand 33800 states and 43768 transitions. Second operand has 14 states, 14 states have (on average 19.428571428571427) internal successors, (272), 14 states have internal predecessors, (272), 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-03 15:12:24,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:24,041 INFO L93 Difference]: Finished difference Result 60971 states and 78868 transitions. [2025-03-03 15:12:24,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:12:24,042 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 19.428571428571427) internal successors, (272), 14 states have internal predecessors, (272), 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 110 [2025-03-03 15:12:24,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:24,069 INFO L225 Difference]: With dead ends: 60971 [2025-03-03 15:12:24,069 INFO L226 Difference]: Without dead ends: 29099 [2025-03-03 15:12:24,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 212 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:12:24,089 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 504 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:24,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 310 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:12:24,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29099 states. [2025-03-03 15:12:24,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29099 to 27817. [2025-03-03 15:12:24,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27817 states, 27816 states have (on average 1.2867773943054357) internal successors, (35793), 27816 states have internal predecessors, (35793), 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-03 15:12:24,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27817 states to 27817 states and 35793 transitions. [2025-03-03 15:12:24,393 INFO L78 Accepts]: Start accepts. Automaton has 27817 states and 35793 transitions. Word has length 110 [2025-03-03 15:12:24,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:24,393 INFO L471 AbstractCegarLoop]: Abstraction has 27817 states and 35793 transitions. [2025-03-03 15:12:24,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 19.428571428571427) internal successors, (272), 14 states have internal predecessors, (272), 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-03 15:12:24,393 INFO L276 IsEmpty]: Start isEmpty. Operand 27817 states and 35793 transitions. [2025-03-03 15:12:24,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 15:12:24,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:24,396 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2025-03-03 15:12:24,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 15:12:24,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:12:24,597 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:12:24,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:24,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1882112341, now seen corresponding path program 1 times [2025-03-03 15:12:24,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:24,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188839051] [2025-03-03 15:12:24,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:24,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:24,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:12:24,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:12:24,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:24,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:24,653 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 15:12:24,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:24,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188839051] [2025-03-03 15:12:24,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188839051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:12:24,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:12:24,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:12:24,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133951632] [2025-03-03 15:12:24,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:12:24,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:12:24,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:24,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:12:24,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:12:24,655 INFO L87 Difference]: Start difference. First operand 27817 states and 35793 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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-03 15:12:24,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:24,721 INFO L93 Difference]: Finished difference Result 41409 states and 53341 transitions. [2025-03-03 15:12:24,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:12:24,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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 110 [2025-03-03 15:12:24,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:24,736 INFO L225 Difference]: With dead ends: 41409 [2025-03-03 15:12:24,736 INFO L226 Difference]: Without dead ends: 14684 [2025-03-03 15:12:24,749 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-03 15:12:24,749 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 30 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:24,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 157 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:12:24,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14684 states. [2025-03-03 15:12:24,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14684 to 14682. [2025-03-03 15:12:24,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14682 states, 14681 states have (on average 1.26333356038417) internal successors, (18547), 14681 states have internal predecessors, (18547), 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-03 15:12:24,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14682 states to 14682 states and 18547 transitions. [2025-03-03 15:12:24,860 INFO L78 Accepts]: Start accepts. Automaton has 14682 states and 18547 transitions. Word has length 110 [2025-03-03 15:12:24,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:24,860 INFO L471 AbstractCegarLoop]: Abstraction has 14682 states and 18547 transitions. [2025-03-03 15:12:24,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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-03 15:12:24,861 INFO L276 IsEmpty]: Start isEmpty. Operand 14682 states and 18547 transitions. [2025-03-03 15:12:24,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 15:12:24,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:24,863 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 15:12:24,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 15:12:24,864 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:12:24,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:24,864 INFO L85 PathProgramCache]: Analyzing trace with hash 394273539, now seen corresponding path program 1 times [2025-03-03 15:12:24,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:24,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051041327] [2025-03-03 15:12:24,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:24,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:24,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:12:24,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:12:24,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:24,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:25,227 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 13 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:25,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:25,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051041327] [2025-03-03 15:12:25,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051041327] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:12:25,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035895759] [2025-03-03 15:12:25,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:25,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:12:25,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:12:25,230 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:12:25,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 15:12:25,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:12:25,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:12:25,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:25,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:25,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-03 15:12:25,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:12:27,086 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 15 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:27,086 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:12:29,456 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 13 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:29,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035895759] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:12:29,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:12:29,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21, 20] total 49 [2025-03-03 15:12:29,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660776390] [2025-03-03 15:12:29,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:12:29,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-03-03 15:12:29,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:29,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-03-03 15:12:29,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=2137, Unknown=0, NotChecked=0, Total=2450 [2025-03-03 15:12:29,457 INFO L87 Difference]: Start difference. First operand 14682 states and 18547 transitions. Second operand has 50 states, 50 states have (on average 6.22) internal successors, (311), 49 states have internal predecessors, (311), 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-03 15:12:37,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:37,422 INFO L93 Difference]: Finished difference Result 29146 states and 37021 transitions. [2025-03-03 15:12:37,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2025-03-03 15:12:37,422 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 6.22) internal successors, (311), 49 states have internal predecessors, (311), 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 110 [2025-03-03 15:12:37,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:37,443 INFO L225 Difference]: With dead ends: 29146 [2025-03-03 15:12:37,443 INFO L226 Difference]: Without dead ends: 18724 [2025-03-03 15:12:37,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7024 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=4171, Invalid=19699, Unknown=0, NotChecked=0, Total=23870 [2025-03-03 15:12:37,457 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 3835 mSDsluCounter, 1530 mSDsCounter, 0 mSdLazyCounter, 2574 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3835 SdHoareTripleChecker+Valid, 1644 SdHoareTripleChecker+Invalid, 2746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 2574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:37,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3835 Valid, 1644 Invalid, 2746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 2574 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-03 15:12:37,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18724 states. [2025-03-03 15:12:37,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18724 to 13822. [2025-03-03 15:12:37,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13822 states, 13821 states have (on average 1.2378988495767311) internal successors, (17109), 13821 states have internal predecessors, (17109), 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-03 15:12:37,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13822 states to 13822 states and 17109 transitions. [2025-03-03 15:12:37,599 INFO L78 Accepts]: Start accepts. Automaton has 13822 states and 17109 transitions. Word has length 110 [2025-03-03 15:12:37,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:37,599 INFO L471 AbstractCegarLoop]: Abstraction has 13822 states and 17109 transitions. [2025-03-03 15:12:37,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 6.22) internal successors, (311), 49 states have internal predecessors, (311), 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-03 15:12:37,599 INFO L276 IsEmpty]: Start isEmpty. Operand 13822 states and 17109 transitions. [2025-03-03 15:12:37,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 15:12:37,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:37,601 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 15:12:37,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 15:12:37,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:12:37,802 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:12:37,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:37,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1769352637, now seen corresponding path program 1 times [2025-03-03 15:12:37,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:37,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564347624] [2025-03-03 15:12:37,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:37,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:37,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:12:37,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:12:37,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:37,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:38,265 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 31 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:38,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:38,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564347624] [2025-03-03 15:12:38,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564347624] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:12:38,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14292558] [2025-03-03 15:12:38,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:38,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:12:38,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:12:38,268 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:12:38,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 15:12:38,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:12:38,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:12:38,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:38,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:38,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-03 15:12:38,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:12:39,233 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:39,233 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:12:40,700 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:40,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14292558] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:12:40,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:12:40,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 18] total 48 [2025-03-03 15:12:40,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816176793] [2025-03-03 15:12:40,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:12:40,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-03 15:12:40,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:40,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-03 15:12:40,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2115, Unknown=0, NotChecked=0, Total=2256 [2025-03-03 15:12:40,704 INFO L87 Difference]: Start difference. First operand 13822 states and 17109 transitions. Second operand has 48 states, 48 states have (on average 6.291666666666667) internal successors, (302), 48 states have internal predecessors, (302), 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)