./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-examples/relax-2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-examples/relax-2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 56e9aa9f750ced23bf75100b2ff89e86c96f8abe4883dfab569153879bc59aef --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 08:58:54,430 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 08:58:54,486 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 08:58:54,490 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 08:58:54,491 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 08:58:54,505 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 08:58:54,506 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 08:58:54,506 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 08:58:54,507 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 08:58:54,507 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 08:58:54,507 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 08:58:54,507 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 08:58:54,507 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 08:58:54,508 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 08:58:54,508 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 08:58:54,508 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 08:58:54,508 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 08:58:54,508 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 08:58:54,508 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 08:58:54,508 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 08:58:54,509 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 08:58:54,509 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 08:58:54,509 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 08:58:54,509 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 08:58:54,509 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 08:58:54,509 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 08:58:54,509 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 08:58:54,509 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 08:58:54,509 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 08:58:54,510 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 08:58:54,510 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 08:58:54,510 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 08:58:54,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 08:58:54,510 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 08:58:54,510 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 08:58:54,510 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 08:58:54,510 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 08:58:54,511 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 08:58:54,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 08:58:54,511 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 08:58:54,511 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 08:58:54,511 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 08:58:54,511 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 08:58:54,511 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 56e9aa9f750ced23bf75100b2ff89e86c96f8abe4883dfab569153879bc59aef [2025-03-03 08:58:54,739 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 08:58:54,747 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 08:58:54,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 08:58:54,751 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 08:58:54,751 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 08:58:54,753 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/relax-2-2.i [2025-03-03 08:58:55,922 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9d7ace6a/b3bd412067e246f99a77dece3d2ee210/FLAGbe052b6a7 [2025-03-03 08:58:56,186 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 08:58:56,187 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/relax-2-2.i [2025-03-03 08:58:56,200 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9d7ace6a/b3bd412067e246f99a77dece3d2ee210/FLAGbe052b6a7 [2025-03-03 08:58:56,217 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9d7ace6a/b3bd412067e246f99a77dece3d2ee210 [2025-03-03 08:58:56,219 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 08:58:56,220 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 08:58:56,222 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 08:58:56,223 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 08:58:56,226 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 08:58:56,227 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,228 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d80931f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56, skipping insertion in model container [2025-03-03 08:58:56,228 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,261 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 08:58:56,380 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/array-examples/relax-2-2.i[982,995] [2025-03-03 08:58:56,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 08:58:56,504 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 08:58:56,512 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/relax-2-2.i[982,995] [2025-03-03 08:58:56,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 08:58:56,572 INFO L204 MainTranslator]: Completed translation [2025-03-03 08:58:56,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56 WrapperNode [2025-03-03 08:58:56,574 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 08:58:56,575 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 08:58:56,575 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 08:58:56,575 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 08:58:56,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,591 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,612 INFO L138 Inliner]: procedures = 120, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 125 [2025-03-03 08:58:56,613 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 08:58:56,613 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 08:58:56,613 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 08:58:56,613 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 08:58:56,620 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,621 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,622 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,641 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 6, 6]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2025-03-03 08:58:56,645 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,646 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,653 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,657 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,658 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,659 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,660 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 08:58:56,664 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 08:58:56,664 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 08:58:56,664 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 08:58:56,665 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 08:58:56,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:58:56,694 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 08:58:56,697 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 08:58:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 08:58:56,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 08:58:56,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 08:58:56,716 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-03 08:58:56,716 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-03 08:58:56,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 08:58:56,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 08:58:56,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 08:58:56,716 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 08:58:56,717 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 08:58:56,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-03 08:58:56,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 08:58:56,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 08:58:56,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 08:58:56,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 08:58:56,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 08:58:56,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 08:58:56,797 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 08:58:56,798 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 08:58:56,987 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-03-03 08:58:56,990 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 08:58:56,996 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 08:58:56,996 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 08:58:56,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:58:56 BoogieIcfgContainer [2025-03-03 08:58:56,997 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 08:58:56,999 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 08:58:56,999 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 08:58:57,002 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 08:58:57,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:58:56" (1/3) ... [2025-03-03 08:58:57,003 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6affc91f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:58:57, skipping insertion in model container [2025-03-03 08:58:57,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (2/3) ... [2025-03-03 08:58:57,004 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6affc91f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:58:57, skipping insertion in model container [2025-03-03 08:58:57,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:58:56" (3/3) ... [2025-03-03 08:58:57,005 INFO L128 eAbstractionObserver]: Analyzing ICFG relax-2-2.i [2025-03-03 08:58:57,016 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 08:58:57,017 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG relax-2-2.i that has 3 procedures, 48 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-03-03 08:58:57,057 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 08:58:57,066 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;@1296a36a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 08:58:57,067 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 08:58:57,070 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 41 states have internal predecessors, (57), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-03 08:58:57,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 08:58:57,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:58:57,075 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:58:57,076 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:58:57,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:58:57,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1204547487, now seen corresponding path program 1 times [2025-03-03 08:58:57,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:58:57,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482836680] [2025-03-03 08:58:57,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:58:57,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:58:57,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 08:58:57,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 08:58:57,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:58:57,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:58:57,211 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 08:58:57,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:58:57,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482836680] [2025-03-03 08:58:57,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482836680] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 08:58:57,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382342107] [2025-03-03 08:58:57,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:58:57,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:58:57,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:58:57,216 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 08:58:57,218 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 08:58:57,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 08:58:57,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 08:58:57,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:58:57,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:58:57,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 08:58:57,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 08:58:57,296 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 08:58:57,296 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 08:58:57,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382342107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 08:58:57,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 08:58:57,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 08:58:57,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629385633] [2025-03-03 08:58:57,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 08:58:57,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 08:58:57,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:58:57,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 08:58:57,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 08:58:57,315 INFO L87 Difference]: Start difference. First operand has 48 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 41 states have internal predecessors, (57), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 08:58:57,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:58:57,328 INFO L93 Difference]: Finished difference Result 93 states and 145 transitions. [2025-03-03 08:58:57,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 08:58:57,330 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2025-03-03 08:58:57,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:58:57,334 INFO L225 Difference]: With dead ends: 93 [2025-03-03 08:58:57,334 INFO L226 Difference]: Without dead ends: 43 [2025-03-03 08:58:57,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 08:58:57,338 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 08:58:57,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 08:58:57,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-03 08:58:57,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-03 08:58:57,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 37 states have internal predecessors, (49), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 08:58:57,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 62 transitions. [2025-03-03 08:58:57,368 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 62 transitions. Word has length 22 [2025-03-03 08:58:57,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:58:57,369 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 62 transitions. [2025-03-03 08:58:57,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 08:58:57,369 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 62 transitions. [2025-03-03 08:58:57,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 08:58:57,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:58:57,371 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:58:57,377 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 08:58:57,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 08:58:57,575 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:58:57,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:58:57,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1799944449, now seen corresponding path program 1 times [2025-03-03 08:58:57,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:58:57,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824605538] [2025-03-03 08:58:57,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:58:57,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:58:57,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 08:58:57,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 08:58:57,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:58:57,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:58:57,769 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 08:58:57,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:58:57,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824605538] [2025-03-03 08:58:57,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824605538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 08:58:57,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 08:58:57,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 08:58:57,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870352089] [2025-03-03 08:58:57,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 08:58:57,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 08:58:57,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:58:57,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 08:58:57,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 08:58:57,772 INFO L87 Difference]: Start difference. First operand 43 states and 62 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:58:57,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:58:57,795 INFO L93 Difference]: Finished difference Result 67 states and 93 transitions. [2025-03-03 08:58:57,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 08:58:57,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-03-03 08:58:57,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:58:57,800 INFO L225 Difference]: With dead ends: 67 [2025-03-03 08:58:57,800 INFO L226 Difference]: Without dead ends: 45 [2025-03-03 08:58:57,800 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 08:58:57,801 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 08:58:57,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 173 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 08:58:57,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-03 08:58:57,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-03 08:58:57,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 35 states have (on average 1.457142857142857) internal successors, (51), 39 states have internal predecessors, (51), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 08:58:57,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 64 transitions. [2025-03-03 08:58:57,807 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 64 transitions. Word has length 22 [2025-03-03 08:58:57,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:58:57,810 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 64 transitions. [2025-03-03 08:58:57,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:58:57,810 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 64 transitions. [2025-03-03 08:58:57,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 08:58:57,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:58:57,811 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:58:57,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 08:58:57,812 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:58:57,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:58:57,812 INFO L85 PathProgramCache]: Analyzing trace with hash 695209794, now seen corresponding path program 1 times [2025-03-03 08:58:57,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:58:57,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427373383] [2025-03-03 08:58:57,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:58:57,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:58:57,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 08:58:57,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 08:58:57,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:58:57,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:58:58,028 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 08:58:58,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:58:58,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427373383] [2025-03-03 08:58:58,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427373383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 08:58:58,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 08:58:58,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 08:58:58,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187676759] [2025-03-03 08:58:58,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 08:58:58,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 08:58:58,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:58:58,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 08:58:58,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 08:58:58,031 INFO L87 Difference]: Start difference. First operand 45 states and 64 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:58:58,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:58:58,122 INFO L93 Difference]: Finished difference Result 93 states and 131 transitions. [2025-03-03 08:58:58,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 08:58:58,123 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2025-03-03 08:58:58,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:58:58,123 INFO L225 Difference]: With dead ends: 93 [2025-03-03 08:58:58,124 INFO L226 Difference]: Without dead ends: 60 [2025-03-03 08:58:58,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 08:58:58,125 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 18 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 08:58:58,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 250 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 08:58:58,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-03 08:58:58,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2025-03-03 08:58:58,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 52 states have internal predecessors, (71), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 08:58:58,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 84 transitions. [2025-03-03 08:58:58,136 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 84 transitions. Word has length 24 [2025-03-03 08:58:58,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:58:58,136 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 84 transitions. [2025-03-03 08:58:58,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:58:58,136 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 84 transitions. [2025-03-03 08:58:58,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 08:58:58,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:58:58,137 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:58:58,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 08:58:58,137 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:58:58,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:58:58,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1771403104, now seen corresponding path program 1 times [2025-03-03 08:58:58,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:58:58,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025159876] [2025-03-03 08:58:58,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:58:58,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:58:58,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 08:58:58,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 08:58:58,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:58:58,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:58:58,356 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 08:58:58,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:58:58,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025159876] [2025-03-03 08:58:58,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025159876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 08:58:58,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 08:58:58,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 08:58:58,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951098573] [2025-03-03 08:58:58,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 08:58:58,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 08:58:58,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:58:58,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 08:58:58,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 08:58:58,360 INFO L87 Difference]: Start difference. First operand 58 states and 84 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:58:58,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:58:58,418 INFO L93 Difference]: Finished difference Result 78 states and 109 transitions. [2025-03-03 08:58:58,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 08:58:58,418 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2025-03-03 08:58:58,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:58:58,419 INFO L225 Difference]: With dead ends: 78 [2025-03-03 08:58:58,419 INFO L226 Difference]: Without dead ends: 66 [2025-03-03 08:58:58,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 08:58:58,420 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 8 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 08:58:58,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 194 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 08:58:58,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-03 08:58:58,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2025-03-03 08:58:58,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 55 states have (on average 1.490909090909091) internal successors, (82), 59 states have internal predecessors, (82), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 08:58:58,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 95 transitions. [2025-03-03 08:58:58,430 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 95 transitions. Word has length 25 [2025-03-03 08:58:58,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:58:58,430 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 95 transitions. [2025-03-03 08:58:58,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:58:58,430 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 95 transitions. [2025-03-03 08:58:58,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 08:58:58,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:58:58,430 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:58:58,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 08:58:58,431 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:58:58,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:58:58,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1817014310, now seen corresponding path program 1 times [2025-03-03 08:58:58,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:58:58,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328378909] [2025-03-03 08:58:58,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:58:58,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:58:58,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 08:58:58,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 08:58:58,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:58:58,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:58:58,707 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 08:58:58,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:58:58,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328378909] [2025-03-03 08:58:58,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328378909] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 08:58:58,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544743851] [2025-03-03 08:58:58,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:58:58,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:58:58,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:58:58,710 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 08:58:58,711 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 08:58:58,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 08:58:58,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 08:58:58,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:58:58,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:58:58,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 08:58:58,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 08:58:58,921 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 08:58:58,922 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 08:58:59,145 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 08:58:59,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544743851] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 08:58:59,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 08:58:59,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2025-03-03 08:58:59,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661792216] [2025-03-03 08:58:59,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 08:58:59,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 08:58:59,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:58:59,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 08:58:59,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-03-03 08:58:59,151 INFO L87 Difference]: Start difference. First operand 65 states and 95 transitions. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 14 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:58:59,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:58:59,974 INFO L93 Difference]: Finished difference Result 165 states and 247 transitions. [2025-03-03 08:58:59,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 08:58:59,974 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 14 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2025-03-03 08:58:59,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:58:59,975 INFO L225 Difference]: With dead ends: 165 [2025-03-03 08:58:59,975 INFO L226 Difference]: Without dead ends: 136 [2025-03-03 08:58:59,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2025-03-03 08:58:59,976 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 122 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 08:58:59,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 929 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 08:58:59,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-03 08:58:59,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 92. [2025-03-03 08:58:59,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 80 states have (on average 1.5125) internal successors, (121), 85 states have internal predecessors, (121), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-03 08:58:59,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 136 transitions. [2025-03-03 08:58:59,988 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 136 transitions. Word has length 25 [2025-03-03 08:58:59,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:58:59,988 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 136 transitions. [2025-03-03 08:58:59,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 14 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:58:59,988 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 136 transitions. [2025-03-03 08:58:59,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 08:58:59,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:58:59,989 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:58:59,994 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 08:59:00,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:59:00,193 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:59:00,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:59:00,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1190881188, now seen corresponding path program 1 times [2025-03-03 08:59:00,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:59:00,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274012295] [2025-03-03 08:59:00,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:59:00,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:59:00,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 08:59:00,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 08:59:00,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:59:00,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:00,314 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 08:59:00,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:59:00,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274012295] [2025-03-03 08:59:00,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274012295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 08:59:00,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 08:59:00,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 08:59:00,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911565064] [2025-03-03 08:59:00,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 08:59:00,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 08:59:00,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:59:00,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 08:59:00,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 08:59:00,316 INFO L87 Difference]: Start difference. First operand 92 states and 136 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:59:00,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:59:00,351 INFO L93 Difference]: Finished difference Result 108 states and 154 transitions. [2025-03-03 08:59:00,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 08:59:00,352 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-03-03 08:59:00,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:59:00,352 INFO L225 Difference]: With dead ends: 108 [2025-03-03 08:59:00,352 INFO L226 Difference]: Without dead ends: 86 [2025-03-03 08:59:00,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 08:59:00,353 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 9 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 08:59:00,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 163 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 08:59:00,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-03 08:59:00,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2025-03-03 08:59:00,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 70 states have (on average 1.457142857142857) internal successors, (102), 75 states have internal predecessors, (102), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-03 08:59:00,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 117 transitions. [2025-03-03 08:59:00,359 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 117 transitions. Word has length 26 [2025-03-03 08:59:00,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:59:00,360 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 117 transitions. [2025-03-03 08:59:00,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:59:00,360 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 117 transitions. [2025-03-03 08:59:00,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 08:59:00,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:59:00,360 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:59:00,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 08:59:00,361 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:59:00,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:59:00,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1356124997, now seen corresponding path program 1 times [2025-03-03 08:59:00,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:59:00,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468599098] [2025-03-03 08:59:00,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:59:00,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:59:00,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 08:59:00,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 08:59:00,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:59:00,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:00,590 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 08:59:00,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:59:00,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468599098] [2025-03-03 08:59:00,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468599098] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 08:59:00,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006497932] [2025-03-03 08:59:00,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:59:00,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:59:00,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:59:00,592 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 08:59:00,594 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 08:59:00,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 08:59:00,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 08:59:00,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:59:00,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:00,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-03 08:59:00,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 08:59:00,746 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 08:59:00,746 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 08:59:00,946 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 08:59:00,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006497932] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 08:59:00,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 08:59:00,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 10] total 17 [2025-03-03 08:59:00,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887443707] [2025-03-03 08:59:00,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 08:59:00,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 08:59:00,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:59:00,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 08:59:00,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2025-03-03 08:59:00,949 INFO L87 Difference]: Start difference. First operand 82 states and 117 transitions. Second operand has 17 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:59:01,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:59:01,273 INFO L93 Difference]: Finished difference Result 135 states and 193 transitions. [2025-03-03 08:59:01,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 08:59:01,274 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-03-03 08:59:01,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:59:01,274 INFO L225 Difference]: With dead ends: 135 [2025-03-03 08:59:01,276 INFO L226 Difference]: Without dead ends: 111 [2025-03-03 08:59:01,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2025-03-03 08:59:01,277 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 57 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 08:59:01,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 644 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 08:59:01,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-03 08:59:01,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 79. [2025-03-03 08:59:01,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 67 states have (on average 1.4029850746268657) internal successors, (94), 72 states have internal predecessors, (94), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-03 08:59:01,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 109 transitions. [2025-03-03 08:59:01,290 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 109 transitions. Word has length 26 [2025-03-03 08:59:01,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:59:01,290 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 109 transitions. [2025-03-03 08:59:01,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:59:01,290 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 109 transitions. [2025-03-03 08:59:01,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 08:59:01,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:59:01,291 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:59:01,299 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 08:59:01,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:59:01,497 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:59:01,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:59:01,497 INFO L85 PathProgramCache]: Analyzing trace with hash -2061751358, now seen corresponding path program 2 times [2025-03-03 08:59:01,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:59:01,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669520866] [2025-03-03 08:59:01,498 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 08:59:01,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:59:01,504 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-03 08:59:01,513 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 26 statements. [2025-03-03 08:59:01,513 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 08:59:01,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:01,759 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 08:59:01,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:59:01,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669520866] [2025-03-03 08:59:01,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669520866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 08:59:01,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 08:59:01,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 08:59:01,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836450929] [2025-03-03 08:59:01,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 08:59:01,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 08:59:01,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:59:01,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 08:59:01,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 08:59:01,761 INFO L87 Difference]: Start difference. First operand 79 states and 109 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:59:01,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:59:01,910 INFO L93 Difference]: Finished difference Result 100 states and 137 transitions. [2025-03-03 08:59:01,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 08:59:01,911 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-03-03 08:59:01,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:59:01,911 INFO L225 Difference]: With dead ends: 100 [2025-03-03 08:59:01,912 INFO L226 Difference]: Without dead ends: 98 [2025-03-03 08:59:01,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-03 08:59:01,912 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 59 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 08:59:01,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 263 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 08:59:01,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-03 08:59:01,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 71. [2025-03-03 08:59:01,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 60 states have (on average 1.3666666666666667) internal successors, (82), 64 states have internal predecessors, (82), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 08:59:01,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 95 transitions. [2025-03-03 08:59:01,920 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 95 transitions. Word has length 26 [2025-03-03 08:59:01,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:59:01,920 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 95 transitions. [2025-03-03 08:59:01,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:59:01,920 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 95 transitions. [2025-03-03 08:59:01,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-03 08:59:01,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:59:01,920 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:59:01,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 08:59:01,922 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:59:01,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:59:01,923 INFO L85 PathProgramCache]: Analyzing trace with hash -587120961, now seen corresponding path program 1 times [2025-03-03 08:59:01,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:59:01,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483383388] [2025-03-03 08:59:01,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:59:01,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:59:01,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-03 08:59:01,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 08:59:01,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:59:01,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:01,966 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 08:59:01,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:59:01,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483383388] [2025-03-03 08:59:01,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483383388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 08:59:01,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 08:59:01,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 08:59:01,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766590661] [2025-03-03 08:59:01,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 08:59:01,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 08:59:01,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:59:01,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 08:59:01,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 08:59:01,968 INFO L87 Difference]: Start difference. First operand 71 states and 95 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:59:01,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:59:01,983 INFO L93 Difference]: Finished difference Result 88 states and 114 transitions. [2025-03-03 08:59:01,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 08:59:01,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2025-03-03 08:59:01,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:59:01,985 INFO L225 Difference]: With dead ends: 88 [2025-03-03 08:59:01,985 INFO L226 Difference]: Without dead ends: 62 [2025-03-03 08:59:01,985 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 08:59:01,985 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 08:59:01,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 173 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 08:59:01,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-03 08:59:01,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-03 08:59:01,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 55 states have internal predecessors, (69), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 08:59:01,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 82 transitions. [2025-03-03 08:59:01,993 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 82 transitions. Word has length 27 [2025-03-03 08:59:01,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:59:01,993 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 82 transitions. [2025-03-03 08:59:01,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:59:01,994 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 82 transitions. [2025-03-03 08:59:01,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-03 08:59:01,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:59:01,995 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:59:01,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 08:59:01,995 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:59:01,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:59:01,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1338776417, now seen corresponding path program 2 times [2025-03-03 08:59:01,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:59:01,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297714581] [2025-03-03 08:59:01,996 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 08:59:01,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:59:02,005 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-03 08:59:02,017 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 27 statements. [2025-03-03 08:59:02,017 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 08:59:02,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:02,174 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 08:59:02,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:59:02,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297714581] [2025-03-03 08:59:02,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297714581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 08:59:02,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 08:59:02,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 08:59:02,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218688074] [2025-03-03 08:59:02,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 08:59:02,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 08:59:02,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:59:02,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 08:59:02,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 08:59:02,176 INFO L87 Difference]: Start difference. First operand 62 states and 82 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:59:02,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:59:02,244 INFO L93 Difference]: Finished difference Result 80 states and 104 transitions. [2025-03-03 08:59:02,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 08:59:02,244 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2025-03-03 08:59:02,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:59:02,245 INFO L225 Difference]: With dead ends: 80 [2025-03-03 08:59:02,245 INFO L226 Difference]: Without dead ends: 73 [2025-03-03 08:59:02,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 08:59:02,246 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 29 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 08:59:02,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 136 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 08:59:02,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-03 08:59:02,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2025-03-03 08:59:02,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 62 states have internal predecessors, (78), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 08:59:02,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2025-03-03 08:59:02,257 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 27 [2025-03-03 08:59:02,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:59:02,257 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2025-03-03 08:59:02,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:59:02,257 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2025-03-03 08:59:02,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-03 08:59:02,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:59:02,258 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:59:02,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 08:59:02,258 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:59:02,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:59:02,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1337852896, now seen corresponding path program 1 times [2025-03-03 08:59:02,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:59:02,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10473381] [2025-03-03 08:59:02,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:59:02,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:59:02,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-03 08:59:02,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 08:59:02,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:59:02,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:02,336 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 08:59:02,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:59:02,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10473381] [2025-03-03 08:59:02,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10473381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 08:59:02,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 08:59:02,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 08:59:02,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552993456] [2025-03-03 08:59:02,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 08:59:02,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 08:59:02,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:59:02,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 08:59:02,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 08:59:02,338 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:59:02,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:59:02,392 INFO L93 Difference]: Finished difference Result 124 states and 169 transitions. [2025-03-03 08:59:02,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 08:59:02,392 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2025-03-03 08:59:02,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:59:02,393 INFO L225 Difference]: With dead ends: 124 [2025-03-03 08:59:02,394 INFO L226 Difference]: Without dead ends: 97 [2025-03-03 08:59:02,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 08:59:02,395 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 76 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 08:59:02,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 143 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 08:59:02,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-03 08:59:02,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87. [2025-03-03 08:59:02,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 75 states have (on average 1.36) internal successors, (102), 79 states have internal predecessors, (102), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-03 08:59:02,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 117 transitions. [2025-03-03 08:59:02,405 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 117 transitions. Word has length 27 [2025-03-03 08:59:02,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:59:02,406 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 117 transitions. [2025-03-03 08:59:02,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:59:02,406 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 117 transitions. [2025-03-03 08:59:02,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-03 08:59:02,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:59:02,407 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 08:59:02,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 08:59:02,407 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:59:02,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:59:02,408 INFO L85 PathProgramCache]: Analyzing trace with hash 342788508, now seen corresponding path program 1 times [2025-03-03 08:59:02,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:59:02,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137742215] [2025-03-03 08:59:02,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:59:02,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:59:02,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-03 08:59:02,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 08:59:02,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:59:02,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:02,435 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 08:59:02,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:59:02,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137742215] [2025-03-03 08:59:02,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137742215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 08:59:02,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 08:59:02,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 08:59:02,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265276257] [2025-03-03 08:59:02,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 08:59:02,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 08:59:02,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:59:02,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 08:59:02,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 08:59:02,436 INFO L87 Difference]: Start difference. First operand 87 states and 117 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:59:02,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:59:02,473 INFO L93 Difference]: Finished difference Result 118 states and 160 transitions. [2025-03-03 08:59:02,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 08:59:02,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2025-03-03 08:59:02,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:59:02,474 INFO L225 Difference]: With dead ends: 118 [2025-03-03 08:59:02,474 INFO L226 Difference]: Without dead ends: 90 [2025-03-03 08:59:02,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 08:59:02,474 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 4 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 08:59:02,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 113 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 08:59:02,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-03 08:59:02,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-03 08:59:02,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 82 states have internal predecessors, (108), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-03 08:59:02,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 123 transitions. [2025-03-03 08:59:02,482 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 123 transitions. Word has length 28 [2025-03-03 08:59:02,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:59:02,482 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 123 transitions. [2025-03-03 08:59:02,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:59:02,482 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 123 transitions. [2025-03-03 08:59:02,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-03 08:59:02,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:59:02,483 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:59:02,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 08:59:02,483 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:59:02,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:59:02,483 INFO L85 PathProgramCache]: Analyzing trace with hash 163235004, now seen corresponding path program 1 times [2025-03-03 08:59:02,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:59:02,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137134184] [2025-03-03 08:59:02,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:59:02,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:59:02,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-03 08:59:02,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 08:59:02,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:59:02,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:02,625 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 08:59:02,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:59:02,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137134184] [2025-03-03 08:59:02,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137134184] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 08:59:02,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422712216] [2025-03-03 08:59:02,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:59:02,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:59:02,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:59:02,628 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 08:59:02,629 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 08:59:02,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-03 08:59:02,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 08:59:02,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:59:02,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:02,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 08:59:02,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 08:59:02,788 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 08:59:02,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 08:59:02,884 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 08:59:02,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422712216] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 08:59:02,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 08:59:02,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 17 [2025-03-03 08:59:02,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734596498] [2025-03-03 08:59:02,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 08:59:02,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 08:59:02,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:59:02,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 08:59:02,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2025-03-03 08:59:02,885 INFO L87 Difference]: Start difference. First operand 90 states and 123 transitions. Second operand has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:59:03,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:59:03,145 INFO L93 Difference]: Finished difference Result 210 states and 301 transitions. [2025-03-03 08:59:03,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 08:59:03,145 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2025-03-03 08:59:03,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:59:03,147 INFO L225 Difference]: With dead ends: 210 [2025-03-03 08:59:03,148 INFO L226 Difference]: Without dead ends: 188 [2025-03-03 08:59:03,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2025-03-03 08:59:03,148 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 216 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 08:59:03,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 548 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 08:59:03,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-03 08:59:03,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 109. [2025-03-03 08:59:03,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 96 states have (on average 1.3958333333333333) internal successors, (134), 100 states have internal predecessors, (134), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 08:59:03,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 151 transitions. [2025-03-03 08:59:03,163 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 151 transitions. Word has length 28 [2025-03-03 08:59:03,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:59:03,163 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 151 transitions. [2025-03-03 08:59:03,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:59:03,163 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 151 transitions. [2025-03-03 08:59:03,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-03 08:59:03,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:59:03,164 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 08:59:03,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 08:59:03,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:59:03,368 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:59:03,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:59:03,369 INFO L85 PathProgramCache]: Analyzing trace with hash -946286453, now seen corresponding path program 1 times [2025-03-03 08:59:03,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:59:03,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552010771] [2025-03-03 08:59:03,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:59:03,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:59:03,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-03 08:59:03,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 08:59:03,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:59:03,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:03,633 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 08:59:03,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:59:03,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552010771] [2025-03-03 08:59:03,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552010771] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 08:59:03,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587241837] [2025-03-03 08:59:03,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:59:03,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:59:03,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:59:03,636 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 08:59:03,637 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 08:59:03,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-03 08:59:03,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 08:59:03,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:59:03,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:03,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-03 08:59:03,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 08:59:03,912 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 08:59:03,912 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 08:59:03,975 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 08:59:03,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587241837] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 08:59:03,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 08:59:03,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8, 11] total 19 [2025-03-03 08:59:03,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40606033] [2025-03-03 08:59:03,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 08:59:03,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 08:59:03,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:59:03,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 08:59:03,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2025-03-03 08:59:03,976 INFO L87 Difference]: Start difference. First operand 109 states and 151 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:59:04,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:59:04,022 INFO L93 Difference]: Finished difference Result 127 states and 170 transitions. [2025-03-03 08:59:04,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 08:59:04,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2025-03-03 08:59:04,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:59:04,023 INFO L225 Difference]: With dead ends: 127 [2025-03-03 08:59:04,024 INFO L226 Difference]: Without dead ends: 112 [2025-03-03 08:59:04,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2025-03-03 08:59:04,024 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 8 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 08:59:04,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 135 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 08:59:04,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-03 08:59:04,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2025-03-03 08:59:04,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 99 states have internal predecessors, (131), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 08:59:04,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 148 transitions. [2025-03-03 08:59:04,033 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 148 transitions. Word has length 31 [2025-03-03 08:59:04,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:59:04,033 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 148 transitions. [2025-03-03 08:59:04,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:59:04,033 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 148 transitions. [2025-03-03 08:59:04,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-03 08:59:04,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:59:04,034 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 08:59:04,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 08:59:04,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-03 08:59:04,238 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:59:04,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:59:04,238 INFO L85 PathProgramCache]: Analyzing trace with hash -671978301, now seen corresponding path program 1 times [2025-03-03 08:59:04,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:59:04,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879966765] [2025-03-03 08:59:04,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:59:04,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:59:04,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-03 08:59:04,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 08:59:04,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:59:04,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:04,378 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 08:59:04,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:59:04,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879966765] [2025-03-03 08:59:04,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879966765] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 08:59:04,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873278729] [2025-03-03 08:59:04,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:59:04,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:59:04,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:59:04,380 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 08:59:04,382 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 08:59:04,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-03 08:59:04,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 08:59:04,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:59:04,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:04,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-03 08:59:04,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 08:59:04,495 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 08:59:04,495 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 08:59:04,706 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 08:59:04,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873278729] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 08:59:04,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 08:59:04,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 12] total 20 [2025-03-03 08:59:04,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674502312] [2025-03-03 08:59:04,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 08:59:04,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 08:59:04,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:59:04,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 08:59:04,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2025-03-03 08:59:04,708 INFO L87 Difference]: Start difference. First operand 108 states and 148 transitions. Second operand has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:59:05,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:59:05,025 INFO L93 Difference]: Finished difference Result 184 states and 252 transitions. [2025-03-03 08:59:05,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 08:59:05,025 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2025-03-03 08:59:05,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:59:05,026 INFO L225 Difference]: With dead ends: 184 [2025-03-03 08:59:05,026 INFO L226 Difference]: Without dead ends: 138 [2025-03-03 08:59:05,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2025-03-03 08:59:05,027 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 65 mSDsluCounter, 1132 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 08:59:05,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 1220 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 08:59:05,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-03 08:59:05,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 93. [2025-03-03 08:59:05,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 80 states have (on average 1.35) internal successors, (108), 84 states have internal predecessors, (108), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 08:59:05,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 125 transitions. [2025-03-03 08:59:05,036 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 125 transitions. Word has length 33 [2025-03-03 08:59:05,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:59:05,036 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 125 transitions. [2025-03-03 08:59:05,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:59:05,037 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 125 transitions. [2025-03-03 08:59:05,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 08:59:05,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:59:05,037 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 08:59:05,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 08:59:05,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 08:59:05,241 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:59:05,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:59:05,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1528282210, now seen corresponding path program 1 times [2025-03-03 08:59:05,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:59:05,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194532529] [2025-03-03 08:59:05,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:59:05,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:59:05,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 08:59:05,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 08:59:05,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:59:05,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:05,323 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 08:59:05,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:59:05,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194532529] [2025-03-03 08:59:05,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194532529] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 08:59:05,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370326314] [2025-03-03 08:59:05,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:59:05,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:59:05,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:59:05,326 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 08:59:05,327 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 08:59:05,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 08:59:05,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 08:59:05,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:59:05,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:05,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 08:59:05,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 08:59:05,482 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 08:59:05,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 08:59:05,609 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 08:59:05,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370326314] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 08:59:05,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 08:59:05,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 10] total 15 [2025-03-03 08:59:05,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485048589] [2025-03-03 08:59:05,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 08:59:05,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 08:59:05,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:59:05,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 08:59:05,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-03 08:59:05,612 INFO L87 Difference]: Start difference. First operand 93 states and 125 transitions. Second operand has 15 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:59:05,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:59:05,734 INFO L93 Difference]: Finished difference Result 163 states and 227 transitions. [2025-03-03 08:59:05,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 08:59:05,734 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2025-03-03 08:59:05,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:59:05,735 INFO L225 Difference]: With dead ends: 163 [2025-03-03 08:59:05,735 INFO L226 Difference]: Without dead ends: 143 [2025-03-03 08:59:05,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-03 08:59:05,736 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 55 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 08:59:05,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 503 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 08:59:05,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-03 08:59:05,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 92. [2025-03-03 08:59:05,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 79 states have (on average 1.3417721518987342) internal successors, (106), 83 states have internal predecessors, (106), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 08:59:05,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 123 transitions. [2025-03-03 08:59:05,747 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 123 transitions. Word has length 36 [2025-03-03 08:59:05,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:59:05,747 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 123 transitions. [2025-03-03 08:59:05,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:59:05,747 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 123 transitions. [2025-03-03 08:59:05,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 08:59:05,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:59:05,748 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 08:59:05,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 08:59:05,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:59:05,952 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:59:05,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:59:05,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1529205731, now seen corresponding path program 1 times [2025-03-03 08:59:05,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:59:05,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453923763] [2025-03-03 08:59:05,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:59:05,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:59:05,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 08:59:05,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 08:59:05,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:59:05,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:06,152 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 08:59:06,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:59:06,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453923763] [2025-03-03 08:59:06,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453923763] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 08:59:06,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60072209] [2025-03-03 08:59:06,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:59:06,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:59:06,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:59:06,154 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 08:59:06,156 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 08:59:06,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 08:59:06,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 08:59:06,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:59:06,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:06,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-03 08:59:06,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 08:59:06,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 08:59:06,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 08:59:06,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-03-03 08:59:06,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-03 08:59:06,617 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 08:59:06,618 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 08:59:06,971 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 08:59:06,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60072209] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 08:59:06,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 08:59:06,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [8, 14] total 30 [2025-03-03 08:59:06,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852870230] [2025-03-03 08:59:06,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 08:59:06,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 08:59:06,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:59:06,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 08:59:06,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=770, Unknown=0, NotChecked=0, Total=870 [2025-03-03 08:59:06,973 INFO L87 Difference]: Start difference. First operand 92 states and 123 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:59:07,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:59:07,399 INFO L93 Difference]: Finished difference Result 172 states and 241 transitions. [2025-03-03 08:59:07,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 08:59:07,400 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2025-03-03 08:59:07,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:59:07,401 INFO L225 Difference]: With dead ends: 172 [2025-03-03 08:59:07,401 INFO L226 Difference]: Without dead ends: 164 [2025-03-03 08:59:07,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=170, Invalid=1162, Unknown=0, NotChecked=0, Total=1332 [2025-03-03 08:59:07,402 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 66 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 08:59:07,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 529 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 08:59:07,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-03 08:59:07,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 122. [2025-03-03 08:59:07,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 109 states have (on average 1.385321100917431) internal successors, (151), 113 states have internal predecessors, (151), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 08:59:07,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 168 transitions. [2025-03-03 08:59:07,415 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 168 transitions. Word has length 36 [2025-03-03 08:59:07,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:59:07,416 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 168 transitions. [2025-03-03 08:59:07,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:59:07,416 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 168 transitions. [2025-03-03 08:59:07,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 08:59:07,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:59:07,416 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 08:59:07,422 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 08:59:07,617 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,SelfDestructingSolverStorable16 [2025-03-03 08:59:07,617 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:59:07,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:59:07,617 INFO L85 PathProgramCache]: Analyzing trace with hash -213604604, now seen corresponding path program 1 times [2025-03-03 08:59:07,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:59:07,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396166392] [2025-03-03 08:59:07,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:59:07,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:59:07,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 08:59:07,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 08:59:07,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:59:07,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:07,792 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 08:59:07,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:59:07,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396166392] [2025-03-03 08:59:07,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396166392] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 08:59:07,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935855359] [2025-03-03 08:59:07,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:59:07,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:59:07,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:59:07,795 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 08:59:07,796 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 08:59:07,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 08:59:07,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 08:59:07,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:59:07,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:07,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-03 08:59:07,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 08:59:07,998 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 08:59:07,998 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 08:59:08,256 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 08:59:08,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935855359] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 08:59:08,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 08:59:08,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 14] total 24 [2025-03-03 08:59:08,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246332720] [2025-03-03 08:59:08,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 08:59:08,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-03 08:59:08,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:59:08,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-03 08:59:08,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2025-03-03 08:59:08,258 INFO L87 Difference]: Start difference. First operand 122 states and 168 transitions. Second operand has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 23 states have internal predecessors, (61), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:59:08,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:59:08,515 INFO L93 Difference]: Finished difference Result 181 states and 242 transitions. [2025-03-03 08:59:08,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 08:59:08,516 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 23 states have internal predecessors, (61), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2025-03-03 08:59:08,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:59:08,517 INFO L225 Difference]: With dead ends: 181 [2025-03-03 08:59:08,517 INFO L226 Difference]: Without dead ends: 137 [2025-03-03 08:59:08,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=546, Unknown=0, NotChecked=0, Total=650 [2025-03-03 08:59:08,517 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 59 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 08:59:08,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 668 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 08:59:08,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-03 08:59:08,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 123. [2025-03-03 08:59:08,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 110 states have (on average 1.3727272727272728) internal successors, (151), 114 states have internal predecessors, (151), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 08:59:08,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 168 transitions. [2025-03-03 08:59:08,538 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 168 transitions. Word has length 36 [2025-03-03 08:59:08,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:59:08,538 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 168 transitions. [2025-03-03 08:59:08,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 23 states have internal predecessors, (61), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:59:08,538 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 168 transitions. [2025-03-03 08:59:08,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 08:59:08,538 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:59:08,538 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:59:08,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-03 08:59:08,739 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,SelfDestructingSolverStorable17 [2025-03-03 08:59:08,739 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:59:08,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:59:08,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1171859563, now seen corresponding path program 1 times [2025-03-03 08:59:08,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:59:08,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326013743] [2025-03-03 08:59:08,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:59:08,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:59:08,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 08:59:08,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 08:59:08,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:59:08,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:08,878 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 08:59:08,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:59:08,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326013743] [2025-03-03 08:59:08,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326013743] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 08:59:08,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142314966] [2025-03-03 08:59:08,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:59:08,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:59:08,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:59:08,881 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 08:59:08,883 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 08:59:08,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 08:59:08,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 08:59:08,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:59:08,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:08,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 08:59:08,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 08:59:09,003 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 08:59:09,003 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 08:59:09,071 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 08:59:09,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142314966] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 08:59:09,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 08:59:09,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 15 [2025-03-03 08:59:09,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607915381] [2025-03-03 08:59:09,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 08:59:09,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 08:59:09,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:59:09,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 08:59:09,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-03 08:59:09,073 INFO L87 Difference]: Start difference. First operand 123 states and 168 transitions. Second operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:59:09,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:59:09,206 INFO L93 Difference]: Finished difference Result 233 states and 319 transitions. [2025-03-03 08:59:09,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 08:59:09,207 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2025-03-03 08:59:09,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:59:09,208 INFO L225 Difference]: With dead ends: 233 [2025-03-03 08:59:09,208 INFO L226 Difference]: Without dead ends: 141 [2025-03-03 08:59:09,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2025-03-03 08:59:09,209 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 13 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 08:59:09,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 558 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 08:59:09,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-03 08:59:09,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 136. [2025-03-03 08:59:09,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 123 states have (on average 1.3658536585365855) internal successors, (168), 127 states have internal predecessors, (168), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 08:59:09,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 185 transitions. [2025-03-03 08:59:09,227 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 185 transitions. Word has length 37 [2025-03-03 08:59:09,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:59:09,227 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 185 transitions. [2025-03-03 08:59:09,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:59:09,227 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 185 transitions. [2025-03-03 08:59:09,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 08:59:09,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:59:09,228 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:59:09,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-03 08:59:09,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:59:09,433 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:59:09,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:59:09,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1079401634, now seen corresponding path program 1 times [2025-03-03 08:59:09,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:59:09,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726501344] [2025-03-03 08:59:09,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:59:09,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:59:09,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 08:59:09,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 08:59:09,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:59:09,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:09,486 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 08:59:09,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:59:09,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726501344] [2025-03-03 08:59:09,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726501344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 08:59:09,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 08:59:09,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 08:59:09,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117197152] [2025-03-03 08:59:09,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 08:59:09,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 08:59:09,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:59:09,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 08:59:09,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 08:59:09,488 INFO L87 Difference]: Start difference. First operand 136 states and 185 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 08:59:09,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:59:09,521 INFO L93 Difference]: Finished difference Result 156 states and 209 transitions. [2025-03-03 08:59:09,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 08:59:09,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2025-03-03 08:59:09,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:59:09,523 INFO L225 Difference]: With dead ends: 156 [2025-03-03 08:59:09,523 INFO L226 Difference]: Without dead ends: 128 [2025-03-03 08:59:09,523 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 08:59:09,523 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 08:59:09,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 08:59:09,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-03 08:59:09,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2025-03-03 08:59:09,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 116 states have (on average 1.3793103448275863) internal successors, (160), 120 states have internal predecessors, (160), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-03 08:59:09,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 175 transitions. [2025-03-03 08:59:09,541 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 175 transitions. Word has length 38 [2025-03-03 08:59:09,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:59:09,542 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 175 transitions. [2025-03-03 08:59:09,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 08:59:09,542 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 175 transitions. [2025-03-03 08:59:09,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 08:59:09,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:59:09,542 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:59:09,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 08:59:09,542 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:59:09,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:59:09,543 INFO L85 PathProgramCache]: Analyzing trace with hash -912857274, now seen corresponding path program 2 times [2025-03-03 08:59:09,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:59:09,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465886435] [2025-03-03 08:59:09,543 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 08:59:09,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:59:09,548 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-03 08:59:09,562 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 08:59:09,562 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 08:59:09,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:09,936 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 08:59:09,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:59:09,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465886435] [2025-03-03 08:59:09,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465886435] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 08:59:09,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908369979] [2025-03-03 08:59:09,937 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 08:59:09,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:59:09,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:59:09,939 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 08:59:09,940 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 08:59:09,986 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-03 08:59:10,007 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 08:59:10,007 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 08:59:10,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:10,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-03-03 08:59:10,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 08:59:10,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 08:59:10,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-03-03 08:59:10,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-03 08:59:10,217 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 08:59:10,217 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 08:59:10,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 08:59:10,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 38 [2025-03-03 08:59:10,451 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 08:59:10,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908369979] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 08:59:10,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 08:59:10,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 12] total 30 [2025-03-03 08:59:10,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26654782] [2025-03-03 08:59:10,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 08:59:10,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-03 08:59:10,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:59:10,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-03 08:59:10,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=770, Unknown=0, NotChecked=0, Total=870 [2025-03-03 08:59:10,453 INFO L87 Difference]: Start difference. First operand 128 states and 175 transitions. Second operand has 30 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 28 states have internal predecessors, (65), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 08:59:11,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:59:11,254 INFO L93 Difference]: Finished difference Result 203 states and 280 transitions. [2025-03-03 08:59:11,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-03 08:59:11,255 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 28 states have internal predecessors, (65), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2025-03-03 08:59:11,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:59:11,256 INFO L225 Difference]: With dead ends: 203 [2025-03-03 08:59:11,256 INFO L226 Difference]: Without dead ends: 175 [2025-03-03 08:59:11,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=273, Invalid=1889, Unknown=0, NotChecked=0, Total=2162 [2025-03-03 08:59:11,257 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 174 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 08:59:11,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 842 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 08:59:11,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-03 08:59:11,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 137. [2025-03-03 08:59:11,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 125 states have (on average 1.384) internal successors, (173), 129 states have internal predecessors, (173), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-03 08:59:11,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 188 transitions. [2025-03-03 08:59:11,277 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 188 transitions. Word has length 37 [2025-03-03 08:59:11,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:59:11,277 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 188 transitions. [2025-03-03 08:59:11,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 28 states have internal predecessors, (65), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 08:59:11,277 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 188 transitions. [2025-03-03 08:59:11,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 08:59:11,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:59:11,278 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:59:11,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-03 08:59:11,478 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,SelfDestructingSolverStorable20 [2025-03-03 08:59:11,478 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:59:11,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:59:11,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1640223208, now seen corresponding path program 2 times [2025-03-03 08:59:11,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:59:11,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6642235] [2025-03-03 08:59:11,479 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 08:59:11,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:59:11,485 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-03 08:59:11,492 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 37 statements. [2025-03-03 08:59:11,492 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 08:59:11,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:11,574 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 08:59:11,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:59:11,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6642235] [2025-03-03 08:59:11,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6642235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 08:59:11,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 08:59:11,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 08:59:11,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345162158] [2025-03-03 08:59:11,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 08:59:11,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 08:59:11,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:59:11,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 08:59:11,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 08:59:11,575 INFO L87 Difference]: Start difference. First operand 137 states and 188 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:59:11,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:59:11,638 INFO L93 Difference]: Finished difference Result 174 states and 237 transitions. [2025-03-03 08:59:11,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 08:59:11,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2025-03-03 08:59:11,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:59:11,641 INFO L225 Difference]: With dead ends: 174 [2025-03-03 08:59:11,642 INFO L226 Difference]: Without dead ends: 166 [2025-03-03 08:59:11,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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 08:59:11,643 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 12 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 08:59:11,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 133 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 08:59:11,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-03 08:59:11,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 152. [2025-03-03 08:59:11,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 140 states have (on average 1.3642857142857143) internal successors, (191), 144 states have internal predecessors, (191), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-03 08:59:11,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 206 transitions. [2025-03-03 08:59:11,662 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 206 transitions. Word has length 37 [2025-03-03 08:59:11,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:59:11,662 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 206 transitions. [2025-03-03 08:59:11,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:59:11,662 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 206 transitions. [2025-03-03 08:59:11,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 08:59:11,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:59:11,664 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:59:11,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 08:59:11,664 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:59:11,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:59:11,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1628189159, now seen corresponding path program 2 times [2025-03-03 08:59:11,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:59:11,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926706082] [2025-03-03 08:59:11,665 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 08:59:11,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:59:11,670 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-03 08:59:11,696 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 08:59:11,696 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 08:59:11,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:11,815 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 08:59:11,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:59:11,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926706082] [2025-03-03 08:59:11,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926706082] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 08:59:11,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377959394] [2025-03-03 08:59:11,815 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 08:59:11,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:59:11,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:59:11,817 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 08:59:11,819 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 08:59:11,869 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-03 08:59:11,899 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 08:59:11,899 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 08:59:11,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:11,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 08:59:11,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 08:59:11,930 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 08:59:11,931 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 08:59:11,992 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 08:59:11,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377959394] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 08:59:11,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 08:59:11,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2025-03-03 08:59:11,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711133786] [2025-03-03 08:59:11,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 08:59:11,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 08:59:11,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:59:11,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 08:59:11,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-03 08:59:11,993 INFO L87 Difference]: Start difference. First operand 152 states and 206 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:59:12,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:59:12,091 INFO L93 Difference]: Finished difference Result 196 states and 262 transitions. [2025-03-03 08:59:12,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 08:59:12,091 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2025-03-03 08:59:12,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:59:12,092 INFO L225 Difference]: With dead ends: 196 [2025-03-03 08:59:12,092 INFO L226 Difference]: Without dead ends: 135 [2025-03-03 08:59:12,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-03-03 08:59:12,092 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 28 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 08:59:12,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 450 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 08:59:12,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-03 08:59:12,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 120. [2025-03-03 08:59:12,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 108 states have (on average 1.3425925925925926) internal successors, (145), 112 states have internal predecessors, (145), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-03 08:59:12,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 160 transitions. [2025-03-03 08:59:12,108 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 160 transitions. Word has length 38 [2025-03-03 08:59:12,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:59:12,108 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 160 transitions. [2025-03-03 08:59:12,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:59:12,109 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 160 transitions. [2025-03-03 08:59:12,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 08:59:12,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:59:12,109 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:59:12,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-03 08:59:12,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-03 08:59:12,310 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:59:12,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:59:12,310 INFO L85 PathProgramCache]: Analyzing trace with hash 966445989, now seen corresponding path program 1 times [2025-03-03 08:59:12,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:59:12,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762872751] [2025-03-03 08:59:12,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:59:12,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:59:12,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 08:59:12,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 08:59:12,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:59:12,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:12,357 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 08:59:12,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:59:12,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762872751] [2025-03-03 08:59:12,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762872751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 08:59:12,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 08:59:12,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 08:59:12,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043094610] [2025-03-03 08:59:12,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 08:59:12,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 08:59:12,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:59:12,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 08:59:12,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 08:59:12,358 INFO L87 Difference]: Start difference. First operand 120 states and 160 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 08:59:12,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:59:12,390 INFO L93 Difference]: Finished difference Result 145 states and 193 transitions. [2025-03-03 08:59:12,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 08:59:12,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2025-03-03 08:59:12,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:59:12,391 INFO L225 Difference]: With dead ends: 145 [2025-03-03 08:59:12,392 INFO L226 Difference]: Without dead ends: 127 [2025-03-03 08:59:12,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 08:59:12,393 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 3 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 08:59:12,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 107 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 08:59:12,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-03 08:59:12,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 123. [2025-03-03 08:59:12,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 111 states have (on average 1.3423423423423424) internal successors, (149), 115 states have internal predecessors, (149), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-03 08:59:12,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 164 transitions. [2025-03-03 08:59:12,412 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 164 transitions. Word has length 39 [2025-03-03 08:59:12,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:59:12,412 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 164 transitions. [2025-03-03 08:59:12,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 08:59:12,412 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 164 transitions. [2025-03-03 08:59:12,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 08:59:12,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:59:12,414 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:59:12,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 08:59:12,414 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:59:12,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:59:12,414 INFO L85 PathProgramCache]: Analyzing trace with hash 745288651, now seen corresponding path program 3 times [2025-03-03 08:59:12,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:59:12,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610366178] [2025-03-03 08:59:12,415 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 08:59:12,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:59:12,421 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 2 equivalence classes. [2025-03-03 08:59:12,440 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 08:59:12,440 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 08:59:12,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:12,865 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 08:59:12,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:59:12,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610366178] [2025-03-03 08:59:12,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610366178] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 08:59:12,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44109730] [2025-03-03 08:59:12,865 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 08:59:12,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:59:12,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:59:12,867 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 08:59:12,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-03 08:59:12,923 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 2 equivalence classes. [2025-03-03 08:59:12,942 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 08:59:12,942 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 08:59:12,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:12,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 08:59:12,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 08:59:13,112 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 08:59:13,113 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 08:59:13,310 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 08:59:13,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44109730] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 08:59:13,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 08:59:13,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 30 [2025-03-03 08:59:13,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171654815] [2025-03-03 08:59:13,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 08:59:13,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-03 08:59:13,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:59:13,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-03 08:59:13,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=751, Unknown=0, NotChecked=0, Total=870 [2025-03-03 08:59:13,312 INFO L87 Difference]: Start difference. First operand 123 states and 164 transitions. Second operand has 30 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 30 states have internal predecessors, (67), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:59:14,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:59:14,568 INFO L93 Difference]: Finished difference Result 374 states and 520 transitions. [2025-03-03 08:59:14,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-03 08:59:14,569 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 30 states have internal predecessors, (67), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2025-03-03 08:59:14,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:59:14,570 INFO L225 Difference]: With dead ends: 374 [2025-03-03 08:59:14,570 INFO L226 Difference]: Without dead ends: 364 [2025-03-03 08:59:14,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 859 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=624, Invalid=3158, Unknown=0, NotChecked=0, Total=3782 [2025-03-03 08:59:14,571 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 415 mSDsluCounter, 1450 mSDsCounter, 0 mSdLazyCounter, 1306 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 1546 SdHoareTripleChecker+Invalid, 1379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 08:59:14,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 1546 Invalid, 1379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1306 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 08:59:14,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-03-03 08:59:14,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 131. [2025-03-03 08:59:14,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 119 states have (on average 1.3361344537815125) internal successors, (159), 123 states have internal predecessors, (159), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-03 08:59:14,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 174 transitions. [2025-03-03 08:59:14,592 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 174 transitions. Word has length 39 [2025-03-03 08:59:14,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:59:14,592 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 174 transitions. [2025-03-03 08:59:14,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 30 states have internal predecessors, (67), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:59:14,593 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 174 transitions. [2025-03-03 08:59:14,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-03 08:59:14,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:59:14,593 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:59:14,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-03 08:59:14,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-03 08:59:14,794 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:59:14,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:59:14,795 INFO L85 PathProgramCache]: Analyzing trace with hash 620584831, now seen corresponding path program 1 times [2025-03-03 08:59:14,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:59:14,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662482397] [2025-03-03 08:59:14,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:59:14,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:59:14,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-03 08:59:14,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 08:59:14,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:59:14,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:14,889 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 08:59:14,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:59:14,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662482397] [2025-03-03 08:59:14,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662482397] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 08:59:14,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458296219] [2025-03-03 08:59:14,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:59:14,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:59:14,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:59:14,892 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 08:59:14,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-03 08:59:14,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-03 08:59:14,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 08:59:14,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:59:14,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:14,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 08:59:14,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 08:59:15,039 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 08:59:15,039 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 08:59:15,128 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 08:59:15,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458296219] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 08:59:15,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 08:59:15,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 18 [2025-03-03 08:59:15,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950372504] [2025-03-03 08:59:15,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 08:59:15,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 08:59:15,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:59:15,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 08:59:15,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2025-03-03 08:59:15,130 INFO L87 Difference]: Start difference. First operand 131 states and 174 transitions. Second operand has 18 states, 17 states have (on average 3.764705882352941) internal successors, (64), 17 states have internal predecessors, (64), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:59:15,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:59:15,373 INFO L93 Difference]: Finished difference Result 225 states and 302 transitions. [2025-03-03 08:59:15,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 08:59:15,374 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.764705882352941) internal successors, (64), 17 states have internal predecessors, (64), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2025-03-03 08:59:15,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:59:15,375 INFO L225 Difference]: With dead ends: 225 [2025-03-03 08:59:15,375 INFO L226 Difference]: Without dead ends: 195 [2025-03-03 08:59:15,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2025-03-03 08:59:15,375 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 33 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 08:59:15,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 1031 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 08:59:15,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-03 08:59:15,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 141. [2025-03-03 08:59:15,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 129 states have (on average 1.3565891472868217) internal successors, (175), 133 states have internal predecessors, (175), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-03 08:59:15,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 190 transitions. [2025-03-03 08:59:15,400 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 190 transitions. Word has length 40 [2025-03-03 08:59:15,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:59:15,400 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 190 transitions. [2025-03-03 08:59:15,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.764705882352941) internal successors, (64), 17 states have internal predecessors, (64), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:59:15,400 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 190 transitions. [2025-03-03 08:59:15,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-03 08:59:15,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:59:15,401 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] [2025-03-03 08:59:15,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-03 08:59:15,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:59:15,606 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:59:15,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:59:15,606 INFO L85 PathProgramCache]: Analyzing trace with hash 230937372, now seen corresponding path program 1 times [2025-03-03 08:59:15,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:59:15,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811260725] [2025-03-03 08:59:15,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:59:15,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:59:15,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-03 08:59:15,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-03 08:59:15,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:59:15,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:16,186 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 08:59:16,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:59:16,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811260725] [2025-03-03 08:59:16,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811260725] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 08:59:16,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846394846] [2025-03-03 08:59:16,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:59:16,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:59:16,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:59:16,188 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 08:59:16,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-03 08:59:16,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-03 08:59:16,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-03 08:59:16,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:59:16,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:16,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-03-03 08:59:16,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 08:59:16,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 08:59:16,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-03-03 08:59:16,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-03 08:59:16,572 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 08:59:16,572 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 08:59:16,744 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 08:59:16,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 41 [2025-03-03 08:59:16,864 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 08:59:16,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846394846] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 08:59:16,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 08:59:16,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20, 12] total 35 [2025-03-03 08:59:16,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581001129] [2025-03-03 08:59:16,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 08:59:16,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-03 08:59:16,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:59:16,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-03 08:59:16,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1060, Unknown=0, NotChecked=0, Total=1190 [2025-03-03 08:59:16,869 INFO L87 Difference]: Start difference. First operand 141 states and 190 transitions. Second operand has 35 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 34 states have internal predecessors, (67), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 08:59:17,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:59:17,552 INFO L93 Difference]: Finished difference Result 244 states and 325 transitions. [2025-03-03 08:59:17,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 08:59:17,553 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 34 states have internal predecessors, (67), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2025-03-03 08:59:17,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:59:17,553 INFO L225 Difference]: With dead ends: 244 [2025-03-03 08:59:17,553 INFO L226 Difference]: Without dead ends: 171 [2025-03-03 08:59:17,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=270, Invalid=1892, Unknown=0, NotChecked=0, Total=2162 [2025-03-03 08:59:17,554 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 156 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 08:59:17,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 725 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1015 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 08:59:17,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-03 08:59:17,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 153. [2025-03-03 08:59:17,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 141 states have (on average 1.3404255319148937) internal successors, (189), 145 states have internal predecessors, (189), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-03 08:59:17,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 204 transitions. [2025-03-03 08:59:17,577 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 204 transitions. Word has length 42 [2025-03-03 08:59:17,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:59:17,577 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 204 transitions. [2025-03-03 08:59:17,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 34 states have internal predecessors, (67), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 08:59:17,577 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 204 transitions. [2025-03-03 08:59:17,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 08:59:17,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:59:17,578 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:59:17,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-03 08:59:17,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-03 08:59:17,779 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:59:17,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:59:17,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1939978935, now seen corresponding path program 1 times [2025-03-03 08:59:17,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:59:17,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616506889] [2025-03-03 08:59:17,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:59:17,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:59:17,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 08:59:17,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 08:59:17,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:59:17,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:17,903 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 08:59:17,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:59:17,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616506889] [2025-03-03 08:59:17,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616506889] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 08:59:17,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708535036] [2025-03-03 08:59:17,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:59:17,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:59:17,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:59:17,905 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 08:59:17,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-03 08:59:17,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 08:59:17,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 08:59:17,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:59:17,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:17,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-03-03 08:59:17,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 08:59:18,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 08:59:18,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-03 08:59:18,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-03-03 08:59:18,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-03 08:59:18,255 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 08:59:18,255 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 08:59:18,564 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 08:59:18,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708535036] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 08:59:18,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 08:59:18,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 14] total 33 [2025-03-03 08:59:18,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098781090] [2025-03-03 08:59:18,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 08:59:18,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-03 08:59:18,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:59:18,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-03 08:59:18,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=941, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 08:59:18,566 INFO L87 Difference]: Start difference. First operand 153 states and 204 transitions. Second operand has 33 states, 32 states have (on average 2.71875) internal successors, (87), 32 states have internal predecessors, (87), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:59:19,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:59:19,585 INFO L93 Difference]: Finished difference Result 458 states and 636 transitions. [2025-03-03 08:59:19,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-03 08:59:19,586 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.71875) internal successors, (87), 32 states have internal predecessors, (87), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2025-03-03 08:59:19,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:59:19,587 INFO L225 Difference]: With dead ends: 458 [2025-03-03 08:59:19,587 INFO L226 Difference]: Without dead ends: 362 [2025-03-03 08:59:19,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=387, Invalid=2919, Unknown=0, NotChecked=0, Total=3306 [2025-03-03 08:59:19,588 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 417 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 1073 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 08:59:19,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 1172 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1073 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 08:59:19,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-03-03 08:59:19,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 253. [2025-03-03 08:59:19,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 241 states have (on average 1.3568464730290457) internal successors, (327), 245 states have internal predecessors, (327), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-03 08:59:19,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 342 transitions. [2025-03-03 08:59:19,630 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 342 transitions. Word has length 44 [2025-03-03 08:59:19,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:59:19,630 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 342 transitions. [2025-03-03 08:59:19,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.71875) internal successors, (87), 32 states have internal predecessors, (87), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:59:19,630 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 342 transitions. [2025-03-03 08:59:19,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-03 08:59:19,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:59:19,631 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 08:59:19,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-03 08:59:19,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-03 08:59:19,835 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:59:19,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:59:19,835 INFO L85 PathProgramCache]: Analyzing trace with hash 909159258, now seen corresponding path program 1 times [2025-03-03 08:59:19,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:59:19,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158098526] [2025-03-03 08:59:19,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:59:19,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:59:19,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 08:59:19,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 08:59:19,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:59:19,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:19,934 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 08:59:19,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:59:19,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158098526] [2025-03-03 08:59:19,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158098526] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 08:59:19,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738210377] [2025-03-03 08:59:19,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:59:19,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:59:19,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:59:19,936 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 08:59:19,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-03 08:59:19,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 08:59:20,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 08:59:20,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:59:20,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:20,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 08:59:20,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 08:59:20,069 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 08:59:20,069 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 08:59:20,145 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 08:59:20,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738210377] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 08:59:20,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 08:59:20,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-03-03 08:59:20,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093987123] [2025-03-03 08:59:20,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 08:59:20,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 08:59:20,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:59:20,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 08:59:20,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-03-03 08:59:20,147 INFO L87 Difference]: Start difference. First operand 253 states and 342 transitions. Second operand has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-03 08:59:20,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:59:20,317 INFO L93 Difference]: Finished difference Result 298 states and 401 transitions. [2025-03-03 08:59:20,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 08:59:20,318 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2025-03-03 08:59:20,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:59:20,319 INFO L225 Difference]: With dead ends: 298 [2025-03-03 08:59:20,319 INFO L226 Difference]: Without dead ends: 253 [2025-03-03 08:59:20,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2025-03-03 08:59:20,319 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 18 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 08:59:20,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 548 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 08:59:20,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-03-03 08:59:20,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 246. [2025-03-03 08:59:20,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 233 states have (on average 1.351931330472103) internal successors, (315), 237 states have internal predecessors, (315), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 08:59:20,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 332 transitions. [2025-03-03 08:59:20,358 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 332 transitions. Word has length 47 [2025-03-03 08:59:20,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:59:20,358 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 332 transitions. [2025-03-03 08:59:20,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-03 08:59:20,358 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 332 transitions. [2025-03-03 08:59:20,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 08:59:20,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:59:20,360 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-03 08:59:20,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-03 08:59:20,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-03 08:59:20,561 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:59:20,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:59:20,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1698396248, now seen corresponding path program 1 times [2025-03-03 08:59:20,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:59:20,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356733955] [2025-03-03 08:59:20,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:59:20,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:59:20,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 08:59:20,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 08:59:20,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:59:20,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:20,856 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 08:59:20,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:59:20,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356733955] [2025-03-03 08:59:20,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356733955] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 08:59:20,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776886960] [2025-03-03 08:59:20,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:59:20,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:59:20,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:59:20,859 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 08:59:20,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-03 08:59:20,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 08:59:20,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 08:59:20,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:59:20,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:20,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-03 08:59:20,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 08:59:21,050 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 08:59:21,050 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 08:59:21,256 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 08:59:21,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776886960] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 08:59:21,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 08:59:21,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 25 [2025-03-03 08:59:21,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705407009] [2025-03-03 08:59:21,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 08:59:21,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 08:59:21,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:59:21,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 08:59:21,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2025-03-03 08:59:21,258 INFO L87 Difference]: Start difference. First operand 246 states and 332 transitions. Second operand has 25 states, 25 states have (on average 2.52) internal successors, (63), 25 states have internal predecessors, (63), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:59:21,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:59:21,742 INFO L93 Difference]: Finished difference Result 349 states and 472 transitions. [2025-03-03 08:59:21,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 08:59:21,742 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.52) internal successors, (63), 25 states have internal predecessors, (63), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2025-03-03 08:59:21,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:59:21,743 INFO L225 Difference]: With dead ends: 349 [2025-03-03 08:59:21,743 INFO L226 Difference]: Without dead ends: 258 [2025-03-03 08:59:21,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=183, Invalid=939, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 08:59:21,744 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 125 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 08:59:21,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 892 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 08:59:21,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-03-03 08:59:21,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 213. [2025-03-03 08:59:21,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 200 states have (on average 1.335) internal successors, (267), 204 states have internal predecessors, (267), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 08:59:21,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2025-03-03 08:59:21,777 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 45 [2025-03-03 08:59:21,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:59:21,777 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2025-03-03 08:59:21,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.52) internal successors, (63), 25 states have internal predecessors, (63), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:59:21,777 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2025-03-03 08:59:21,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 08:59:21,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:59:21,778 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 08:59:21,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-03 08:59:21,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:59:21,978 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:59:21,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:59:21,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1249061639, now seen corresponding path program 2 times [2025-03-03 08:59:21,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:59:21,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348184113] [2025-03-03 08:59:21,979 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 08:59:21,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:59:21,985 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-03-03 08:59:21,999 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 08:59:21,999 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 08:59:21,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:22,087 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 08:59:22,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:59:22,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348184113] [2025-03-03 08:59:22,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348184113] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 08:59:22,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006913864] [2025-03-03 08:59:22,088 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 08:59:22,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:59:22,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:59:22,090 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 08:59:22,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-03 08:59:22,154 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-03-03 08:59:22,176 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 08:59:22,176 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 08:59:22,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:22,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 08:59:22,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 08:59:22,255 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 08:59:22,255 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 08:59:22,362 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 08:59:22,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006913864] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 08:59:22,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 08:59:22,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-03-03 08:59:22,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552874554] [2025-03-03 08:59:22,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 08:59:22,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 08:59:22,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:59:22,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 08:59:22,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2025-03-03 08:59:22,363 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand has 22 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 21 states have internal predecessors, (73), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:59:22,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:59:22,816 INFO L93 Difference]: Finished difference Result 432 states and 579 transitions. [2025-03-03 08:59:22,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 08:59:22,816 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 21 states have internal predecessors, (73), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2025-03-03 08:59:22,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:59:22,818 INFO L225 Difference]: With dead ends: 432 [2025-03-03 08:59:22,818 INFO L226 Difference]: Without dead ends: 337 [2025-03-03 08:59:22,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=925, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 08:59:22,818 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 48 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 08:59:22,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 972 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 08:59:22,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-03-03 08:59:22,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 290. [2025-03-03 08:59:22,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 277 states have (on average 1.3285198555956679) internal successors, (368), 281 states have internal predecessors, (368), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 08:59:22,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 385 transitions. [2025-03-03 08:59:22,862 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 385 transitions. Word has length 45 [2025-03-03 08:59:22,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:59:22,862 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 385 transitions. [2025-03-03 08:59:22,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 21 states have internal predecessors, (73), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:59:22,862 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 385 transitions. [2025-03-03 08:59:22,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 08:59:22,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:59:22,863 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 08:59:22,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-03 08:59:23,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:59:23,064 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:59:23,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:59:23,064 INFO L85 PathProgramCache]: Analyzing trace with hash 565641452, now seen corresponding path program 1 times [2025-03-03 08:59:23,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:59:23,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119493667] [2025-03-03 08:59:23,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:59:23,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:59:23,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 08:59:23,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 08:59:23,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:59:23,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:23,175 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 08:59:23,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:59:23,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119493667] [2025-03-03 08:59:23,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119493667] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 08:59:23,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135959577] [2025-03-03 08:59:23,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:59:23,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:59:23,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:59:23,177 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 08:59:23,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-03 08:59:23,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 08:59:23,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 08:59:23,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:59:23,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:23,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 08:59:23,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 08:59:23,308 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 08:59:23,308 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 08:59:23,372 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 08:59:23,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135959577] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 08:59:23,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 08:59:23,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 18 [2025-03-03 08:59:23,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021921240] [2025-03-03 08:59:23,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 08:59:23,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 08:59:23,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:59:23,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 08:59:23,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2025-03-03 08:59:23,374 INFO L87 Difference]: Start difference. First operand 290 states and 385 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-03 08:59:23,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:59:23,556 INFO L93 Difference]: Finished difference Result 344 states and 456 transitions. [2025-03-03 08:59:23,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 08:59:23,556 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 48 [2025-03-03 08:59:23,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:59:23,557 INFO L225 Difference]: With dead ends: 344 [2025-03-03 08:59:23,557 INFO L226 Difference]: Without dead ends: 287 [2025-03-03 08:59:23,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2025-03-03 08:59:23,558 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 22 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 08:59:23,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 531 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 08:59:23,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-03-03 08:59:23,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 278. [2025-03-03 08:59:23,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 266 states have (on average 1.3233082706766917) internal successors, (352), 270 states have internal predecessors, (352), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-03 08:59:23,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 367 transitions. [2025-03-03 08:59:23,602 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 367 transitions. Word has length 48 [2025-03-03 08:59:23,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:59:23,603 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 367 transitions. [2025-03-03 08:59:23,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-03 08:59:23,603 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 367 transitions. [2025-03-03 08:59:23,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-03 08:59:23,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:59:23,603 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-03-03 08:59:23,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-03 08:59:23,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-03-03 08:59:23,804 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:59:23,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:59:23,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1939099124, now seen corresponding path program 2 times [2025-03-03 08:59:23,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:59:23,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432610180] [2025-03-03 08:59:23,804 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 08:59:23,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:59:23,810 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-03 08:59:23,822 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-03-03 08:59:23,822 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 08:59:23,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:24,098 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 08:59:24,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:59:24,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432610180] [2025-03-03 08:59:24,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432610180] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 08:59:24,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601382466] [2025-03-03 08:59:24,099 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 08:59:24,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:59:24,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:59:24,101 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 08:59:24,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-03 08:59:24,165 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-03 08:59:24,186 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-03-03 08:59:24,186 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 08:59:24,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:24,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-03 08:59:24,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 08:59:24,379 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 08:59:24,379 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 08:59:24,569 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-03 08:59:24,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601382466] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 08:59:24,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 08:59:24,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 10] total 25 [2025-03-03 08:59:24,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394534036] [2025-03-03 08:59:24,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 08:59:24,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 08:59:24,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:59:24,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 08:59:24,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2025-03-03 08:59:24,570 INFO L87 Difference]: Start difference. First operand 278 states and 367 transitions. Second operand has 25 states, 25 states have (on average 3.2) internal successors, (80), 25 states have internal predecessors, (80), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:59:29,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:59:29,074 INFO L93 Difference]: Finished difference Result 384 states and 512 transitions. [2025-03-03 08:59:29,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-03 08:59:29,075 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.2) internal successors, (80), 25 states have internal predecessors, (80), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2025-03-03 08:59:29,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:59:29,076 INFO L225 Difference]: With dead ends: 384 [2025-03-03 08:59:29,076 INFO L226 Difference]: Without dead ends: 318 [2025-03-03 08:59:29,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=149, Invalid=907, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 08:59:29,077 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 57 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 08:59:29,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 1213 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 08:59:29,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-03-03 08:59:29,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 243. [2025-03-03 08:59:29,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 231 states have (on average 1.316017316017316) internal successors, (304), 235 states have internal predecessors, (304), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-03 08:59:29,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 319 transitions. [2025-03-03 08:59:29,127 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 319 transitions. Word has length 46 [2025-03-03 08:59:29,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:59:29,127 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 319 transitions. [2025-03-03 08:59:29,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.2) internal successors, (80), 25 states have internal predecessors, (80), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:59:29,127 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 319 transitions. [2025-03-03 08:59:29,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-03 08:59:29,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:59:29,128 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 08:59:29,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-03 08:59:29,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-03 08:59:29,328 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:59:29,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:59:29,329 INFO L85 PathProgramCache]: Analyzing trace with hash 145750829, now seen corresponding path program 1 times [2025-03-03 08:59:29,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:59:29,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374490414] [2025-03-03 08:59:29,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:59:29,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:59:29,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-03 08:59:29,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-03 08:59:29,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:59:29,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:29,551 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 08:59:29,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:59:29,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374490414] [2025-03-03 08:59:29,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374490414] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 08:59:29,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090915641] [2025-03-03 08:59:29,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:59:29,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:59:29,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:59:29,553 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 08:59:29,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-03 08:59:29,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-03 08:59:29,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-03 08:59:29,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:59:29,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:29,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-03 08:59:29,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 08:59:29,926 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 08:59:29,926 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 08:59:30,152 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 08:59:30,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090915641] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 08:59:30,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 08:59:30,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 10] total 31 [2025-03-03 08:59:30,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701921323] [2025-03-03 08:59:30,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 08:59:30,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-03 08:59:30,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:59:30,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-03 08:59:30,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2025-03-03 08:59:30,153 INFO L87 Difference]: Start difference. First operand 243 states and 319 transitions. Second operand has 31 states, 31 states have (on average 2.4193548387096775) internal successors, (75), 31 states have internal predecessors, (75), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-03 08:59:30,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:59:30,877 INFO L93 Difference]: Finished difference Result 372 states and 496 transitions. [2025-03-03 08:59:30,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 08:59:30,878 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.4193548387096775) internal successors, (75), 31 states have internal predecessors, (75), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 50 [2025-03-03 08:59:30,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:59:30,879 INFO L225 Difference]: With dead ends: 372 [2025-03-03 08:59:30,879 INFO L226 Difference]: Without dead ends: 316 [2025-03-03 08:59:30,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=273, Invalid=2079, Unknown=0, NotChecked=0, Total=2352 [2025-03-03 08:59:30,880 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 184 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 08:59:30,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 476 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 08:59:30,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-03-03 08:59:30,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 260. [2025-03-03 08:59:30,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 248 states have (on average 1.3064516129032258) internal successors, (324), 252 states have internal predecessors, (324), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-03 08:59:30,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 339 transitions. [2025-03-03 08:59:30,940 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 339 transitions. Word has length 50 [2025-03-03 08:59:30,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:59:30,941 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 339 transitions. [2025-03-03 08:59:30,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.4193548387096775) internal successors, (75), 31 states have internal predecessors, (75), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-03 08:59:30,941 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 339 transitions. [2025-03-03 08:59:30,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 08:59:30,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:59:30,942 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-03-03 08:59:30,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-03 08:59:31,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:59:31,142 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:59:31,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:59:31,142 INFO L85 PathProgramCache]: Analyzing trace with hash -977152833, now seen corresponding path program 2 times [2025-03-03 08:59:31,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:59:31,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559059921] [2025-03-03 08:59:31,143 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 08:59:31,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:59:31,148 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-03 08:59:31,158 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 08:59:31,158 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 08:59:31,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:31,706 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 08:59:31,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:59:31,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559059921] [2025-03-03 08:59:31,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559059921] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 08:59:31,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587968328] [2025-03-03 08:59:31,707 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 08:59:31,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:59:31,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:59:31,709 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 08:59:31,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-03 08:59:31,777 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-03 08:59:31,799 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 08:59:31,799 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 08:59:31,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:31,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-03 08:59:31,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 08:59:31,922 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 08:59:31,922 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 08:59:32,076 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 08:59:32,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587968328] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 08:59:32,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 08:59:32,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 9] total 29 [2025-03-03 08:59:32,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980168564] [2025-03-03 08:59:32,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 08:59:32,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-03 08:59:32,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:59:32,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-03 08:59:32,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=726, Unknown=0, NotChecked=0, Total=812 [2025-03-03 08:59:32,077 INFO L87 Difference]: Start difference. First operand 260 states and 339 transitions. Second operand has 29 states, 29 states have (on average 2.7241379310344827) internal successors, (79), 29 states have internal predecessors, (79), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:59:35,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 08:59:35,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:59:35,520 INFO L93 Difference]: Finished difference Result 349 states and 457 transitions. [2025-03-03 08:59:35,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-03 08:59:35,521 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.7241379310344827) internal successors, (79), 29 states have internal predecessors, (79), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2025-03-03 08:59:35,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:59:35,522 INFO L225 Difference]: With dead ends: 349 [2025-03-03 08:59:35,522 INFO L226 Difference]: Without dead ends: 314 [2025-03-03 08:59:35,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=189, Invalid=1617, Unknown=0, NotChecked=0, Total=1806 [2025-03-03 08:59:35,523 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 160 mSDsluCounter, 1131 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-03 08:59:35,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 1206 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-03 08:59:35,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-03-03 08:59:35,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 238. [2025-03-03 08:59:35,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 226 states have (on average 1.3141592920353982) internal successors, (297), 230 states have internal predecessors, (297), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-03 08:59:35,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 312 transitions. [2025-03-03 08:59:35,575 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 312 transitions. Word has length 48 [2025-03-03 08:59:35,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:59:35,575 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 312 transitions. [2025-03-03 08:59:35,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.7241379310344827) internal successors, (79), 29 states have internal predecessors, (79), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 08:59:35,575 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 312 transitions. [2025-03-03 08:59:35,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-03 08:59:35,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:59:35,576 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2025-03-03 08:59:35,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-03 08:59:35,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:59:35,776 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:59:35,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:59:35,777 INFO L85 PathProgramCache]: Analyzing trace with hash -888847409, now seen corresponding path program 3 times [2025-03-03 08:59:35,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:59:35,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415175242] [2025-03-03 08:59:35,777 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 08:59:35,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:59:35,788 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 4 equivalence classes. [2025-03-03 08:59:35,845 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 50 of 50 statements. [2025-03-03 08:59:35,845 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 08:59:35,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:00:13,746 WARN L286 SmtUtils]: Spent 32.03s on a formula simplification. DAG size of input: 36 DAG size of output: 34 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 09:00:26,369 WARN L286 SmtUtils]: Spent 8.61s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)