./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.factorial4even.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.factorial4even.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a9bfc0bfd402f01a909df8198af653a6c40e8b771ded2d89ed782f9da2aa5bbb --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 17:27:35,449 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:27:35,510 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 17:27:35,515 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:27:35,517 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:27:35,534 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:27:35,534 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:27:35,535 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:27:35,535 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:27:35,535 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:27:35,535 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:27:35,535 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:27:35,535 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:27:35,535 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:27:35,536 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:27:35,536 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:27:35,536 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:27:35,536 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 17:27:35,536 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:27:35,536 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:27:35,536 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:27:35,536 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:27:35,536 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:27:35,536 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:27:35,537 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:27:35,537 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:27:35,537 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:27:35,537 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:27:35,537 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:27:35,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:27:35,537 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:27:35,537 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:27:35,537 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:27:35,537 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:27:35,537 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 17:27:35,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 17:27:35,537 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:27:35,537 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:27:35,537 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:27:35,537 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:27:35,538 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a9bfc0bfd402f01a909df8198af653a6c40e8b771ded2d89ed782f9da2aa5bbb [2025-03-03 17:27:35,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:27:35,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:27:35,765 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:27:35,767 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:27:35,767 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:27:35,768 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.factorial4even.c [2025-03-03 17:27:36,863 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07348b02e/140f7bb3e50a442f87d50df2b209a929/FLAG974bb6155 [2025-03-03 17:27:37,050 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:27:37,051 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.factorial4even.c [2025-03-03 17:27:37,062 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07348b02e/140f7bb3e50a442f87d50df2b209a929/FLAG974bb6155 [2025-03-03 17:27:37,426 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07348b02e/140f7bb3e50a442f87d50df2b209a929 [2025-03-03 17:27:37,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:27:37,429 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:27:37,430 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:27:37,430 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:27:37,434 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:27:37,434 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:27:37" (1/1) ... [2025-03-03 17:27:37,435 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e71dd22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:27:37, skipping insertion in model container [2025-03-03 17:27:37,435 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:27:37" (1/1) ... [2025-03-03 17:27:37,445 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:27:37,538 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.factorial4even.c[1439,1452] [2025-03-03 17:27:37,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:27:37,562 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:27:37,569 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.factorial4even.c[1439,1452] [2025-03-03 17:27:37,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:27:37,593 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:27:37,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:27:37 WrapperNode [2025-03-03 17:27:37,594 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:27:37,595 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:27:37,595 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:27:37,595 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:27:37,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:27:37" (1/1) ... [2025-03-03 17:27:37,606 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:27:37" (1/1) ... [2025-03-03 17:27:37,624 INFO L138 Inliner]: procedures = 17, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 97 [2025-03-03 17:27:37,625 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:27:37,625 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:27:37,626 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:27:37,626 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:27:37,631 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:27:37" (1/1) ... [2025-03-03 17:27:37,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:27:37" (1/1) ... [2025-03-03 17:27:37,633 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:27:37" (1/1) ... [2025-03-03 17:27:37,643 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 17:27:37,643 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:27:37" (1/1) ... [2025-03-03 17:27:37,643 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:27:37" (1/1) ... [2025-03-03 17:27:37,646 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:27:37" (1/1) ... [2025-03-03 17:27:37,647 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:27:37" (1/1) ... [2025-03-03 17:27:37,648 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:27:37" (1/1) ... [2025-03-03 17:27:37,649 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:27:37" (1/1) ... [2025-03-03 17:27:37,650 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:27:37,651 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:27:37,651 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:27:37,651 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:27:37,651 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:27:37" (1/1) ... [2025-03-03 17:27:37,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:27:37,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:27:37,673 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 17:27:37,675 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 17:27:37,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:27:37,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 17:27:37,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:27:37,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:27:37,691 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-03 17:27:37,691 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-03 17:27:37,742 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:27:37,743 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:27:37,939 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2025-03-03 17:27:37,940 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:27:37,958 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:27:37,959 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:27:37,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:27:37 BoogieIcfgContainer [2025-03-03 17:27:37,959 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:27:37,961 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:27:37,962 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:27:37,964 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:27:37,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:27:37" (1/3) ... [2025-03-03 17:27:37,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1baedfd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:27:37, skipping insertion in model container [2025-03-03 17:27:37,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:27:37" (2/3) ... [2025-03-03 17:27:37,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1baedfd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:27:37, skipping insertion in model container [2025-03-03 17:27:37,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:27:37" (3/3) ... [2025-03-03 17:27:37,966 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.factorial4even.c [2025-03-03 17:27:37,976 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:27:37,977 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.factorial4even.c that has 2 procedures, 36 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:27:38,009 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:27:38,019 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;@6a9fa8cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:27:38,019 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:27:38,022 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 32 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 17:27:38,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-03 17:27:38,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:27:38,026 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:27:38,027 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:27:38,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:27:38,030 INFO L85 PathProgramCache]: Analyzing trace with hash 385881273, now seen corresponding path program 1 times [2025-03-03 17:27:38,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:27:38,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957824589] [2025-03-03 17:27:38,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:27:38,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:27:38,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-03 17:27:38,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-03 17:27:38,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:27:38,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:27:38,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:27:38,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:27:38,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957824589] [2025-03-03 17:27:38,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957824589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:27:38,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:27:38,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:27:38,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712070267] [2025-03-03 17:27:38,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:27:38,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:27:38,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:27:38,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:27:38,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:27:38,519 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 32 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:27:38,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:27:38,644 INFO L93 Difference]: Finished difference Result 80 states and 114 transitions. [2025-03-03 17:27:38,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:27:38,647 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-03 17:27:38,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:27:38,655 INFO L225 Difference]: With dead ends: 80 [2025-03-03 17:27:38,655 INFO L226 Difference]: Without dead ends: 54 [2025-03-03 17:27:38,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:27:38,659 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 93 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:27:38,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 158 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:27:38,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-03 17:27:38,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2025-03-03 17:27:38,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 17:27:38,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2025-03-03 17:27:38,685 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 50 transitions. Word has length 11 [2025-03-03 17:27:38,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:27:38,686 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 50 transitions. [2025-03-03 17:27:38,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:27:38,686 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2025-03-03 17:27:38,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-03 17:27:38,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:27:38,688 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:27:38,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 17:27:38,688 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:27:38,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:27:38,689 INFO L85 PathProgramCache]: Analyzing trace with hash -707154950, now seen corresponding path program 1 times [2025-03-03 17:27:38,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:27:38,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593861073] [2025-03-03 17:27:38,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:27:38,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:27:38,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-03 17:27:38,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 17:27:38,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:27:38,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:27:38,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:27:38,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:27:38,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593861073] [2025-03-03 17:27:38,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593861073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:27:38,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:27:38,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:27:38,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754129501] [2025-03-03 17:27:38,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:27:38,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:27:38,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:27:38,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:27:38,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:27:38,838 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 17:27:38,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:27:38,895 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2025-03-03 17:27:38,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:27:38,895 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-03-03 17:27:38,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:27:38,898 INFO L225 Difference]: With dead ends: 52 [2025-03-03 17:27:38,898 INFO L226 Difference]: Without dead ends: 50 [2025-03-03 17:27:38,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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 17:27:38,899 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 9 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 17:27:38,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 179 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 17:27:38,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-03 17:27:38,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2025-03-03 17:27:38,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 39 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-03 17:27:38,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2025-03-03 17:27:38,909 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 21 [2025-03-03 17:27:38,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:27:38,910 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2025-03-03 17:27:38,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 17:27:38,910 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2025-03-03 17:27:38,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 17:27:38,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:27:38,910 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:27:38,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 17:27:38,911 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:27:38,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:27:38,911 INFO L85 PathProgramCache]: Analyzing trace with hash -284036817, now seen corresponding path program 1 times [2025-03-03 17:27:38,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:27:38,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636917661] [2025-03-03 17:27:38,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:27:38,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:27:38,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 17:27:38,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 17:27:38,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:27:38,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:27:38,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:27:38,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:27:38,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636917661] [2025-03-03 17:27:38,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636917661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:27:38,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:27:38,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:27:38,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749486125] [2025-03-03 17:27:38,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:27:38,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:27:38,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:27:38,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:27:38,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:27:38,990 INFO L87 Difference]: Start difference. First operand 45 states and 56 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, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 17:27:39,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:27:39,021 INFO L93 Difference]: Finished difference Result 76 states and 95 transitions. [2025-03-03 17:27:39,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:27:39,022 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, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-03-03 17:27:39,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:27:39,023 INFO L225 Difference]: With dead ends: 76 [2025-03-03 17:27:39,023 INFO L226 Difference]: Without dead ends: 47 [2025-03-03 17:27:39,024 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 17:27:39,024 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 17:27:39,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 17:27:39,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-03 17:27:39,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-03 17:27:39,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 41 states have internal predecessors, (50), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-03 17:27:39,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2025-03-03 17:27:39,030 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 22 [2025-03-03 17:27:39,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:27:39,030 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2025-03-03 17:27:39,030 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, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 17:27:39,030 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2025-03-03 17:27:39,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 17:27:39,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:27:39,030 INFO L218 NwaCegarLoop]: trace histogram [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 17:27:39,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 17:27:39,030 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:27:39,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:27:39,031 INFO L85 PathProgramCache]: Analyzing trace with hash 500520917, now seen corresponding path program 1 times [2025-03-03 17:27:39,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:27:39,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281249938] [2025-03-03 17:27:39,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:27:39,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:27:39,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 17:27:39,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 17:27:39,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:27:39,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:27:39,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:27:39,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:27:39,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281249938] [2025-03-03 17:27:39,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281249938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:27:39,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:27:39,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:27:39,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296126576] [2025-03-03 17:27:39,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:27:39,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:27:39,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:27:39,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:27:39,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:27:39,259 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 17:27:39,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:27:39,354 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2025-03-03 17:27:39,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:27:39,355 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-03-03 17:27:39,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:27:39,355 INFO L225 Difference]: With dead ends: 89 [2025-03-03 17:27:39,356 INFO L226 Difference]: Without dead ends: 58 [2025-03-03 17:27:39,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:27:39,357 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 54 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:27:39,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 130 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:27:39,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-03 17:27:39,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2025-03-03 17:27:39,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 42 states have internal predecessors, (52), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-03 17:27:39,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2025-03-03 17:27:39,366 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 23 [2025-03-03 17:27:39,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:27:39,366 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2025-03-03 17:27:39,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 17:27:39,367 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2025-03-03 17:27:39,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-03 17:27:39,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:27:39,368 INFO L218 NwaCegarLoop]: trace histogram [3, 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 17:27:39,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 17:27:39,368 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:27:39,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:27:39,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1307293478, now seen corresponding path program 1 times [2025-03-03 17:27:39,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:27:39,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437288952] [2025-03-03 17:27:39,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:27:39,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:27:39,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-03 17:27:39,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-03 17:27:39,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:27:39,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:27:39,536 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 17:27:39,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:27:39,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437288952] [2025-03-03 17:27:39,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437288952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:27:39,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:27:39,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:27:39,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207047272] [2025-03-03 17:27:39,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:27:39,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:27:39,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:27:39,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:27:39,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:27:39,538 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 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 17:27:39,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:27:39,608 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2025-03-03 17:27:39,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:27:39,609 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 30 [2025-03-03 17:27:39,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:27:39,609 INFO L225 Difference]: With dead ends: 89 [2025-03-03 17:27:39,609 INFO L226 Difference]: Without dead ends: 58 [2025-03-03 17:27:39,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:27:39,610 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 42 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:27:39,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 60 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:27:39,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-03 17:27:39,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2025-03-03 17:27:39,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 47 states have internal predecessors, (57), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 17:27:39,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2025-03-03 17:27:39,620 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 30 [2025-03-03 17:27:39,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:27:39,620 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2025-03-03 17:27:39,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 17:27:39,621 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2025-03-03 17:27:39,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-03 17:27:39,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:27:39,621 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 17:27:39,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 17:27:39,621 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:27:39,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:27:39,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1264069854, now seen corresponding path program 1 times [2025-03-03 17:27:39,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:27:39,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398003385] [2025-03-03 17:27:39,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:27:39,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:27:39,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-03 17:27:39,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 17:27:39,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:27:39,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:27:39,751 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 17:27:39,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:27:39,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398003385] [2025-03-03 17:27:39,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398003385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:27:39,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:27:39,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:27:39,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130025442] [2025-03-03 17:27:39,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:27:39,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:27:39,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:27:39,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:27:39,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:27:39,753 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 17:27:39,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:27:39,818 INFO L93 Difference]: Finished difference Result 89 states and 109 transitions. [2025-03-03 17:27:39,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:27:39,819 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 17:27:39,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:27:39,819 INFO L225 Difference]: With dead ends: 89 [2025-03-03 17:27:39,819 INFO L226 Difference]: Without dead ends: 58 [2025-03-03 17:27:39,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:27:39,820 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 39 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:27:39,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 60 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:27:39,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-03 17:27:39,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2025-03-03 17:27:39,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 48 states have internal predecessors, (58), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 17:27:39,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2025-03-03 17:27:39,827 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 31 [2025-03-03 17:27:39,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:27:39,828 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2025-03-03 17:27:39,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 17:27:39,828 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2025-03-03 17:27:39,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-03 17:27:39,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:27:39,829 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 17:27:39,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 17:27:39,830 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:27:39,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:27:39,830 INFO L85 PathProgramCache]: Analyzing trace with hash 2117950622, now seen corresponding path program 1 times [2025-03-03 17:27:39,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:27:39,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313136378] [2025-03-03 17:27:39,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:27:39,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:27:39,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-03 17:27:39,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 17:27:39,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:27:39,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:27:40,216 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 17:27:40,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:27:40,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313136378] [2025-03-03 17:27:40,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313136378] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 17:27:40,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497686979] [2025-03-03 17:27:40,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:27:40,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:27:40,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:27:40,218 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 17:27:40,220 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 17:27:40,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-03 17:27:40,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 17:27:40,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:27:40,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:27:40,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-03 17:27:40,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:27:40,646 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 17:27:40,647 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 17:27:41,363 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 17:27:41,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497686979] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 17:27:41,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 17:27:41,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 16] total 34 [2025-03-03 17:27:41,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600530240] [2025-03-03 17:27:41,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 17:27:41,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-03 17:27:41,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:27:41,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-03 17:27:41,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=979, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 17:27:41,367 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand has 34 states, 29 states have (on average 2.206896551724138) internal successors, (64), 33 states have internal predecessors, (64), 8 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-03 17:27:42,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:27:42,089 INFO L93 Difference]: Finished difference Result 138 states and 175 transitions. [2025-03-03 17:27:42,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 17:27:42,090 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 29 states have (on average 2.206896551724138) internal successors, (64), 33 states have internal predecessors, (64), 8 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 32 [2025-03-03 17:27:42,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:27:42,092 INFO L225 Difference]: With dead ends: 138 [2025-03-03 17:27:42,093 INFO L226 Difference]: Without dead ends: 107 [2025-03-03 17:27:42,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=367, Invalid=1795, Unknown=0, NotChecked=0, Total=2162 [2025-03-03 17:27:42,094 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 312 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:27:42,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 377 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:27:42,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-03 17:27:42,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 85. [2025-03-03 17:27:42,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 74 states have internal predecessors, (87), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 17:27:42,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 105 transitions. [2025-03-03 17:27:42,110 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 105 transitions. Word has length 32 [2025-03-03 17:27:42,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:27:42,110 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 105 transitions. [2025-03-03 17:27:42,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 29 states have (on average 2.206896551724138) internal successors, (64), 33 states have internal predecessors, (64), 8 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-03 17:27:42,110 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 105 transitions. [2025-03-03 17:27:42,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 17:27:42,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:27:42,111 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 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] [2025-03-03 17:27:42,117 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 17:27:42,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:27:42,312 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:27:42,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:27:42,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1133834298, now seen corresponding path program 1 times [2025-03-03 17:27:42,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:27:42,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356290134] [2025-03-03 17:27:42,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:27:42,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:27:42,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 17:27:42,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 17:27:42,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:27:42,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:27:42,720 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 17:27:42,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:27:42,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356290134] [2025-03-03 17:27:42,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356290134] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 17:27:42,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798204859] [2025-03-03 17:27:42,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:27:42,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:27:42,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:27:42,723 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 17:27:42,725 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 17:27:42,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 17:27:42,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 17:27:42,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:27:42,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:27:42,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-03-03 17:27:42,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:27:43,061 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 17:27:43,062 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 17:27:43,550 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 17:27:43,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798204859] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 17:27:43,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 17:27:43,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 15] total 32 [2025-03-03 17:27:43,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838154366] [2025-03-03 17:27:43,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 17:27:43,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-03 17:27:43,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:27:43,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-03 17:27:43,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=870, Unknown=0, NotChecked=0, Total=992 [2025-03-03 17:27:43,552 INFO L87 Difference]: Start difference. First operand 85 states and 105 transitions. Second operand has 32 states, 31 states have (on average 2.5806451612903225) internal successors, (80), 32 states have internal predecessors, (80), 10 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2025-03-03 17:27:44,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:27:44,517 INFO L93 Difference]: Finished difference Result 150 states and 185 transitions. [2025-03-03 17:27:44,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-03 17:27:44,518 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.5806451612903225) internal successors, (80), 32 states have internal predecessors, (80), 10 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 44 [2025-03-03 17:27:44,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:27:44,518 INFO L225 Difference]: With dead ends: 150 [2025-03-03 17:27:44,518 INFO L226 Difference]: Without dead ends: 91 [2025-03-03 17:27:44,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=501, Invalid=2579, Unknown=0, NotChecked=0, Total=3080 [2025-03-03 17:27:44,520 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 275 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:27:44,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 183 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:27:44,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-03 17:27:44,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2025-03-03 17:27:44,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 66 states have (on average 1.1818181818181819) internal successors, (78), 67 states have internal predecessors, (78), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 17:27:44,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 94 transitions. [2025-03-03 17:27:44,526 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 94 transitions. Word has length 44 [2025-03-03 17:27:44,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:27:44,526 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 94 transitions. [2025-03-03 17:27:44,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.5806451612903225) internal successors, (80), 32 states have internal predecessors, (80), 10 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2025-03-03 17:27:44,526 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2025-03-03 17:27:44,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 17:27:44,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:27:44,527 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:27:44,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 17:27:44,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-03 17:27:44,731 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:27:44,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:27:44,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1661578174, now seen corresponding path program 1 times [2025-03-03 17:27:44,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:27:44,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336024951] [2025-03-03 17:27:44,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:27:44,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:27:44,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 17:27:44,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 17:27:44,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:27:44,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:27:45,158 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 20 proven. 35 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 17:27:45,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:27:45,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336024951] [2025-03-03 17:27:45,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336024951] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 17:27:45,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794137554] [2025-03-03 17:27:45,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:27:45,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:27:45,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:27:45,160 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 17:27:45,162 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 17:27:45,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 17:27:45,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 17:27:45,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:27:45,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:27:45,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 82 conjuncts are in the unsatisfiable core [2025-03-03 17:27:45,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:27:46,028 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 29 proven. 50 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-03 17:27:46,028 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 17:28:06,435 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 20 proven. 50 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-03 17:28:06,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794137554] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 17:28:06,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 17:28:06,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 21] total 43 [2025-03-03 17:28:06,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921800322] [2025-03-03 17:28:06,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 17:28:06,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-03 17:28:06,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:28:06,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-03 17:28:06,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=1522, Unknown=1, NotChecked=0, Total=1806 [2025-03-03 17:28:06,438 INFO L87 Difference]: Start difference. First operand 79 states and 94 transitions. Second operand has 43 states, 41 states have (on average 2.975609756097561) internal successors, (122), 43 states have internal predecessors, (122), 12 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 10 states have call predecessors, (18), 11 states have call successors, (18) [2025-03-03 17:28:07,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:28:07,334 INFO L93 Difference]: Finished difference Result 187 states and 233 transitions. [2025-03-03 17:28:07,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-03 17:28:07,334 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 41 states have (on average 2.975609756097561) internal successors, (122), 43 states have internal predecessors, (122), 12 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 10 states have call predecessors, (18), 11 states have call successors, (18) Word has length 73 [2025-03-03 17:28:07,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:28:07,336 INFO L225 Difference]: With dead ends: 187 [2025-03-03 17:28:07,336 INFO L226 Difference]: Without dead ends: 134 [2025-03-03 17:28:07,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1032 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=585, Invalid=2836, Unknown=1, NotChecked=0, Total=3422 [2025-03-03 17:28:07,338 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 384 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:28:07,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 274 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:28:07,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-03 17:28:07,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 128. [2025-03-03 17:28:07,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 111 states have internal predecessors, (129), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 17:28:07,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 159 transitions. [2025-03-03 17:28:07,367 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 159 transitions. Word has length 73 [2025-03-03 17:28:07,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:28:07,367 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 159 transitions. [2025-03-03 17:28:07,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 41 states have (on average 2.975609756097561) internal successors, (122), 43 states have internal predecessors, (122), 12 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 10 states have call predecessors, (18), 11 states have call successors, (18) [2025-03-03 17:28:07,367 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 159 transitions. [2025-03-03 17:28:07,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 17:28:07,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:28:07,368 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:28:07,375 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 17:28:07,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:28:07,569 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:28:07,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:28:07,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1614872706, now seen corresponding path program 2 times [2025-03-03 17:28:07,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:28:07,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241106556] [2025-03-03 17:28:07,569 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 17:28:07,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:28:07,577 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 74 statements into 2 equivalence classes. [2025-03-03 17:28:07,616 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 17:28:07,616 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 17:28:07,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:28:08,321 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 17:28:08,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:28:08,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241106556] [2025-03-03 17:28:08,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241106556] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 17:28:08,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465887851] [2025-03-03 17:28:08,321 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 17:28:08,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:28:08,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:28:08,323 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 17:28:08,325 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 17:28:08,374 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 74 statements into 2 equivalence classes. [2025-03-03 17:28:08,438 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 17:28:08,438 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 17:28:08,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:28:08,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 100 conjuncts are in the unsatisfiable core [2025-03-03 17:28:08,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:28:09,254 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 23 proven. 50 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-03 17:28:09,255 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 17:28:15,357 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 29 proven. 50 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-03 17:28:15,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465887851] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 17:28:15,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 17:28:15,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20, 22] total 51 [2025-03-03 17:28:15,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060340778] [2025-03-03 17:28:15,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 17:28:15,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-03 17:28:15,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:28:15,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-03 17:28:15,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=2253, Unknown=0, NotChecked=0, Total=2550 [2025-03-03 17:28:15,359 INFO L87 Difference]: Start difference. First operand 128 states and 159 transitions. Second operand has 51 states, 44 states have (on average 2.8181818181818183) internal successors, (124), 48 states have internal predecessors, (124), 15 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (17), 11 states have call predecessors, (17), 12 states have call successors, (17) [2025-03-03 17:28:16,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:28:16,396 INFO L93 Difference]: Finished difference Result 237 states and 295 transitions. [2025-03-03 17:28:16,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-03 17:28:16,396 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 44 states have (on average 2.8181818181818183) internal successors, (124), 48 states have internal predecessors, (124), 15 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (17), 11 states have call predecessors, (17), 12 states have call successors, (17) Word has length 74 [2025-03-03 17:28:16,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:28:16,397 INFO L225 Difference]: With dead ends: 237 [2025-03-03 17:28:16,397 INFO L226 Difference]: Without dead ends: 135 [2025-03-03 17:28:16,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 115 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1293 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=963, Invalid=4149, Unknown=0, NotChecked=0, Total=5112 [2025-03-03 17:28:16,401 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 464 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:28:16,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 339 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:28:16,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-03 17:28:16,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-03-03 17:28:16,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 113 states have (on average 1.1592920353982301) internal successors, (131), 117 states have internal predecessors, (131), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 12 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 17:28:16,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 163 transitions. [2025-03-03 17:28:16,417 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 163 transitions. Word has length 74 [2025-03-03 17:28:16,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:28:16,417 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 163 transitions. [2025-03-03 17:28:16,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 44 states have (on average 2.8181818181818183) internal successors, (124), 48 states have internal predecessors, (124), 15 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (17), 11 states have call predecessors, (17), 12 states have call successors, (17) [2025-03-03 17:28:16,418 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 163 transitions. [2025-03-03 17:28:16,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 17:28:16,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:28:16,420 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:28:16,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 17:28:16,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:28:16,624 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:28:16,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:28:16,625 INFO L85 PathProgramCache]: Analyzing trace with hash -933674214, now seen corresponding path program 2 times [2025-03-03 17:28:16,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:28:16,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929436042] [2025-03-03 17:28:16,625 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 17:28:16,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:28:16,635 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-03-03 17:28:16,695 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 17:28:16,697 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 17:28:16,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 17:28:16,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1004335823] [2025-03-03 17:28:16,700 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 17:28:16,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:28:16,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:28:16,702 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 17:28:16,703 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 17:28:16,755 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-03-03 17:28:16,854 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 17:28:16,854 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 17:28:16,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:28:16,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 114 conjuncts are in the unsatisfiable core [2025-03-03 17:28:16,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:28:19,028 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 26 proven. 69 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-03 17:28:19,028 INFO L312 TraceCheckSpWp]: Computing backward predicates...