./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-e2fb8be-m [2025-03-08 08:39:13,429 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 08:39:13,487 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 08:39:13,491 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 08:39:13,492 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 08:39:13,515 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 08:39:13,515 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 08:39:13,516 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 08:39:13,516 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 08:39:13,516 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 08:39:13,516 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 08:39:13,517 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 08:39:13,517 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 08:39:13,517 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 08:39:13,518 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 08:39:13,518 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 08:39:13,518 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 08:39:13,518 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 08:39:13,518 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 08:39:13,518 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 08:39:13,518 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 08:39:13,519 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 08:39:13,519 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 08:39:13,519 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 08:39:13,519 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 08:39:13,519 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 08:39:13,519 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 08:39:13,519 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 08:39:13,519 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 08:39:13,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 08:39:13,520 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 08:39:13,520 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 08:39:13,520 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 08:39:13,520 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 08:39:13,520 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 08:39:13,520 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 08:39:13,521 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 08:39:13,521 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 08:39:13,521 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 08:39:13,521 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 08:39:13,521 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-08 08:39:13,766 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 08:39:13,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 08:39:13,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 08:39:13,776 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 08:39:13,776 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 08:39:13,778 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-08 08:39:14,967 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffef83771/7d79b98a68e14174be429645ddac75cd/FLAG2199f9b0f [2025-03-08 08:39:15,163 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 08:39:15,164 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.factorial4even.c [2025-03-08 08:39:15,170 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffef83771/7d79b98a68e14174be429645ddac75cd/FLAG2199f9b0f [2025-03-08 08:39:15,182 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffef83771/7d79b98a68e14174be429645ddac75cd [2025-03-08 08:39:15,184 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 08:39:15,186 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 08:39:15,188 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 08:39:15,189 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 08:39:15,192 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 08:39:15,193 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 08:39:15" (1/1) ... [2025-03-08 08:39:15,195 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19d50e6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:39:15, skipping insertion in model container [2025-03-08 08:39:15,196 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 08:39:15" (1/1) ... [2025-03-08 08:39:15,209 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 08:39:15,311 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-08 08:39:15,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 08:39:15,353 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 08:39:15,360 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-08 08:39:15,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 08:39:15,390 INFO L204 MainTranslator]: Completed translation [2025-03-08 08:39:15,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:39:15 WrapperNode [2025-03-08 08:39:15,390 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 08:39:15,392 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 08:39:15,392 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 08:39:15,392 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 08:39:15,396 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:39:15" (1/1) ... [2025-03-08 08:39:15,406 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:39:15" (1/1) ... [2025-03-08 08:39:15,431 INFO L138 Inliner]: procedures = 17, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 97 [2025-03-08 08:39:15,433 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 08:39:15,434 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 08:39:15,434 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 08:39:15,434 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 08:39:15,440 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:39:15" (1/1) ... [2025-03-08 08:39:15,440 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:39:15" (1/1) ... [2025-03-08 08:39:15,443 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:39:15" (1/1) ... [2025-03-08 08:39:15,463 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 08:39:15,465 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:39:15" (1/1) ... [2025-03-08 08:39:15,465 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:39:15" (1/1) ... [2025-03-08 08:39:15,468 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:39:15" (1/1) ... [2025-03-08 08:39:15,470 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:39:15" (1/1) ... [2025-03-08 08:39:15,474 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:39:15" (1/1) ... [2025-03-08 08:39:15,475 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:39:15" (1/1) ... [2025-03-08 08:39:15,479 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 08:39:15,480 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 08:39:15,481 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 08:39:15,481 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 08:39:15,482 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:39:15" (1/1) ... [2025-03-08 08:39:15,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 08:39:15,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 08:39:15,512 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 08:39:15,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 08:39:15,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 08:39:15,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 08:39:15,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 08:39:15,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 08:39:15,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 08:39:15,533 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 08:39:15,587 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 08:39:15,589 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 08:39:15,791 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2025-03-08 08:39:15,791 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 08:39:15,804 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 08:39:15,805 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 08:39:15,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 08:39:15 BoogieIcfgContainer [2025-03-08 08:39:15,805 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 08:39:15,806 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 08:39:15,806 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 08:39:15,810 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 08:39:15,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 08:39:15" (1/3) ... [2025-03-08 08:39:15,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1182f146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 08:39:15, skipping insertion in model container [2025-03-08 08:39:15,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:39:15" (2/3) ... [2025-03-08 08:39:15,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1182f146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 08:39:15, skipping insertion in model container [2025-03-08 08:39:15,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 08:39:15" (3/3) ... [2025-03-08 08:39:15,811 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.factorial4even.c [2025-03-08 08:39:15,821 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 08:39:15,824 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-08 08:39:15,866 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 08:39:15,875 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;@2fd9106e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 08:39:15,875 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 08:39:15,878 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-08 08:39:15,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 08:39:15,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:39:15,881 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:39:15,882 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:39:15,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:39:15,887 INFO L85 PathProgramCache]: Analyzing trace with hash 385881273, now seen corresponding path program 1 times [2025-03-08 08:39:15,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:39:15,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876423579] [2025-03-08 08:39:15,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:39:15,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:39:15,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 08:39:15,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 08:39:15,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:39:15,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:39:16,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:39:16,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:39:16,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876423579] [2025-03-08 08:39:16,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876423579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:39:16,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:39:16,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 08:39:16,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478824247] [2025-03-08 08:39:16,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:39:16,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 08:39:16,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:39:16,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 08:39:16,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 08:39:16,336 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-08 08:39:16,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:39:16,455 INFO L93 Difference]: Finished difference Result 80 states and 114 transitions. [2025-03-08 08:39:16,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 08:39:16,456 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-08 08:39:16,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:39:16,460 INFO L225 Difference]: With dead ends: 80 [2025-03-08 08:39:16,461 INFO L226 Difference]: Without dead ends: 54 [2025-03-08 08:39:16,462 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-08 08:39:16,464 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-08 08:39:16,465 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-08 08:39:16,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-08 08:39:16,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2025-03-08 08:39:16,492 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-08 08:39:16,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2025-03-08 08:39:16,495 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 50 transitions. Word has length 11 [2025-03-08 08:39:16,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:39:16,495 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 50 transitions. [2025-03-08 08:39:16,496 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-08 08:39:16,496 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2025-03-08 08:39:16,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 08:39:16,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:39:16,496 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-08 08:39:16,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 08:39:16,497 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:39:16,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:39:16,497 INFO L85 PathProgramCache]: Analyzing trace with hash -707154950, now seen corresponding path program 1 times [2025-03-08 08:39:16,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:39:16,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543184916] [2025-03-08 08:39:16,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:39:16,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:39:16,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 08:39:16,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 08:39:16,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:39:16,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:39:16,630 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-08 08:39:16,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:39:16,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543184916] [2025-03-08 08:39:16,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543184916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:39:16,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:39:16,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 08:39:16,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588721844] [2025-03-08 08:39:16,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:39:16,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 08:39:16,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:39:16,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 08:39:16,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:39:16,635 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-08 08:39:16,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:39:16,689 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2025-03-08 08:39:16,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 08:39:16,690 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-08 08:39:16,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:39:16,691 INFO L225 Difference]: With dead ends: 52 [2025-03-08 08:39:16,691 INFO L226 Difference]: Without dead ends: 50 [2025-03-08 08:39:16,692 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-08 08:39:16,692 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-08 08:39:16,692 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-08 08:39:16,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-08 08:39:16,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2025-03-08 08:39:16,697 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-08 08:39:16,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2025-03-08 08:39:16,698 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 21 [2025-03-08 08:39:16,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:39:16,698 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2025-03-08 08:39:16,698 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-08 08:39:16,698 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2025-03-08 08:39:16,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 08:39:16,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:39:16,699 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-08 08:39:16,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 08:39:16,699 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:39:16,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:39:16,699 INFO L85 PathProgramCache]: Analyzing trace with hash -284036817, now seen corresponding path program 1 times [2025-03-08 08:39:16,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:39:16,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746430434] [2025-03-08 08:39:16,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:39:16,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:39:16,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 08:39:16,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 08:39:16,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:39:16,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:39:16,777 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-08 08:39:16,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:39:16,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746430434] [2025-03-08 08:39:16,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746430434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:39:16,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:39:16,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 08:39:16,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722981545] [2025-03-08 08:39:16,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:39:16,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:39:16,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:39:16,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:39:16,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:39:16,779 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-08 08:39:16,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:39:16,809 INFO L93 Difference]: Finished difference Result 76 states and 95 transitions. [2025-03-08 08:39:16,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:39:16,810 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-08 08:39:16,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:39:16,811 INFO L225 Difference]: With dead ends: 76 [2025-03-08 08:39:16,811 INFO L226 Difference]: Without dead ends: 47 [2025-03-08 08:39:16,811 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-08 08:39:16,811 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-08 08:39:16,811 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-08 08:39:16,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-08 08:39:16,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-08 08:39:16,819 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-08 08:39:16,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2025-03-08 08:39:16,820 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 22 [2025-03-08 08:39:16,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:39:16,820 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2025-03-08 08:39:16,820 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-08 08:39:16,820 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2025-03-08 08:39:16,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 08:39:16,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:39:16,821 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-08 08:39:16,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 08:39:16,821 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:39:16,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:39:16,821 INFO L85 PathProgramCache]: Analyzing trace with hash 500520917, now seen corresponding path program 1 times [2025-03-08 08:39:16,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:39:16,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656450103] [2025-03-08 08:39:16,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:39:16,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:39:16,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 08:39:16,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 08:39:16,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:39:16,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:39:17,085 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-08 08:39:17,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:39:17,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656450103] [2025-03-08 08:39:17,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656450103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:39:17,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:39:17,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 08:39:17,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169445315] [2025-03-08 08:39:17,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:39:17,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 08:39:17,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:39:17,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 08:39:17,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:39:17,087 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-08 08:39:17,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:39:17,193 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2025-03-08 08:39:17,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 08:39:17,193 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-08 08:39:17,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:39:17,195 INFO L225 Difference]: With dead ends: 89 [2025-03-08 08:39:17,195 INFO L226 Difference]: Without dead ends: 58 [2025-03-08 08:39:17,196 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-08 08:39:17,197 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 54 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-08 08:39:17,198 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-08 08:39:17,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-08 08:39:17,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2025-03-08 08:39:17,205 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-08 08:39:17,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2025-03-08 08:39:17,207 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 23 [2025-03-08 08:39:17,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:39:17,207 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2025-03-08 08:39:17,207 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-08 08:39:17,208 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2025-03-08 08:39:17,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 08:39:17,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:39:17,209 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-08 08:39:17,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 08:39:17,209 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:39:17,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:39:17,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1307293478, now seen corresponding path program 1 times [2025-03-08 08:39:17,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:39:17,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7007581] [2025-03-08 08:39:17,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:39:17,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:39:17,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 08:39:17,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 08:39:17,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:39:17,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:39:17,429 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-08 08:39:17,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:39:17,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7007581] [2025-03-08 08:39:17,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7007581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:39:17,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:39:17,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:39:17,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051062273] [2025-03-08 08:39:17,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:39:17,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:39:17,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:39:17,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:39:17,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:39:17,431 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-08 08:39:17,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:39:17,509 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2025-03-08 08:39:17,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 08:39:17,509 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-08 08:39:17,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:39:17,510 INFO L225 Difference]: With dead ends: 89 [2025-03-08 08:39:17,510 INFO L226 Difference]: Without dead ends: 58 [2025-03-08 08:39:17,510 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-08 08:39:17,511 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-08 08:39:17,511 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-08 08:39:17,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-08 08:39:17,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2025-03-08 08:39:17,516 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-08 08:39:17,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2025-03-08 08:39:17,517 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 30 [2025-03-08 08:39:17,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:39:17,517 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2025-03-08 08:39:17,517 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-08 08:39:17,517 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2025-03-08 08:39:17,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 08:39:17,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:39:17,518 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-08 08:39:17,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 08:39:17,518 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:39:17,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:39:17,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1264069854, now seen corresponding path program 1 times [2025-03-08 08:39:17,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:39:17,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368552956] [2025-03-08 08:39:17,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:39:17,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:39:17,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 08:39:17,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 08:39:17,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:39:17,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:39:17,676 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-08 08:39:17,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:39:17,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368552956] [2025-03-08 08:39:17,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368552956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:39:17,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:39:17,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:39:17,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390672792] [2025-03-08 08:39:17,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:39:17,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:39:17,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:39:17,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:39:17,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:39:17,678 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-08 08:39:17,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:39:17,757 INFO L93 Difference]: Finished difference Result 89 states and 109 transitions. [2025-03-08 08:39:17,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 08:39:17,757 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-08 08:39:17,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:39:17,758 INFO L225 Difference]: With dead ends: 89 [2025-03-08 08:39:17,758 INFO L226 Difference]: Without dead ends: 58 [2025-03-08 08:39:17,758 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-08 08:39:17,758 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 39 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-08 08:39:17,759 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-08 08:39:17,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-08 08:39:17,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2025-03-08 08:39:17,764 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-08 08:39:17,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2025-03-08 08:39:17,765 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 31 [2025-03-08 08:39:17,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:39:17,765 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2025-03-08 08:39:17,765 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-08 08:39:17,765 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2025-03-08 08:39:17,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-08 08:39:17,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:39:17,766 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-08 08:39:17,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 08:39:17,766 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:39:17,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:39:17,766 INFO L85 PathProgramCache]: Analyzing trace with hash 2117950622, now seen corresponding path program 1 times [2025-03-08 08:39:17,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:39:17,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762240767] [2025-03-08 08:39:17,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:39:17,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:39:17,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 08:39:17,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 08:39:17,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:39:17,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:39:18,176 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-08 08:39:18,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:39:18,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762240767] [2025-03-08 08:39:18,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762240767] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 08:39:18,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577431074] [2025-03-08 08:39:18,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:39:18,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 08:39:18,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 08:39:18,179 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 08:39:18,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 08:39:18,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 08:39:18,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 08:39:18,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:39:18,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:39:18,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-08 08:39:18,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 08:39:18,596 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-08 08:39:18,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 08:39:19,272 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-08 08:39:19,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577431074] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 08:39:19,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 08:39:19,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 16] total 34 [2025-03-08 08:39:19,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489527071] [2025-03-08 08:39:19,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 08:39:19,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-08 08:39:19,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:39:19,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-08 08:39:19,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=979, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 08:39:19,276 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-08 08:39:19,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:39:19,951 INFO L93 Difference]: Finished difference Result 138 states and 175 transitions. [2025-03-08 08:39:19,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 08:39:19,951 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-08 08:39:19,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:39:19,953 INFO L225 Difference]: With dead ends: 138 [2025-03-08 08:39:19,953 INFO L226 Difference]: Without dead ends: 107 [2025-03-08 08:39:19,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=367, Invalid=1795, Unknown=0, NotChecked=0, Total=2162 [2025-03-08 08:39:19,955 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-08 08:39:19,955 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-08 08:39:19,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-08 08:39:19,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 85. [2025-03-08 08:39:19,962 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-08 08:39:19,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 105 transitions. [2025-03-08 08:39:19,963 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 105 transitions. Word has length 32 [2025-03-08 08:39:19,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:39:19,963 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 105 transitions. [2025-03-08 08:39:19,963 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-08 08:39:19,964 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 105 transitions. [2025-03-08 08:39:19,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 08:39:19,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:39:19,964 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-08 08:39:19,971 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-08 08:39:20,169 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-08 08:39:20,169 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:39:20,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:39:20,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1133834298, now seen corresponding path program 1 times [2025-03-08 08:39:20,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:39:20,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220366082] [2025-03-08 08:39:20,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:39:20,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:39:20,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 08:39:20,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 08:39:20,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:39:20,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:39:20,542 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-08 08:39:20,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:39:20,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220366082] [2025-03-08 08:39:20,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220366082] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 08:39:20,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028254465] [2025-03-08 08:39:20,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:39:20,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 08:39:20,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 08:39:20,546 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 08:39:20,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 08:39:20,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 08:39:20,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 08:39:20,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:39:20,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:39:20,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-03-08 08:39:20,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 08:39:20,932 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-08 08:39:20,932 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 08:39:21,457 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-08 08:39:21,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028254465] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 08:39:21,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 08:39:21,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 15] total 32 [2025-03-08 08:39:21,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118508065] [2025-03-08 08:39:21,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 08:39:21,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-08 08:39:21,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:39:21,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-08 08:39:21,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=870, Unknown=0, NotChecked=0, Total=992 [2025-03-08 08:39:21,459 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-08 08:39:22,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:39:22,415 INFO L93 Difference]: Finished difference Result 150 states and 185 transitions. [2025-03-08 08:39:22,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-08 08:39:22,416 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-08 08:39:22,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:39:22,417 INFO L225 Difference]: With dead ends: 150 [2025-03-08 08:39:22,417 INFO L226 Difference]: Without dead ends: 91 [2025-03-08 08:39:22,418 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-08 08:39:22,419 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-08 08:39:22,419 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-08 08:39:22,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-08 08:39:22,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2025-03-08 08:39:22,430 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-08 08:39:22,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 94 transitions. [2025-03-08 08:39:22,431 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 94 transitions. Word has length 44 [2025-03-08 08:39:22,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:39:22,431 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 94 transitions. [2025-03-08 08:39:22,431 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-08 08:39:22,431 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2025-03-08 08:39:22,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 08:39:22,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:39:22,432 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-08 08:39:22,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 08:39:22,633 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-08 08:39:22,633 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:39:22,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:39:22,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1661578174, now seen corresponding path program 1 times [2025-03-08 08:39:22,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:39:22,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921422611] [2025-03-08 08:39:22,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:39:22,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:39:22,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 08:39:22,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 08:39:22,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:39:22,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:39:23,063 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-08 08:39:23,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:39:23,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921422611] [2025-03-08 08:39:23,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921422611] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 08:39:23,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582450932] [2025-03-08 08:39:23,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:39:23,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 08:39:23,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 08:39:23,065 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 08:39:23,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 08:39:23,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 08:39:23,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 08:39:23,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:39:23,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:39:23,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 82 conjuncts are in the unsatisfiable core [2025-03-08 08:39:23,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 08:39:23,987 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-08 08:39:23,987 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 08:39:35,130 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-08 08:39:35,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582450932] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 08:39:35,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 08:39:35,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 20] total 42 [2025-03-08 08:39:35,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265228270] [2025-03-08 08:39:35,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 08:39:35,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-08 08:39:35,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:39:35,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-08 08:39:35,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=1459, Unknown=0, NotChecked=0, Total=1722 [2025-03-08 08:39:35,133 INFO L87 Difference]: Start difference. First operand 79 states and 94 transitions. Second operand has 42 states, 40 states have (on average 3.05) internal successors, (122), 42 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-08 08:39:36,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:39:36,046 INFO L93 Difference]: Finished difference Result 187 states and 233 transitions. [2025-03-08 08:39:36,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 08:39:36,046 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 3.05) internal successors, (122), 42 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-08 08:39:36,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:39:36,047 INFO L225 Difference]: With dead ends: 187 [2025-03-08 08:39:36,047 INFO L226 Difference]: Without dead ends: 134 [2025-03-08 08:39:36,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 995 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=550, Invalid=2756, Unknown=0, NotChecked=0, Total=3306 [2025-03-08 08:39:36,049 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 309 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 08:39:36,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 274 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 08:39:36,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-08 08:39:36,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 128. [2025-03-08 08:39:36,060 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-08 08:39:36,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 159 transitions. [2025-03-08 08:39:36,061 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 159 transitions. Word has length 73 [2025-03-08 08:39:36,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:39:36,061 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 159 transitions. [2025-03-08 08:39:36,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 3.05) internal successors, (122), 42 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-08 08:39:36,061 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 159 transitions. [2025-03-08 08:39:36,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 08:39:36,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:39:36,062 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-08 08:39:36,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 08:39:36,263 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-08 08:39:36,263 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:39:36,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:39:36,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1614872706, now seen corresponding path program 2 times [2025-03-08 08:39:36,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:39:36,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756608341] [2025-03-08 08:39:36,264 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 08:39:36,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:39:36,273 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 74 statements into 2 equivalence classes. [2025-03-08 08:39:36,320 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 08:39:36,320 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 08:39:36,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:39:37,097 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-08 08:39:37,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:39:37,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756608341] [2025-03-08 08:39:37,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756608341] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 08:39:37,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177192345] [2025-03-08 08:39:37,097 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 08:39:37,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 08:39:37,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 08:39:37,099 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 08:39:37,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 08:39:37,145 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 74 statements into 2 equivalence classes. [2025-03-08 08:39:37,207 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 08:39:37,207 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 08:39:37,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:39:37,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 100 conjuncts are in the unsatisfiable core [2025-03-08 08:39:37,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 08:39:38,003 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-08 08:39:38,003 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 08:39:42,231 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-08 08:39:42,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177192345] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 08:39:42,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 08:39:42,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20, 22] total 51 [2025-03-08 08:39:42,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229753934] [2025-03-08 08:39:42,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 08:39:42,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-08 08:39:42,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:39:42,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-08 08:39:42,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=2253, Unknown=0, NotChecked=0, Total=2550 [2025-03-08 08:39:42,233 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-08 08:39:43,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:39:43,161 INFO L93 Difference]: Finished difference Result 237 states and 295 transitions. [2025-03-08 08:39:43,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-08 08:39:43,162 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-08 08:39:43,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:39:43,163 INFO L225 Difference]: With dead ends: 237 [2025-03-08 08:39:43,163 INFO L226 Difference]: Without dead ends: 135 [2025-03-08 08:39:43,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 115 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1293 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=963, Invalid=4149, Unknown=0, NotChecked=0, Total=5112 [2025-03-08 08:39:43,165 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 513 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 08:39:43,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 220 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 08:39:43,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-08 08:39:43,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-03-08 08:39:43,182 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-08 08:39:43,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 163 transitions. [2025-03-08 08:39:43,182 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 163 transitions. Word has length 74 [2025-03-08 08:39:43,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:39:43,183 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 163 transitions. [2025-03-08 08:39:43,183 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-08 08:39:43,183 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 163 transitions. [2025-03-08 08:39:43,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 08:39:43,184 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:39:43,184 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-08 08:39:43,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 08:39:43,384 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-08 08:39:43,385 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:39:43,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:39:43,385 INFO L85 PathProgramCache]: Analyzing trace with hash -933674214, now seen corresponding path program 2 times [2025-03-08 08:39:43,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:39:43,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429320156] [2025-03-08 08:39:43,385 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 08:39:43,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:39:43,394 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-03-08 08:39:43,460 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 08:39:43,460 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 08:39:43,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 08:39:43,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [856383049] [2025-03-08 08:39:43,464 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 08:39:43,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 08:39:43,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 08:39:43,466 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 08:39:43,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 08:39:43,532 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-03-08 08:39:43,636 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 08:39:43,636 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 08:39:43,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:39:43,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 114 conjuncts are in the unsatisfiable core [2025-03-08 08:39:43,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 08:39:45,861 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-08 08:39:45,862 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 08:40:03,706 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 08:40:24,390 WARN L873 $PredicateComparison]: unable to prove that (or (let ((.cse6 (mod |c_ULTIMATE.start_main_~var_16~0#1| 256)) (.cse1 (mod |c_ULTIMATE.start_main_~var_7~0#1| 256)) (.cse3 (mod (* (mod |c_ULTIMATE.start_main_~state_3~0#1| 256) (mod |c_ULTIMATE.start_main_~state_4~0#1| 256)) 256)) (.cse4 (mod |c_ULTIMATE.start_main_~mask_SORT_12~0#1| 256)) (.cse5 (mod |c_ULTIMATE.start_main_~var_2~0#1| 256))) (and (forall ((v_z_69 Int) (v_y_68 Int) (v_y_69 Int)) (let ((.cse7 (* v_y_69 256))) (let ((.cse0 (+ v_z_69 .cse7)) (.cse2 (+ v_z_69 .cse7 (* v_y_68 256)))) (or (< .cse0 0) (< .cse1 .cse2) (< 255 .cse0) (not (= (mod (* .cse3 v_z_69) 256) .cse4)) (< .cse2 0) (< 255 v_z_69) (< (+ v_z_69 .cse5) (+ 257 .cse6)))))) (forall ((v_z_69 Int) (v_y_68 Int) (v_y_69 Int)) (let ((.cse11 (* v_y_69 256))) (let ((.cse8 (+ v_z_69 .cse5)) (.cse9 (+ v_z_69 .cse11)) (.cse10 (+ v_z_69 .cse11 (* v_y_68 256)))) (or (< 255 .cse8) (< .cse9 0) (< .cse8 (+ .cse6 1)) (< .cse1 .cse10) (< 255 .cse9) (not (= (mod (* .cse3 v_z_69) 256) .cse4)) (< .cse10 0) (< v_z_69 0))))))) (not (= (mod (+ (* 255 |c_ULTIMATE.start_main_~mask_SORT_12~0#1|) 1) 256) 0))) is different from true