./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label00.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label00.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 6d20f8abdac11d3a14265079d0abbd72a3c88bf6607f5bf46f98ccd96bfda721 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:19:33,087 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:19:33,149 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:19:33,153 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:19:33,153 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:19:33,174 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:19:33,175 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:19:33,176 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:19:33,176 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:19:33,176 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:19:33,176 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:19:33,176 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:19:33,176 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:19:33,177 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:19:33,178 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:19:33,178 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:19:33,178 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:19:33,178 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:19:33,178 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:19:33,178 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:19:33,178 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:19:33,178 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:19:33,178 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:19:33,178 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:19:33,178 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:19:33,179 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:19:33,179 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:19:33,179 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:19:33,179 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:19:33,179 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:19:33,179 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:19:33,179 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:19:33,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:19:33,180 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:19:33,180 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:19:33,180 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:19:33,180 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:19:33,180 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:19:33,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:19:33,180 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:19:33,180 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:19:33,181 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:19:33,181 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:19:33,181 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 -> 6d20f8abdac11d3a14265079d0abbd72a3c88bf6607f5bf46f98ccd96bfda721 [2025-03-16 20:19:33,404 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:19:33,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:19:33,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:19:33,416 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:19:33,417 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:19:33,418 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label00.c [2025-03-16 20:19:34,575 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0add1cb07/8d8bb6317fa048b6bf1c256eba680f2c/FLAG9a3a0a168 [2025-03-16 20:19:35,077 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:19:35,078 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label00.c [2025-03-16 20:19:35,106 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0add1cb07/8d8bb6317fa048b6bf1c256eba680f2c/FLAG9a3a0a168 [2025-03-16 20:19:35,160 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0add1cb07/8d8bb6317fa048b6bf1c256eba680f2c [2025-03-16 20:19:35,163 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:19:35,164 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:19:35,165 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:19:35,165 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:19:35,168 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:19:35,169 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:19:35" (1/1) ... [2025-03-16 20:19:35,169 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b8b4709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:19:35, skipping insertion in model container [2025-03-16 20:19:35,169 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:19:35" (1/1) ... [2025-03-16 20:19:35,241 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:19:35,477 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.3.ufo.BOUNDED-6.pals+Problem12_label00.c[6354,6367] [2025-03-16 20:19:35,512 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.3.ufo.BOUNDED-6.pals+Problem12_label00.c[8229,8242] [2025-03-16 20:19:35,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:19:35,937 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:19:35,965 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.3.ufo.BOUNDED-6.pals+Problem12_label00.c[6354,6367] [2025-03-16 20:19:35,970 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.3.ufo.BOUNDED-6.pals+Problem12_label00.c[8229,8242] [2025-03-16 20:19:36,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:19:36,262 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:19:36,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:19:36 WrapperNode [2025-03-16 20:19:36,263 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:19:36,264 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:19:36,264 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:19:36,264 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:19:36,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:19:36" (1/1) ... [2025-03-16 20:19:36,306 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:19:36" (1/1) ... [2025-03-16 20:19:36,530 INFO L138 Inliner]: procedures = 33, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 4977 [2025-03-16 20:19:36,530 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:19:36,531 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:19:36,531 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:19:36,532 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:19:36,538 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:19:36" (1/1) ... [2025-03-16 20:19:36,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:19:36" (1/1) ... [2025-03-16 20:19:36,568 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:19:36" (1/1) ... [2025-03-16 20:19:36,717 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 20:19:36,717 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:19:36" (1/1) ... [2025-03-16 20:19:36,717 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:19:36" (1/1) ... [2025-03-16 20:19:36,836 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:19:36" (1/1) ... [2025-03-16 20:19:36,853 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:19:36" (1/1) ... [2025-03-16 20:19:36,867 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:19:36" (1/1) ... [2025-03-16 20:19:36,882 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:19:36" (1/1) ... [2025-03-16 20:19:36,938 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:19:36,940 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:19:36,940 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:19:36,940 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:19:36,941 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:19:36" (1/1) ... [2025-03-16 20:19:36,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:19:36,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:19:36,972 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 20:19:36,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 20:19:36,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:19:36,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:19:36,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:19:36,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:19:37,068 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:19:37,070 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:19:40,607 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4951: havoc calculate_output3_#t~ret32#1; [2025-03-16 20:19:40,607 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1982: havoc calculate_output_#t~ret30#1; [2025-03-16 20:19:40,607 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3461: havoc calculate_output2_#t~ret31#1; [2025-03-16 20:19:40,763 INFO L? ?]: Removed 729 outVars from TransFormulas that were not future-live. [2025-03-16 20:19:40,764 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:19:40,796 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:19:40,797 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:19:40,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:19:40 BoogieIcfgContainer [2025-03-16 20:19:40,797 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:19:40,799 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:19:40,799 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:19:40,802 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:19:40,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:19:35" (1/3) ... [2025-03-16 20:19:40,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54656a0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:19:40, skipping insertion in model container [2025-03-16 20:19:40,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:19:36" (2/3) ... [2025-03-16 20:19:40,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54656a0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:19:40, skipping insertion in model container [2025-03-16 20:19:40,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:19:40" (3/3) ... [2025-03-16 20:19:40,805 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label00.c [2025-03-16 20:19:40,816 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:19:40,819 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label00.c that has 1 procedures, 807 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-16 20:19:40,888 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:19:40,898 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;@5a702724, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:19:40,899 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:19:40,906 INFO L276 IsEmpty]: Start isEmpty. Operand has 807 states, 804 states have (on average 1.9776119402985075) internal successors, (1590), 806 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:40,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-16 20:19:40,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:19:40,913 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:19:40,913 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:19:40,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:19:40,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1916833504, now seen corresponding path program 1 times [2025-03-16 20:19:40,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:19:40,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294682528] [2025-03-16 20:19:40,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:19:40,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:19:40,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-16 20:19:41,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-16 20:19:41,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:19:41,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:19:41,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:19:41,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:19:41,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294682528] [2025-03-16 20:19:41,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294682528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:19:41,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:19:41,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:19:41,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669156217] [2025-03-16 20:19:41,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:19:41,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 20:19:41,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:19:41,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 20:19:41,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:19:41,088 INFO L87 Difference]: Start difference. First operand has 807 states, 804 states have (on average 1.9776119402985075) internal successors, (1590), 806 states have internal predecessors, (1590), 0 states have call successors, (0), 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 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:41,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:19:41,162 INFO L93 Difference]: Finished difference Result 1594 states and 3142 transitions. [2025-03-16 20:19:41,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 20:19:41,164 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2025-03-16 20:19:41,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:19:41,174 INFO L225 Difference]: With dead ends: 1594 [2025-03-16 20:19:41,174 INFO L226 Difference]: Without dead ends: 803 [2025-03-16 20:19:41,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:19:41,186 INFO L435 NwaCegarLoop]: 1526 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1526 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:19:41,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1526 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:19:41,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2025-03-16 20:19:41,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 803. [2025-03-16 20:19:41,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 801 states have (on average 1.898876404494382) internal successors, (1521), 802 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:41,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1521 transitions. [2025-03-16 20:19:41,256 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1521 transitions. Word has length 15 [2025-03-16 20:19:41,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:19:41,256 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1521 transitions. [2025-03-16 20:19:41,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:41,257 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1521 transitions. [2025-03-16 20:19:41,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-16 20:19:41,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:19:41,257 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:19:41,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:19:41,258 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:19:41,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:19:41,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1208482754, now seen corresponding path program 1 times [2025-03-16 20:19:41,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:19:41,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349384193] [2025-03-16 20:19:41,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:19:41,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:19:41,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-16 20:19:41,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-16 20:19:41,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:19:41,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:19:41,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:19:41,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:19:41,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349384193] [2025-03-16 20:19:41,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349384193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:19:41,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:19:41,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:19:41,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892597247] [2025-03-16 20:19:41,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:19:41,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:19:41,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:19:41,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:19:41,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:19:41,389 INFO L87 Difference]: Start difference. First operand 803 states and 1521 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:44,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:19:44,186 INFO L93 Difference]: Finished difference Result 2307 states and 4394 transitions. [2025-03-16 20:19:44,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:19:44,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2025-03-16 20:19:44,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:19:44,194 INFO L225 Difference]: With dead ends: 2307 [2025-03-16 20:19:44,196 INFO L226 Difference]: Without dead ends: 1554 [2025-03-16 20:19:44,198 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-16 20:19:44,198 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 885 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2274 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 885 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 2865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-16 20:19:44,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [885 Valid, 510 Invalid, 2865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2274 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-16 20:19:44,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2025-03-16 20:19:44,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1554. [2025-03-16 20:19:44,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1554 states, 1552 states have (on average 1.6417525773195876) internal successors, (2548), 1553 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:44,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 2548 transitions. [2025-03-16 20:19:44,249 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 2548 transitions. Word has length 15 [2025-03-16 20:19:44,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:19:44,250 INFO L471 AbstractCegarLoop]: Abstraction has 1554 states and 2548 transitions. [2025-03-16 20:19:44,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:44,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 2548 transitions. [2025-03-16 20:19:44,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-16 20:19:44,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:19:44,250 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:19:44,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:19:44,251 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:19:44,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:19:44,251 INFO L85 PathProgramCache]: Analyzing trace with hash 474899080, now seen corresponding path program 1 times [2025-03-16 20:19:44,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:19:44,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789784135] [2025-03-16 20:19:44,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:19:44,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:19:44,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-16 20:19:44,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-16 20:19:44,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:19:44,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:19:44,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:19:44,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:19:44,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789784135] [2025-03-16 20:19:44,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789784135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:19:44,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:19:44,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:19:44,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128251082] [2025-03-16 20:19:44,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:19:44,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:19:44,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:19:44,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:19:44,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:19:44,355 INFO L87 Difference]: Start difference. First operand 1554 states and 2548 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:44,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:19:44,396 INFO L93 Difference]: Finished difference Result 1615 states and 2643 transitions. [2025-03-16 20:19:44,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:19:44,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2025-03-16 20:19:44,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:19:44,401 INFO L225 Difference]: With dead ends: 1615 [2025-03-16 20:19:44,401 INFO L226 Difference]: Without dead ends: 1583 [2025-03-16 20:19:44,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:19:44,402 INFO L435 NwaCegarLoop]: 1518 mSDtfsCounter, 45 mSDsluCounter, 3015 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 4533 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:19:44,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 4533 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:19:44,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2025-03-16 20:19:44,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1554. [2025-03-16 20:19:44,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1554 states, 1552 states have (on average 1.6314432989690721) internal successors, (2532), 1553 states have internal predecessors, (2532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:44,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 2532 transitions. [2025-03-16 20:19:44,425 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 2532 transitions. Word has length 17 [2025-03-16 20:19:44,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:19:44,425 INFO L471 AbstractCegarLoop]: Abstraction has 1554 states and 2532 transitions. [2025-03-16 20:19:44,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:44,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 2532 transitions. [2025-03-16 20:19:44,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-16 20:19:44,426 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:19:44,426 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] [2025-03-16 20:19:44,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:19:44,426 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:19:44,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:19:44,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1346779243, now seen corresponding path program 1 times [2025-03-16 20:19:44,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:19:44,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720936866] [2025-03-16 20:19:44,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:19:44,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:19:44,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-16 20:19:44,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-16 20:19:44,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:19:44,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:19:44,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:19:44,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:19:44,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720936866] [2025-03-16 20:19:44,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720936866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:19:44,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:19:44,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:19:44,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352308570] [2025-03-16 20:19:44,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:19:44,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:19:44,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:19:44,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:19:44,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:19:44,543 INFO L87 Difference]: Start difference. First operand 1554 states and 2532 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:44,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:19:44,625 INFO L93 Difference]: Finished difference Result 1728 states and 2808 transitions. [2025-03-16 20:19:44,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:19:44,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2025-03-16 20:19:44,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:19:44,630 INFO L225 Difference]: With dead ends: 1728 [2025-03-16 20:19:44,630 INFO L226 Difference]: Without dead ends: 1699 [2025-03-16 20:19:44,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:19:44,633 INFO L435 NwaCegarLoop]: 1499 mSDtfsCounter, 4611 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4611 SdHoareTripleChecker+Valid, 1759 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:19:44,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4611 Valid, 1759 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:19:44,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2025-03-16 20:19:44,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1581. [2025-03-16 20:19:44,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1581 states, 1579 states have (on average 1.630778974034199) internal successors, (2575), 1580 states have internal predecessors, (2575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:44,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 2575 transitions. [2025-03-16 20:19:44,659 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 2575 transitions. Word has length 32 [2025-03-16 20:19:44,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:19:44,660 INFO L471 AbstractCegarLoop]: Abstraction has 1581 states and 2575 transitions. [2025-03-16 20:19:44,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:44,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 2575 transitions. [2025-03-16 20:19:44,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 20:19:44,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:19:44,661 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] [2025-03-16 20:19:44,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:19:44,661 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:19:44,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:19:44,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1506878637, now seen corresponding path program 1 times [2025-03-16 20:19:44,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:19:44,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892321337] [2025-03-16 20:19:44,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:19:44,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:19:44,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 20:19:44,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 20:19:44,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:19:44,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:19:44,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:19:44,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:19:44,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892321337] [2025-03-16 20:19:44,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892321337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:19:44,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:19:44,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:19:44,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176309590] [2025-03-16 20:19:44,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:19:44,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:19:44,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:19:44,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:19:44,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:19:44,819 INFO L87 Difference]: Start difference. First operand 1581 states and 2575 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:44,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:19:44,875 INFO L93 Difference]: Finished difference Result 1639 states and 2665 transitions. [2025-03-16 20:19:44,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:19:44,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2025-03-16 20:19:44,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:19:44,882 INFO L225 Difference]: With dead ends: 1639 [2025-03-16 20:19:44,882 INFO L226 Difference]: Without dead ends: 1583 [2025-03-16 20:19:44,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:19:44,884 INFO L435 NwaCegarLoop]: 1500 mSDtfsCounter, 2942 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2942 SdHoareTripleChecker+Valid, 1587 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:19:44,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2942 Valid, 1587 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:19:44,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2025-03-16 20:19:44,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1581. [2025-03-16 20:19:44,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1581 states, 1579 states have (on average 1.6301456618112729) internal successors, (2574), 1580 states have internal predecessors, (2574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:44,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 2574 transitions. [2025-03-16 20:19:44,913 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 2574 transitions. Word has length 34 [2025-03-16 20:19:44,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:19:44,914 INFO L471 AbstractCegarLoop]: Abstraction has 1581 states and 2574 transitions. [2025-03-16 20:19:44,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:44,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 2574 transitions. [2025-03-16 20:19:44,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 20:19:44,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:19:44,915 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] [2025-03-16 20:19:44,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:19:44,915 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:19:44,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:19:44,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1505835952, now seen corresponding path program 1 times [2025-03-16 20:19:44,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:19:44,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755499357] [2025-03-16 20:19:44,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:19:44,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:19:44,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 20:19:44,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 20:19:44,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:19:44,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:19:44,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:19:44,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:19:44,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755499357] [2025-03-16 20:19:44,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755499357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:19:44,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:19:44,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:19:44,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879131680] [2025-03-16 20:19:44,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:19:44,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:19:44,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:19:44,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:19:44,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:19:44,976 INFO L87 Difference]: Start difference. First operand 1581 states and 2574 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:44,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:19:44,998 INFO L93 Difference]: Finished difference Result 1682 states and 2731 transitions. [2025-03-16 20:19:44,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:19:44,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2025-03-16 20:19:44,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:19:45,004 INFO L225 Difference]: With dead ends: 1682 [2025-03-16 20:19:45,005 INFO L226 Difference]: Without dead ends: 1626 [2025-03-16 20:19:45,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:19:45,006 INFO L435 NwaCegarLoop]: 1502 mSDtfsCounter, 1464 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1464 SdHoareTripleChecker+Valid, 1543 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:19:45,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1464 Valid, 1543 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:19:45,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2025-03-16 20:19:45,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1624. [2025-03-16 20:19:45,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1622 states have (on average 1.6270036991368682) internal successors, (2639), 1623 states have internal predecessors, (2639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:45,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2639 transitions. [2025-03-16 20:19:45,035 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2639 transitions. Word has length 34 [2025-03-16 20:19:45,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:19:45,035 INFO L471 AbstractCegarLoop]: Abstraction has 1624 states and 2639 transitions. [2025-03-16 20:19:45,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:45,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2639 transitions. [2025-03-16 20:19:45,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-16 20:19:45,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:19:45,039 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:19:45,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:19:45,039 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:19:45,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:19:45,039 INFO L85 PathProgramCache]: Analyzing trace with hash -530417449, now seen corresponding path program 1 times [2025-03-16 20:19:45,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:19:45,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195103865] [2025-03-16 20:19:45,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:19:45,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:19:45,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-16 20:19:45,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-16 20:19:45,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:19:45,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:19:45,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:19:45,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:19:45,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195103865] [2025-03-16 20:19:45,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195103865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:19:45,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:19:45,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:19:45,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961428632] [2025-03-16 20:19:45,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:19:45,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:19:45,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:19:45,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:19:45,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:19:45,188 INFO L87 Difference]: Start difference. First operand 1624 states and 2639 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:45,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:19:45,214 INFO L93 Difference]: Finished difference Result 1630 states and 2646 transitions. [2025-03-16 20:19:45,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:19:45,214 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-16 20:19:45,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:19:45,219 INFO L225 Difference]: With dead ends: 1630 [2025-03-16 20:19:45,219 INFO L226 Difference]: Without dead ends: 1628 [2025-03-16 20:19:45,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:19:45,220 INFO L435 NwaCegarLoop]: 1503 mSDtfsCounter, 0 mSDsluCounter, 2998 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4501 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:19:45,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4501 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:19:45,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2025-03-16 20:19:45,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 1628. [2025-03-16 20:19:45,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1628 states, 1626 states have (on average 1.6248462484624846) internal successors, (2642), 1627 states have internal predecessors, (2642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:45,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 2642 transitions. [2025-03-16 20:19:45,244 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 2642 transitions. Word has length 35 [2025-03-16 20:19:45,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:19:45,245 INFO L471 AbstractCegarLoop]: Abstraction has 1628 states and 2642 transitions. [2025-03-16 20:19:45,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:45,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 2642 transitions. [2025-03-16 20:19:45,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 20:19:45,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:19:45,247 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:19:45,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:19:45,247 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:19:45,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:19:45,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1988236593, now seen corresponding path program 1 times [2025-03-16 20:19:45,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:19:45,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110008878] [2025-03-16 20:19:45,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:19:45,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:19:45,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 20:19:45,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 20:19:45,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:19:45,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:19:45,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:19:45,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:19:45,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110008878] [2025-03-16 20:19:45,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110008878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:19:45,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:19:45,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:19:45,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306474468] [2025-03-16 20:19:45,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:19:45,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:19:45,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:19:45,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:19:45,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:19:45,287 INFO L87 Difference]: Start difference. First operand 1628 states and 2642 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:45,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:19:45,310 INFO L93 Difference]: Finished difference Result 1818 states and 2926 transitions. [2025-03-16 20:19:45,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:19:45,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-16 20:19:45,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:19:45,315 INFO L225 Difference]: With dead ends: 1818 [2025-03-16 20:19:45,315 INFO L226 Difference]: Without dead ends: 1715 [2025-03-16 20:19:45,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:19:45,316 INFO L435 NwaCegarLoop]: 1530 mSDtfsCounter, 1472 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1472 SdHoareTripleChecker+Valid, 1581 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:19:45,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1472 Valid, 1581 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:19:45,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2025-03-16 20:19:45,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1713. [2025-03-16 20:19:45,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1713 states, 1711 states have (on average 1.6160140268848626) internal successors, (2765), 1712 states have internal predecessors, (2765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:45,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1713 states to 1713 states and 2765 transitions. [2025-03-16 20:19:45,345 INFO L78 Accepts]: Start accepts. Automaton has 1713 states and 2765 transitions. Word has length 36 [2025-03-16 20:19:45,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:19:45,347 INFO L471 AbstractCegarLoop]: Abstraction has 1713 states and 2765 transitions. [2025-03-16 20:19:45,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:45,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1713 states and 2765 transitions. [2025-03-16 20:19:45,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 20:19:45,348 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:19:45,349 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:19:45,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:19:45,349 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:19:45,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:19:45,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1756941775, now seen corresponding path program 1 times [2025-03-16 20:19:45,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:19:45,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441899703] [2025-03-16 20:19:45,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:19:45,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:19:45,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 20:19:45,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 20:19:45,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:19:45,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:19:45,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:19:45,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:19:45,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441899703] [2025-03-16 20:19:45,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441899703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:19:45,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:19:45,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:19:45,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883251883] [2025-03-16 20:19:45,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:19:45,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:19:45,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:19:45,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:19:45,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:19:45,387 INFO L87 Difference]: Start difference. First operand 1713 states and 2765 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:45,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:19:45,412 INFO L93 Difference]: Finished difference Result 2057 states and 3267 transitions. [2025-03-16 20:19:45,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:19:45,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-16 20:19:45,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:19:45,419 INFO L225 Difference]: With dead ends: 2057 [2025-03-16 20:19:45,419 INFO L226 Difference]: Without dead ends: 1869 [2025-03-16 20:19:45,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:19:45,423 INFO L435 NwaCegarLoop]: 1528 mSDtfsCounter, 1470 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1470 SdHoareTripleChecker+Valid, 1583 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:19:45,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1470 Valid, 1583 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:19:45,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1869 states. [2025-03-16 20:19:45,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1869 to 1867. [2025-03-16 20:19:45,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1867 states, 1865 states have (on average 1.597319034852547) internal successors, (2979), 1866 states have internal predecessors, (2979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:45,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1867 states and 2979 transitions. [2025-03-16 20:19:45,456 INFO L78 Accepts]: Start accepts. Automaton has 1867 states and 2979 transitions. Word has length 36 [2025-03-16 20:19:45,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:19:45,456 INFO L471 AbstractCegarLoop]: Abstraction has 1867 states and 2979 transitions. [2025-03-16 20:19:45,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:45,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1867 states and 2979 transitions. [2025-03-16 20:19:45,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 20:19:45,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:19:45,457 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:19:45,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:19:45,457 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:19:45,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:19:45,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1922054193, now seen corresponding path program 1 times [2025-03-16 20:19:45,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:19:45,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771036744] [2025-03-16 20:19:45,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:19:45,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:19:45,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 20:19:45,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 20:19:45,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:19:45,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:19:45,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:19:45,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:19:45,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771036744] [2025-03-16 20:19:45,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771036744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:19:45,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:19:45,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:19:45,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743949104] [2025-03-16 20:19:45,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:19:45,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:19:45,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:19:45,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:19:45,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:19:45,496 INFO L87 Difference]: Start difference. First operand 1867 states and 2979 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:45,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:19:45,520 INFO L93 Difference]: Finished difference Result 2241 states and 3528 transitions. [2025-03-16 20:19:45,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:19:45,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-16 20:19:45,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:19:45,527 INFO L225 Difference]: With dead ends: 2241 [2025-03-16 20:19:45,527 INFO L226 Difference]: Without dead ends: 2039 [2025-03-16 20:19:45,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:19:45,531 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 1474 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1583 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:19:45,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1583 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:19:45,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2039 states. [2025-03-16 20:19:45,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2039 to 2037. [2025-03-16 20:19:45,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2037 states, 2035 states have (on average 1.5808353808353808) internal successors, (3217), 2036 states have internal predecessors, (3217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:45,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 2037 states and 3217 transitions. [2025-03-16 20:19:45,585 INFO L78 Accepts]: Start accepts. Automaton has 2037 states and 3217 transitions. Word has length 36 [2025-03-16 20:19:45,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:19:45,585 INFO L471 AbstractCegarLoop]: Abstraction has 2037 states and 3217 transitions. [2025-03-16 20:19:45,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:45,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2037 states and 3217 transitions. [2025-03-16 20:19:45,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 20:19:45,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:19:45,586 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] [2025-03-16 20:19:45,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:19:45,586 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:19:45,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:19:45,587 INFO L85 PathProgramCache]: Analyzing trace with hash 512007547, now seen corresponding path program 1 times [2025-03-16 20:19:45,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:19:45,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528532456] [2025-03-16 20:19:45,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:19:45,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:19:45,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 20:19:45,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 20:19:45,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:19:45,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:19:45,681 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 20:19:45,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:19:45,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528532456] [2025-03-16 20:19:45,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528532456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:19:45,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:19:45,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:19:45,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158911938] [2025-03-16 20:19:45,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:19:45,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:19:45,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:19:45,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:19:45,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:19:45,683 INFO L87 Difference]: Start difference. First operand 2037 states and 3217 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-16 20:19:45,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:19:45,761 INFO L93 Difference]: Finished difference Result 3685 states and 5561 transitions. [2025-03-16 20:19:45,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:19:45,762 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 50 [2025-03-16 20:19:45,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:19:45,776 INFO L225 Difference]: With dead ends: 3685 [2025-03-16 20:19:45,776 INFO L226 Difference]: Without dead ends: 3175 [2025-03-16 20:19:45,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:19:45,778 INFO L435 NwaCegarLoop]: 1542 mSDtfsCounter, 3033 mSDsluCounter, 1603 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3033 SdHoareTripleChecker+Valid, 3145 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:19:45,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3033 Valid, 3145 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:19:45,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3175 states. [2025-03-16 20:19:45,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3175 to 2545. [2025-03-16 20:19:45,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2545 states, 2543 states have (on average 1.546598505701927) internal successors, (3933), 2544 states have internal predecessors, (3933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:45,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2545 states and 3933 transitions. [2025-03-16 20:19:45,831 INFO L78 Accepts]: Start accepts. Automaton has 2545 states and 3933 transitions. Word has length 50 [2025-03-16 20:19:45,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:19:45,831 INFO L471 AbstractCegarLoop]: Abstraction has 2545 states and 3933 transitions. [2025-03-16 20:19:45,832 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-16 20:19:45,832 INFO L276 IsEmpty]: Start isEmpty. Operand 2545 states and 3933 transitions. [2025-03-16 20:19:45,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 20:19:45,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:19:45,832 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] [2025-03-16 20:19:45,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:19:45,833 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:19:45,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:19:45,833 INFO L85 PathProgramCache]: Analyzing trace with hash -37781381, now seen corresponding path program 1 times [2025-03-16 20:19:45,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:19:45,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439070135] [2025-03-16 20:19:45,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:19:45,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:19:45,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 20:19:45,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 20:19:45,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:19:45,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:19:45,942 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 20:19:45,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:19:45,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439070135] [2025-03-16 20:19:45,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439070135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:19:45,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:19:45,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:19:45,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072413440] [2025-03-16 20:19:45,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:19:45,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:19:45,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:19:45,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:19:45,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:19:45,943 INFO L87 Difference]: Start difference. First operand 2545 states and 3933 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:46,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:19:46,021 INFO L93 Difference]: Finished difference Result 4193 states and 6277 transitions. [2025-03-16 20:19:46,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:19:46,022 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 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-16 20:19:46,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:19:46,032 INFO L225 Difference]: With dead ends: 4193 [2025-03-16 20:19:46,032 INFO L226 Difference]: Without dead ends: 3683 [2025-03-16 20:19:46,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:19:46,035 INFO L435 NwaCegarLoop]: 1543 mSDtfsCounter, 3041 mSDsluCounter, 1589 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3041 SdHoareTripleChecker+Valid, 3132 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:19:46,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3041 Valid, 3132 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:19:46,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3683 states. [2025-03-16 20:19:46,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3683 to 3309. [2025-03-16 20:19:46,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3309 states, 3307 states have (on average 1.511037193831267) internal successors, (4997), 3308 states have internal predecessors, (4997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:46,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3309 states to 3309 states and 4997 transitions. [2025-03-16 20:19:46,097 INFO L78 Accepts]: Start accepts. Automaton has 3309 states and 4997 transitions. Word has length 50 [2025-03-16 20:19:46,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:19:46,097 INFO L471 AbstractCegarLoop]: Abstraction has 3309 states and 4997 transitions. [2025-03-16 20:19:46,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:46,098 INFO L276 IsEmpty]: Start isEmpty. Operand 3309 states and 4997 transitions. [2025-03-16 20:19:46,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 20:19:46,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:19:46,098 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] [2025-03-16 20:19:46,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:19:46,098 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:19:46,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:19:46,098 INFO L85 PathProgramCache]: Analyzing trace with hash 578189947, now seen corresponding path program 1 times [2025-03-16 20:19:46,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:19:46,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002127195] [2025-03-16 20:19:46,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:19:46,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:19:46,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 20:19:46,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 20:19:46,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:19:46,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:19:46,165 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:19:46,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:19:46,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002127195] [2025-03-16 20:19:46,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002127195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:19:46,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:19:46,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:19:46,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881887411] [2025-03-16 20:19:46,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:19:46,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:19:46,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:19:46,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:19:46,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:19:46,167 INFO L87 Difference]: Start difference. First operand 3309 states and 4997 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:46,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:19:46,257 INFO L93 Difference]: Finished difference Result 4421 states and 6609 transitions. [2025-03-16 20:19:46,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:19:46,258 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 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-16 20:19:46,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:19:46,269 INFO L225 Difference]: With dead ends: 4421 [2025-03-16 20:19:46,269 INFO L226 Difference]: Without dead ends: 4051 [2025-03-16 20:19:46,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:19:46,271 INFO L435 NwaCegarLoop]: 1541 mSDtfsCounter, 3034 mSDsluCounter, 1606 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3034 SdHoareTripleChecker+Valid, 3147 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:19:46,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3034 Valid, 3147 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:19:46,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4051 states. [2025-03-16 20:19:46,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4051 to 3677. [2025-03-16 20:19:46,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3677 states, 3675 states have (on average 1.5034013605442176) internal successors, (5525), 3676 states have internal predecessors, (5525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:46,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3677 states to 3677 states and 5525 transitions. [2025-03-16 20:19:46,344 INFO L78 Accepts]: Start accepts. Automaton has 3677 states and 5525 transitions. Word has length 50 [2025-03-16 20:19:46,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:19:46,344 INFO L471 AbstractCegarLoop]: Abstraction has 3677 states and 5525 transitions. [2025-03-16 20:19:46,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:46,345 INFO L276 IsEmpty]: Start isEmpty. Operand 3677 states and 5525 transitions. [2025-03-16 20:19:46,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-16 20:19:46,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:19:46,346 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] [2025-03-16 20:19:46,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:19:46,346 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:19:46,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:19:46,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1763746431, now seen corresponding path program 1 times [2025-03-16 20:19:46,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:19:46,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343746151] [2025-03-16 20:19:46,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:19:46,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:19:46,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-16 20:19:46,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-16 20:19:46,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:19:46,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:19:46,417 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:19:46,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:19:46,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343746151] [2025-03-16 20:19:46,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343746151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:19:46,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:19:46,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:19:46,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779579451] [2025-03-16 20:19:46,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:19:46,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:19:46,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:19:46,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:19:46,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:19:46,418 INFO L87 Difference]: Start difference. First operand 3677 states and 5525 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:46,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:19:46,470 INFO L93 Difference]: Finished difference Result 5829 states and 8563 transitions. [2025-03-16 20:19:46,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:19:46,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2025-03-16 20:19:46,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:19:46,486 INFO L225 Difference]: With dead ends: 5829 [2025-03-16 20:19:46,487 INFO L226 Difference]: Without dead ends: 3679 [2025-03-16 20:19:46,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:19:46,491 INFO L435 NwaCegarLoop]: 1523 mSDtfsCounter, 29 mSDsluCounter, 1493 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3016 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-16 20:19:46,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3016 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:19:46,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3679 states. [2025-03-16 20:19:46,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3679 to 3677. [2025-03-16 20:19:46,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3677 states, 3675 states have (on average 1.489795918367347) internal successors, (5475), 3676 states have internal predecessors, (5475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:46,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3677 states to 3677 states and 5475 transitions. [2025-03-16 20:19:46,579 INFO L78 Accepts]: Start accepts. Automaton has 3677 states and 5475 transitions. Word has length 51 [2025-03-16 20:19:46,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:19:46,580 INFO L471 AbstractCegarLoop]: Abstraction has 3677 states and 5475 transitions. [2025-03-16 20:19:46,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:46,580 INFO L276 IsEmpty]: Start isEmpty. Operand 3677 states and 5475 transitions. [2025-03-16 20:19:46,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-16 20:19:46,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:19:46,582 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] [2025-03-16 20:19:46,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:19:46,582 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:19:46,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:19:46,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1844804163, now seen corresponding path program 1 times [2025-03-16 20:19:46,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:19:46,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632811756] [2025-03-16 20:19:46,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:19:46,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:19:46,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-16 20:19:46,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-16 20:19:46,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:19:46,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:19:46,661 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:19:46,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:19:46,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632811756] [2025-03-16 20:19:46,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632811756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:19:46,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:19:46,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:19:46,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807614867] [2025-03-16 20:19:46,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:19:46,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:19:46,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:19:46,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:19:46,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:19:46,662 INFO L87 Difference]: Start difference. First operand 3677 states and 5475 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:46,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:19:46,725 INFO L93 Difference]: Finished difference Result 4523 states and 6662 transitions. [2025-03-16 20:19:46,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:19:46,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2025-03-16 20:19:46,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:19:46,732 INFO L225 Difference]: With dead ends: 4523 [2025-03-16 20:19:46,732 INFO L226 Difference]: Without dead ends: 2373 [2025-03-16 20:19:46,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:19:46,733 INFO L435 NwaCegarLoop]: 1521 mSDtfsCounter, 23 mSDsluCounter, 1492 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3013 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-16 20:19:46,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3013 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:19:46,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2025-03-16 20:19:46,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 2366. [2025-03-16 20:19:46,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2366 states, 2364 states have (on average 1.5439932318104908) internal successors, (3650), 2365 states have internal predecessors, (3650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:46,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 2366 states and 3650 transitions. [2025-03-16 20:19:46,772 INFO L78 Accepts]: Start accepts. Automaton has 2366 states and 3650 transitions. Word has length 52 [2025-03-16 20:19:46,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:19:46,772 INFO L471 AbstractCegarLoop]: Abstraction has 2366 states and 3650 transitions. [2025-03-16 20:19:46,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:46,773 INFO L276 IsEmpty]: Start isEmpty. Operand 2366 states and 3650 transitions. [2025-03-16 20:19:46,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 20:19:46,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:19:46,774 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] [2025-03-16 20:19:46,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:19:46,774 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:19:46,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:19:46,775 INFO L85 PathProgramCache]: Analyzing trace with hash 120675386, now seen corresponding path program 1 times [2025-03-16 20:19:46,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:19:46,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685565056] [2025-03-16 20:19:46,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:19:46,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:19:46,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 20:19:46,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 20:19:46,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:19:46,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:19:46,838 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:19:46,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:19:46,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685565056] [2025-03-16 20:19:46,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685565056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:19:46,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:19:46,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:19:46,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108160195] [2025-03-16 20:19:46,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:19:46,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:19:46,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:19:46,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:19:46,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:19:46,839 INFO L87 Difference]: Start difference. First operand 2366 states and 3650 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:46,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:19:46,861 INFO L93 Difference]: Finished difference Result 2784 states and 4228 transitions. [2025-03-16 20:19:46,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:19:46,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-03-16 20:19:46,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:19:46,864 INFO L225 Difference]: With dead ends: 2784 [2025-03-16 20:19:46,864 INFO L226 Difference]: Without dead ends: 1954 [2025-03-16 20:19:46,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:19:46,866 INFO L435 NwaCegarLoop]: 1515 mSDtfsCounter, 25 mSDsluCounter, 1477 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 2992 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-16 20:19:46,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 2992 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:19:46,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2025-03-16 20:19:46,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 1952. [2025-03-16 20:19:46,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1952 states, 1950 states have (on average 1.5717948717948718) internal successors, (3065), 1951 states have internal predecessors, (3065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:46,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 3065 transitions. [2025-03-16 20:19:46,889 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 3065 transitions. Word has length 53 [2025-03-16 20:19:46,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:19:46,889 INFO L471 AbstractCegarLoop]: Abstraction has 1952 states and 3065 transitions. [2025-03-16 20:19:46,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:46,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 3065 transitions. [2025-03-16 20:19:46,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 20:19:46,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:19:46,890 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:19:46,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 20:19:46,891 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:19:46,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:19:46,891 INFO L85 PathProgramCache]: Analyzing trace with hash 637021683, now seen corresponding path program 1 times [2025-03-16 20:19:46,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:19:46,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377794097] [2025-03-16 20:19:46,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:19:46,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:19:46,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 20:19:46,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 20:19:46,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:19:46,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:19:47,229 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:19:47,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:19:47,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377794097] [2025-03-16 20:19:47,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377794097] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:19:47,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045624405] [2025-03-16 20:19:47,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:19:47,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:19:47,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:19:47,231 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:19:47,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 20:19:47,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 20:19:47,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 20:19:47,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:19:47,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:19:47,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 20:19:47,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:19:47,641 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:19:47,641 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:19:48,157 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:19:48,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045624405] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:19:48,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:19:48,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-03-16 20:19:48,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436319950] [2025-03-16 20:19:48,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:19:48,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-16 20:19:48,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:19:48,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-16 20:19:48,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2025-03-16 20:19:48,159 INFO L87 Difference]: Start difference. First operand 1952 states and 3065 transitions. Second operand has 25 states, 25 states have (on average 5.84) internal successors, (146), 24 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:49,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:19:49,278 INFO L93 Difference]: Finished difference Result 3258 states and 4852 transitions. [2025-03-16 20:19:49,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-16 20:19:49,278 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.84) internal successors, (146), 24 states have internal predecessors, (146), 0 states have call successors, (0), 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 55 [2025-03-16 20:19:49,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:19:49,285 INFO L225 Difference]: With dead ends: 3258 [2025-03-16 20:19:49,285 INFO L226 Difference]: Without dead ends: 2842 [2025-03-16 20:19:49,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=488, Invalid=1674, Unknown=0, NotChecked=0, Total=2162 [2025-03-16 20:19:49,288 INFO L435 NwaCegarLoop]: 1477 mSDtfsCounter, 15087 mSDsluCounter, 4729 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15087 SdHoareTripleChecker+Valid, 6206 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:19:49,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15087 Valid, 6206 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:19:49,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2842 states. [2025-03-16 20:19:49,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2842 to 2825. [2025-03-16 20:19:49,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2825 states, 2823 states have (on average 1.4969890187743535) internal successors, (4226), 2824 states have internal predecessors, (4226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:49,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2825 states to 2825 states and 4226 transitions. [2025-03-16 20:19:49,338 INFO L78 Accepts]: Start accepts. Automaton has 2825 states and 4226 transitions. Word has length 55 [2025-03-16 20:19:49,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:19:49,338 INFO L471 AbstractCegarLoop]: Abstraction has 2825 states and 4226 transitions. [2025-03-16 20:19:49,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.84) internal successors, (146), 24 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:49,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2825 states and 4226 transitions. [2025-03-16 20:19:49,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-16 20:19:49,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:19:49,339 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:19:49,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 20:19:49,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-16 20:19:49,541 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:19:49,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:19:49,541 INFO L85 PathProgramCache]: Analyzing trace with hash 564417798, now seen corresponding path program 1 times [2025-03-16 20:19:49,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:19:49,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193818462] [2025-03-16 20:19:49,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:19:49,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:19:49,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-16 20:19:49,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-16 20:19:49,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:19:49,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:19:49,784 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:19:49,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:19:49,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193818462] [2025-03-16 20:19:49,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193818462] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:19:49,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496928508] [2025-03-16 20:19:49,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:19:49,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:19:49,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:19:49,787 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:19:49,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 20:19:49,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-16 20:19:49,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-16 20:19:49,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:19:49,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:19:49,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 20:19:49,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:19:50,162 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:19:50,162 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:19:50,618 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:19:50,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496928508] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:19:50,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:19:50,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-03-16 20:19:50,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065689545] [2025-03-16 20:19:50,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:19:50,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-16 20:19:50,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:19:50,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-16 20:19:50,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2025-03-16 20:19:50,621 INFO L87 Difference]: Start difference. First operand 2825 states and 4226 transitions. Second operand has 23 states, 23 states have (on average 5.3478260869565215) internal successors, (123), 22 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:50,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:19:50,993 INFO L93 Difference]: Finished difference Result 5567 states and 7928 transitions. [2025-03-16 20:19:50,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 20:19:50,993 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.3478260869565215) internal successors, (123), 22 states have internal predecessors, (123), 0 states have call successors, (0), 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 56 [2025-03-16 20:19:50,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:19:50,999 INFO L225 Difference]: With dead ends: 5567 [2025-03-16 20:19:51,000 INFO L226 Difference]: Without dead ends: 4278 [2025-03-16 20:19:51,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=283, Invalid=839, Unknown=0, NotChecked=0, Total=1122 [2025-03-16 20:19:51,002 INFO L435 NwaCegarLoop]: 1499 mSDtfsCounter, 14983 mSDsluCounter, 4652 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14983 SdHoareTripleChecker+Valid, 6151 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:19:51,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14983 Valid, 6151 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:19:51,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4278 states. [2025-03-16 20:19:51,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4278 to 4220. [2025-03-16 20:19:51,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4220 states, 4218 states have (on average 1.4307728781412992) internal successors, (6035), 4219 states have internal predecessors, (6035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:51,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4220 states to 4220 states and 6035 transitions. [2025-03-16 20:19:51,068 INFO L78 Accepts]: Start accepts. Automaton has 4220 states and 6035 transitions. Word has length 56 [2025-03-16 20:19:51,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:19:51,068 INFO L471 AbstractCegarLoop]: Abstraction has 4220 states and 6035 transitions. [2025-03-16 20:19:51,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.3478260869565215) internal successors, (123), 22 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:19:51,069 INFO L276 IsEmpty]: Start isEmpty. Operand 4220 states and 6035 transitions. [2025-03-16 20:19:51,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-16 20:19:51,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:19:51,072 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:19:51,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 20:19:51,272 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,SelfDestructingSolverStorable17 [2025-03-16 20:19:51,273 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:19:51,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:19:51,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1547711768, now seen corresponding path program 1 times [2025-03-16 20:19:51,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:19:51,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055110382] [2025-03-16 20:19:51,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:19:51,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:19:51,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 20:19:51,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 20:19:51,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:19:51,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:19:52,593 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:19:52,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:19:52,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055110382] [2025-03-16 20:19:52,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055110382] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:19:52,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32578724] [2025-03-16 20:19:52,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:19:52,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:19:52,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:19:52,598 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:19:52,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 20:19:52,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 20:19:52,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 20:19:52,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:19:52,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:19:52,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-16 20:19:52,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:19:53,494 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:19:53,494 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:19:54,133 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:19:54,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32578724] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:19:54,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:19:54,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 15, 17] total 45 [2025-03-16 20:19:54,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089272577] [2025-03-16 20:19:54,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:19:54,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-16 20:19:54,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:19:54,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-16 20:19:54,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1777, Unknown=0, NotChecked=0, Total=1980 [2025-03-16 20:19:54,135 INFO L87 Difference]: Start difference. First operand 4220 states and 6035 transitions. Second operand has 45 states, 45 states have (on average 3.3333333333333335) internal successors, (150), 45 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:02,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:02,835 INFO L93 Difference]: Finished difference Result 11451 states and 15506 transitions. [2025-03-16 20:20:02,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2025-03-16 20:20:02,836 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.3333333333333335) internal successors, (150), 45 states have internal predecessors, (150), 0 states have call successors, (0), 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 57 [2025-03-16 20:20:02,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:02,850 INFO L225 Difference]: With dead ends: 11451 [2025-03-16 20:20:02,851 INFO L226 Difference]: Without dead ends: 10257 [2025-03-16 20:20:02,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13221 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=7344, Invalid=24876, Unknown=0, NotChecked=0, Total=32220 [2025-03-16 20:20:02,859 INFO L435 NwaCegarLoop]: 1514 mSDtfsCounter, 19436 mSDsluCounter, 23302 mSDsCounter, 0 mSdLazyCounter, 2128 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19436 SdHoareTripleChecker+Valid, 24816 SdHoareTripleChecker+Invalid, 2294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 2128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:20:02,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19436 Valid, 24816 Invalid, 2294 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [166 Valid, 2128 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 20:20:02,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10257 states. [2025-03-16 20:20:02,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10257 to 4022. [2025-03-16 20:20:02,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4022 states, 4020 states have (on average 1.4330845771144278) internal successors, (5761), 4021 states have internal predecessors, (5761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:02,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4022 states to 4022 states and 5761 transitions. [2025-03-16 20:20:02,970 INFO L78 Accepts]: Start accepts. Automaton has 4022 states and 5761 transitions. Word has length 57 [2025-03-16 20:20:02,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:02,970 INFO L471 AbstractCegarLoop]: Abstraction has 4022 states and 5761 transitions. [2025-03-16 20:20:02,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.3333333333333335) internal successors, (150), 45 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:02,971 INFO L276 IsEmpty]: Start isEmpty. Operand 4022 states and 5761 transitions. [2025-03-16 20:20:02,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-16 20:20:02,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:02,971 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:20:02,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 20:20:03,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:20:03,172 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:03,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:03,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1121316136, now seen corresponding path program 1 times [2025-03-16 20:20:03,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:03,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778899094] [2025-03-16 20:20:03,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:03,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:03,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 20:20:03,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 20:20:03,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:03,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:03,650 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:03,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:03,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778899094] [2025-03-16 20:20:03,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778899094] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:20:03,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385280395] [2025-03-16 20:20:03,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:03,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:20:03,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:20:03,652 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-16 20:20:03,654 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-16 20:20:03,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 20:20:03,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 20:20:03,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:03,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:03,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-16 20:20:03,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:20:05,931 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:05,932 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:20:07,632 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:07,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385280395] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:20:07,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:20:07,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 19] total 44 [2025-03-16 20:20:07,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114386751] [2025-03-16 20:20:07,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:20:07,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-16 20:20:07,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:07,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-16 20:20:07,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=1647, Unknown=0, NotChecked=0, Total=1892 [2025-03-16 20:20:07,634 INFO L87 Difference]: Start difference. First operand 4022 states and 5761 transitions. Second operand has 44 states, 44 states have (on average 3.477272727272727) internal successors, (153), 44 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:10,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:10,351 INFO L93 Difference]: Finished difference Result 5437 states and 7637 transitions. [2025-03-16 20:20:10,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-16 20:20:10,351 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 3.477272727272727) internal successors, (153), 44 states have internal predecessors, (153), 0 states have call successors, (0), 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 57 [2025-03-16 20:20:10,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:10,357 INFO L225 Difference]: With dead ends: 5437 [2025-03-16 20:20:10,357 INFO L226 Difference]: Without dead ends: 4235 [2025-03-16 20:20:10,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1944 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1479, Invalid=6003, Unknown=0, NotChecked=0, Total=7482 [2025-03-16 20:20:10,362 INFO L435 NwaCegarLoop]: 1506 mSDtfsCounter, 26034 mSDsluCounter, 16547 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26034 SdHoareTripleChecker+Valid, 18053 SdHoareTripleChecker+Invalid, 1011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:20:10,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26034 Valid, 18053 Invalid, 1011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 945 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:20:10,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4235 states. [2025-03-16 20:20:10,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4235 to 3632. [2025-03-16 20:20:10,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3632 states, 3630 states have (on average 1.4465564738292012) internal successors, (5251), 3631 states have internal predecessors, (5251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:10,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3632 states to 3632 states and 5251 transitions. [2025-03-16 20:20:10,446 INFO L78 Accepts]: Start accepts. Automaton has 3632 states and 5251 transitions. Word has length 57 [2025-03-16 20:20:10,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:10,446 INFO L471 AbstractCegarLoop]: Abstraction has 3632 states and 5251 transitions. [2025-03-16 20:20:10,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 3.477272727272727) internal successors, (153), 44 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:10,446 INFO L276 IsEmpty]: Start isEmpty. Operand 3632 states and 5251 transitions. [2025-03-16 20:20:10,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-16 20:20:10,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:10,447 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:20:10,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 20:20:10,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:20:10,652 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:10,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:10,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1745447079, now seen corresponding path program 1 times [2025-03-16 20:20:10,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:10,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745476752] [2025-03-16 20:20:10,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:10,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:10,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 20:20:10,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 20:20:10,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:10,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:10,750 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:20:10,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:10,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745476752] [2025-03-16 20:20:10,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745476752] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:20:10,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971242545] [2025-03-16 20:20:10,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:10,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:20:10,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:20:10,757 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-16 20:20:10,765 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-16 20:20:10,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 20:20:10,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 20:20:10,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:10,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:10,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-16 20:20:10,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:20:10,902 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:20:10,902 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:20:11,052 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:20:11,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971242545] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:20:11,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:20:11,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 9 [2025-03-16 20:20:11,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725494176] [2025-03-16 20:20:11,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:20:11,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 20:20:11,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:11,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 20:20:11,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:20:11,054 INFO L87 Difference]: Start difference. First operand 3632 states and 5251 transitions. Second operand has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:11,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:11,243 INFO L93 Difference]: Finished difference Result 7078 states and 9638 transitions. [2025-03-16 20:20:11,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:20:11,244 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-16 20:20:11,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:11,249 INFO L225 Difference]: With dead ends: 7078 [2025-03-16 20:20:11,249 INFO L226 Difference]: Without dead ends: 4982 [2025-03-16 20:20:11,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:20:11,251 INFO L435 NwaCegarLoop]: 1513 mSDtfsCounter, 5837 mSDsluCounter, 3117 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5837 SdHoareTripleChecker+Valid, 4630 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:20:11,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5837 Valid, 4630 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:20:11,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4982 states. [2025-03-16 20:20:11,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4982 to 4780. [2025-03-16 20:20:11,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4780 states, 4778 states have (on average 1.3652155713687735) internal successors, (6523), 4779 states have internal predecessors, (6523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:11,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4780 states to 4780 states and 6523 transitions. [2025-03-16 20:20:11,371 INFO L78 Accepts]: Start accepts. Automaton has 4780 states and 6523 transitions. Word has length 58 [2025-03-16 20:20:11,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:11,371 INFO L471 AbstractCegarLoop]: Abstraction has 4780 states and 6523 transitions. [2025-03-16 20:20:11,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:11,371 INFO L276 IsEmpty]: Start isEmpty. Operand 4780 states and 6523 transitions. [2025-03-16 20:20:11,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-16 20:20:11,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:11,372 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] [2025-03-16 20:20:11,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 20:20:11,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:20:11,576 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:11,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:11,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1540464325, now seen corresponding path program 1 times [2025-03-16 20:20:11,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:11,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612842561] [2025-03-16 20:20:11,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:11,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:11,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 20:20:11,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 20:20:11,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:11,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:12,142 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:12,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:12,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612842561] [2025-03-16 20:20:12,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612842561] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:20:12,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081320069] [2025-03-16 20:20:12,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:12,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:20:12,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:20:12,144 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-16 20:20:12,145 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-16 20:20:12,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 20:20:12,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 20:20:12,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:12,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:12,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-16 20:20:12,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:20:13,625 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:13,625 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:20:15,616 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:15,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081320069] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:20:15,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:20:15,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21, 16] total 53 [2025-03-16 20:20:15,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620699671] [2025-03-16 20:20:15,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:20:15,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-03-16 20:20:15,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:15,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-03-16 20:20:15,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=2393, Unknown=0, NotChecked=0, Total=2756 [2025-03-16 20:20:15,618 INFO L87 Difference]: Start difference. First operand 4780 states and 6523 transitions. Second operand has 53 states, 53 states have (on average 2.981132075471698) internal successors, (158), 53 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:34,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:34,560 INFO L93 Difference]: Finished difference Result 13260 states and 17044 transitions. [2025-03-16 20:20:34,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2025-03-16 20:20:34,563 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.981132075471698) internal successors, (158), 53 states have internal predecessors, (158), 0 states have call successors, (0), 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 58 [2025-03-16 20:20:34,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:34,578 INFO L225 Difference]: With dead ends: 13260 [2025-03-16 20:20:34,578 INFO L226 Difference]: Without dead ends: 10920 [2025-03-16 20:20:34,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11265 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=6171, Invalid=24981, Unknown=0, NotChecked=0, Total=31152 [2025-03-16 20:20:34,588 INFO L435 NwaCegarLoop]: 1533 mSDtfsCounter, 20980 mSDsluCounter, 19208 mSDsCounter, 0 mSdLazyCounter, 2352 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20980 SdHoareTripleChecker+Valid, 20741 SdHoareTripleChecker+Invalid, 2479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 2352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:20:34,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20980 Valid, 20741 Invalid, 2479 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [127 Valid, 2352 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 20:20:34,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10920 states. [2025-03-16 20:20:34,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10920 to 6162. [2025-03-16 20:20:34,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6162 states, 6160 states have (on average 1.3301948051948052) internal successors, (8194), 6161 states have internal predecessors, (8194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:34,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6162 states to 6162 states and 8194 transitions. [2025-03-16 20:20:34,852 INFO L78 Accepts]: Start accepts. Automaton has 6162 states and 8194 transitions. Word has length 58 [2025-03-16 20:20:34,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:34,853 INFO L471 AbstractCegarLoop]: Abstraction has 6162 states and 8194 transitions. [2025-03-16 20:20:34,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.981132075471698) internal successors, (158), 53 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:34,853 INFO L276 IsEmpty]: Start isEmpty. Operand 6162 states and 8194 transitions. [2025-03-16 20:20:34,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-16 20:20:34,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:34,853 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] [2025-03-16 20:20:34,861 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-16 20:20:35,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:20:35,058 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:35,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:35,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1483340795, now seen corresponding path program 1 times [2025-03-16 20:20:35,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:35,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129412632] [2025-03-16 20:20:35,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:35,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:35,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 20:20:35,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 20:20:35,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:35,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:35,419 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:35,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:35,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129412632] [2025-03-16 20:20:35,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129412632] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:20:35,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802727791] [2025-03-16 20:20:35,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:35,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:20:35,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:20:35,422 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-16 20:20:35,424 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-16 20:20:35,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 20:20:35,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 20:20:35,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:35,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:35,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-16 20:20:35,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:20:35,927 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:35,927 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:20:36,690 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:36,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802727791] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:20:36,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:20:36,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2025-03-16 20:20:36,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793027946] [2025-03-16 20:20:36,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:20:36,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-16 20:20:36,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:36,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-16 20:20:36,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=931, Unknown=0, NotChecked=0, Total=1056 [2025-03-16 20:20:36,691 INFO L87 Difference]: Start difference. First operand 6162 states and 8194 transitions. Second operand has 33 states, 33 states have (on average 4.181818181818182) internal successors, (138), 33 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:38,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:38,001 INFO L93 Difference]: Finished difference Result 10023 states and 13064 transitions. [2025-03-16 20:20:38,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-16 20:20:38,002 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 4.181818181818182) internal successors, (138), 33 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-03-16 20:20:38,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:38,012 INFO L225 Difference]: With dead ends: 10023 [2025-03-16 20:20:38,012 INFO L226 Difference]: Without dead ends: 7558 [2025-03-16 20:20:38,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=476, Invalid=1974, Unknown=0, NotChecked=0, Total=2450 [2025-03-16 20:20:38,015 INFO L435 NwaCegarLoop]: 1488 mSDtfsCounter, 11160 mSDsluCounter, 16497 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11160 SdHoareTripleChecker+Valid, 17985 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:20:38,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11160 Valid, 17985 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:20:38,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7558 states. [2025-03-16 20:20:38,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7558 to 5606. [2025-03-16 20:20:38,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5606 states, 5604 states have (on average 1.342612419700214) internal successors, (7524), 5605 states have internal predecessors, (7524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:38,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5606 states to 5606 states and 7524 transitions. [2025-03-16 20:20:38,281 INFO L78 Accepts]: Start accepts. Automaton has 5606 states and 7524 transitions. Word has length 59 [2025-03-16 20:20:38,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:38,281 INFO L471 AbstractCegarLoop]: Abstraction has 5606 states and 7524 transitions. [2025-03-16 20:20:38,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.181818181818182) internal successors, (138), 33 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:38,282 INFO L276 IsEmpty]: Start isEmpty. Operand 5606 states and 7524 transitions. [2025-03-16 20:20:38,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 20:20:38,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:38,282 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:20:38,291 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-16 20:20:38,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:20:38,484 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:38,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:38,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1865761881, now seen corresponding path program 1 times [2025-03-16 20:20:38,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:38,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616927908] [2025-03-16 20:20:38,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:38,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:38,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 20:20:38,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 20:20:38,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:38,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:38,537 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:38,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:38,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616927908] [2025-03-16 20:20:38,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616927908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:20:38,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:20:38,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:20:38,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336348652] [2025-03-16 20:20:38,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:20:38,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:20:38,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:38,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:20:38,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:20:38,539 INFO L87 Difference]: Start difference. First operand 5606 states and 7524 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:40,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:40,818 INFO L93 Difference]: Finished difference Result 8612 states and 12451 transitions. [2025-03-16 20:20:40,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:20:40,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-03-16 20:20:40,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:40,826 INFO L225 Difference]: With dead ends: 8612 [2025-03-16 20:20:40,826 INFO L226 Difference]: Without dead ends: 7108 [2025-03-16 20:20:40,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:20:40,828 INFO L435 NwaCegarLoop]: 1215 mSDtfsCounter, 753 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 2412 mSolverCounterSat, 681 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 3093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 681 IncrementalHoareTripleChecker+Valid, 2412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:20:40,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 1289 Invalid, 3093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [681 Valid, 2412 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 20:20:40,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7108 states. [2025-03-16 20:20:41,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7108 to 7108. [2025-03-16 20:20:41,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7108 states, 7106 states have (on average 1.3622291021671826) internal successors, (9680), 7107 states have internal predecessors, (9680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:41,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7108 states to 7108 states and 9680 transitions. [2025-03-16 20:20:41,034 INFO L78 Accepts]: Start accepts. Automaton has 7108 states and 9680 transitions. Word has length 86 [2025-03-16 20:20:41,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:41,035 INFO L471 AbstractCegarLoop]: Abstraction has 7108 states and 9680 transitions. [2025-03-16 20:20:41,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:41,035 INFO L276 IsEmpty]: Start isEmpty. Operand 7108 states and 9680 transitions. [2025-03-16 20:20:41,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 20:20:41,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:41,036 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:20:41,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 20:20:41,036 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:41,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:41,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1605857883, now seen corresponding path program 1 times [2025-03-16 20:20:41,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:41,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85790285] [2025-03-16 20:20:41,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:41,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:41,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 20:20:41,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 20:20:41,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:41,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:41,071 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:41,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:41,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85790285] [2025-03-16 20:20:41,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85790285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:20:41,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:20:41,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:20:41,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666445466] [2025-03-16 20:20:41,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:20:41,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:20:41,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:41,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:20:41,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:20:41,074 INFO L87 Difference]: Start difference. First operand 7108 states and 9680 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:43,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:43,300 INFO L93 Difference]: Finished difference Result 13118 states and 18919 transitions. [2025-03-16 20:20:43,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:20:43,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-03-16 20:20:43,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:43,313 INFO L225 Difference]: With dead ends: 13118 [2025-03-16 20:20:43,313 INFO L226 Difference]: Without dead ends: 10112 [2025-03-16 20:20:43,318 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-16 20:20:43,319 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 841 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 935 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 841 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 935 IncrementalHoareTripleChecker+Valid, 1995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:20:43,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [841 Valid, 513 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [935 Valid, 1995 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 20:20:43,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10112 states. [2025-03-16 20:20:43,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10112 to 10112. [2025-03-16 20:20:43,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10112 states, 10110 states have (on average 1.3164193867457963) internal successors, (13309), 10111 states have internal predecessors, (13309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:43,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10112 states to 10112 states and 13309 transitions. [2025-03-16 20:20:43,583 INFO L78 Accepts]: Start accepts. Automaton has 10112 states and 13309 transitions. Word has length 89 [2025-03-16 20:20:43,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:43,583 INFO L471 AbstractCegarLoop]: Abstraction has 10112 states and 13309 transitions. [2025-03-16 20:20:43,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:43,584 INFO L276 IsEmpty]: Start isEmpty. Operand 10112 states and 13309 transitions. [2025-03-16 20:20:43,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-16 20:20:43,585 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:43,585 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:20:43,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 20:20:43,585 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:43,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:43,585 INFO L85 PathProgramCache]: Analyzing trace with hash 804692853, now seen corresponding path program 1 times [2025-03-16 20:20:43,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:43,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021840846] [2025-03-16 20:20:43,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:43,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:43,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-16 20:20:43,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-16 20:20:43,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:43,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:44,875 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:44,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:44,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021840846] [2025-03-16 20:20:44,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021840846] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:20:44,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796137457] [2025-03-16 20:20:44,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:44,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:20:44,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:20:44,878 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-16 20:20:44,879 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-16 20:20:44,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-16 20:20:44,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-16 20:20:44,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:44,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:44,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-16 20:20:44,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:20:46,021 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 32 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:46,022 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:20:48,205 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 32 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:48,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796137457] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:20:48,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:20:48,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 18, 17] total 59 [2025-03-16 20:20:48,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125907412] [2025-03-16 20:20:48,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:20:48,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2025-03-16 20:20:48,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:48,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2025-03-16 20:20:48,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=3191, Unknown=0, NotChecked=0, Total=3422 [2025-03-16 20:20:48,207 INFO L87 Difference]: Start difference. First operand 10112 states and 13309 transitions. Second operand has 59 states, 59 states have (on average 4.3559322033898304) internal successors, (257), 59 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)