./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p19.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p19.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 46c8c70b94fb416b397f60e2acbf82f6629dd4cb8ce2ac8f593f21f2a4fca4f4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:27:31,943 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:27:31,992 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 18:27:31,998 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:27:31,998 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:27:32,015 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:27:32,016 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:27:32,017 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:27:32,017 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:27:32,017 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:27:32,018 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:27:32,018 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:27:32,018 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:27:32,018 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:27:32,018 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:27:32,019 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:27:32,019 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:27:32,019 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 18:27:32,019 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:27:32,020 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:27:32,020 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:27:32,020 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:27:32,020 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:27:32,020 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:27:32,020 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:27:32,020 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:27:32,020 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:27:32,020 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:27:32,020 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:27:32,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:27:32,020 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:27:32,020 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:27:32,020 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:27:32,020 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:27:32,020 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 18:27:32,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 18:27:32,020 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:27:32,020 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:27:32,020 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:27:32,020 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:27:32,020 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 46c8c70b94fb416b397f60e2acbf82f6629dd4cb8ce2ac8f593f21f2a4fca4f4 [2025-03-03 18:27:32,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:27:32,240 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:27:32,242 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:27:32,243 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:27:32,243 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:27:32,245 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p19.c [2025-03-03 18:27:33,397 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/298aa0d33/96757380b8c64e1aafffb251dcc43e8a/FLAGe22722a1f [2025-03-03 18:27:33,612 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:27:33,613 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p19.c [2025-03-03 18:27:33,620 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/298aa0d33/96757380b8c64e1aafffb251dcc43e8a/FLAGe22722a1f [2025-03-03 18:27:33,941 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/298aa0d33/96757380b8c64e1aafffb251dcc43e8a [2025-03-03 18:27:33,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:27:33,945 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:27:33,946 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:27:33,946 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:27:33,949 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:27:33,950 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:27:33" (1/1) ... [2025-03-03 18:27:33,950 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75254f70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:33, skipping insertion in model container [2025-03-03 18:27:33,950 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:27:33" (1/1) ... [2025-03-03 18:27:33,967 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:27:34,076 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/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p19.c[1266,1279] [2025-03-03 18:27:34,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:27:34,187 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:27:34,195 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/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p19.c[1266,1279] [2025-03-03 18:27:34,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:27:34,276 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:27:34,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:34 WrapperNode [2025-03-03 18:27:34,277 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:27:34,278 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:27:34,278 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:27:34,278 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:27:34,284 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:34" (1/1) ... [2025-03-03 18:27:34,300 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:34" (1/1) ... [2025-03-03 18:27:34,373 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 719 [2025-03-03 18:27:34,374 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:27:34,375 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:27:34,375 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:27:34,375 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:27:34,381 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:34" (1/1) ... [2025-03-03 18:27:34,382 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:34" (1/1) ... [2025-03-03 18:27:34,397 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:34" (1/1) ... [2025-03-03 18:27:34,431 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 18:27:34,436 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:34" (1/1) ... [2025-03-03 18:27:34,437 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:34" (1/1) ... [2025-03-03 18:27:34,455 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:34" (1/1) ... [2025-03-03 18:27:34,459 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:34" (1/1) ... [2025-03-03 18:27:34,464 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:34" (1/1) ... [2025-03-03 18:27:34,469 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:34" (1/1) ... [2025-03-03 18:27:34,478 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:27:34,478 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:27:34,479 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:27:34,479 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:27:34,479 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:34" (1/1) ... [2025-03-03 18:27:34,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:27:34,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:27:34,509 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 18:27:34,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 18:27:34,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:27:34,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 18:27:34,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:27:34,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:27:34,628 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:27:34,630 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:27:35,302 INFO L? ?]: Removed 373 outVars from TransFormulas that were not future-live. [2025-03-03 18:27:35,302 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:27:35,346 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:27:35,346 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:27:35,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:27:35 BoogieIcfgContainer [2025-03-03 18:27:35,347 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:27:35,349 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:27:35,349 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:27:35,353 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:27:35,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:27:33" (1/3) ... [2025-03-03 18:27:35,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@600f51a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:27:35, skipping insertion in model container [2025-03-03 18:27:35,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:34" (2/3) ... [2025-03-03 18:27:35,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@600f51a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:27:35, skipping insertion in model container [2025-03-03 18:27:35,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:27:35" (3/3) ... [2025-03-03 18:27:35,356 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p19.c [2025-03-03 18:27:35,368 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:27:35,370 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p19.c that has 1 procedures, 142 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:27:35,422 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:27:35,433 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;@7cb37798, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:27:35,433 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:27:35,438 INFO L276 IsEmpty]: Start isEmpty. Operand has 142 states, 140 states have (on average 1.4928571428571429) internal successors, (209), 141 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:27:35,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-03 18:27:35,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:27:35,445 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:27:35,446 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:27:35,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:27:35,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1016460869, now seen corresponding path program 1 times [2025-03-03 18:27:35,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:27:35,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803258758] [2025-03-03 18:27:35,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:27:35,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:27:35,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-03 18:27:35,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-03 18:27:35,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:27:35,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:27:36,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:27:36,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:27:36,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803258758] [2025-03-03 18:27:36,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803258758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:27:36,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:27:36,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:27:36,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791385385] [2025-03-03 18:27:36,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:27:36,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:27:36,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:27:36,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:27:36,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:27:36,044 INFO L87 Difference]: Start difference. First operand has 142 states, 140 states have (on average 1.4928571428571429) internal successors, (209), 141 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:27:36,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:27:36,141 INFO L93 Difference]: Finished difference Result 229 states and 339 transitions. [2025-03-03 18:27:36,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:27:36,143 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-03-03 18:27:36,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:27:36,148 INFO L225 Difference]: With dead ends: 229 [2025-03-03 18:27:36,148 INFO L226 Difference]: Without dead ends: 141 [2025-03-03 18:27:36,151 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-03 18:27:36,153 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:27:36,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 505 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:27:36,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-03 18:27:36,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2025-03-03 18:27:36,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.4785714285714286) internal successors, (207), 140 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:27:36,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 207 transitions. [2025-03-03 18:27:36,193 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 207 transitions. Word has length 41 [2025-03-03 18:27:36,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:27:36,193 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 207 transitions. [2025-03-03 18:27:36,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:27:36,194 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 207 transitions. [2025-03-03 18:27:36,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-03 18:27:36,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:27:36,195 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:27:36,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 18:27:36,196 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:27:36,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:27:36,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1440836617, now seen corresponding path program 1 times [2025-03-03 18:27:36,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:27:36,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613135053] [2025-03-03 18:27:36,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:27:36,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:27:36,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-03 18:27:36,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-03 18:27:36,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:27:36,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:27:36,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:27:36,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:27:36,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613135053] [2025-03-03 18:27:36,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613135053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:27:36,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:27:36,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:27:36,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787137859] [2025-03-03 18:27:36,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:27:36,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:27:36,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:27:36,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:27:36,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:27:36,349 INFO L87 Difference]: Start difference. First operand 141 states and 207 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:27:36,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:27:36,449 INFO L93 Difference]: Finished difference Result 230 states and 337 transitions. [2025-03-03 18:27:36,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:27:36,450 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-03-03 18:27:36,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:27:36,450 INFO L225 Difference]: With dead ends: 230 [2025-03-03 18:27:36,450 INFO L226 Difference]: Without dead ends: 143 [2025-03-03 18:27:36,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-03 18:27:36,451 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:27:36,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 502 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:27:36,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-03 18:27:36,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2025-03-03 18:27:36,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.471830985915493) internal successors, (209), 142 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:27:36,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 209 transitions. [2025-03-03 18:27:36,465 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 209 transitions. Word has length 42 [2025-03-03 18:27:36,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:27:36,465 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 209 transitions. [2025-03-03 18:27:36,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:27:36,465 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 209 transitions. [2025-03-03 18:27:36,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-03 18:27:36,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:27:36,466 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:27:36,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 18:27:36,467 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:27:36,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:27:36,467 INFO L85 PathProgramCache]: Analyzing trace with hash 215247158, now seen corresponding path program 1 times [2025-03-03 18:27:36,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:27:36,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727338494] [2025-03-03 18:27:36,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:27:36,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:27:36,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-03 18:27:36,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 18:27:36,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:27:36,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:27:36,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:27:36,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:27:36,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727338494] [2025-03-03 18:27:36,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727338494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:27:36,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:27:36,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:27:36,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711799664] [2025-03-03 18:27:36,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:27:36,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:27:36,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:27:36,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:27:36,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:27:36,817 INFO L87 Difference]: Start difference. First operand 143 states and 209 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:27:36,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:27:36,904 INFO L93 Difference]: Finished difference Result 232 states and 338 transitions. [2025-03-03 18:27:36,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:27:36,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2025-03-03 18:27:36,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:27:36,905 INFO L225 Difference]: With dead ends: 232 [2025-03-03 18:27:36,905 INFO L226 Difference]: Without dead ends: 143 [2025-03-03 18:27:36,906 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-03 18:27:36,906 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 6 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:27:36,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 492 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:27:36,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-03 18:27:36,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2025-03-03 18:27:36,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.4647887323943662) internal successors, (208), 142 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:27:36,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 208 transitions. [2025-03-03 18:27:36,914 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 208 transitions. Word has length 43 [2025-03-03 18:27:36,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:27:36,914 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 208 transitions. [2025-03-03 18:27:36,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:27:36,915 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 208 transitions. [2025-03-03 18:27:36,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 18:27:36,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:27:36,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:27:36,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 18:27:36,918 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:27:36,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:27:36,918 INFO L85 PathProgramCache]: Analyzing trace with hash -28910084, now seen corresponding path program 1 times [2025-03-03 18:27:36,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:27:36,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106992449] [2025-03-03 18:27:36,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:27:36,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:27:36,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 18:27:36,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 18:27:36,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:27:36,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:27:37,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:27:37,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:27:37,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106992449] [2025-03-03 18:27:37,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106992449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:27:37,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:27:37,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 18:27:37,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101993676] [2025-03-03 18:27:37,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:27:37,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 18:27:37,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:27:37,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 18:27:37,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:27:37,266 INFO L87 Difference]: Start difference. First operand 143 states and 208 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:27:37,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:27:37,457 INFO L93 Difference]: Finished difference Result 242 states and 350 transitions. [2025-03-03 18:27:37,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 18:27:37,457 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-03-03 18:27:37,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:27:37,459 INFO L225 Difference]: With dead ends: 242 [2025-03-03 18:27:37,459 INFO L226 Difference]: Without dead ends: 153 [2025-03-03 18:27:37,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-03 18:27:37,460 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 192 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:27:37,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 972 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:27:37,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-03 18:27:37,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2025-03-03 18:27:37,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 1.4569536423841059) internal successors, (220), 151 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:27:37,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 220 transitions. [2025-03-03 18:27:37,472 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 220 transitions. Word has length 44 [2025-03-03 18:27:37,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:27:37,472 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 220 transitions. [2025-03-03 18:27:37,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:27:37,472 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 220 transitions. [2025-03-03 18:27:37,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 18:27:37,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:27:37,473 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:27:37,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 18:27:37,473 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:27:37,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:27:37,473 INFO L85 PathProgramCache]: Analyzing trace with hash 53862060, now seen corresponding path program 1 times [2025-03-03 18:27:37,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:27:37,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732635194] [2025-03-03 18:27:37,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:27:37,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:27:37,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 18:27:37,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 18:27:37,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:27:37,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:27:37,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:27:37,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:27:37,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732635194] [2025-03-03 18:27:37,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732635194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:27:37,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:27:37,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:27:37,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002206984] [2025-03-03 18:27:37,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:27:37,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:27:37,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:27:37,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:27:37,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:27:37,660 INFO L87 Difference]: Start difference. First operand 152 states and 220 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 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-03 18:27:37,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:27:37,783 INFO L93 Difference]: Finished difference Result 279 states and 397 transitions. [2025-03-03 18:27:37,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:27:37,783 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 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 45 [2025-03-03 18:27:37,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:27:37,784 INFO L225 Difference]: With dead ends: 279 [2025-03-03 18:27:37,784 INFO L226 Difference]: Without dead ends: 181 [2025-03-03 18:27:37,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:27:37,785 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 236 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:27:37,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 475 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:27:37,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-03 18:27:37,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 154. [2025-03-03 18:27:37,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 1.4509803921568627) internal successors, (222), 153 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:27:37,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 222 transitions. [2025-03-03 18:27:37,790 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 222 transitions. Word has length 45 [2025-03-03 18:27:37,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:27:37,790 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 222 transitions. [2025-03-03 18:27:37,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 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-03 18:27:37,791 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 222 transitions. [2025-03-03 18:27:37,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 18:27:37,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:27:37,791 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:27:37,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 18:27:37,792 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:27:37,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:27:37,792 INFO L85 PathProgramCache]: Analyzing trace with hash 710647059, now seen corresponding path program 1 times [2025-03-03 18:27:37,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:27:37,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375576606] [2025-03-03 18:27:37,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:27:37,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:27:37,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 18:27:37,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 18:27:37,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:27:37,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:27:38,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:27:38,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:27:38,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375576606] [2025-03-03 18:27:38,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375576606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:27:38,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:27:38,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 18:27:38,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019848316] [2025-03-03 18:27:38,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:27:38,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 18:27:38,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:27:38,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 18:27:38,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:27:38,332 INFO L87 Difference]: Start difference. First operand 154 states and 222 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 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-03 18:27:38,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:27:38,646 INFO L93 Difference]: Finished difference Result 257 states and 369 transitions. [2025-03-03 18:27:38,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 18:27:38,646 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 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 45 [2025-03-03 18:27:38,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:27:38,647 INFO L225 Difference]: With dead ends: 257 [2025-03-03 18:27:38,647 INFO L226 Difference]: Without dead ends: 159 [2025-03-03 18:27:38,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-03 18:27:38,652 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 197 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:27:38,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 1045 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:27:38,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-03 18:27:38,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2025-03-03 18:27:38,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.4458598726114649) internal successors, (227), 157 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:27:38,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 227 transitions. [2025-03-03 18:27:38,661 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 227 transitions. Word has length 45 [2025-03-03 18:27:38,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:27:38,661 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 227 transitions. [2025-03-03 18:27:38,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 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-03 18:27:38,661 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 227 transitions. [2025-03-03 18:27:38,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-03 18:27:38,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:27:38,662 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:27:38,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 18:27:38,662 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:27:38,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:27:38,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1645188021, now seen corresponding path program 1 times [2025-03-03 18:27:38,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:27:38,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157400871] [2025-03-03 18:27:38,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:27:38,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:27:38,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-03 18:27:38,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-03 18:27:38,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:27:38,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:27:38,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:27:38,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:27:38,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157400871] [2025-03-03 18:27:38,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157400871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:27:38,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:27:38,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:27:38,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097092949] [2025-03-03 18:27:38,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:27:38,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:27:38,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:27:38,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:27:38,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:27:38,891 INFO L87 Difference]: Start difference. First operand 158 states and 227 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:27:38,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:27:38,986 INFO L93 Difference]: Finished difference Result 266 states and 380 transitions. [2025-03-03 18:27:38,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:27:38,987 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-03-03 18:27:38,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:27:38,987 INFO L225 Difference]: With dead ends: 266 [2025-03-03 18:27:38,988 INFO L226 Difference]: Without dead ends: 164 [2025-03-03 18:27:38,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:27:38,988 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 175 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:27:38,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 493 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:27:38,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-03 18:27:38,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2025-03-03 18:27:38,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 1.4294478527607362) internal successors, (233), 163 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:27:38,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 233 transitions. [2025-03-03 18:27:38,998 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 233 transitions. Word has length 46 [2025-03-03 18:27:38,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:27:38,998 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 233 transitions. [2025-03-03 18:27:38,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:27:38,998 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 233 transitions. [2025-03-03 18:27:38,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-03 18:27:38,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:27:38,999 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:27:38,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 18:27:38,999 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:27:38,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:27:39,000 INFO L85 PathProgramCache]: Analyzing trace with hash -413299158, now seen corresponding path program 1 times [2025-03-03 18:27:39,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:27:39,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972981982] [2025-03-03 18:27:39,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:27:39,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:27:39,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 18:27:39,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 18:27:39,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:27:39,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:27:39,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:27:39,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:27:39,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972981982] [2025-03-03 18:27:39,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972981982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:27:39,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:27:39,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:27:39,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436845154] [2025-03-03 18:27:39,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:27:39,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:27:39,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:27:39,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:27:39,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:27:39,140 INFO L87 Difference]: Start difference. First operand 164 states and 233 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 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-03 18:27:39,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:27:39,380 INFO L93 Difference]: Finished difference Result 284 states and 397 transitions. [2025-03-03 18:27:39,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:27:39,380 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-03-03 18:27:39,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:27:39,381 INFO L225 Difference]: With dead ends: 284 [2025-03-03 18:27:39,381 INFO L226 Difference]: Without dead ends: 176 [2025-03-03 18:27:39,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:27:39,382 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 202 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:27:39,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 526 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:27:39,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-03 18:27:39,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 166. [2025-03-03 18:27:39,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 1.4242424242424243) internal successors, (235), 165 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:27:39,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 235 transitions. [2025-03-03 18:27:39,386 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 235 transitions. Word has length 47 [2025-03-03 18:27:39,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:27:39,386 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 235 transitions. [2025-03-03 18:27:39,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 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-03 18:27:39,386 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 235 transitions. [2025-03-03 18:27:39,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 18:27:39,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:27:39,387 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:27:39,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 18:27:39,387 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:27:39,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:27:39,388 INFO L85 PathProgramCache]: Analyzing trace with hash -767472048, now seen corresponding path program 1 times [2025-03-03 18:27:39,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:27:39,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144944258] [2025-03-03 18:27:39,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:27:39,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:27:39,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 18:27:39,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 18:27:39,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:27:39,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:27:40,136 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:27:40,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:27:40,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144944258] [2025-03-03 18:27:40,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144944258] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:27:40,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563647810] [2025-03-03 18:27:40,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:27:40,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:27:40,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:27:40,141 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:27:40,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 18:27:40,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 18:27:40,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 18:27:40,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:27:40,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:27:40,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-03 18:27:40,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:27:40,810 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:27:40,810 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:27:40,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563647810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:27:40,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 18:27:40,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2025-03-03 18:27:40,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723586024] [2025-03-03 18:27:40,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:27:40,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:27:40,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:27:40,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:27:40,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:27:40,811 INFO L87 Difference]: Start difference. First operand 166 states and 235 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 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-03 18:27:41,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:27:41,170 INFO L93 Difference]: Finished difference Result 287 states and 401 transitions. [2025-03-03 18:27:41,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:27:41,170 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 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-03 18:27:41,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:27:41,172 INFO L225 Difference]: With dead ends: 287 [2025-03-03 18:27:41,172 INFO L226 Difference]: Without dead ends: 179 [2025-03-03 18:27:41,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:27:41,173 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 196 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:27:41,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 147 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:27:41,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-03-03 18:27:41,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2025-03-03 18:27:41,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 177 states have (on average 1.3954802259887005) internal successors, (247), 177 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:27:41,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 247 transitions. [2025-03-03 18:27:41,178 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 247 transitions. Word has length 89 [2025-03-03 18:27:41,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:27:41,179 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 247 transitions. [2025-03-03 18:27:41,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 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-03 18:27:41,179 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 247 transitions. [2025-03-03 18:27:41,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 18:27:41,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:27:41,179 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:27:41,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 18:27:41,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:27:41,380 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:27:41,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:27:41,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1318407481, now seen corresponding path program 1 times [2025-03-03 18:27:41,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:27:41,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556418979] [2025-03-03 18:27:41,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:27:41,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:27:41,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 18:27:41,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 18:27:41,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:27:41,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:27:42,024 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:27:42,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:27:42,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556418979] [2025-03-03 18:27:42,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556418979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:27:42,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:27:42,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:27:42,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705761168] [2025-03-03 18:27:42,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:27:42,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:27:42,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:27:42,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:27:42,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:27:42,026 INFO L87 Difference]: Start difference. First operand 178 states and 247 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:27:42,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:27:42,395 INFO L93 Difference]: Finished difference Result 340 states and 478 transitions. [2025-03-03 18:27:42,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:27:42,396 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2025-03-03 18:27:42,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:27:42,397 INFO L225 Difference]: With dead ends: 340 [2025-03-03 18:27:42,397 INFO L226 Difference]: Without dead ends: 232 [2025-03-03 18:27:42,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:27:42,397 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 342 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:27:42,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 373 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:27:42,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-03 18:27:42,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 201. [2025-03-03 18:27:42,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 1.4) internal successors, (280), 200 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:27:42,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 280 transitions. [2025-03-03 18:27:42,402 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 280 transitions. Word has length 91 [2025-03-03 18:27:42,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:27:42,402 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 280 transitions. [2025-03-03 18:27:42,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:27:42,403 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 280 transitions. [2025-03-03 18:27:42,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 18:27:42,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:27:42,403 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:27:42,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 18:27:42,403 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:27:42,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:27:42,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1459720151, now seen corresponding path program 1 times [2025-03-03 18:27:42,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:27:42,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910427440] [2025-03-03 18:27:42,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:27:42,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:27:42,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 18:27:42,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 18:27:42,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:27:42,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:27:43,010 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:27:43,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:27:43,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910427440] [2025-03-03 18:27:43,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910427440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:27:43,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:27:43,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:27:43,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005140891] [2025-03-03 18:27:43,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:27:43,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:27:43,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:27:43,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:27:43,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:27:43,012 INFO L87 Difference]: Start difference. First operand 201 states and 280 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:27:43,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:27:43,311 INFO L93 Difference]: Finished difference Result 334 states and 467 transitions. [2025-03-03 18:27:43,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:27:43,312 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-03-03 18:27:43,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:27:43,313 INFO L225 Difference]: With dead ends: 334 [2025-03-03 18:27:43,313 INFO L226 Difference]: Without dead ends: 208 [2025-03-03 18:27:43,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:27:43,314 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 318 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:27:43,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 347 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:27:43,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-03-03 18:27:43,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 201. [2025-03-03 18:27:43,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 1.395) internal successors, (279), 200 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:27:43,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 279 transitions. [2025-03-03 18:27:43,324 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 279 transitions. Word has length 92 [2025-03-03 18:27:43,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:27:43,324 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 279 transitions. [2025-03-03 18:27:43,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:27:43,324 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 279 transitions. [2025-03-03 18:27:43,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 18:27:43,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:27:43,325 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:27:43,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 18:27:43,325 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:27:43,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:27:43,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1034827698, now seen corresponding path program 1 times [2025-03-03 18:27:43,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:27:43,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450753297] [2025-03-03 18:27:43,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:27:43,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:27:43,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 18:27:43,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 18:27:43,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:27:43,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:27:44,092 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:27:44,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:27:44,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450753297] [2025-03-03 18:27:44,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450753297] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:27:44,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629061405] [2025-03-03 18:27:44,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:27:44,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:27:44,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:27:44,096 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:27:44,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 18:27:44,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 18:27:44,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 18:27:44,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:27:44,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:27:44,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-03 18:27:44,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:27:45,008 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:27:45,008 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:27:45,447 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:27:45,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629061405] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:27:45,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 18:27:45,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 9] total 22 [2025-03-03 18:27:45,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382070347] [2025-03-03 18:27:45,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 18:27:45,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 18:27:45,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:27:45,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 18:27:45,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2025-03-03 18:27:45,449 INFO L87 Difference]: Start difference. First operand 201 states and 279 transitions. Second operand has 22 states, 22 states have (on average 11.454545454545455) internal successors, (252), 22 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:27:46,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:27:46,404 INFO L93 Difference]: Finished difference Result 324 states and 454 transitions. [2025-03-03 18:27:46,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 18:27:46,404 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 11.454545454545455) internal successors, (252), 22 states have internal predecessors, (252), 0 states have call successors, (0), 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 93 [2025-03-03 18:27:46,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:27:46,405 INFO L225 Difference]: With dead ends: 324 [2025-03-03 18:27:46,405 INFO L226 Difference]: Without dead ends: 216 [2025-03-03 18:27:46,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=202, Invalid=790, Unknown=0, NotChecked=0, Total=992 [2025-03-03 18:27:46,406 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 615 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 1478 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 18:27:46,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 444 Invalid, 1483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1478 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 18:27:46,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-03-03 18:27:46,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 185. [2025-03-03 18:27:46,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.391304347826087) internal successors, (256), 184 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:27:46,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 256 transitions. [2025-03-03 18:27:46,414 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 256 transitions. Word has length 93 [2025-03-03 18:27:46,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:27:46,414 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 256 transitions. [2025-03-03 18:27:46,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 11.454545454545455) internal successors, (252), 22 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:27:46,415 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 256 transitions. [2025-03-03 18:27:46,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 18:27:46,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:27:46,415 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:27:46,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 18:27:46,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 18:27:46,616 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:27:46,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:27:46,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1696841136, now seen corresponding path program 1 times [2025-03-03 18:27:46,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:27:46,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873673874] [2025-03-03 18:27:46,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:27:46,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:27:46,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 18:27:46,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 18:27:46,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:27:46,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:27:47,507 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:27:47,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:27:47,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873673874] [2025-03-03 18:27:47,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873673874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:27:47,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:27:47,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 18:27:47,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568800846] [2025-03-03 18:27:47,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:27:47,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 18:27:47,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:27:47,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 18:27:47,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:27:47,508 INFO L87 Difference]: Start difference. First operand 185 states and 256 transitions. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:27:48,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:27:48,045 INFO L93 Difference]: Finished difference Result 327 states and 450 transitions. [2025-03-03 18:27:48,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 18:27:48,045 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2025-03-03 18:27:48,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:27:48,046 INFO L225 Difference]: With dead ends: 327 [2025-03-03 18:27:48,046 INFO L226 Difference]: Without dead ends: 235 [2025-03-03 18:27:48,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:27:48,048 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 194 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:27:48,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 415 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:27:48,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-03-03 18:27:48,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 209. [2025-03-03 18:27:48,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.3894230769230769) internal successors, (289), 208 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:27:48,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 289 transitions. [2025-03-03 18:27:48,052 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 289 transitions. Word has length 95 [2025-03-03 18:27:48,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:27:48,052 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 289 transitions. [2025-03-03 18:27:48,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:27:48,052 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 289 transitions. [2025-03-03 18:27:48,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 18:27:48,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:27:48,053 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:27:48,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 18:27:48,053 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:27:48,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:27:48,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1674430862, now seen corresponding path program 1 times [2025-03-03 18:27:48,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:27:48,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51547696] [2025-03-03 18:27:48,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:27:48,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:27:48,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 18:27:48,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 18:27:48,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:27:48,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:27:49,104 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:27:49,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:27:49,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51547696] [2025-03-03 18:27:49,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51547696] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:27:49,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323507210] [2025-03-03 18:27:49,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:27:49,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:27:49,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:27:49,107 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:27:49,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 18:27:49,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 18:27:49,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 18:27:49,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:27:49,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:27:49,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 821 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-03 18:27:49,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:27:49,753 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:27:49,754 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:27:50,198 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:27:50,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323507210] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:27:50,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 18:27:50,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 10] total 23 [2025-03-03 18:27:50,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476486983] [2025-03-03 18:27:50,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 18:27:50,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 18:27:50,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:27:50,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 18:27:50,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2025-03-03 18:27:50,201 INFO L87 Difference]: Start difference. First operand 209 states and 289 transitions. Second operand has 23 states, 23 states have (on average 9.652173913043478) internal successors, (222), 23 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:27:51,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:27:51,059 INFO L93 Difference]: Finished difference Result 397 states and 549 transitions. [2025-03-03 18:27:51,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 18:27:51,059 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 9.652173913043478) internal successors, (222), 23 states have internal predecessors, (222), 0 states have call successors, (0), 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 96 [2025-03-03 18:27:51,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:27:51,061 INFO L225 Difference]: With dead ends: 397 [2025-03-03 18:27:51,061 INFO L226 Difference]: Without dead ends: 260 [2025-03-03 18:27:51,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=817, Unknown=0, NotChecked=0, Total=992 [2025-03-03 18:27:51,062 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 677 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 1393 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 677 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 1394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 18:27:51,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [677 Valid, 447 Invalid, 1394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1393 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 18:27:51,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-03-03 18:27:51,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 250. [2025-03-03 18:27:51,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 1.393574297188755) internal successors, (347), 249 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:27:51,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 347 transitions. [2025-03-03 18:27:51,068 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 347 transitions. Word has length 96 [2025-03-03 18:27:51,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:27:51,068 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 347 transitions. [2025-03-03 18:27:51,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.652173913043478) internal successors, (222), 23 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:27:51,069 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 347 transitions. [2025-03-03 18:27:51,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-03 18:27:51,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:27:51,070 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 18:27:51,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 18:27:51,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:27:51,271 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:27:51,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:27:51,272 INFO L85 PathProgramCache]: Analyzing trace with hash 714565130, now seen corresponding path program 1 times [2025-03-03 18:27:51,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:27:51,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355009955] [2025-03-03 18:27:51,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:27:51,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:27:51,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 18:27:51,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 18:27:51,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:27:51,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:27:52,531 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:27:52,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:27:52,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355009955] [2025-03-03 18:27:52,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355009955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:27:52,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:27:52,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 18:27:52,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703920565] [2025-03-03 18:27:52,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:27:52,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 18:27:52,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:27:52,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 18:27:52,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:27:52,534 INFO L87 Difference]: Start difference. First operand 250 states and 347 transitions. Second operand has 9 states, 9 states have (on average 15.666666666666666) internal successors, (141), 9 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:27:53,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:27:53,229 INFO L93 Difference]: Finished difference Result 666 states and 937 transitions. [2025-03-03 18:27:53,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 18:27:53,230 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.666666666666666) internal successors, (141), 9 states have internal predecessors, (141), 0 states have call successors, (0), 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 141 [2025-03-03 18:27:53,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:27:53,232 INFO L225 Difference]: With dead ends: 666 [2025-03-03 18:27:53,232 INFO L226 Difference]: Without dead ends: 550 [2025-03-03 18:27:53,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-03-03 18:27:53,234 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 331 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 1269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 18:27:53,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 555 Invalid, 1269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1268 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 18:27:53,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-03-03 18:27:53,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 395. [2025-03-03 18:27:53,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 394 states have (on average 1.3934010152284264) internal successors, (549), 394 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:27:53,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 549 transitions. [2025-03-03 18:27:53,251 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 549 transitions. Word has length 141 [2025-03-03 18:27:53,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:27:53,251 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 549 transitions. [2025-03-03 18:27:53,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.666666666666666) internal successors, (141), 9 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:27:53,251 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 549 transitions. [2025-03-03 18:27:53,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-03 18:27:53,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:27:53,252 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 18:27:53,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 18:27:53,252 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:27:53,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:27:53,253 INFO L85 PathProgramCache]: Analyzing trace with hash -571120865, now seen corresponding path program 1 times [2025-03-03 18:27:53,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:27:53,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153339846] [2025-03-03 18:27:53,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:27:53,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:27:53,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 18:27:53,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 18:27:53,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:27:53,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:27:54,509 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:27:54,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:27:54,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153339846] [2025-03-03 18:27:54,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153339846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:27:54,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:27:54,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 18:27:54,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013608104] [2025-03-03 18:27:54,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:27:54,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 18:27:54,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:27:54,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 18:27:54,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:27:54,512 INFO L87 Difference]: Start difference. First operand 395 states and 549 transitions. Second operand has 9 states, 9 states have (on average 15.777777777777779) internal successors, (142), 9 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:27:55,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:27:55,060 INFO L93 Difference]: Finished difference Result 817 states and 1119 transitions. [2025-03-03 18:27:55,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 18:27:55,061 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.777777777777779) internal successors, (142), 9 states have internal predecessors, (142), 0 states have call successors, (0), 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 142 [2025-03-03 18:27:55,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:27:55,062 INFO L225 Difference]: With dead ends: 817 [2025-03-03 18:27:55,063 INFO L226 Difference]: Without dead ends: 593 [2025-03-03 18:27:55,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:27:55,063 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 308 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:27:55,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 533 Invalid, 1221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1220 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:27:55,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-03-03 18:27:55,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 437. [2025-03-03 18:27:55,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 436 states have (on average 1.360091743119266) internal successors, (593), 436 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:27:55,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 593 transitions. [2025-03-03 18:27:55,076 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 593 transitions. Word has length 142 [2025-03-03 18:27:55,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:27:55,077 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 593 transitions. [2025-03-03 18:27:55,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.777777777777779) internal successors, (142), 9 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:27:55,078 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 593 transitions. [2025-03-03 18:27:55,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 18:27:55,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:27:55,079 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 18:27:55,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 18:27:55,080 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:27:55,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:27:55,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1639676049, now seen corresponding path program 1 times [2025-03-03 18:27:55,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:27:55,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84319616] [2025-03-03 18:27:55,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:27:55,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:27:55,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 18:27:55,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 18:27:55,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:27:55,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:27:56,176 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 18:27:56,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:27:56,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84319616] [2025-03-03 18:27:56,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84319616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:27:56,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:27:56,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 18:27:56,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638347972] [2025-03-03 18:27:56,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:27:56,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 18:27:56,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:27:56,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 18:27:56,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:27:56,177 INFO L87 Difference]: Start difference. First operand 437 states and 593 transitions. Second operand has 10 states, 10 states have (on average 13.8) internal successors, (138), 10 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-03 18:27:56,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:27:56,852 INFO L93 Difference]: Finished difference Result 849 states and 1143 transitions. [2025-03-03 18:27:56,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 18:27:56,852 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.8) internal successors, (138), 10 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 143 [2025-03-03 18:27:56,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:27:56,854 INFO L225 Difference]: With dead ends: 849 [2025-03-03 18:27:56,854 INFO L226 Difference]: Without dead ends: 543 [2025-03-03 18:27:56,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-03 18:27:56,855 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 272 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 18:27:56,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 519 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 18:27:56,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2025-03-03 18:27:56,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 441. [2025-03-03 18:27:56,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 440 states have (on average 1.3613636363636363) internal successors, (599), 440 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:27:56,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 599 transitions. [2025-03-03 18:27:56,866 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 599 transitions. Word has length 143 [2025-03-03 18:27:56,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:27:56,867 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 599 transitions. [2025-03-03 18:27:56,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.8) internal successors, (138), 10 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-03 18:27:56,867 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 599 transitions. [2025-03-03 18:27:56,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 18:27:56,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:27:56,868 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 18:27:56,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 18:27:56,868 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:27:56,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:27:56,869 INFO L85 PathProgramCache]: Analyzing trace with hash 404633006, now seen corresponding path program 1 times [2025-03-03 18:27:56,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:27:56,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639606284] [2025-03-03 18:27:56,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:27:56,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:27:56,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 18:27:57,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 18:27:57,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:27:57,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:27:58,563 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 59 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:27:58,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:27:58,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639606284] [2025-03-03 18:27:58,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639606284] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:27:58,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134028283] [2025-03-03 18:27:58,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:27:58,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:27:58,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:27:58,567 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:27:58,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 18:27:58,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 18:27:59,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 18:27:59,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:27:59,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:27:59,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 1389 conjuncts, 105 conjuncts are in the unsatisfiable core [2025-03-03 18:27:59,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:27:59,743 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 55 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:27:59,743 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:28:01,319 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 43 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:28:01,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134028283] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:28:01,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 18:28:01,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 16] total 36 [2025-03-03 18:28:01,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679291627] [2025-03-03 18:28:01,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 18:28:01,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-03 18:28:01,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:28:01,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-03 18:28:01,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1100, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 18:28:01,322 INFO L87 Difference]: Start difference. First operand 441 states and 599 transitions. Second operand has 36 states, 36 states have (on average 11.11111111111111) internal successors, (400), 36 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:28:05,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:28:05,996 INFO L93 Difference]: Finished difference Result 2505 states and 3433 transitions. [2025-03-03 18:28:05,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2025-03-03 18:28:05,997 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 11.11111111111111) internal successors, (400), 36 states have internal predecessors, (400), 0 states have call successors, (0), 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 144 [2025-03-03 18:28:05,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:28:06,003 INFO L225 Difference]: With dead ends: 2505 [2025-03-03 18:28:06,003 INFO L226 Difference]: Without dead ends: 2247 [2025-03-03 18:28:06,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5828 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1829, Invalid=17353, Unknown=0, NotChecked=0, Total=19182 [2025-03-03 18:28:06,008 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 2140 mSDsluCounter, 1532 mSDsCounter, 0 mSdLazyCounter, 8007 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2140 SdHoareTripleChecker+Valid, 1619 SdHoareTripleChecker+Invalid, 8041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 8007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-03 18:28:06,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2140 Valid, 1619 Invalid, 8041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 8007 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-03 18:28:06,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2247 states. [2025-03-03 18:28:06,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2247 to 1197. [2025-03-03 18:28:06,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1197 states, 1196 states have (on average 1.4088628762541806) internal successors, (1685), 1196 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:28:06,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1685 transitions. [2025-03-03 18:28:06,037 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1685 transitions. Word has length 144 [2025-03-03 18:28:06,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:28:06,038 INFO L471 AbstractCegarLoop]: Abstraction has 1197 states and 1685 transitions. [2025-03-03 18:28:06,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 11.11111111111111) internal successors, (400), 36 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:28:06,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1685 transitions. [2025-03-03 18:28:06,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-03 18:28:06,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:28:06,040 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:28:06,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 18:28:06,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 18:28:06,243 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:28:06,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:28:06,243 INFO L85 PathProgramCache]: Analyzing trace with hash -942986889, now seen corresponding path program 1 times [2025-03-03 18:28:06,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:28:06,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446435885] [2025-03-03 18:28:06,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:28:06,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:28:06,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 18:28:06,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 18:28:06,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:28:06,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:28:07,488 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 60 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:28:07,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:28:07,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446435885] [2025-03-03 18:28:07,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446435885] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:28:07,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324286456] [2025-03-03 18:28:07,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:28:07,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:28:07,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:28:07,490 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:28:07,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 18:28:07,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 18:28:07,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 18:28:07,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:28:07,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:28:07,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 1390 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-03 18:28:07,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:28:08,377 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 33 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:28:08,378 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:28:08,779 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 37 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:28:08,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324286456] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:28:08,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 18:28:08,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 13] total 34 [2025-03-03 18:28:08,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909577383] [2025-03-03 18:28:08,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 18:28:08,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-03 18:28:08,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:28:08,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-03 18:28:08,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1014, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 18:28:08,781 INFO L87 Difference]: Start difference. First operand 1197 states and 1685 transitions. Second operand has 34 states, 34 states have (on average 8.882352941176471) internal successors, (302), 34 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:28:10,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:28:10,848 INFO L93 Difference]: Finished difference Result 3593 states and 4996 transitions. [2025-03-03 18:28:10,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-03-03 18:28:10,849 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 8.882352941176471) internal successors, (302), 34 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2025-03-03 18:28:10,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:28:10,854 INFO L225 Difference]: With dead ends: 3593 [2025-03-03 18:28:10,855 INFO L226 Difference]: Without dead ends: 2577 [2025-03-03 18:28:10,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1737 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=733, Invalid=6407, Unknown=0, NotChecked=0, Total=7140 [2025-03-03 18:28:10,857 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 1489 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 3773 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1489 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 3795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 3773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:28:10,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1489 Valid, 1039 Invalid, 3795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 3773 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 18:28:10,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2577 states. [2025-03-03 18:28:10,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2577 to 1537. [2025-03-03 18:28:10,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1537 states, 1536 states have (on average 1.3841145833333333) internal successors, (2126), 1536 states have internal predecessors, (2126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:28:10,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1537 states to 1537 states and 2126 transitions. [2025-03-03 18:28:10,885 INFO L78 Accepts]: Start accepts. Automaton has 1537 states and 2126 transitions. Word has length 145 [2025-03-03 18:28:10,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:28:10,885 INFO L471 AbstractCegarLoop]: Abstraction has 1537 states and 2126 transitions. [2025-03-03 18:28:10,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 8.882352941176471) internal successors, (302), 34 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:28:10,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1537 states and 2126 transitions. [2025-03-03 18:28:10,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-03 18:28:10,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:28:10,888 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 18:28:10,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 18:28:11,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:28:11,088 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:28:11,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:28:11,089 INFO L85 PathProgramCache]: Analyzing trace with hash -466470701, now seen corresponding path program 1 times [2025-03-03 18:28:11,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:28:11,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779286637] [2025-03-03 18:28:11,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:28:11,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:28:11,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 18:28:11,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 18:28:11,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:28:11,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:28:12,086 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 69 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:28:12,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:28:12,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779286637] [2025-03-03 18:28:12,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779286637] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:28:12,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137338152] [2025-03-03 18:28:12,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:28:12,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:28:12,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:28:12,089 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:28:12,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 18:28:12,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 18:28:12,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 18:28:12,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:28:12,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:28:12,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 1390 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-03 18:28:12,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:28:12,847 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 69 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:28:12,847 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:28:13,273 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 63 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:28:13,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137338152] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:28:13,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 18:28:13,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 10] total 20 [2025-03-03 18:28:13,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305441831] [2025-03-03 18:28:13,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 18:28:13,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 18:28:13,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:28:13,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 18:28:13,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2025-03-03 18:28:13,275 INFO L87 Difference]: Start difference. First operand 1537 states and 2126 transitions. Second operand has 20 states, 20 states have (on average 19.15) internal successors, (383), 20 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:28:13,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:28:13,962 INFO L93 Difference]: Finished difference Result 3847 states and 5290 transitions. [2025-03-03 18:28:13,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 18:28:13,963 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 19.15) internal successors, (383), 20 states have internal predecessors, (383), 0 states have call successors, (0), 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 145 [2025-03-03 18:28:13,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:28:13,968 INFO L225 Difference]: With dead ends: 3847 [2025-03-03 18:28:13,968 INFO L226 Difference]: Without dead ends: 2383 [2025-03-03 18:28:13,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=547, Unknown=0, NotChecked=0, Total=702 [2025-03-03 18:28:13,972 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 519 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 1877 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 1881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 18:28:13,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 570 Invalid, 1881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1877 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 18:28:13,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2383 states. [2025-03-03 18:28:14,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2383 to 1645. [2025-03-03 18:28:14,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1645 states, 1644 states have (on average 1.3759124087591241) internal successors, (2262), 1644 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:28:14,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 2262 transitions. [2025-03-03 18:28:14,023 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 2262 transitions. Word has length 145 [2025-03-03 18:28:14,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:28:14,023 INFO L471 AbstractCegarLoop]: Abstraction has 1645 states and 2262 transitions. [2025-03-03 18:28:14,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 19.15) internal successors, (383), 20 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:28:14,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 2262 transitions. [2025-03-03 18:28:14,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-03 18:28:14,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:28:14,026 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:28:14,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 18:28:14,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:28:14,227 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:28:14,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:28:14,227 INFO L85 PathProgramCache]: Analyzing trace with hash 721748813, now seen corresponding path program 1 times [2025-03-03 18:28:14,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:28:14,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445490106] [2025-03-03 18:28:14,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:28:14,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:28:14,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 18:28:14,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 18:28:14,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:28:14,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:28:16,719 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 53 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:28:16,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:28:16,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445490106] [2025-03-03 18:28:16,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445490106] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:28:16,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032929409] [2025-03-03 18:28:16,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:28:16,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:28:16,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:28:16,721 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:28:16,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 18:28:17,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 18:28:17,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 18:28:17,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:28:17,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:28:17,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 1393 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-03 18:28:17,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:28:17,453 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 18:28:17,453 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:28:17,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032929409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:28:17,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 18:28:17,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 19 [2025-03-03 18:28:17,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983873572] [2025-03-03 18:28:17,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:28:17,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:28:17,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:28:17,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:28:17,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2025-03-03 18:28:17,454 INFO L87 Difference]: Start difference. First operand 1645 states and 2262 transitions. Second operand has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:28:17,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:28:17,804 INFO L93 Difference]: Finished difference Result 3619 states and 5002 transitions. [2025-03-03 18:28:17,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:28:17,805 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 0 states have call successors, (0), 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 146 [2025-03-03 18:28:17,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:28:17,809 INFO L225 Difference]: With dead ends: 3619 [2025-03-03 18:28:17,809 INFO L226 Difference]: Without dead ends: 2047 [2025-03-03 18:28:17,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2025-03-03 18:28:17,811 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 381 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:28:17,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 244 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:28:17,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2047 states. [2025-03-03 18:28:17,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2047 to 1683. [2025-03-03 18:28:17,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1683 states, 1682 states have (on average 1.3775267538644471) internal successors, (2317), 1682 states have internal predecessors, (2317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:28:17,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2317 transitions. [2025-03-03 18:28:17,838 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2317 transitions. Word has length 146 [2025-03-03 18:28:17,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:28:17,838 INFO L471 AbstractCegarLoop]: Abstraction has 1683 states and 2317 transitions. [2025-03-03 18:28:17,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:28:17,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2317 transitions. [2025-03-03 18:28:17,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-03 18:28:17,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:28:17,841 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:28:17,851 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-03 18:28:18,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:28:18,042 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:28:18,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:28:18,043 INFO L85 PathProgramCache]: Analyzing trace with hash -325954118, now seen corresponding path program 1 times [2025-03-03 18:28:18,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:28:18,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957779447] [2025-03-03 18:28:18,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:28:18,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:28:18,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 18:28:18,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 18:28:18,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:28:18,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:28:21,410 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 49 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:28:21,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:28:21,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957779447] [2025-03-03 18:28:21,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957779447] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:28:21,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462993737] [2025-03-03 18:28:21,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:28:21,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:28:21,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:28:21,413 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:28:21,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 18:28:21,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 18:28:22,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 18:28:22,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:28:22,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:28:22,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 1395 conjuncts, 126 conjuncts are in the unsatisfiable core [2025-03-03 18:28:22,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:28:23,255 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 18 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:28:23,255 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:28:24,978 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 22 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:28:24,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462993737] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:28:24,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 18:28:24,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 24, 18] total 58 [2025-03-03 18:28:24,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906998596] [2025-03-03 18:28:24,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 18:28:24,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-03-03 18:28:24,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:28:24,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-03-03 18:28:24,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=2975, Unknown=0, NotChecked=0, Total=3306 [2025-03-03 18:28:24,981 INFO L87 Difference]: Start difference. First operand 1683 states and 2317 transitions. Second operand has 58 states, 58 states have (on average 7.241379310344827) internal successors, (420), 58 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:28:31,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:28:31,274 INFO L93 Difference]: Finished difference Result 5039 states and 6932 transitions. [2025-03-03 18:28:31,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2025-03-03 18:28:31,277 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 7.241379310344827) internal successors, (420), 58 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 146 [2025-03-03 18:28:31,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:28:31,284 INFO L225 Difference]: With dead ends: 5039 [2025-03-03 18:28:31,284 INFO L226 Difference]: Without dead ends: 3169 [2025-03-03 18:28:31,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6343 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2176, Invalid=19286, Unknown=0, NotChecked=0, Total=21462 [2025-03-03 18:28:31,293 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 1661 mSDsluCounter, 2616 mSDsCounter, 0 mSdLazyCounter, 11107 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1661 SdHoareTripleChecker+Valid, 2705 SdHoareTripleChecker+Invalid, 11132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 11107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-03-03 18:28:31,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1661 Valid, 2705 Invalid, 11132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 11107 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-03-03 18:28:31,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3169 states. [2025-03-03 18:28:31,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3169 to 1118. [2025-03-03 18:28:31,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1118 states, 1117 states have (on average 1.3813786929274843) internal successors, (1543), 1117 states have internal predecessors, (1543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:28:31,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1543 transitions. [2025-03-03 18:28:31,342 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1543 transitions. Word has length 146 [2025-03-03 18:28:31,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:28:31,342 INFO L471 AbstractCegarLoop]: Abstraction has 1118 states and 1543 transitions. [2025-03-03 18:28:31,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 7.241379310344827) internal successors, (420), 58 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:28:31,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1543 transitions. [2025-03-03 18:28:31,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-03 18:28:31,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:28:31,345 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:28:31,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-03 18:28:31,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-03 18:28:31,545 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:28:31,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:28:31,546 INFO L85 PathProgramCache]: Analyzing trace with hash -712545572, now seen corresponding path program 1 times [2025-03-03 18:28:31,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:28:31,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702171737] [2025-03-03 18:28:31,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:28:31,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:28:31,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 18:28:31,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 18:28:31,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:28:31,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:28:32,243 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 18:28:32,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:28:32,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702171737] [2025-03-03 18:28:32,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702171737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:28:32,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:28:32,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:28:32,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845319594] [2025-03-03 18:28:32,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:28:32,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:28:32,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:28:32,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:28:32,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:28:32,244 INFO L87 Difference]: Start difference. First operand 1118 states and 1543 transitions. Second operand has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 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-03 18:28:32,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:28:32,451 INFO L93 Difference]: Finished difference Result 2203 states and 3057 transitions. [2025-03-03 18:28:32,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:28:32,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 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 147 [2025-03-03 18:28:32,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:28:32,454 INFO L225 Difference]: With dead ends: 2203 [2025-03-03 18:28:32,454 INFO L226 Difference]: Without dead ends: 1177 [2025-03-03 18:28:32,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:28:32,455 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 252 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:28:32,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 158 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:28:32,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2025-03-03 18:28:32,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 856. [2025-03-03 18:28:32,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 855 states have (on average 1.3625730994152048) internal successors, (1165), 855 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:28:32,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1165 transitions. [2025-03-03 18:28:32,465 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1165 transitions. Word has length 147 [2025-03-03 18:28:32,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:28:32,465 INFO L471 AbstractCegarLoop]: Abstraction has 856 states and 1165 transitions. [2025-03-03 18:28:32,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 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-03 18:28:32,465 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1165 transitions. [2025-03-03 18:28:32,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-03 18:28:32,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:28:32,467 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:28:32,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 18:28:32,467 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:28:32,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:28:32,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1004371431, now seen corresponding path program 1 times [2025-03-03 18:28:32,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:28:32,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653332182] [2025-03-03 18:28:32,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:28:32,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:28:32,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 18:28:33,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 18:28:33,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:28:33,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:28:34,506 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-03 18:28:34,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:28:34,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653332182] [2025-03-03 18:28:34,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653332182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:28:34,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:28:34,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:28:34,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850343358] [2025-03-03 18:28:34,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:28:34,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:28:34,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:28:34,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:28:34,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:28:34,508 INFO L87 Difference]: Start difference. First operand 856 states and 1165 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:28:34,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:28:34,779 INFO L93 Difference]: Finished difference Result 1620 states and 2204 transitions. [2025-03-03 18:28:34,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:28:34,780 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 0 states have call successors, (0), 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 147 [2025-03-03 18:28:34,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:28:34,782 INFO L225 Difference]: With dead ends: 1620 [2025-03-03 18:28:34,782 INFO L226 Difference]: Without dead ends: 848 [2025-03-03 18:28:34,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:28:34,784 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 183 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:28:34,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 156 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:28:34,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2025-03-03 18:28:34,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 848. [2025-03-03 18:28:34,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 847 states have (on average 1.3612750885478158) internal successors, (1153), 847 states have internal predecessors, (1153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:28:34,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1153 transitions. [2025-03-03 18:28:34,800 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1153 transitions. Word has length 147 [2025-03-03 18:28:34,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:28:34,800 INFO L471 AbstractCegarLoop]: Abstraction has 848 states and 1153 transitions. [2025-03-03 18:28:34,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:28:34,800 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1153 transitions. [2025-03-03 18:28:34,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-03 18:28:34,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:28:34,802 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-03 18:28:34,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 18:28:34,802 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:28:34,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:28:34,803 INFO L85 PathProgramCache]: Analyzing trace with hash 45640082, now seen corresponding path program 1 times [2025-03-03 18:28:34,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:28:34,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325750949] [2025-03-03 18:28:34,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:28:34,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:28:34,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-03 18:28:35,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-03 18:28:35,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:28:35,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:28:36,108 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 177 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:28:36,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:28:36,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325750949] [2025-03-03 18:28:36,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325750949] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:28:36,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921810738] [2025-03-03 18:28:36,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:28:36,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:28:36,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:28:36,110 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:28:36,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 18:28:36,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-03 18:28:36,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-03 18:28:36,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:28:36,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:28:36,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 1964 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-03 18:28:36,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:28:37,375 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 98 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:28:37,375 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:28:38,030 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 181 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:28:38,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921810738] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:28:38,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 18:28:38,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 10] total 25 [2025-03-03 18:28:38,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663079871] [2025-03-03 18:28:38,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 18:28:38,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 18:28:38,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:28:38,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 18:28:38,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=437, Unknown=0, NotChecked=0, Total=600 [2025-03-03 18:28:38,031 INFO L87 Difference]: Start difference. First operand 848 states and 1153 transitions. Second operand has 25 states, 25 states have (on average 19.32) internal successors, (483), 25 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:28:38,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:28:38,925 INFO L93 Difference]: Finished difference Result 2018 states and 2747 transitions. [2025-03-03 18:28:38,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 18:28:38,926 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 19.32) internal successors, (483), 25 states have internal predecessors, (483), 0 states have call successors, (0), 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 195 [2025-03-03 18:28:38,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:28:38,929 INFO L225 Difference]: With dead ends: 2018 [2025-03-03 18:28:38,929 INFO L226 Difference]: Without dead ends: 1254 [2025-03-03 18:28:38,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 372 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=334, Invalid=1072, Unknown=0, NotChecked=0, Total=1406 [2025-03-03 18:28:38,930 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 717 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 2616 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 2622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 18:28:38,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 864 Invalid, 2622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2616 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 18:28:38,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2025-03-03 18:28:38,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1104. [2025-03-03 18:28:38,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1104 states, 1103 states have (on average 1.344514959202176) internal successors, (1483), 1103 states have internal predecessors, (1483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:28:38,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1483 transitions. [2025-03-03 18:28:38,945 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1483 transitions. Word has length 195 [2025-03-03 18:28:38,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:28:38,945 INFO L471 AbstractCegarLoop]: Abstraction has 1104 states and 1483 transitions. [2025-03-03 18:28:38,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 19.32) internal successors, (483), 25 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:28:38,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1483 transitions. [2025-03-03 18:28:38,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-03 18:28:38,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:28:38,947 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:28:38,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-03 18:28:39,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-03 18:28:39,148 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:28:39,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:28:39,149 INFO L85 PathProgramCache]: Analyzing trace with hash 227409485, now seen corresponding path program 2 times [2025-03-03 18:28:39,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:28:39,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661748389] [2025-03-03 18:28:39,149 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 18:28:39,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:28:39,200 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 196 statements into 2 equivalence classes. [2025-03-03 18:28:39,822 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 196 of 196 statements. [2025-03-03 18:28:39,823 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 18:28:39,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:28:40,568 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 141 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-03 18:28:40,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:28:40,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661748389] [2025-03-03 18:28:40,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661748389] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:28:40,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542709720] [2025-03-03 18:28:40,569 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 18:28:40,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:28:40,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:28:40,571 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:28:40,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 18:28:41,098 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 196 statements into 2 equivalence classes. [2025-03-03 18:28:41,440 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 196 of 196 statements. [2025-03-03 18:28:41,440 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 18:28:41,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:28:41,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 1967 conjuncts, 80 conjuncts are in the unsatisfiable core [2025-03-03 18:28:41,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:28:41,666 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-03 18:28:41,667 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:28:41,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542709720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:28:41,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 18:28:41,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2025-03-03 18:28:41,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870930058] [2025-03-03 18:28:41,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:28:41,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:28:41,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:28:41,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:28:41,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-03 18:28:41,668 INFO L87 Difference]: Start difference. First operand 1104 states and 1483 transitions. Second operand has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 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-03 18:28:41,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:28:41,981 INFO L93 Difference]: Finished difference Result 2172 states and 2921 transitions. [2025-03-03 18:28:41,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:28:41,981 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 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 196 [2025-03-03 18:28:41,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:28:41,984 INFO L225 Difference]: With dead ends: 2172 [2025-03-03 18:28:41,984 INFO L226 Difference]: Without dead ends: 1152 [2025-03-03 18:28:41,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2025-03-03 18:28:41,985 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 320 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:28:41,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 239 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:28:41,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2025-03-03 18:28:41,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1111. [2025-03-03 18:28:41,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1111 states, 1110 states have (on average 1.3441441441441442) internal successors, (1492), 1110 states have internal predecessors, (1492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:28:41,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1492 transitions. [2025-03-03 18:28:41,997 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1492 transitions. Word has length 196 [2025-03-03 18:28:41,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:28:41,997 INFO L471 AbstractCegarLoop]: Abstraction has 1111 states and 1492 transitions. [2025-03-03 18:28:41,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 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-03 18:28:41,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1492 transitions. [2025-03-03 18:28:41,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-03 18:28:41,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:28:41,999 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-03 18:28:42,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-03 18:28:42,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-03 18:28:42,200 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:28:42,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:28:42,200 INFO L85 PathProgramCache]: Analyzing trace with hash -955996845, now seen corresponding path program 1 times [2025-03-03 18:28:42,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:28:42,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328871455] [2025-03-03 18:28:42,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:28:42,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:28:42,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-03 18:28:42,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-03 18:28:42,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:28:42,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:28:43,816 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 140 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-03 18:28:43,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:28:43,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328871455] [2025-03-03 18:28:43,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328871455] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:28:43,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988929661] [2025-03-03 18:28:43,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:28:43,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:28:43,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:28:43,818 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:28:43,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 18:28:44,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-03 18:28:44,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-03 18:28:44,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:28:44,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:28:44,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 1969 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-03 18:28:44,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:28:44,954 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 140 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-03 18:28:44,954 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:28:45,280 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 122 proven. 20 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-03 18:28:45,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988929661] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:28:45,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 18:28:45,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-03-03 18:28:45,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453173604] [2025-03-03 18:28:45,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 18:28:45,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 18:28:45,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:28:45,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 18:28:45,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2025-03-03 18:28:45,282 INFO L87 Difference]: Start difference. First operand 1111 states and 1492 transitions. Second operand has 17 states, 17 states have (on average 20.941176470588236) internal successors, (356), 17 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:28:45,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:28:45,770 INFO L93 Difference]: Finished difference Result 2133 states and 2862 transitions. [2025-03-03 18:28:45,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:28:45,770 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 20.941176470588236) internal successors, (356), 17 states have internal predecessors, (356), 0 states have call successors, (0), 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 196 [2025-03-03 18:28:45,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:28:45,773 INFO L225 Difference]: With dead ends: 2133 [2025-03-03 18:28:45,773 INFO L226 Difference]: Without dead ends: 1113 [2025-03-03 18:28:45,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2025-03-03 18:28:45,774 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 543 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 1356 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 1357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:28:45,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 463 Invalid, 1357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1356 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:28:45,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2025-03-03 18:28:45,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1111. [2025-03-03 18:28:45,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1111 states, 1110 states have (on average 1.3405405405405406) internal successors, (1488), 1110 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:28:45,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1488 transitions. [2025-03-03 18:28:45,785 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1488 transitions. Word has length 196 [2025-03-03 18:28:45,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:28:45,785 INFO L471 AbstractCegarLoop]: Abstraction has 1111 states and 1488 transitions. [2025-03-03 18:28:45,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 20.941176470588236) internal successors, (356), 17 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:28:45,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1488 transitions. [2025-03-03 18:28:45,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-03 18:28:45,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:28:45,787 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-03 18:28:45,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-03 18:28:45,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-03 18:28:45,988 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:28:45,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:28:45,988 INFO L85 PathProgramCache]: Analyzing trace with hash 319660561, now seen corresponding path program 2 times [2025-03-03 18:28:45,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:28:45,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680254161] [2025-03-03 18:28:45,988 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 18:28:45,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:28:46,039 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 196 statements into 2 equivalence classes. [2025-03-03 18:28:47,530 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 196 of 196 statements. [2025-03-03 18:28:47,530 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 18:28:47,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:28:48,795 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 27 proven. 146 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 18:28:48,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:28:48,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680254161] [2025-03-03 18:28:48,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680254161] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:28:48,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027626597] [2025-03-03 18:28:48,795 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 18:28:48,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:28:48,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:28:48,797 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:28:48,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-03 18:28:49,344 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 196 statements into 2 equivalence classes. [2025-03-03 18:28:49,824 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 196 of 196 statements. [2025-03-03 18:28:49,824 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 18:28:49,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:28:49,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 1969 conjuncts, 183 conjuncts are in the unsatisfiable core [2025-03-03 18:28:49,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:28:50,677 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 150 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 18:28:50,677 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:28:51,719 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 143 proven. 13 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 18:28:51,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027626597] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:28:51,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 18:28:51,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16, 17] total 39 [2025-03-03 18:28:51,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118442429] [2025-03-03 18:28:51,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 18:28:51,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-03 18:28:51,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:28:51,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-03 18:28:51,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1272, Unknown=0, NotChecked=0, Total=1482 [2025-03-03 18:28:51,721 INFO L87 Difference]: Start difference. First operand 1111 states and 1488 transitions. Second operand has 39 states, 39 states have (on average 11.871794871794872) internal successors, (463), 39 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)