./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label03.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label03.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 2aece9bc24459d3bfdb5e96b44f652012670bcbf1cd47e085c4f986f518e00f1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 07:17:53,037 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 07:17:53,091 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 07:17:53,096 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 07:17:53,096 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 07:17:53,118 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 07:17:53,118 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 07:17:53,119 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 07:17:53,119 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 07:17:53,119 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 07:17:53,119 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 07:17:53,119 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 07:17:53,119 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 07:17:53,119 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 07:17:53,119 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 07:17:53,120 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 07:17:53,120 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 07:17:53,120 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 07:17:53,121 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 07:17:53,121 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 07:17:53,121 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 07:17:53,121 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 07:17:53,121 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 07:17:53,121 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 07:17:53,122 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 07:17:53,122 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 07:17:53,122 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 07:17:53,122 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 07:17:53,122 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 07:17:53,122 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 07:17:53,122 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 07:17:53,122 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 07:17:53,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:17:53,123 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 07:17:53,123 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 07:17:53,123 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 07:17:53,123 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 07:17:53,123 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 07:17:53,123 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 07:17:53,123 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 07:17:53,123 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 07:17:53,123 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 07:17:53,123 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 07:17:53,123 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 -> 2aece9bc24459d3bfdb5e96b44f652012670bcbf1cd47e085c4f986f518e00f1 [2025-03-08 07:17:53,366 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 07:17:53,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 07:17:53,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 07:17:53,378 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 07:17:53,378 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 07:17:53,379 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label03.c [2025-03-08 07:17:54,505 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b21fa3741/0c46abc1ae2c4598bb492235d35d4395/FLAG4f164b4c9 [2025-03-08 07:17:54,915 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 07:17:54,916 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label03.c [2025-03-08 07:17:54,945 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b21fa3741/0c46abc1ae2c4598bb492235d35d4395/FLAG4f164b4c9 [2025-03-08 07:17:55,085 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b21fa3741/0c46abc1ae2c4598bb492235d35d4395 [2025-03-08 07:17:55,087 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 07:17:55,088 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 07:17:55,089 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 07:17:55,089 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 07:17:55,092 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 07:17:55,093 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:17:55" (1/1) ... [2025-03-08 07:17:55,093 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52d30aa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:17:55, skipping insertion in model container [2025-03-08 07:17:55,093 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:17:55" (1/1) ... [2025-03-08 07:17:55,159 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 07:17:55,395 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/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label03.c[8712,8725] [2025-03-08 07:17:55,424 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/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label03.c[11049,11062] [2025-03-08 07:17:55,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:17:55,847 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 07:17:55,872 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/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label03.c[8712,8725] [2025-03-08 07:17:55,875 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/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label03.c[11049,11062] [2025-03-08 07:17:56,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:17:56,132 INFO L204 MainTranslator]: Completed translation [2025-03-08 07:17:56,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:17:56 WrapperNode [2025-03-08 07:17:56,133 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 07:17:56,134 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 07:17:56,134 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 07:17:56,134 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 07:17:56,139 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:17:56" (1/1) ... [2025-03-08 07:17:56,177 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:17:56" (1/1) ... [2025-03-08 07:17:56,375 INFO L138 Inliner]: procedures = 36, calls = 21, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 5033 [2025-03-08 07:17:56,375 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 07:17:56,376 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 07:17:56,376 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 07:17:56,376 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 07:17:56,383 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:17:56" (1/1) ... [2025-03-08 07:17:56,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:17:56" (1/1) ... [2025-03-08 07:17:56,452 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:17:56" (1/1) ... [2025-03-08 07:17:56,619 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 07:17:56,621 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:17:56" (1/1) ... [2025-03-08 07:17:56,621 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:17:56" (1/1) ... [2025-03-08 07:17:56,769 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:17:56" (1/1) ... [2025-03-08 07:17:56,799 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:17:56" (1/1) ... [2025-03-08 07:17:56,817 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:17:56" (1/1) ... [2025-03-08 07:17:56,834 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:17:56" (1/1) ... [2025-03-08 07:17:56,868 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 07:17:56,869 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 07:17:56,870 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 07:17:56,870 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 07:17:56,871 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:17:56" (1/1) ... [2025-03-08 07:17:56,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:17:56,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:17:56,897 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 07:17:56,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 07:17:56,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 07:17:56,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 07:17:56,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 07:17:56,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 07:17:56,990 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 07:17:56,991 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 07:18:00,276 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5025: havoc calculate_output3_#t~ret35#1; [2025-03-08 07:18:00,277 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2056: havoc calculate_output_#t~ret33#1; [2025-03-08 07:18:00,277 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3535: havoc calculate_output2_#t~ret34#1; [2025-03-08 07:18:00,438 INFO L? ?]: Removed 739 outVars from TransFormulas that were not future-live. [2025-03-08 07:18:00,438 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 07:18:00,470 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 07:18:00,471 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 07:18:00,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:18:00 BoogieIcfgContainer [2025-03-08 07:18:00,471 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 07:18:00,473 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 07:18:00,473 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 07:18:00,477 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 07:18:00,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:17:55" (1/3) ... [2025-03-08 07:18:00,479 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fa5c2ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:18:00, skipping insertion in model container [2025-03-08 07:18:00,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:17:56" (2/3) ... [2025-03-08 07:18:00,479 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fa5c2ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:18:00, skipping insertion in model container [2025-03-08 07:18:00,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:18:00" (3/3) ... [2025-03-08 07:18:00,480 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label03.c [2025-03-08 07:18:00,493 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 07:18:00,496 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label03.c that has 1 procedures, 886 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-08 07:18:00,573 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 07:18:00,583 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;@46d9d7f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 07:18:00,584 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 07:18:00,590 INFO L276 IsEmpty]: Start isEmpty. Operand has 886 states, 883 states have (on average 1.9037372593431483) internal successors, (1681), 885 states have internal predecessors, (1681), 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-08 07:18:00,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 07:18:00,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:18:00,596 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] [2025-03-08 07:18:00,597 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:18:00,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:18:00,601 INFO L85 PathProgramCache]: Analyzing trace with hash 756448838, now seen corresponding path program 1 times [2025-03-08 07:18:00,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:18:00,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492622030] [2025-03-08 07:18:00,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:18:00,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:18:00,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 07:18:00,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 07:18:00,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:18:00,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:18:00,845 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-08 07:18:00,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:18:00,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492622030] [2025-03-08 07:18:00,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492622030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:18:00,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:18:00,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 07:18:00,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842391163] [2025-03-08 07:18:00,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:18:00,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:18:00,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:18:00,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:18:00,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:18:00,869 INFO L87 Difference]: Start difference. First operand has 886 states, 883 states have (on average 1.9037372593431483) internal successors, (1681), 885 states have internal predecessors, (1681), 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 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 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-08 07:18:03,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:18:03,689 INFO L93 Difference]: Finished difference Result 2497 states and 4808 transitions. [2025-03-08 07:18:03,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:18:03,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 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 20 [2025-03-08 07:18:03,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:18:03,703 INFO L225 Difference]: With dead ends: 2497 [2025-03-08 07:18:03,704 INFO L226 Difference]: Without dead ends: 1572 [2025-03-08 07:18:03,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:18:03,709 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 990 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2437 mSolverCounterSat, 771 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 990 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 3208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 771 IncrementalHoareTripleChecker+Valid, 2437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-08 07:18:03,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [990 Valid, 270 Invalid, 3208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [771 Valid, 2437 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-08 07:18:03,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2025-03-08 07:18:03,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1572. [2025-03-08 07:18:03,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1570 states have (on average 1.8407643312101911) internal successors, (2890), 1571 states have internal predecessors, (2890), 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-08 07:18:03,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2890 transitions. [2025-03-08 07:18:03,807 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2890 transitions. Word has length 20 [2025-03-08 07:18:03,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:18:03,807 INFO L471 AbstractCegarLoop]: Abstraction has 1572 states and 2890 transitions. [2025-03-08 07:18:03,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 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-08 07:18:03,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2890 transitions. [2025-03-08 07:18:03,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 07:18:03,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:18:03,809 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] [2025-03-08 07:18:03,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 07:18:03,810 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:18:03,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:18:03,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1841298800, now seen corresponding path program 1 times [2025-03-08 07:18:03,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:18:03,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993797252] [2025-03-08 07:18:03,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:18:03,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:18:03,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 07:18:03,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 07:18:03,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:18:03,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:18:03,996 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-08 07:18:03,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:18:03,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993797252] [2025-03-08 07:18:03,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993797252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:18:03,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:18:03,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:18:03,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354927332] [2025-03-08 07:18:03,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:18:03,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:18:03,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:18:03,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:18:03,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:18:03,998 INFO L87 Difference]: Start difference. First operand 1572 states and 2890 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-08 07:18:04,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:18:04,044 INFO L93 Difference]: Finished difference Result 1614 states and 2954 transitions. [2025-03-08 07:18:04,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:18:04,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2025-03-08 07:18:04,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:18:04,050 INFO L225 Difference]: With dead ends: 1614 [2025-03-08 07:18:04,050 INFO L226 Difference]: Without dead ends: 1572 [2025-03-08 07:18:04,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-08 07:18:04,052 INFO L435 NwaCegarLoop]: 1549 mSDtfsCounter, 0 mSDsluCounter, 4619 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6168 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:18:04,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6168 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:18:04,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2025-03-08 07:18:04,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1572. [2025-03-08 07:18:04,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1570 states have (on average 1.8261146496815286) internal successors, (2867), 1571 states have internal predecessors, (2867), 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-08 07:18:04,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2867 transitions. [2025-03-08 07:18:04,082 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2867 transitions. Word has length 22 [2025-03-08 07:18:04,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:18:04,083 INFO L471 AbstractCegarLoop]: Abstraction has 1572 states and 2867 transitions. [2025-03-08 07:18:04,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-08 07:18:04,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2867 transitions. [2025-03-08 07:18:04,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 07:18:04,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:18:04,086 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, 1, 1] [2025-03-08 07:18:04,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 07:18:04,086 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:18:04,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:18:04,089 INFO L85 PathProgramCache]: Analyzing trace with hash 483422138, now seen corresponding path program 1 times [2025-03-08 07:18:04,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:18:04,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632043925] [2025-03-08 07:18:04,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:18:04,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:18:04,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 07:18:04,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 07:18:04,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:18:04,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:18:04,219 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-08 07:18:04,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:18:04,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632043925] [2025-03-08 07:18:04,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632043925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:18:04,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:18:04,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:18:04,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723073409] [2025-03-08 07:18:04,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:18:04,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:18:04,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:18:04,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:18:04,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:18:04,221 INFO L87 Difference]: Start difference. First operand 1572 states and 2867 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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-08 07:18:04,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:18:04,335 INFO L93 Difference]: Finished difference Result 1876 states and 3347 transitions. [2025-03-08 07:18:04,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:18:04,336 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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 44 [2025-03-08 07:18:04,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:18:04,341 INFO L225 Difference]: With dead ends: 1876 [2025-03-08 07:18:04,342 INFO L226 Difference]: Without dead ends: 1838 [2025-03-08 07:18:04,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 07:18:04,343 INFO L435 NwaCegarLoop]: 1522 mSDtfsCounter, 6285 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6285 SdHoareTripleChecker+Valid, 2135 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:18:04,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6285 Valid, 2135 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:18:04,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2025-03-08 07:18:04,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1608. [2025-03-08 07:18:04,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1608 states, 1606 states have (on average 1.8206724782067247) internal successors, (2924), 1607 states have internal predecessors, (2924), 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-08 07:18:04,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2924 transitions. [2025-03-08 07:18:04,372 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 2924 transitions. Word has length 44 [2025-03-08 07:18:04,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:18:04,372 INFO L471 AbstractCegarLoop]: Abstraction has 1608 states and 2924 transitions. [2025-03-08 07:18:04,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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-08 07:18:04,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2924 transitions. [2025-03-08 07:18:04,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 07:18:04,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:18:04,375 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, 1, 1, 1, 1] [2025-03-08 07:18:04,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 07:18:04,375 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:18:04,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:18:04,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1832559893, now seen corresponding path program 1 times [2025-03-08 07:18:04,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:18:04,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237984842] [2025-03-08 07:18:04,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:18:04,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:18:04,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 07:18:04,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 07:18:04,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:18:04,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:18:04,478 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-08 07:18:04,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:18:04,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237984842] [2025-03-08 07:18:04,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237984842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:18:04,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:18:04,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:18:04,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053148917] [2025-03-08 07:18:04,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:18:04,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:18:04,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:18:04,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:18:04,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:18:04,479 INFO L87 Difference]: Start difference. First operand 1608 states and 2924 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-08 07:18:04,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:18:04,512 INFO L93 Difference]: Finished difference Result 1745 states and 3139 transitions. [2025-03-08 07:18:04,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:18:04,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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 46 [2025-03-08 07:18:04,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:18:04,517 INFO L225 Difference]: With dead ends: 1745 [2025-03-08 07:18:04,518 INFO L226 Difference]: Without dead ends: 1671 [2025-03-08 07:18:04,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:18:04,518 INFO L435 NwaCegarLoop]: 1524 mSDtfsCounter, 1476 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 1577 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-08 07:18:04,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 1577 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:18:04,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2025-03-08 07:18:04,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1667. [2025-03-08 07:18:04,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1665 states have (on average 1.8102102102102102) internal successors, (3014), 1666 states have internal predecessors, (3014), 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-08 07:18:04,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 3014 transitions. [2025-03-08 07:18:04,546 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 3014 transitions. Word has length 46 [2025-03-08 07:18:04,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:18:04,546 INFO L471 AbstractCegarLoop]: Abstraction has 1667 states and 3014 transitions. [2025-03-08 07:18:04,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-08 07:18:04,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 3014 transitions. [2025-03-08 07:18:04,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 07:18:04,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:18:04,548 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, 1, 1, 1, 1] [2025-03-08 07:18:04,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 07:18:04,548 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:18:04,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:18:04,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1864883128, now seen corresponding path program 1 times [2025-03-08 07:18:04,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:18:04,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517575491] [2025-03-08 07:18:04,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:18:04,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:18:04,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 07:18:04,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 07:18:04,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:18:04,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:18:04,743 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-08 07:18:04,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:18:04,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517575491] [2025-03-08 07:18:04,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517575491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:18:04,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:18:04,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:18:04,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990974013] [2025-03-08 07:18:04,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:18:04,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:18:04,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:18:04,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:18:04,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:18:04,745 INFO L87 Difference]: Start difference. First operand 1667 states and 3014 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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-08 07:18:04,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:18:04,842 INFO L93 Difference]: Finished difference Result 1802 states and 3222 transitions. [2025-03-08 07:18:04,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:18:04,842 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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 46 [2025-03-08 07:18:04,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:18:04,849 INFO L225 Difference]: With dead ends: 1802 [2025-03-08 07:18:04,849 INFO L226 Difference]: Without dead ends: 1669 [2025-03-08 07:18:04,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-08 07:18:04,850 INFO L435 NwaCegarLoop]: 1522 mSDtfsCounter, 4455 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4455 SdHoareTripleChecker+Valid, 1690 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:18:04,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4455 Valid, 1690 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:18:04,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2025-03-08 07:18:04,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1667. [2025-03-08 07:18:04,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1665 states have (on average 1.809009009009009) internal successors, (3012), 1666 states have internal predecessors, (3012), 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-08 07:18:04,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 3012 transitions. [2025-03-08 07:18:04,879 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 3012 transitions. Word has length 46 [2025-03-08 07:18:04,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:18:04,880 INFO L471 AbstractCegarLoop]: Abstraction has 1667 states and 3012 transitions. [2025-03-08 07:18:04,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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-08 07:18:04,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 3012 transitions. [2025-03-08 07:18:04,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 07:18:04,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:18:04,881 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, 1, 1, 1, 1, 1] [2025-03-08 07:18:04,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 07:18:04,882 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:18:04,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:18:04,882 INFO L85 PathProgramCache]: Analyzing trace with hash 2007339854, now seen corresponding path program 1 times [2025-03-08 07:18:04,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:18:04,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470852702] [2025-03-08 07:18:04,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:18:04,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:18:04,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 07:18:04,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 07:18:04,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:18:04,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:18:05,065 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-08 07:18:05,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:18:05,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470852702] [2025-03-08 07:18:05,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470852702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:18:05,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:18:05,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:18:05,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257460127] [2025-03-08 07:18:05,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:18:05,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:18:05,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:18:05,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:18:05,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:18:05,067 INFO L87 Difference]: Start difference. First operand 1667 states and 3012 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-08 07:18:05,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:18:05,101 INFO L93 Difference]: Finished difference Result 1675 states and 3021 transitions. [2025-03-08 07:18:05,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:18:05,102 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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 47 [2025-03-08 07:18:05,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:18:05,106 INFO L225 Difference]: With dead ends: 1675 [2025-03-08 07:18:05,106 INFO L226 Difference]: Without dead ends: 1673 [2025-03-08 07:18:05,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-08 07:18:05,107 INFO L435 NwaCegarLoop]: 1525 mSDtfsCounter, 0 mSDsluCounter, 4566 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6091 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:18:05,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6091 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:18:05,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2025-03-08 07:18:05,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1673. [2025-03-08 07:18:05,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1673 states, 1671 states have (on average 1.8055056852184321) internal successors, (3017), 1672 states have internal predecessors, (3017), 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-08 07:18:05,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 3017 transitions. [2025-03-08 07:18:05,133 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 3017 transitions. Word has length 47 [2025-03-08 07:18:05,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:18:05,133 INFO L471 AbstractCegarLoop]: Abstraction has 1673 states and 3017 transitions. [2025-03-08 07:18:05,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-08 07:18:05,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 3017 transitions. [2025-03-08 07:18:05,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 07:18:05,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:18:05,134 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, 1, 1, 1, 1, 1, 1] [2025-03-08 07:18:05,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 07:18:05,134 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:18:05,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:18:05,134 INFO L85 PathProgramCache]: Analyzing trace with hash 56563094, now seen corresponding path program 1 times [2025-03-08 07:18:05,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:18:05,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396077151] [2025-03-08 07:18:05,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:18:05,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:18:05,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 07:18:05,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 07:18:05,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:18:05,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:18:05,180 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-08 07:18:05,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:18:05,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396077151] [2025-03-08 07:18:05,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396077151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:18:05,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:18:05,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:18:05,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159760979] [2025-03-08 07:18:05,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:18:05,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:18:05,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:18:05,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:18:05,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:18:05,183 INFO L87 Difference]: Start difference. First operand 1673 states and 3017 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-08 07:18:05,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:18:05,204 INFO L93 Difference]: Finished difference Result 1935 states and 3409 transitions. [2025-03-08 07:18:05,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:18:05,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 48 [2025-03-08 07:18:05,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:18:05,210 INFO L225 Difference]: With dead ends: 1935 [2025-03-08 07:18:05,210 INFO L226 Difference]: Without dead ends: 1796 [2025-03-08 07:18:05,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:18:05,212 INFO L435 NwaCegarLoop]: 1565 mSDtfsCounter, 1487 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1487 SdHoareTripleChecker+Valid, 1630 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:18:05,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1487 Valid, 1630 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:18:05,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1796 states. [2025-03-08 07:18:05,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1796 to 1794. [2025-03-08 07:18:05,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1794 states, 1792 states have (on average 1.7823660714285714) internal successors, (3194), 1793 states have internal predecessors, (3194), 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-08 07:18:05,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1794 states and 3194 transitions. [2025-03-08 07:18:05,240 INFO L78 Accepts]: Start accepts. Automaton has 1794 states and 3194 transitions. Word has length 48 [2025-03-08 07:18:05,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:18:05,240 INFO L471 AbstractCegarLoop]: Abstraction has 1794 states and 3194 transitions. [2025-03-08 07:18:05,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-08 07:18:05,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 3194 transitions. [2025-03-08 07:18:05,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 07:18:05,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:18:05,242 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, 1, 1, 1, 1, 1, 1] [2025-03-08 07:18:05,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 07:18:05,242 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:18:05,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:18:05,242 INFO L85 PathProgramCache]: Analyzing trace with hash 471738966, now seen corresponding path program 1 times [2025-03-08 07:18:05,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:18:05,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437559676] [2025-03-08 07:18:05,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:18:05,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:18:05,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 07:18:05,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 07:18:05,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:18:05,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:18:05,299 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-08 07:18:05,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:18:05,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437559676] [2025-03-08 07:18:05,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437559676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:18:05,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:18:05,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:18:05,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795308492] [2025-03-08 07:18:05,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:18:05,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:18:05,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:18:05,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:18:05,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:18:05,300 INFO L87 Difference]: Start difference. First operand 1794 states and 3194 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-08 07:18:05,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:18:05,326 INFO L93 Difference]: Finished difference Result 2282 states and 3912 transitions. [2025-03-08 07:18:05,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:18:05,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 48 [2025-03-08 07:18:05,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:18:05,333 INFO L225 Difference]: With dead ends: 2282 [2025-03-08 07:18:05,333 INFO L226 Difference]: Without dead ends: 2022 [2025-03-08 07:18:05,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:18:05,334 INFO L435 NwaCegarLoop]: 1563 mSDtfsCounter, 1485 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1485 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:18:05,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1485 Valid, 1632 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:18:05,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2022 states. [2025-03-08 07:18:05,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2022 to 2020. [2025-03-08 07:18:05,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2020 states, 2018 states have (on average 1.7423191278493557) internal successors, (3516), 2019 states have internal predecessors, (3516), 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-08 07:18:05,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 2020 states and 3516 transitions. [2025-03-08 07:18:05,365 INFO L78 Accepts]: Start accepts. Automaton has 2020 states and 3516 transitions. Word has length 48 [2025-03-08 07:18:05,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:18:05,367 INFO L471 AbstractCegarLoop]: Abstraction has 2020 states and 3516 transitions. [2025-03-08 07:18:05,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-08 07:18:05,368 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 3516 transitions. [2025-03-08 07:18:05,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 07:18:05,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:18:05,369 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, 1, 1, 1, 1, 1, 1] [2025-03-08 07:18:05,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 07:18:05,369 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:18:05,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:18:05,369 INFO L85 PathProgramCache]: Analyzing trace with hash -14979306, now seen corresponding path program 1 times [2025-03-08 07:18:05,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:18:05,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521703668] [2025-03-08 07:18:05,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:18:05,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:18:05,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 07:18:05,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 07:18:05,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:18:05,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:18:05,423 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-08 07:18:05,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:18:05,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521703668] [2025-03-08 07:18:05,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521703668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:18:05,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:18:05,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:18:05,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243205700] [2025-03-08 07:18:05,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:18:05,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:18:05,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:18:05,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:18:05,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:18:05,424 INFO L87 Difference]: Start difference. First operand 2020 states and 3516 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-08 07:18:05,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:18:05,453 INFO L93 Difference]: Finished difference Result 2928 states and 4822 transitions. [2025-03-08 07:18:05,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:18:05,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 48 [2025-03-08 07:18:05,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:18:05,461 INFO L225 Difference]: With dead ends: 2928 [2025-03-08 07:18:05,461 INFO L226 Difference]: Without dead ends: 2442 [2025-03-08 07:18:05,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:18:05,462 INFO L435 NwaCegarLoop]: 1561 mSDtfsCounter, 1483 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1483 SdHoareTripleChecker+Valid, 1634 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:18:05,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1483 Valid, 1634 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:18:05,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2025-03-08 07:18:05,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2440. [2025-03-08 07:18:05,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2440 states, 2438 states have (on average 1.6800656275635768) internal successors, (4096), 2439 states have internal predecessors, (4096), 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-08 07:18:05,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2440 states to 2440 states and 4096 transitions. [2025-03-08 07:18:05,502 INFO L78 Accepts]: Start accepts. Automaton has 2440 states and 4096 transitions. Word has length 48 [2025-03-08 07:18:05,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:18:05,502 INFO L471 AbstractCegarLoop]: Abstraction has 2440 states and 4096 transitions. [2025-03-08 07:18:05,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-08 07:18:05,502 INFO L276 IsEmpty]: Start isEmpty. Operand 2440 states and 4096 transitions. [2025-03-08 07:18:05,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 07:18:05,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:18:05,503 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:18:05,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 07:18:05,503 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:18:05,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:18:05,507 INFO L85 PathProgramCache]: Analyzing trace with hash -2144209802, now seen corresponding path program 1 times [2025-03-08 07:18:05,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:18:05,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524360300] [2025-03-08 07:18:05,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:18:05,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:18:05,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 07:18:05,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 07:18:05,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:18:05,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:18:05,554 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-08 07:18:05,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:18:05,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524360300] [2025-03-08 07:18:05,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524360300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:18:05,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:18:05,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:18:05,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503950209] [2025-03-08 07:18:05,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:18:05,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:18:05,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:18:05,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:18:05,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:18:05,555 INFO L87 Difference]: Start difference. First operand 2440 states and 4096 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-08 07:18:05,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:18:05,590 INFO L93 Difference]: Finished difference Result 3407 states and 5494 transitions. [2025-03-08 07:18:05,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:18:05,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 50 [2025-03-08 07:18:05,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:18:05,599 INFO L225 Difference]: With dead ends: 3407 [2025-03-08 07:18:05,599 INFO L226 Difference]: Without dead ends: 2876 [2025-03-08 07:18:05,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:18:05,603 INFO L435 NwaCegarLoop]: 1570 mSDtfsCounter, 1486 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1486 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:18:05,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1486 Valid, 1631 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:18:05,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2876 states. [2025-03-08 07:18:05,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2876 to 2874. [2025-03-08 07:18:05,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2874 states, 2872 states have (on average 1.6357938718662952) internal successors, (4698), 2873 states have internal predecessors, (4698), 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-08 07:18:05,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2874 states to 2874 states and 4698 transitions. [2025-03-08 07:18:05,652 INFO L78 Accepts]: Start accepts. Automaton has 2874 states and 4698 transitions. Word has length 50 [2025-03-08 07:18:05,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:18:05,653 INFO L471 AbstractCegarLoop]: Abstraction has 2874 states and 4698 transitions. [2025-03-08 07:18:05,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-08 07:18:05,653 INFO L276 IsEmpty]: Start isEmpty. Operand 2874 states and 4698 transitions. [2025-03-08 07:18:05,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 07:18:05,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:18:05,654 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] [2025-03-08 07:18:05,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 07:18:05,655 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:18:05,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:18:05,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1690582205, now seen corresponding path program 1 times [2025-03-08 07:18:05,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:18:05,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322567237] [2025-03-08 07:18:05,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:18:05,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:18:05,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 07:18:05,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 07:18:05,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:18:05,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:18:05,765 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 07:18:05,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:18:05,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322567237] [2025-03-08 07:18:05,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322567237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:18:05,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:18:05,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:18:05,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620880461] [2025-03-08 07:18:05,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:18:05,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:18:05,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:18:05,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:18:05,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:18:05,767 INFO L87 Difference]: Start difference. First operand 2874 states and 4698 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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-08 07:18:05,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:18:05,983 INFO L93 Difference]: Finished difference Result 8524 states and 12655 transitions. [2025-03-08 07:18:05,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:18:05,983 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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 65 [2025-03-08 07:18:05,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:18:06,012 INFO L225 Difference]: With dead ends: 8524 [2025-03-08 07:18:06,012 INFO L226 Difference]: Without dead ends: 7186 [2025-03-08 07:18:06,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:18:06,023 INFO L435 NwaCegarLoop]: 1582 mSDtfsCounter, 4667 mSDsluCounter, 1768 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4667 SdHoareTripleChecker+Valid, 3350 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:18:06,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4667 Valid, 3350 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:18:06,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7186 states. [2025-03-08 07:18:06,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7186 to 4210. [2025-03-08 07:18:06,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4210 states, 4208 states have (on average 1.5594106463878328) internal successors, (6562), 4209 states have internal predecessors, (6562), 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-08 07:18:06,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4210 states to 4210 states and 6562 transitions. [2025-03-08 07:18:06,146 INFO L78 Accepts]: Start accepts. Automaton has 4210 states and 6562 transitions. Word has length 65 [2025-03-08 07:18:06,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:18:06,146 INFO L471 AbstractCegarLoop]: Abstraction has 4210 states and 6562 transitions. [2025-03-08 07:18:06,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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-08 07:18:06,146 INFO L276 IsEmpty]: Start isEmpty. Operand 4210 states and 6562 transitions. [2025-03-08 07:18:06,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 07:18:06,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:18:06,148 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] [2025-03-08 07:18:06,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 07:18:06,148 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:18:06,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:18:06,148 INFO L85 PathProgramCache]: Analyzing trace with hash 2105758077, now seen corresponding path program 1 times [2025-03-08 07:18:06,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:18:06,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284459676] [2025-03-08 07:18:06,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:18:06,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:18:06,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 07:18:06,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 07:18:06,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:18:06,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:18:06,273 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 07:18:06,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:18:06,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284459676] [2025-03-08 07:18:06,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284459676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:18:06,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:18:06,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:18:06,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480913945] [2025-03-08 07:18:06,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:18:06,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:18:06,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:18:06,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:18:06,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:18:06,275 INFO L87 Difference]: Start difference. First operand 4210 states and 6562 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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-08 07:18:06,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:18:06,445 INFO L93 Difference]: Finished difference Result 9860 states and 14519 transitions. [2025-03-08 07:18:06,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:18:06,445 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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-08 07:18:06,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:18:06,459 INFO L225 Difference]: With dead ends: 9860 [2025-03-08 07:18:06,459 INFO L226 Difference]: Without dead ends: 8522 [2025-03-08 07:18:06,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:18:06,465 INFO L435 NwaCegarLoop]: 1579 mSDtfsCounter, 4688 mSDsluCounter, 1739 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4688 SdHoareTripleChecker+Valid, 3318 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:18:06,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4688 Valid, 3318 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:18:06,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8522 states. [2025-03-08 07:18:06,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8522 to 6218. [2025-03-08 07:18:06,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6218 states, 6216 states have (on average 1.5022522522522523) internal successors, (9338), 6217 states have internal predecessors, (9338), 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-08 07:18:06,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 9338 transitions. [2025-03-08 07:18:06,638 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 9338 transitions. Word has length 65 [2025-03-08 07:18:06,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:18:06,638 INFO L471 AbstractCegarLoop]: Abstraction has 6218 states and 9338 transitions. [2025-03-08 07:18:06,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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-08 07:18:06,639 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 9338 transitions. [2025-03-08 07:18:06,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 07:18:06,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:18:06,640 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] [2025-03-08 07:18:06,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 07:18:06,641 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:18:06,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:18:06,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1619039805, now seen corresponding path program 1 times [2025-03-08 07:18:06,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:18:06,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551988382] [2025-03-08 07:18:06,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:18:06,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:18:06,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 07:18:06,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 07:18:06,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:18:06,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:18:06,734 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 07:18:06,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:18:06,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551988382] [2025-03-08 07:18:06,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551988382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:18:06,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:18:06,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:18:06,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489891831] [2025-03-08 07:18:06,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:18:06,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:18:06,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:18:06,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:18:06,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:18:06,736 INFO L87 Difference]: Start difference. First operand 6218 states and 9338 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:18:06,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:18:06,898 INFO L93 Difference]: Finished difference Result 11196 states and 16383 transitions. [2025-03-08 07:18:06,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:18:06,899 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-08 07:18:06,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:18:06,915 INFO L225 Difference]: With dead ends: 11196 [2025-03-08 07:18:06,915 INFO L226 Difference]: Without dead ends: 9858 [2025-03-08 07:18:06,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:18:06,921 INFO L435 NwaCegarLoop]: 1581 mSDtfsCounter, 4673 mSDsluCounter, 1756 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4673 SdHoareTripleChecker+Valid, 3337 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:18:06,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4673 Valid, 3337 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:18:06,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9858 states. [2025-03-08 07:18:07,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9858 to 7554. [2025-03-08 07:18:07,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7554 states, 7552 states have (on average 1.4833156779661016) internal successors, (11202), 7553 states have internal predecessors, (11202), 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-08 07:18:07,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7554 states to 7554 states and 11202 transitions. [2025-03-08 07:18:07,100 INFO L78 Accepts]: Start accepts. Automaton has 7554 states and 11202 transitions. Word has length 65 [2025-03-08 07:18:07,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:18:07,101 INFO L471 AbstractCegarLoop]: Abstraction has 7554 states and 11202 transitions. [2025-03-08 07:18:07,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:18:07,101 INFO L276 IsEmpty]: Start isEmpty. Operand 7554 states and 11202 transitions. [2025-03-08 07:18:07,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 07:18:07,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:18:07,102 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2025-03-08 07:18:07,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 07:18:07,102 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:18:07,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:18:07,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1990429701, now seen corresponding path program 1 times [2025-03-08 07:18:07,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:18:07,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145516114] [2025-03-08 07:18:07,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:18:07,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:18:07,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 07:18:07,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 07:18:07,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:18:07,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:18:07,186 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:18:07,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:18:07,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145516114] [2025-03-08 07:18:07,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145516114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:18:07,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:18:07,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:18:07,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762133112] [2025-03-08 07:18:07,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:18:07,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:18:07,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:18:07,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:18:07,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:18:07,187 INFO L87 Difference]: Start difference. First operand 7554 states and 11202 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-08 07:18:07,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:18:07,274 INFO L93 Difference]: Finished difference Result 11896 states and 17343 transitions. [2025-03-08 07:18:07,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:18:07,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-08 07:18:07,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:18:07,287 INFO L225 Difference]: With dead ends: 11896 [2025-03-08 07:18:07,287 INFO L226 Difference]: Without dead ends: 5878 [2025-03-08 07:18:07,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:18:07,295 INFO L435 NwaCegarLoop]: 1560 mSDtfsCounter, 42 mSDsluCounter, 1513 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 3073 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:18:07,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 3073 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:18:07,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5878 states. [2025-03-08 07:18:07,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5878 to 5876. [2025-03-08 07:18:07,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5876 states, 5874 states have (on average 1.5110657133129044) internal successors, (8876), 5875 states have internal predecessors, (8876), 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-08 07:18:07,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5876 states to 5876 states and 8876 transitions. [2025-03-08 07:18:07,415 INFO L78 Accepts]: Start accepts. Automaton has 5876 states and 8876 transitions. Word has length 67 [2025-03-08 07:18:07,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:18:07,415 INFO L471 AbstractCegarLoop]: Abstraction has 5876 states and 8876 transitions. [2025-03-08 07:18:07,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-08 07:18:07,415 INFO L276 IsEmpty]: Start isEmpty. Operand 5876 states and 8876 transitions. [2025-03-08 07:18:07,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 07:18:07,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:18:07,416 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-08 07:18:07,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 07:18:07,416 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:18:07,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:18:07,417 INFO L85 PathProgramCache]: Analyzing trace with hash 485092829, now seen corresponding path program 1 times [2025-03-08 07:18:07,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:18:07,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645743578] [2025-03-08 07:18:07,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:18:07,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:18:07,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 07:18:07,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 07:18:07,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:18:07,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:18:07,627 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 07:18:07,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:18:07,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645743578] [2025-03-08 07:18:07,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645743578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:18:07,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:18:07,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:18:07,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671018171] [2025-03-08 07:18:07,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:18:07,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:18:07,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:18:07,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:18:07,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:18:07,632 INFO L87 Difference]: Start difference. First operand 5876 states and 8876 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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-08 07:18:07,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:18:07,874 INFO L93 Difference]: Finished difference Result 9726 states and 14321 transitions. [2025-03-08 07:18:07,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:18:07,875 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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-08 07:18:07,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:18:07,888 INFO L225 Difference]: With dead ends: 9726 [2025-03-08 07:18:07,889 INFO L226 Difference]: Without dead ends: 8764 [2025-03-08 07:18:07,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:18:07,895 INFO L435 NwaCegarLoop]: 1577 mSDtfsCounter, 4665 mSDsluCounter, 1827 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4665 SdHoareTripleChecker+Valid, 3404 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:18:07,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4665 Valid, 3404 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:18:07,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8764 states. [2025-03-08 07:18:08,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8764 to 6836. [2025-03-08 07:18:08,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6836 states, 6834 states have (on average 1.495463857184665) internal successors, (10220), 6835 states have internal predecessors, (10220), 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-08 07:18:08,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6836 states to 6836 states and 10220 transitions. [2025-03-08 07:18:08,021 INFO L78 Accepts]: Start accepts. Automaton has 6836 states and 10220 transitions. Word has length 67 [2025-03-08 07:18:08,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:18:08,021 INFO L471 AbstractCegarLoop]: Abstraction has 6836 states and 10220 transitions. [2025-03-08 07:18:08,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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-08 07:18:08,022 INFO L276 IsEmpty]: Start isEmpty. Operand 6836 states and 10220 transitions. [2025-03-08 07:18:08,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 07:18:08,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:18:08,023 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:18:08,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 07:18:08,023 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:18:08,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:18:08,024 INFO L85 PathProgramCache]: Analyzing trace with hash 317371601, now seen corresponding path program 1 times [2025-03-08 07:18:08,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:18:08,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539468752] [2025-03-08 07:18:08,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:18:08,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:18:08,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 07:18:08,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 07:18:08,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:18:08,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:18:08,104 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:18:08,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:18:08,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539468752] [2025-03-08 07:18:08,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539468752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:18:08,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:18:08,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:18:08,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648280324] [2025-03-08 07:18:08,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:18:08,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:18:08,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:18:08,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:18:08,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:18:08,107 INFO L87 Difference]: Start difference. First operand 6836 states and 10220 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-08 07:18:08,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:18:08,172 INFO L93 Difference]: Finished difference Result 9480 states and 13918 transitions. [2025-03-08 07:18:08,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:18:08,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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 68 [2025-03-08 07:18:08,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:18:08,180 INFO L225 Difference]: With dead ends: 9480 [2025-03-08 07:18:08,180 INFO L226 Difference]: Without dead ends: 4198 [2025-03-08 07:18:08,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:18:08,186 INFO L435 NwaCegarLoop]: 1553 mSDtfsCounter, 37 mSDsluCounter, 1505 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 3058 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:18:08,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 3058 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:18:08,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4198 states. [2025-03-08 07:18:08,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4198 to 4196. [2025-03-08 07:18:08,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4196 states, 4194 states have (on average 1.5450643776824033) internal successors, (6480), 4195 states have internal predecessors, (6480), 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-08 07:18:08,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4196 states to 4196 states and 6480 transitions. [2025-03-08 07:18:08,249 INFO L78 Accepts]: Start accepts. Automaton has 4196 states and 6480 transitions. Word has length 68 [2025-03-08 07:18:08,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:18:08,250 INFO L471 AbstractCegarLoop]: Abstraction has 4196 states and 6480 transitions. [2025-03-08 07:18:08,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-08 07:18:08,250 INFO L276 IsEmpty]: Start isEmpty. Operand 4196 states and 6480 transitions. [2025-03-08 07:18:08,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 07:18:08,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:18:08,251 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, 1, 1, 1] [2025-03-08 07:18:08,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 07:18:08,251 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:18:08,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:18:08,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1409098024, now seen corresponding path program 1 times [2025-03-08 07:18:08,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:18:08,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232723846] [2025-03-08 07:18:08,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:18:08,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:18:08,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 07:18:08,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 07:18:08,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:18:08,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:18:08,331 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:18:08,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:18:08,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232723846] [2025-03-08 07:18:08,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232723846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:18:08,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:18:08,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:18:08,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914935144] [2025-03-08 07:18:08,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:18:08,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:18:08,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:18:08,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:18:08,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:18:08,333 INFO L87 Difference]: Start difference. First operand 4196 states and 6480 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-08 07:18:08,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:18:08,363 INFO L93 Difference]: Finished difference Result 5520 states and 8308 transitions. [2025-03-08 07:18:08,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:18:08,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 70 [2025-03-08 07:18:08,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:18:08,369 INFO L225 Difference]: With dead ends: 5520 [2025-03-08 07:18:08,369 INFO L226 Difference]: Without dead ends: 2878 [2025-03-08 07:18:08,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:18:08,372 INFO L435 NwaCegarLoop]: 1546 mSDtfsCounter, 34 mSDsluCounter, 1497 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 3043 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:18:08,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 3043 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:18:08,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2878 states. [2025-03-08 07:18:08,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2878 to 2876. [2025-03-08 07:18:08,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2876 states, 2874 states have (on average 1.6116910229645094) internal successors, (4632), 2875 states have internal predecessors, (4632), 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-08 07:18:08,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2876 states to 2876 states and 4632 transitions. [2025-03-08 07:18:08,411 INFO L78 Accepts]: Start accepts. Automaton has 2876 states and 4632 transitions. Word has length 70 [2025-03-08 07:18:08,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:18:08,411 INFO L471 AbstractCegarLoop]: Abstraction has 2876 states and 4632 transitions. [2025-03-08 07:18:08,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-08 07:18:08,411 INFO L276 IsEmpty]: Start isEmpty. Operand 2876 states and 4632 transitions. [2025-03-08 07:18:08,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 07:18:08,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:18:08,412 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:18:08,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 07:18:08,413 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:18:08,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:18:08,413 INFO L85 PathProgramCache]: Analyzing trace with hash -505296385, now seen corresponding path program 1 times [2025-03-08 07:18:08,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:18:08,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102220126] [2025-03-08 07:18:08,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:18:08,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:18:08,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 07:18:08,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 07:18:08,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:18:08,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:18:08,483 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:18:08,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:18:08,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102220126] [2025-03-08 07:18:08,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102220126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:18:08,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:18:08,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:18:08,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793256633] [2025-03-08 07:18:08,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:18:08,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:18:08,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:18:08,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:18:08,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:18:08,484 INFO L87 Difference]: Start difference. First operand 2876 states and 4632 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-08 07:18:08,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:18:08,507 INFO L93 Difference]: Finished difference Result 3540 states and 5536 transitions. [2025-03-08 07:18:08,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:18:08,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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 72 [2025-03-08 07:18:08,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:18:08,511 INFO L225 Difference]: With dead ends: 3540 [2025-03-08 07:18:08,511 INFO L226 Difference]: Without dead ends: 2218 [2025-03-08 07:18:08,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:18:08,513 INFO L435 NwaCegarLoop]: 1539 mSDtfsCounter, 31 mSDsluCounter, 1489 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3028 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:18:08,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 3028 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:18:08,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2025-03-08 07:18:08,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 2216. [2025-03-08 07:18:08,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2216 states, 2214 states have (on average 1.679765130984643) internal successors, (3719), 2215 states have internal predecessors, (3719), 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-08 07:18:08,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 3719 transitions. [2025-03-08 07:18:08,538 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 3719 transitions. Word has length 72 [2025-03-08 07:18:08,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:18:08,538 INFO L471 AbstractCegarLoop]: Abstraction has 2216 states and 3719 transitions. [2025-03-08 07:18:08,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-08 07:18:08,538 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 3719 transitions. [2025-03-08 07:18:08,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 07:18:08,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:18:08,539 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:18:08,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 07:18:08,540 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:18:08,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:18:08,540 INFO L85 PathProgramCache]: Analyzing trace with hash 163046982, now seen corresponding path program 1 times [2025-03-08 07:18:08,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:18:08,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303690228] [2025-03-08 07:18:08,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:18:08,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:18:08,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 07:18:08,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 07:18:08,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:18:08,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:18:09,878 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:18:09,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:18:09,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303690228] [2025-03-08 07:18:09,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303690228] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:18:09,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813773009] [2025-03-08 07:18:09,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:18:09,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:18:09,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:18:09,881 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:18:09,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 07:18:09,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 07:18:09,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 07:18:09,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:18:09,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:18:09,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 07:18:09,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:18:10,226 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:18:10,227 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:18:10,459 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:18:10,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813773009] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:18:10,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:18:10,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 6] total 22 [2025-03-08 07:18:10,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179923038] [2025-03-08 07:18:10,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:18:10,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 07:18:10,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:18:10,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 07:18:10,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2025-03-08 07:18:10,461 INFO L87 Difference]: Start difference. First operand 2216 states and 3719 transitions. Second operand has 22 states, 22 states have (on average 9.5) internal successors, (209), 22 states have internal predecessors, (209), 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-08 07:18:13,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:18:13,453 INFO L93 Difference]: Finished difference Result 8272 states and 11767 transitions. [2025-03-08 07:18:13,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-03-08 07:18:13,453 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 9.5) internal successors, (209), 22 states have internal predecessors, (209), 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 74 [2025-03-08 07:18:13,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:18:13,464 INFO L225 Difference]: With dead ends: 8272 [2025-03-08 07:18:13,465 INFO L226 Difference]: Without dead ends: 7536 [2025-03-08 07:18:13,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2850 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1313, Invalid=7243, Unknown=0, NotChecked=0, Total=8556 [2025-03-08 07:18:13,469 INFO L435 NwaCegarLoop]: 1517 mSDtfsCounter, 11766 mSDsluCounter, 9491 mSDsCounter, 0 mSdLazyCounter, 1863 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11766 SdHoareTripleChecker+Valid, 11008 SdHoareTripleChecker+Invalid, 1940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:18:13,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11766 Valid, 11008 Invalid, 1940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1863 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 07:18:13,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7536 states. [2025-03-08 07:18:13,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7536 to 7038. [2025-03-08 07:18:13,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7038 states, 7036 states have (on average 1.419556566230813) internal successors, (9988), 7037 states have internal predecessors, (9988), 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-08 07:18:13,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7038 states to 7038 states and 9988 transitions. [2025-03-08 07:18:13,612 INFO L78 Accepts]: Start accepts. Automaton has 7038 states and 9988 transitions. Word has length 74 [2025-03-08 07:18:13,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:18:13,612 INFO L471 AbstractCegarLoop]: Abstraction has 7038 states and 9988 transitions. [2025-03-08 07:18:13,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.5) internal successors, (209), 22 states have internal predecessors, (209), 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-08 07:18:13,612 INFO L276 IsEmpty]: Start isEmpty. Operand 7038 states and 9988 transitions. [2025-03-08 07:18:13,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 07:18:13,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:18:13,614 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:18:13,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 07:18:13,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:18:13,815 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:18:13,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:18:13,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1032286997, now seen corresponding path program 1 times [2025-03-08 07:18:13,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:18:13,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202190707] [2025-03-08 07:18:13,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:18:13,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:18:13,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 07:18:13,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 07:18:13,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:18:13,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:18:14,817 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:18:14,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:18:14,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202190707] [2025-03-08 07:18:14,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202190707] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:18:14,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167584995] [2025-03-08 07:18:14,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:18:14,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:18:14,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:18:14,819 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:18:14,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 07:18:14,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 07:18:14,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 07:18:14,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:18:14,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:18:14,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 07:18:14,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:18:15,263 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:18:15,264 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:18:16,123 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:18:16,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167584995] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:18:16,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:18:16,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 13] total 31 [2025-03-08 07:18:16,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891017937] [2025-03-08 07:18:16,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:18:16,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-08 07:18:16,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:18:16,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-08 07:18:16,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=824, Unknown=0, NotChecked=0, Total=930 [2025-03-08 07:18:16,125 INFO L87 Difference]: Start difference. First operand 7038 states and 9988 transitions. Second operand has 31 states, 31 states have (on average 6.548387096774194) internal successors, (203), 31 states have internal predecessors, (203), 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-08 07:18:17,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:18:17,926 INFO L93 Difference]: Finished difference Result 27900 states and 37175 transitions. [2025-03-08 07:18:17,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-08 07:18:17,926 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 6.548387096774194) internal successors, (203), 31 states have internal predecessors, (203), 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 75 [2025-03-08 07:18:17,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:18:17,957 INFO L225 Difference]: With dead ends: 27900 [2025-03-08 07:18:17,957 INFO L226 Difference]: Without dead ends: 22490 [2025-03-08 07:18:17,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 888 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=697, Invalid=3335, Unknown=0, NotChecked=0, Total=4032 [2025-03-08 07:18:17,963 INFO L435 NwaCegarLoop]: 1492 mSDtfsCounter, 14092 mSDsluCounter, 8036 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14092 SdHoareTripleChecker+Valid, 9528 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:18:17,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14092 Valid, 9528 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:18:17,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22490 states. [2025-03-08 07:18:18,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22490 to 22326. [2025-03-08 07:18:18,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22326 states, 22324 states have (on average 1.3297796093889984) internal successors, (29686), 22325 states have internal predecessors, (29686), 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-08 07:18:18,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22326 states to 22326 states and 29686 transitions. [2025-03-08 07:18:18,511 INFO L78 Accepts]: Start accepts. Automaton has 22326 states and 29686 transitions. Word has length 75 [2025-03-08 07:18:18,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:18:18,512 INFO L471 AbstractCegarLoop]: Abstraction has 22326 states and 29686 transitions. [2025-03-08 07:18:18,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 6.548387096774194) internal successors, (203), 31 states have internal predecessors, (203), 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-08 07:18:18,512 INFO L276 IsEmpty]: Start isEmpty. Operand 22326 states and 29686 transitions. [2025-03-08 07:18:18,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 07:18:18,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:18:18,514 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:18:18,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 07:18:18,716 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,SelfDestructingSolverStorable19 [2025-03-08 07:18:18,716 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:18:18,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:18:18,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1424546165, now seen corresponding path program 1 times [2025-03-08 07:18:18,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:18:18,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860253266] [2025-03-08 07:18:18,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:18:18,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:18:18,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 07:18:18,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 07:18:18,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:18:18,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:18:19,013 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:18:19,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:18:19,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860253266] [2025-03-08 07:18:19,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860253266] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:18:19,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754100966] [2025-03-08 07:18:19,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:18:19,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:18:19,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:18:19,015 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-08 07:18:19,017 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-08 07:18:19,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 07:18:19,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 07:18:19,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:18:19,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:18:19,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 07:18:19,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:18:19,429 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:18:19,429 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:18:19,913 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:18:19,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754100966] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:18:19,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:18:19,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-03-08 07:18:19,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592803699] [2025-03-08 07:18:19,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:18:19,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 07:18:19,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:18:19,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 07:18:19,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2025-03-08 07:18:19,914 INFO L87 Difference]: Start difference. First operand 22326 states and 29686 transitions. Second operand has 23 states, 23 states have (on average 7.782608695652174) internal successors, (179), 22 states have internal predecessors, (179), 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-08 07:18:20,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:18:20,594 INFO L93 Difference]: Finished difference Result 42686 states and 56149 transitions. [2025-03-08 07:18:20,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 07:18:20,594 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.782608695652174) internal successors, (179), 22 states have internal predecessors, (179), 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 75 [2025-03-08 07:18:20,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:18:20,626 INFO L225 Difference]: With dead ends: 42686 [2025-03-08 07:18:20,627 INFO L226 Difference]: Without dead ends: 23218 [2025-03-08 07:18:20,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=278, Invalid=844, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 07:18:20,638 INFO L435 NwaCegarLoop]: 1501 mSDtfsCounter, 18125 mSDsluCounter, 4615 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18125 SdHoareTripleChecker+Valid, 6116 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:18:20,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18125 Valid, 6116 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:18:20,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23218 states. [2025-03-08 07:18:21,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23218 to 21858. [2025-03-08 07:18:21,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21858 states, 21856 states have (on average 1.316663616398243) internal successors, (28777), 21857 states have internal predecessors, (28777), 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-08 07:18:21,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21858 states to 21858 states and 28777 transitions. [2025-03-08 07:18:21,289 INFO L78 Accepts]: Start accepts. Automaton has 21858 states and 28777 transitions. Word has length 75 [2025-03-08 07:18:21,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:18:21,290 INFO L471 AbstractCegarLoop]: Abstraction has 21858 states and 28777 transitions. [2025-03-08 07:18:21,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.782608695652174) internal successors, (179), 22 states have internal predecessors, (179), 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-08 07:18:21,290 INFO L276 IsEmpty]: Start isEmpty. Operand 21858 states and 28777 transitions. [2025-03-08 07:18:21,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 07:18:21,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:18:21,291 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:18:21,298 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-08 07:18:21,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:18:21,493 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:18:21,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:18:21,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1434856139, now seen corresponding path program 1 times [2025-03-08 07:18:21,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:18:21,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451982921] [2025-03-08 07:18:21,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:18:21,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:18:21,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 07:18:21,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 07:18:21,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:18:21,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:18:21,845 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:18:21,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:18:21,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451982921] [2025-03-08 07:18:21,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451982921] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:18:21,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794358918] [2025-03-08 07:18:21,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:18:21,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:18:21,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:18:21,848 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-08 07:18:21,850 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-08 07:18:21,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 07:18:21,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 07:18:21,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:18:21,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:18:21,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 07:18:21,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:18:22,246 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:18:22,246 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:18:22,724 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:18:22,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794358918] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:18:22,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:18:22,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-08 07:18:22,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264318830] [2025-03-08 07:18:22,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:18:22,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 07:18:22,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:18:22,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 07:18:22,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2025-03-08 07:18:22,727 INFO L87 Difference]: Start difference. First operand 21858 states and 28777 transitions. Second operand has 21 states, 21 states have (on average 7.666666666666667) internal successors, (161), 20 states have internal predecessors, (161), 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-08 07:18:23,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:18:23,823 INFO L93 Difference]: Finished difference Result 63206 states and 81982 transitions. [2025-03-08 07:18:23,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 07:18:23,826 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 7.666666666666667) internal successors, (161), 20 states have internal predecessors, (161), 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 75 [2025-03-08 07:18:23,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:18:23,879 INFO L225 Difference]: With dead ends: 63206 [2025-03-08 07:18:23,879 INFO L226 Difference]: Without dead ends: 43718 [2025-03-08 07:18:23,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2025-03-08 07:18:23,893 INFO L435 NwaCegarLoop]: 1523 mSDtfsCounter, 12079 mSDsluCounter, 4750 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12079 SdHoareTripleChecker+Valid, 6273 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:18:23,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12079 Valid, 6273 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:18:23,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43718 states. [2025-03-08 07:18:24,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43718 to 43170. [2025-03-08 07:18:24,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43170 states, 43168 states have (on average 1.282385100074129) internal successors, (55358), 43169 states have internal predecessors, (55358), 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-08 07:18:24,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43170 states to 43170 states and 55358 transitions. [2025-03-08 07:18:24,913 INFO L78 Accepts]: Start accepts. Automaton has 43170 states and 55358 transitions. Word has length 75 [2025-03-08 07:18:24,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:18:24,914 INFO L471 AbstractCegarLoop]: Abstraction has 43170 states and 55358 transitions. [2025-03-08 07:18:24,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.666666666666667) internal successors, (161), 20 states have internal predecessors, (161), 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-08 07:18:24,914 INFO L276 IsEmpty]: Start isEmpty. Operand 43170 states and 55358 transitions. [2025-03-08 07:18:24,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 07:18:24,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:18:24,915 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:18:24,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 07:18:25,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:18:25,116 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:18:25,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:18:25,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1161185343, now seen corresponding path program 1 times [2025-03-08 07:18:25,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:18:25,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836438519] [2025-03-08 07:18:25,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:18:25,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:18:25,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 07:18:25,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 07:18:25,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:18:25,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:18:25,309 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:18:25,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:18:25,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836438519] [2025-03-08 07:18:25,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836438519] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:18:25,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306581553] [2025-03-08 07:18:25,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:18:25,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:18:25,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:18:25,312 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-08 07:18:25,313 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-08 07:18:25,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 07:18:25,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 07:18:25,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:18:25,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:18:25,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 07:18:25,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:18:25,716 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:18:25,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:18:26,235 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:18:26,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306581553] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:18:26,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:18:26,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-03-08 07:18:26,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560962859] [2025-03-08 07:18:26,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:18:26,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 07:18:26,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:18:26,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 07:18:26,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2025-03-08 07:18:26,237 INFO L87 Difference]: Start difference. First operand 43170 states and 55358 transitions. Second operand has 23 states, 23 states have (on average 7.521739130434782) internal successors, (173), 22 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:18:27,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:18:27,916 INFO L93 Difference]: Finished difference Result 84532 states and 107930 transitions. [2025-03-08 07:18:27,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 07:18:27,920 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.521739130434782) internal successors, (173), 22 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-08 07:18:27,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:18:27,982 INFO L225 Difference]: With dead ends: 84532 [2025-03-08 07:18:27,982 INFO L226 Difference]: Without dead ends: 44854 [2025-03-08 07:18:28,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=278, Invalid=844, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 07:18:28,018 INFO L435 NwaCegarLoop]: 1517 mSDtfsCounter, 20806 mSDsluCounter, 6287 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20806 SdHoareTripleChecker+Valid, 7804 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:18:28,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20806 Valid, 7804 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:18:28,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44854 states. [2025-03-08 07:18:29,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44854 to 42370. [2025-03-08 07:18:29,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42370 states, 42368 states have (on average 1.272516993957704) internal successors, (53914), 42369 states have internal predecessors, (53914), 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-08 07:18:29,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42370 states to 42370 states and 53914 transitions. [2025-03-08 07:18:29,214 INFO L78 Accepts]: Start accepts. Automaton has 42370 states and 53914 transitions. Word has length 76 [2025-03-08 07:18:29,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:18:29,215 INFO L471 AbstractCegarLoop]: Abstraction has 42370 states and 53914 transitions. [2025-03-08 07:18:29,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.521739130434782) internal successors, (173), 22 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:18:29,215 INFO L276 IsEmpty]: Start isEmpty. Operand 42370 states and 53914 transitions. [2025-03-08 07:18:29,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 07:18:29,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:18:29,217 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:18:29,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 07:18:29,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-08 07:18:29,420 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:18:29,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:18:29,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1571986160, now seen corresponding path program 1 times [2025-03-08 07:18:29,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:18:29,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283173183] [2025-03-08 07:18:29,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:18:29,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:18:29,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 07:18:29,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 07:18:29,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:18:29,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:18:29,967 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:18:29,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:18:29,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283173183] [2025-03-08 07:18:29,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283173183] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:18:29,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846298245] [2025-03-08 07:18:29,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:18:29,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:18:29,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:18:29,969 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-08 07:18:29,970 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-08 07:18:30,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 07:18:30,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 07:18:30,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:18:30,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:18:30,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-08 07:18:30,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:18:33,152 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:18:33,152 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:18:34,369 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:18:34,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846298245] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:18:34,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:18:34,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 20, 17] total 45 [2025-03-08 07:18:34,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899270026] [2025-03-08 07:18:34,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:18:34,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-08 07:18:34,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:18:34,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-08 07:18:34,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=1730, Unknown=0, NotChecked=0, Total=1980 [2025-03-08 07:18:34,371 INFO L87 Difference]: Start difference. First operand 42370 states and 53914 transitions. Second operand has 45 states, 45 states have (on average 4.4222222222222225) internal successors, (199), 45 states have internal predecessors, (199), 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-08 07:18:38,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 07:18:40,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 07:18:53,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:18:53,062 INFO L93 Difference]: Finished difference Result 109534 states and 139557 transitions. [2025-03-08 07:18:53,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2025-03-08 07:18:53,063 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 4.4222222222222225) internal successors, (199), 45 states have internal predecessors, (199), 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 77 [2025-03-08 07:18:53,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:18:53,161 INFO L225 Difference]: With dead ends: 109534 [2025-03-08 07:18:53,161 INFO L226 Difference]: Without dead ends: 88744 [2025-03-08 07:18:53,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4983 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=3330, Invalid=12672, Unknown=0, NotChecked=0, Total=16002 [2025-03-08 07:18:53,188 INFO L435 NwaCegarLoop]: 1559 mSDtfsCounter, 19117 mSDsluCounter, 22452 mSDsCounter, 0 mSdLazyCounter, 2604 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19117 SdHoareTripleChecker+Valid, 24011 SdHoareTripleChecker+Invalid, 2682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 2604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:18:53,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19117 Valid, 24011 Invalid, 2682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 2604 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2025-03-08 07:18:53,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88744 states. [2025-03-08 07:18:55,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88744 to 57894. [2025-03-08 07:18:55,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57894 states, 57892 states have (on average 1.272490154080011) internal successors, (73667), 57893 states have internal predecessors, (73667), 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-08 07:18:55,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57894 states to 57894 states and 73667 transitions. [2025-03-08 07:18:55,549 INFO L78 Accepts]: Start accepts. Automaton has 57894 states and 73667 transitions. Word has length 77 [2025-03-08 07:18:55,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:18:55,550 INFO L471 AbstractCegarLoop]: Abstraction has 57894 states and 73667 transitions. [2025-03-08 07:18:55,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 4.4222222222222225) internal successors, (199), 45 states have internal predecessors, (199), 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-08 07:18:55,550 INFO L276 IsEmpty]: Start isEmpty. Operand 57894 states and 73667 transitions. [2025-03-08 07:18:55,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 07:18:55,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:18:55,551 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:18:55,558 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-08 07:18:55,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:18:55,752 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:18:55,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:18:55,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1286826896, now seen corresponding path program 1 times [2025-03-08 07:18:55,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:18:55,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103998740] [2025-03-08 07:18:55,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:18:55,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:18:55,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 07:18:55,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 07:18:55,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:18:55,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:18:56,465 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:18:56,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:18:56,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103998740] [2025-03-08 07:18:56,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103998740] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:18:56,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354002487] [2025-03-08 07:18:56,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:18:56,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:18:56,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:18:56,468 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-08 07:18:56,470 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-08 07:18:56,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 07:18:56,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 07:18:56,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:18:56,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:18:56,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-08 07:18:56,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:18:57,164 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:18:57,165 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:18:58,359 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:18:58,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354002487] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:18:58,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:18:58,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 16] total 36 [2025-03-08 07:18:58,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133729217] [2025-03-08 07:18:58,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:18:58,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-08 07:18:58,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:18:58,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-08 07:18:58,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1118, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 07:18:58,361 INFO L87 Difference]: Start difference. First operand 57894 states and 73667 transitions. Second operand has 36 states, 36 states have (on average 5.527777777777778) internal successors, (199), 36 states have internal predecessors, (199), 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-08 07:19:00,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:00,754 INFO L93 Difference]: Finished difference Result 79264 states and 99749 transitions. [2025-03-08 07:19:00,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 07:19:00,755 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 5.527777777777778) internal successors, (199), 36 states have internal predecessors, (199), 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 77 [2025-03-08 07:19:00,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:00,825 INFO L225 Difference]: With dead ends: 79264 [2025-03-08 07:19:00,825 INFO L226 Difference]: Without dead ends: 57294 [2025-03-08 07:19:00,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=449, Invalid=2001, Unknown=0, NotChecked=0, Total=2450 [2025-03-08 07:19:00,848 INFO L435 NwaCegarLoop]: 1503 mSDtfsCounter, 9574 mSDsluCounter, 16797 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9574 SdHoareTripleChecker+Valid, 18300 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:19:00,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9574 Valid, 18300 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:19:00,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57294 states. [2025-03-08 07:19:02,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57294 to 50628. [2025-03-08 07:19:02,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50628 states, 50626 states have (on average 1.2708489708845256) internal successors, (64338), 50627 states have internal predecessors, (64338), 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-08 07:19:02,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50628 states to 50628 states and 64338 transitions. [2025-03-08 07:19:02,459 INFO L78 Accepts]: Start accepts. Automaton has 50628 states and 64338 transitions. Word has length 77 [2025-03-08 07:19:02,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:02,459 INFO L471 AbstractCegarLoop]: Abstraction has 50628 states and 64338 transitions. [2025-03-08 07:19:02,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 5.527777777777778) internal successors, (199), 36 states have internal predecessors, (199), 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-08 07:19:02,459 INFO L276 IsEmpty]: Start isEmpty. Operand 50628 states and 64338 transitions. [2025-03-08 07:19:02,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 07:19:02,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:02,464 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:19:02,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 07:19:02,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:19:02,665 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:02,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:02,665 INFO L85 PathProgramCache]: Analyzing trace with hash -221937505, now seen corresponding path program 1 times [2025-03-08 07:19:02,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:02,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088093339] [2025-03-08 07:19:02,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:02,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:02,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 07:19:02,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 07:19:02,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:02,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:03,298 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:19:03,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:03,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088093339] [2025-03-08 07:19:03,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088093339] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:19:03,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129150224] [2025-03-08 07:19:03,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:03,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:19:03,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:19:03,301 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-08 07:19:03,303 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-08 07:19:03,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 07:19:03,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 07:19:03,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:03,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:03,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-08 07:19:03,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:19:06,800 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:19:06,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:19:10,959 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:19:10,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129150224] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:19:10,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:19:10,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 29, 25] total 61 [2025-03-08 07:19:10,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167589270] [2025-03-08 07:19:10,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:19:10,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2025-03-08 07:19:10,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:10,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2025-03-08 07:19:10,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=471, Invalid=3189, Unknown=0, NotChecked=0, Total=3660 [2025-03-08 07:19:10,961 INFO L87 Difference]: Start difference. First operand 50628 states and 64338 transitions. Second operand has 61 states, 61 states have (on average 3.4754098360655736) internal successors, (212), 61 states have internal predecessors, (212), 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)