./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_unwindbound10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_unwindbound10.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 76fd23ddcb7e8fff12decb053b84ed59e907e32bdbc4e822256bdb820e1311ef --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 13:51:28,415 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 13:51:28,464 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 13:51:28,470 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 13:51:28,470 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 13:51:28,489 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 13:51:28,491 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 13:51:28,491 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 13:51:28,491 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 13:51:28,492 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 13:51:28,492 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 13:51:28,492 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 13:51:28,493 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 13:51:28,493 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 13:51:28,493 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 13:51:28,493 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 13:51:28,493 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 13:51:28,493 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 13:51:28,494 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 13:51:28,494 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 13:51:28,494 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 13:51:28,494 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 13:51:28,494 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 13:51:28,494 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 13:51:28,494 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 13:51:28,494 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 13:51:28,494 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 13:51:28,494 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 13:51:28,494 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 13:51:28,494 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 13:51:28,494 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 13:51:28,495 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 13:51:28,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:51:28,495 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 13:51:28,495 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 13:51:28,495 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 13:51:28,495 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 13:51:28,496 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 13:51:28,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 13:51:28,496 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 13:51:28,496 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 13:51:28,496 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 13:51:28,496 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 13:51:28,496 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 76fd23ddcb7e8fff12decb053b84ed59e907e32bdbc4e822256bdb820e1311ef [2025-03-03 13:51:28,705 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 13:51:28,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 13:51:28,713 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 13:51:28,714 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 13:51:28,714 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 13:51:28,716 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_unwindbound10.c [2025-03-03 13:51:29,786 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0801d9ba6/b990610d652f4060b01bf4f042ae315a/FLAGb9c76e56c [2025-03-03 13:51:29,975 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 13:51:29,976 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_unwindbound10.c [2025-03-03 13:51:29,981 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0801d9ba6/b990610d652f4060b01bf4f042ae315a/FLAGb9c76e56c [2025-03-03 13:51:30,346 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0801d9ba6/b990610d652f4060b01bf4f042ae315a [2025-03-03 13:51:30,348 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 13:51:30,349 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 13:51:30,349 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 13:51:30,350 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 13:51:30,352 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 13:51:30,353 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:51:30" (1/1) ... [2025-03-03 13:51:30,353 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67074860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:51:30, skipping insertion in model container [2025-03-03 13:51:30,354 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:51:30" (1/1) ... [2025-03-03 13:51:30,364 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 13:51:30,452 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/nla-digbench-scaling/egcd3-ll_unwindbound10.c[490,503] [2025-03-03 13:51:30,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:51:30,469 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 13:51:30,476 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/nla-digbench-scaling/egcd3-ll_unwindbound10.c[490,503] [2025-03-03 13:51:30,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:51:30,490 INFO L204 MainTranslator]: Completed translation [2025-03-03 13:51:30,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:51:30 WrapperNode [2025-03-03 13:51:30,491 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 13:51:30,492 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 13:51:30,492 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 13:51:30,492 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 13:51:30,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:51:30" (1/1) ... [2025-03-03 13:51:30,502 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:51:30" (1/1) ... [2025-03-03 13:51:30,517 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 91 [2025-03-03 13:51:30,518 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 13:51:30,518 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 13:51:30,518 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 13:51:30,518 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 13:51:30,524 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:51:30" (1/1) ... [2025-03-03 13:51:30,524 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:51:30" (1/1) ... [2025-03-03 13:51:30,525 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:51:30" (1/1) ... [2025-03-03 13:51:30,536 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 13:51:30,536 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:51:30" (1/1) ... [2025-03-03 13:51:30,536 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:51:30" (1/1) ... [2025-03-03 13:51:30,538 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:51:30" (1/1) ... [2025-03-03 13:51:30,541 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:51:30" (1/1) ... [2025-03-03 13:51:30,541 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:51:30" (1/1) ... [2025-03-03 13:51:30,542 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:51:30" (1/1) ... [2025-03-03 13:51:30,546 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 13:51:30,547 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 13:51:30,547 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 13:51:30,547 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 13:51:30,548 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:51:30" (1/1) ... [2025-03-03 13:51:30,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:51:30,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:51:30,574 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 13:51:30,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 13:51:30,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 13:51:30,595 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 13:51:30,595 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 13:51:30,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 13:51:30,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 13:51:30,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 13:51:30,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-03 13:51:30,595 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-03 13:51:30,645 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 13:51:30,647 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 13:51:30,793 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-03 13:51:30,795 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 13:51:30,801 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 13:51:30,801 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 13:51:30,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:51:30 BoogieIcfgContainer [2025-03-03 13:51:30,801 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 13:51:30,803 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 13:51:30,803 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 13:51:30,806 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 13:51:30,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 01:51:30" (1/3) ... [2025-03-03 13:51:30,807 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16de7494 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:51:30, skipping insertion in model container [2025-03-03 13:51:30,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:51:30" (2/3) ... [2025-03-03 13:51:30,807 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16de7494 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:51:30, skipping insertion in model container [2025-03-03 13:51:30,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:51:30" (3/3) ... [2025-03-03 13:51:30,808 INFO L128 eAbstractionObserver]: Analyzing ICFG egcd3-ll_unwindbound10.c [2025-03-03 13:51:30,817 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 13:51:30,818 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG egcd3-ll_unwindbound10.c that has 3 procedures, 35 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-03 13:51:30,864 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 13:51:30,874 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;@2686c25c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 13:51:30,875 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 13:51:30,878 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 24 states have (on average 1.5) internal successors, (36), 25 states have internal predecessors, (36), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-03 13:51:30,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-03 13:51:30,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:51:30,884 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:51:30,884 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:51:30,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:51:30,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1333316680, now seen corresponding path program 1 times [2025-03-03 13:51:30,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:51:30,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955173897] [2025-03-03 13:51:30,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:51:30,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:51:30,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 13:51:30,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 13:51:30,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:51:30,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:51:31,000 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:51:31,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:51:31,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955173897] [2025-03-03 13:51:31,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955173897] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:51:31,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282266408] [2025-03-03 13:51:31,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:51:31,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:51:31,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:51:31,005 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:51:31,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 13:51:31,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 13:51:31,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 13:51:31,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:51:31,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:51:31,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 13:51:31,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:51:31,077 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:51:31,077 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:51:31,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282266408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:51:31,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 13:51:31,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 13:51:31,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785567917] [2025-03-03 13:51:31,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:51:31,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 13:51:31,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:51:31,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 13:51:31,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 13:51:31,095 INFO L87 Difference]: Start difference. First operand has 35 states, 24 states have (on average 1.5) internal successors, (36), 25 states have internal predecessors, (36), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:51:31,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:51:31,107 INFO L93 Difference]: Finished difference Result 67 states and 103 transitions. [2025-03-03 13:51:31,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 13:51:31,108 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2025-03-03 13:51:31,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:51:31,112 INFO L225 Difference]: With dead ends: 67 [2025-03-03 13:51:31,112 INFO L226 Difference]: Without dead ends: 31 [2025-03-03 13:51:31,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 13:51:31,116 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:51:31,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:51:31,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-03 13:51:31,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-03 13:51:31,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 13:51:31,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2025-03-03 13:51:31,141 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 18 [2025-03-03 13:51:31,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:51:31,142 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2025-03-03 13:51:31,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:51:31,142 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2025-03-03 13:51:31,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-03 13:51:31,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:51:31,143 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:51:31,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 13:51:31,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 13:51:31,345 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:51:31,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:51:31,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1413187582, now seen corresponding path program 1 times [2025-03-03 13:51:31,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:51:31,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690048509] [2025-03-03 13:51:31,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:51:31,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:51:31,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-03 13:51:31,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 13:51:31,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:51:31,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:51:31,447 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:51:31,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:51:31,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690048509] [2025-03-03 13:51:31,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690048509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:51:31,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:51:31,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 13:51:31,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617036719] [2025-03-03 13:51:31,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:51:31,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 13:51:31,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:51:31,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 13:51:31,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:51:31,450 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 13:51:31,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:51:31,475 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2025-03-03 13:51:31,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 13:51:31,475 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 19 [2025-03-03 13:51:31,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:51:31,476 INFO L225 Difference]: With dead ends: 40 [2025-03-03 13:51:31,476 INFO L226 Difference]: Without dead ends: 33 [2025-03-03 13:51:31,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:51:31,477 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 5 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:51:31,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 103 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:51:31,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-03 13:51:31,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-03 13:51:31,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 13:51:31,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2025-03-03 13:51:31,482 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 19 [2025-03-03 13:51:31,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:51:31,482 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2025-03-03 13:51:31,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 13:51:31,483 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2025-03-03 13:51:31,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-03 13:51:31,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:51:31,483 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:51:31,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 13:51:31,483 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:51:31,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:51:31,484 INFO L85 PathProgramCache]: Analyzing trace with hash -908950636, now seen corresponding path program 1 times [2025-03-03 13:51:31,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:51:31,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553334040] [2025-03-03 13:51:31,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:51:31,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:51:31,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 13:51:31,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 13:51:31,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:51:31,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:51:31,627 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:51:31,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:51:31,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553334040] [2025-03-03 13:51:31,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553334040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:51:31,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:51:31,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 13:51:31,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004173386] [2025-03-03 13:51:31,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:51:31,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 13:51:31,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:51:31,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 13:51:31,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:51:31,629 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 13:51:31,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:51:31,697 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2025-03-03 13:51:31,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 13:51:31,698 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2025-03-03 13:51:31,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:51:31,699 INFO L225 Difference]: With dead ends: 53 [2025-03-03 13:51:31,699 INFO L226 Difference]: Without dead ends: 46 [2025-03-03 13:51:31,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:51:31,699 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 42 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:51:31,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 119 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:51:31,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-03 13:51:31,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2025-03-03 13:51:31,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 13:51:31,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2025-03-03 13:51:31,709 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 20 [2025-03-03 13:51:31,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:51:31,709 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2025-03-03 13:51:31,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 13:51:31,709 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2025-03-03 13:51:31,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 13:51:31,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:51:31,709 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:51:31,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 13:51:31,709 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:51:31,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:51:31,710 INFO L85 PathProgramCache]: Analyzing trace with hash 41792401, now seen corresponding path program 1 times [2025-03-03 13:51:31,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:51:31,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012047291] [2025-03-03 13:51:31,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:51:31,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:51:31,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 13:51:31,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 13:51:31,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:51:31,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:51:31,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1445916775] [2025-03-03 13:51:31,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:51:31,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:51:31,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:51:31,730 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:51:31,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 13:51:31,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 13:51:31,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 13:51:31,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:51:31,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:51:31,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 13:51:31,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:51:31,874 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:51:31,874 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:51:31,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:51:31,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012047291] [2025-03-03 13:51:31,875 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:51:31,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445916775] [2025-03-03 13:51:31,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445916775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:51:31,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:51:31,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:51:31,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515046721] [2025-03-03 13:51:31,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:51:31,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:51:31,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:51:31,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:51:31,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:51:31,876 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 13:51:31,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:51:31,912 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2025-03-03 13:51:31,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:51:31,912 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2025-03-03 13:51:31,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:51:31,913 INFO L225 Difference]: With dead ends: 52 [2025-03-03 13:51:31,913 INFO L226 Difference]: Without dead ends: 50 [2025-03-03 13:51:31,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:51:31,914 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 9 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:51:31,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 138 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:51:31,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-03 13:51:31,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2025-03-03 13:51:31,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-03 13:51:31,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 66 transitions. [2025-03-03 13:51:31,921 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 66 transitions. Word has length 25 [2025-03-03 13:51:31,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:51:31,921 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 66 transitions. [2025-03-03 13:51:31,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 13:51:31,921 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 66 transitions. [2025-03-03 13:51:31,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 13:51:31,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:51:31,922 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:51:31,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 13:51:32,124 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,SelfDestructingSolverStorable3 [2025-03-03 13:51:32,124 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:51:32,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:51:32,125 INFO L85 PathProgramCache]: Analyzing trace with hash 55469992, now seen corresponding path program 1 times [2025-03-03 13:51:32,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:51:32,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107386209] [2025-03-03 13:51:32,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:51:32,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:51:32,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 13:51:32,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 13:51:32,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:51:32,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:51:32,193 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:51:32,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:51:32,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107386209] [2025-03-03 13:51:32,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107386209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:51:32,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:51:32,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:51:32,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177866852] [2025-03-03 13:51:32,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:51:32,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:51:32,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:51:32,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:51:32,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:51:32,194 INFO L87 Difference]: Start difference. First operand 49 states and 66 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 13:51:32,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:51:32,219 INFO L93 Difference]: Finished difference Result 73 states and 100 transitions. [2025-03-03 13:51:32,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:51:32,221 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2025-03-03 13:51:32,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:51:32,223 INFO L225 Difference]: With dead ends: 73 [2025-03-03 13:51:32,223 INFO L226 Difference]: Without dead ends: 51 [2025-03-03 13:51:32,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:51:32,223 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 5 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:51:32,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 128 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:51:32,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-03 13:51:32,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-03 13:51:32,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 37 states have internal predecessors, (47), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-03 13:51:32,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 68 transitions. [2025-03-03 13:51:32,232 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 68 transitions. Word has length 25 [2025-03-03 13:51:32,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:51:32,232 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 68 transitions. [2025-03-03 13:51:32,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 13:51:32,233 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2025-03-03 13:51:32,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 13:51:32,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:51:32,233 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:51:32,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 13:51:32,234 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:51:32,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:51:32,234 INFO L85 PathProgramCache]: Analyzing trace with hash 535252708, now seen corresponding path program 1 times [2025-03-03 13:51:32,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:51:32,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949439203] [2025-03-03 13:51:32,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:51:32,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:51:32,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 13:51:32,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 13:51:32,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:51:32,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:51:32,323 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:51:32,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:51:32,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949439203] [2025-03-03 13:51:32,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949439203] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:51:32,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130847127] [2025-03-03 13:51:32,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:51:32,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:51:32,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:51:32,325 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:51:32,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 13:51:32,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 13:51:32,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 13:51:32,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:51:32,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:51:32,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 13:51:32,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:51:32,412 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:51:32,412 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:51:32,474 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:51:32,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130847127] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:51:32,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:51:32,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2025-03-03 13:51:32,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106341971] [2025-03-03 13:51:32,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:51:32,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 13:51:32,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:51:32,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 13:51:32,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-03 13:51:32,476 INFO L87 Difference]: Start difference. First operand 51 states and 68 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 13:51:32,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:51:32,605 INFO L93 Difference]: Finished difference Result 147 states and 193 transitions. [2025-03-03 13:51:32,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 13:51:32,606 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 26 [2025-03-03 13:51:32,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:51:32,607 INFO L225 Difference]: With dead ends: 147 [2025-03-03 13:51:32,607 INFO L226 Difference]: Without dead ends: 140 [2025-03-03 13:51:32,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-03 13:51:32,608 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 72 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:51:32,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 234 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:51:32,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-03 13:51:32,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 97. [2025-03-03 13:51:32,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 71 states have internal predecessors, (92), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 13:51:32,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 130 transitions. [2025-03-03 13:51:32,629 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 130 transitions. Word has length 26 [2025-03-03 13:51:32,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:51:32,630 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 130 transitions. [2025-03-03 13:51:32,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 13:51:32,630 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 130 transitions. [2025-03-03 13:51:32,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-03 13:51:32,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:51:32,630 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:51:32,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 13:51:32,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:51:32,831 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:51:32,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:51:32,831 INFO L85 PathProgramCache]: Analyzing trace with hash -636843790, now seen corresponding path program 1 times [2025-03-03 13:51:32,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:51:32,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678296353] [2025-03-03 13:51:32,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:51:32,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:51:32,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-03 13:51:32,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 13:51:32,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:51:32,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:51:32,906 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:51:32,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:51:32,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678296353] [2025-03-03 13:51:32,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678296353] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:51:32,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915655656] [2025-03-03 13:51:32,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:51:32,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:51:32,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:51:32,909 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:51:32,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 13:51:32,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-03 13:51:32,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 13:51:32,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:51:32,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:51:32,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 13:51:32,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:51:32,971 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:51:32,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:51:33,029 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:51:33,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915655656] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:51:33,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:51:33,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 9 [2025-03-03 13:51:33,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031231962] [2025-03-03 13:51:33,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:51:33,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 13:51:33,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:51:33,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 13:51:33,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 13:51:33,031 INFO L87 Difference]: Start difference. First operand 97 states and 130 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:51:33,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:51:33,189 INFO L93 Difference]: Finished difference Result 183 states and 261 transitions. [2025-03-03 13:51:33,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 13:51:33,190 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2025-03-03 13:51:33,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:51:33,191 INFO L225 Difference]: With dead ends: 183 [2025-03-03 13:51:33,191 INFO L226 Difference]: Without dead ends: 171 [2025-03-03 13:51:33,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-03-03 13:51:33,192 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 113 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:51:33,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 293 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:51:33,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-03 13:51:33,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 128. [2025-03-03 13:51:33,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 97 states have (on average 1.3505154639175259) internal successors, (131), 98 states have internal predecessors, (131), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 13:51:33,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 176 transitions. [2025-03-03 13:51:33,207 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 176 transitions. Word has length 27 [2025-03-03 13:51:33,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:51:33,207 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 176 transitions. [2025-03-03 13:51:33,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:51:33,207 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 176 transitions. [2025-03-03 13:51:33,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-03 13:51:33,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:51:33,208 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:51:33,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 13:51:33,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:51:33,408 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:51:33,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:51:33,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1382279618, now seen corresponding path program 1 times [2025-03-03 13:51:33,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:51:33,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682304353] [2025-03-03 13:51:33,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:51:33,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:51:33,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-03 13:51:33,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-03 13:51:33,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:51:33,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:51:33,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1656325234] [2025-03-03 13:51:33,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:51:33,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:51:33,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:51:33,423 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:51:33,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 13:51:33,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-03 13:51:33,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-03 13:51:33,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:51:33,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:51:33,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 13:51:33,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:51:33,533 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:51:33,533 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:51:33,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:51:33,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682304353] [2025-03-03 13:51:33,533 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:51:33,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656325234] [2025-03-03 13:51:33,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656325234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:51:33,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:51:33,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:51:33,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394018592] [2025-03-03 13:51:33,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:51:33,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:51:33,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:51:33,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:51:33,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:51:33,534 INFO L87 Difference]: Start difference. First operand 128 states and 176 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 13:51:33,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:51:33,572 INFO L93 Difference]: Finished difference Result 143 states and 190 transitions. [2025-03-03 13:51:33,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:51:33,572 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2025-03-03 13:51:33,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:51:33,573 INFO L225 Difference]: With dead ends: 143 [2025-03-03 13:51:33,573 INFO L226 Difference]: Without dead ends: 141 [2025-03-03 13:51:33,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:51:33,574 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:51:33,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 136 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:51:33,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-03 13:51:33,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2025-03-03 13:51:33,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 106 states have (on average 1.320754716981132) internal successors, (140), 107 states have internal predecessors, (140), 23 states have call successors, (23), 10 states have call predecessors, (23), 10 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 13:51:33,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 185 transitions. [2025-03-03 13:51:33,595 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 185 transitions. Word has length 30 [2025-03-03 13:51:33,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:51:33,595 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 185 transitions. [2025-03-03 13:51:33,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 13:51:33,596 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 185 transitions. [2025-03-03 13:51:33,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-03 13:51:33,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:51:33,596 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:51:33,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 13:51:33,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:51:33,797 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:51:33,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:51:33,797 INFO L85 PathProgramCache]: Analyzing trace with hash 2112379123, now seen corresponding path program 1 times [2025-03-03 13:51:33,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:51:33,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749942009] [2025-03-03 13:51:33,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:51:33,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:51:33,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-03 13:51:33,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 13:51:33,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:51:33,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:51:33,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1642101546] [2025-03-03 13:51:33,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:51:33,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:51:33,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:51:33,816 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:51:33,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 13:51:33,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-03 13:51:33,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 13:51:33,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:51:33,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:51:33,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 13:51:33,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:51:33,962 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:51:33,962 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:51:34,101 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:51:34,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:51:34,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749942009] [2025-03-03 13:51:34,102 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:51:34,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642101546] [2025-03-03 13:51:34,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642101546] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:51:34,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:51:34,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2025-03-03 13:51:34,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005369037] [2025-03-03 13:51:34,102 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:51:34,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 13:51:34,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:51:34,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 13:51:34,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 13:51:34,103 INFO L87 Difference]: Start difference. First operand 140 states and 185 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 13:51:34,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:51:34,192 INFO L93 Difference]: Finished difference Result 175 states and 237 transitions. [2025-03-03 13:51:34,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 13:51:34,192 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2025-03-03 13:51:34,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:51:34,193 INFO L225 Difference]: With dead ends: 175 [2025-03-03 13:51:34,193 INFO L226 Difference]: Without dead ends: 173 [2025-03-03 13:51:34,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 13:51:34,194 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 27 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:51:34,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 264 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:51:34,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-03 13:51:34,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 170. [2025-03-03 13:51:34,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 127 states have (on average 1.3464566929133859) internal successors, (171), 128 states have internal predecessors, (171), 31 states have call successors, (31), 11 states have call predecessors, (31), 11 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 13:51:34,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 232 transitions. [2025-03-03 13:51:34,214 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 232 transitions. Word has length 32 [2025-03-03 13:51:34,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:51:34,215 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 232 transitions. [2025-03-03 13:51:34,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 13:51:34,215 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 232 transitions. [2025-03-03 13:51:34,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-03 13:51:34,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:51:34,217 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:51:34,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 13:51:34,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:51:34,421 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:51:34,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:51:34,422 INFO L85 PathProgramCache]: Analyzing trace with hash 429519069, now seen corresponding path program 1 times [2025-03-03 13:51:34,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:51:34,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998090783] [2025-03-03 13:51:34,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:51:34,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:51:34,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-03 13:51:34,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 13:51:34,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:51:34,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:51:34,474 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:51:34,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:51:34,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998090783] [2025-03-03 13:51:34,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998090783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:51:34,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:51:34,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 13:51:34,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991327873] [2025-03-03 13:51:34,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:51:34,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 13:51:34,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:51:34,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 13:51:34,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:51:34,476 INFO L87 Difference]: Start difference. First operand 170 states and 232 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 13:51:34,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:51:34,509 INFO L93 Difference]: Finished difference Result 237 states and 325 transitions. [2025-03-03 13:51:34,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 13:51:34,509 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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 32 [2025-03-03 13:51:34,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:51:34,510 INFO L225 Difference]: With dead ends: 237 [2025-03-03 13:51:34,510 INFO L226 Difference]: Without dead ends: 170 [2025-03-03 13:51:34,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:51:34,511 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 10 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:51:34,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 128 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:51:34,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-03 13:51:34,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2025-03-03 13:51:34,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 127 states have (on average 1.3385826771653544) internal successors, (170), 128 states have internal predecessors, (170), 31 states have call successors, (31), 11 states have call predecessors, (31), 11 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 13:51:34,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 231 transitions. [2025-03-03 13:51:34,524 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 231 transitions. Word has length 32 [2025-03-03 13:51:34,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:51:34,524 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 231 transitions. [2025-03-03 13:51:34,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 13:51:34,524 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 231 transitions. [2025-03-03 13:51:34,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-03 13:51:34,525 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:51:34,525 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:51:34,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 13:51:34,525 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:51:34,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:51:34,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1488699407, now seen corresponding path program 1 times [2025-03-03 13:51:34,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:51:34,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029084119] [2025-03-03 13:51:34,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:51:34,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:51:34,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-03 13:51:34,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 13:51:34,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:51:34,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:51:34,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1252484345] [2025-03-03 13:51:34,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:51:34,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:51:34,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:51:34,538 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:51:34,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 13:51:34,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-03 13:51:34,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 13:51:34,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:51:34,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:51:34,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 13:51:34,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:51:34,611 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 13:51:34,611 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:51:34,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:51:34,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029084119] [2025-03-03 13:51:34,611 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:51:34,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252484345] [2025-03-03 13:51:34,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252484345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:51:34,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:51:34,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:51:34,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314640957] [2025-03-03 13:51:34,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:51:34,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:51:34,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:51:34,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:51:34,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:51:34,612 INFO L87 Difference]: Start difference. First operand 170 states and 231 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 13:51:34,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:51:34,665 INFO L93 Difference]: Finished difference Result 235 states and 331 transitions. [2025-03-03 13:51:34,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:51:34,665 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2025-03-03 13:51:34,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:51:34,667 INFO L225 Difference]: With dead ends: 235 [2025-03-03 13:51:34,667 INFO L226 Difference]: Without dead ends: 233 [2025-03-03 13:51:34,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:51:34,669 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 8 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:51:34,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 128 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:51:34,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-03-03 13:51:34,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 226. [2025-03-03 13:51:34,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 160 states have (on average 1.36875) internal successors, (219), 161 states have internal predecessors, (219), 51 states have call successors, (51), 14 states have call predecessors, (51), 14 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-03 13:51:34,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 320 transitions. [2025-03-03 13:51:34,691 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 320 transitions. Word has length 35 [2025-03-03 13:51:34,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:51:34,692 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 320 transitions. [2025-03-03 13:51:34,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 13:51:34,692 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 320 transitions. [2025-03-03 13:51:34,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 13:51:34,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:51:34,692 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:51:34,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 13:51:34,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:51:34,896 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:51:34,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:51:34,896 INFO L85 PathProgramCache]: Analyzing trace with hash -78938596, now seen corresponding path program 1 times [2025-03-03 13:51:34,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:51:34,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838475849] [2025-03-03 13:51:34,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:51:34,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:51:34,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 13:51:34,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 13:51:34,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:51:34,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:51:34,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [860692784] [2025-03-03 13:51:34,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:51:34,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:51:34,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:51:34,911 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:51:34,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 13:51:34,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 13:51:34,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 13:51:34,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:51:34,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:51:34,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-03 13:51:34,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:51:35,082 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:51:35,083 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:51:35,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:51:35,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838475849] [2025-03-03 13:51:35,114 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:51:35,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860692784] [2025-03-03 13:51:35,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860692784] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:51:35,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 13:51:35,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2025-03-03 13:51:35,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977537689] [2025-03-03 13:51:35,114 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 13:51:35,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 13:51:35,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:51:35,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 13:51:35,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 13:51:35,115 INFO L87 Difference]: Start difference. First operand 226 states and 320 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 13:51:35,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:51:35,238 INFO L93 Difference]: Finished difference Result 238 states and 330 transitions. [2025-03-03 13:51:35,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 13:51:35,238 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2025-03-03 13:51:35,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:51:35,243 INFO L225 Difference]: With dead ends: 238 [2025-03-03 13:51:35,243 INFO L226 Difference]: Without dead ends: 236 [2025-03-03 13:51:35,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-03 13:51:35,243 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 37 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:51:35,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 238 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:51:35,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-03 13:51:35,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2025-03-03 13:51:35,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 166 states have (on average 1.355421686746988) internal successors, (225), 167 states have internal predecessors, (225), 51 states have call successors, (51), 16 states have call predecessors, (51), 16 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-03 13:51:35,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 326 transitions. [2025-03-03 13:51:35,259 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 326 transitions. Word has length 37 [2025-03-03 13:51:35,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:51:35,260 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 326 transitions. [2025-03-03 13:51:35,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 13:51:35,260 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 326 transitions. [2025-03-03 13:51:35,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-03 13:51:35,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:51:35,260 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:51:35,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 13:51:35,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 13:51:35,461 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:51:35,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:51:35,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1633413538, now seen corresponding path program 1 times [2025-03-03 13:51:35,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:51:35,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402869089] [2025-03-03 13:51:35,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:51:35,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:51:35,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-03 13:51:35,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 13:51:35,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:51:35,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:51:35,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2127451311] [2025-03-03 13:51:35,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:51:35,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:51:35,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:51:35,471 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:51:35,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 13:51:35,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-03 13:51:35,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 13:51:35,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:51:35,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:51:35,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 13:51:35,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:51:35,542 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 13:51:35,542 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:51:35,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:51:35,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402869089] [2025-03-03 13:51:35,542 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:51:35,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127451311] [2025-03-03 13:51:35,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127451311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:51:35,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:51:35,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:51:35,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603044221] [2025-03-03 13:51:35,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:51:35,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:51:35,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:51:35,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:51:35,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:51:35,543 INFO L87 Difference]: Start difference. First operand 234 states and 326 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 13:51:35,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:51:35,601 INFO L93 Difference]: Finished difference Result 309 states and 454 transitions. [2025-03-03 13:51:35,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:51:35,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 40 [2025-03-03 13:51:35,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:51:35,603 INFO L225 Difference]: With dead ends: 309 [2025-03-03 13:51:35,603 INFO L226 Difference]: Without dead ends: 307 [2025-03-03 13:51:35,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:51:35,603 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 5 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:51:35,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 136 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:51:35,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-03-03 13:51:35,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 292. [2025-03-03 13:51:35,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 187 states have (on average 1.358288770053476) internal successors, (254), 197 states have internal predecessors, (254), 87 states have call successors, (87), 17 states have call predecessors, (87), 17 states have return successors, (86), 77 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-03 13:51:35,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 427 transitions. [2025-03-03 13:51:35,632 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 427 transitions. Word has length 40 [2025-03-03 13:51:35,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:51:35,632 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 427 transitions. [2025-03-03 13:51:35,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 13:51:35,632 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 427 transitions. [2025-03-03 13:51:35,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 13:51:35,633 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:51:35,633 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 13:51:35,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-03 13:51:35,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 13:51:35,833 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:51:35,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:51:35,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1348686203, now seen corresponding path program 1 times [2025-03-03 13:51:35,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:51:35,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393883668] [2025-03-03 13:51:35,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:51:35,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:51:35,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 13:51:35,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 13:51:35,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:51:35,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:51:35,907 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:51:35,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:51:35,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393883668] [2025-03-03 13:51:35,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393883668] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:51:35,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219625805] [2025-03-03 13:51:35,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:51:35,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:51:35,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:51:35,909 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:51:35,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 13:51:35,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 13:51:35,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 13:51:35,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:51:35,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:51:35,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 13:51:35,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:51:35,992 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:51:35,992 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:51:36,064 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:51:36,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219625805] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:51:36,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:51:36,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 14 [2025-03-03 13:51:36,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035224739] [2025-03-03 13:51:36,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:51:36,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 13:51:36,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:51:36,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 13:51:36,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-03 13:51:36,066 INFO L87 Difference]: Start difference. First operand 292 states and 427 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 13:51:36,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:51:36,315 INFO L93 Difference]: Finished difference Result 1094 states and 1585 transitions. [2025-03-03 13:51:36,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 13:51:36,316 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 38 [2025-03-03 13:51:36,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:51:36,321 INFO L225 Difference]: With dead ends: 1094 [2025-03-03 13:51:36,321 INFO L226 Difference]: Without dead ends: 897 [2025-03-03 13:51:36,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=144, Invalid=276, Unknown=0, NotChecked=0, Total=420 [2025-03-03 13:51:36,322 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 195 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:51:36,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 307 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:51:36,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2025-03-03 13:51:36,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 858. [2025-03-03 13:51:36,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 568 states have (on average 1.2922535211267605) internal successors, (734), 591 states have internal predecessors, (734), 232 states have call successors, (232), 57 states have call predecessors, (232), 57 states have return successors, (226), 209 states have call predecessors, (226), 226 states have call successors, (226) [2025-03-03 13:51:36,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1192 transitions. [2025-03-03 13:51:36,410 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1192 transitions. Word has length 38 [2025-03-03 13:51:36,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:51:36,410 INFO L471 AbstractCegarLoop]: Abstraction has 858 states and 1192 transitions. [2025-03-03 13:51:36,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 13:51:36,410 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1192 transitions. [2025-03-03 13:51:36,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 13:51:36,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:51:36,410 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:51:36,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-03 13:51:36,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-03 13:51:36,615 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:51:36,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:51:36,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1981833881, now seen corresponding path program 1 times [2025-03-03 13:51:36,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:51:36,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55558937] [2025-03-03 13:51:36,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:51:36,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:51:36,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 13:51:36,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 13:51:36,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:51:36,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:51:36,679 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:51:36,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:51:36,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55558937] [2025-03-03 13:51:36,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55558937] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:51:36,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899145399] [2025-03-03 13:51:36,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:51:36,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:51:36,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:51:36,681 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:51:36,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 13:51:36,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 13:51:36,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 13:51:36,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:51:36,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:51:36,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 13:51:36,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:51:36,742 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:51:36,743 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:51:36,794 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:51:36,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899145399] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:51:36,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:51:36,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 12 [2025-03-03 13:51:36,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383591066] [2025-03-03 13:51:36,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:51:36,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 13:51:36,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:51:36,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 13:51:36,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-03-03 13:51:36,795 INFO L87 Difference]: Start difference. First operand 858 states and 1192 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 13:51:36,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:51:36,988 INFO L93 Difference]: Finished difference Result 1267 states and 1779 transitions. [2025-03-03 13:51:36,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 13:51:36,988 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 38 [2025-03-03 13:51:36,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:51:36,994 INFO L225 Difference]: With dead ends: 1267 [2025-03-03 13:51:36,995 INFO L226 Difference]: Without dead ends: 863 [2025-03-03 13:51:36,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2025-03-03 13:51:36,997 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 135 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:51:36,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 253 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:51:36,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2025-03-03 13:51:37,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 855. [2025-03-03 13:51:37,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 565 states have (on average 1.2601769911504426) internal successors, (712), 588 states have internal predecessors, (712), 232 states have call successors, (232), 57 states have call predecessors, (232), 57 states have return successors, (226), 209 states have call predecessors, (226), 226 states have call successors, (226) [2025-03-03 13:51:37,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1170 transitions. [2025-03-03 13:51:37,093 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1170 transitions. Word has length 38 [2025-03-03 13:51:37,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:51:37,093 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 1170 transitions. [2025-03-03 13:51:37,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 13:51:37,093 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1170 transitions. [2025-03-03 13:51:37,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 13:51:37,093 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:51:37,093 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:51:37,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-03 13:51:37,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 13:51:37,294 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:51:37,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:51:37,296 INFO L85 PathProgramCache]: Analyzing trace with hash 492650833, now seen corresponding path program 2 times [2025-03-03 13:51:37,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:51:37,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161553846] [2025-03-03 13:51:37,296 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:51:37,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:51:37,301 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-03 13:51:37,307 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 13:51:37,308 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:51:37,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:51:37,362 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:51:37,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:51:37,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161553846] [2025-03-03 13:51:37,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161553846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:51:37,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:51:37,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:51:37,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032702530] [2025-03-03 13:51:37,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:51:37,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:51:37,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:51:37,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:51:37,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:51:37,364 INFO L87 Difference]: Start difference. First operand 855 states and 1170 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 13:51:37,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:51:37,491 INFO L93 Difference]: Finished difference Result 1147 states and 1612 transitions. [2025-03-03 13:51:37,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 13:51:37,491 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2025-03-03 13:51:37,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:51:37,496 INFO L225 Difference]: With dead ends: 1147 [2025-03-03 13:51:37,496 INFO L226 Difference]: Without dead ends: 911 [2025-03-03 13:51:37,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:51:37,497 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 30 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:51:37,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 181 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:51:37,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2025-03-03 13:51:37,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 803. [2025-03-03 13:51:37,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 533 states have (on average 1.24953095684803) internal successors, (666), 555 states have internal predecessors, (666), 212 states have call successors, (212), 57 states have call predecessors, (212), 57 states have return successors, (206), 190 states have call predecessors, (206), 206 states have call successors, (206) [2025-03-03 13:51:37,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1084 transitions. [2025-03-03 13:51:37,576 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1084 transitions. Word has length 39 [2025-03-03 13:51:37,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:51:37,576 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1084 transitions. [2025-03-03 13:51:37,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 13:51:37,576 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1084 transitions. [2025-03-03 13:51:37,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 13:51:37,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:51:37,577 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:51:37,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 13:51:37,577 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:51:37,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:51:37,577 INFO L85 PathProgramCache]: Analyzing trace with hash 657747001, now seen corresponding path program 1 times [2025-03-03 13:51:37,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:51:37,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379634219] [2025-03-03 13:51:37,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:51:37,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:51:37,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 13:51:37,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 13:51:37,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:51:37,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:51:37,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [431954472] [2025-03-03 13:51:37,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:51:37,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:51:37,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:51:37,596 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:51:37,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-03 13:51:37,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 13:51:37,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 13:51:37,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:51:37,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:51:37,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-03 13:51:37,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:51:38,176 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 13:51:38,177 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:51:38,536 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 13:51:38,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:51:38,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379634219] [2025-03-03 13:51:38,536 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:51:38,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431954472] [2025-03-03 13:51:38,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431954472] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:51:38,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:51:38,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2025-03-03 13:51:38,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408827061] [2025-03-03 13:51:38,536 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:51:38,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 13:51:38,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:51:38,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 13:51:38,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2025-03-03 13:51:38,537 INFO L87 Difference]: Start difference. First operand 803 states and 1084 transitions. Second operand has 23 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 20 states have internal predecessors, (52), 6 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-03 13:51:40,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:51:40,244 INFO L93 Difference]: Finished difference Result 1387 states and 1908 transitions. [2025-03-03 13:51:40,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-03 13:51:40,244 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 20 states have internal predecessors, (52), 6 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 54 [2025-03-03 13:51:40,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:51:40,251 INFO L225 Difference]: With dead ends: 1387 [2025-03-03 13:51:40,251 INFO L226 Difference]: Without dead ends: 1053 [2025-03-03 13:51:40,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=398, Invalid=1672, Unknown=0, NotChecked=0, Total=2070 [2025-03-03 13:51:40,254 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 238 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 13:51:40,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 719 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 13:51:40,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2025-03-03 13:51:40,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 898. [2025-03-03 13:51:40,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 606 states have (on average 1.2508250825082508) internal successors, (758), 624 states have internal predecessors, (758), 226 states have call successors, (226), 65 states have call predecessors, (226), 65 states have return successors, (222), 208 states have call predecessors, (222), 222 states have call successors, (222) [2025-03-03 13:51:40,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1206 transitions. [2025-03-03 13:51:40,383 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1206 transitions. Word has length 54 [2025-03-03 13:51:40,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:51:40,383 INFO L471 AbstractCegarLoop]: Abstraction has 898 states and 1206 transitions. [2025-03-03 13:51:40,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 20 states have internal predecessors, (52), 6 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-03 13:51:40,383 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1206 transitions. [2025-03-03 13:51:40,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 13:51:40,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:51:40,384 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 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, 1, 1, 1, 1] [2025-03-03 13:51:40,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-03 13:51:40,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-03 13:51:40,588 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:51:40,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:51:40,589 INFO L85 PathProgramCache]: Analyzing trace with hash -114883297, now seen corresponding path program 1 times [2025-03-03 13:51:40,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:51:40,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381547332] [2025-03-03 13:51:40,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:51:40,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:51:40,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 13:51:40,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 13:51:40,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:51:40,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:51:40,709 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 13:51:40,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:51:40,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381547332] [2025-03-03 13:51:40,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381547332] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:51:40,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263485772] [2025-03-03 13:51:40,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:51:40,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:51:40,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:51:40,712 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:51:40,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-03 13:51:40,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 13:51:40,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 13:51:40,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:51:40,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:51:40,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 13:51:40,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:51:40,809 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 13:51:40,809 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:51:40,901 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 13:51:40,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263485772] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:51:40,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:51:40,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 14 [2025-03-03 13:51:40,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563762804] [2025-03-03 13:51:40,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:51:40,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 13:51:40,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:51:40,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 13:51:40,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-03 13:51:40,904 INFO L87 Difference]: Start difference. First operand 898 states and 1206 transitions. Second operand has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 5 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-03 13:51:41,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:51:41,181 INFO L93 Difference]: Finished difference Result 974 states and 1284 transitions. [2025-03-03 13:51:41,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 13:51:41,182 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 5 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 60 [2025-03-03 13:51:41,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:51:41,186 INFO L225 Difference]: With dead ends: 974 [2025-03-03 13:51:41,186 INFO L226 Difference]: Without dead ends: 952 [2025-03-03 13:51:41,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 112 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=271, Unknown=0, NotChecked=0, Total=420 [2025-03-03 13:51:41,187 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 138 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:51:41,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 241 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:51:41,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2025-03-03 13:51:41,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 925. [2025-03-03 13:51:41,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 633 states have (on average 1.2290679304897314) internal successors, (778), 651 states have internal predecessors, (778), 226 states have call successors, (226), 65 states have call predecessors, (226), 65 states have return successors, (222), 208 states have call predecessors, (222), 222 states have call successors, (222) [2025-03-03 13:51:41,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1226 transitions. [2025-03-03 13:51:41,307 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1226 transitions. Word has length 60 [2025-03-03 13:51:41,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:51:41,308 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1226 transitions. [2025-03-03 13:51:41,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 5 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-03 13:51:41,308 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1226 transitions. [2025-03-03 13:51:41,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 13:51:41,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:51:41,308 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:51:41,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-03 13:51:41,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 13:51:41,510 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:51:41,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:51:41,511 INFO L85 PathProgramCache]: Analyzing trace with hash 896233895, now seen corresponding path program 1 times [2025-03-03 13:51:41,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:51:41,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78018520] [2025-03-03 13:51:41,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:51:41,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:51:41,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 13:51:41,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 13:51:41,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:51:41,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:51:41,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1528968888] [2025-03-03 13:51:41,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:51:41,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:51:41,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:51:41,524 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:51:41,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-03 13:51:41,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 13:51:41,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 13:51:41,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:51:41,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:51:41,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 13:51:41,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:51:41,608 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-03 13:51:41,608 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:51:41,678 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-03-03 13:51:41,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:51:41,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78018520] [2025-03-03 13:51:41,678 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:51:41,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528968888] [2025-03-03 13:51:41,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528968888] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 13:51:41,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 13:51:41,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2025-03-03 13:51:41,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292602953] [2025-03-03 13:51:41,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:51:41,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:51:41,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:51:41,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:51:41,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:51:41,679 INFO L87 Difference]: Start difference. First operand 925 states and 1226 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 13:51:41,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:51:41,871 INFO L93 Difference]: Finished difference Result 947 states and 1247 transitions. [2025-03-03 13:51:41,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:51:41,871 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 63 [2025-03-03 13:51:41,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:51:41,875 INFO L225 Difference]: With dead ends: 947 [2025-03-03 13:51:41,876 INFO L226 Difference]: Without dead ends: 945 [2025-03-03 13:51:41,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 117 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 13:51:41,877 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 5 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:51:41,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 129 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:51:41,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2025-03-03 13:51:42,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 945. [2025-03-03 13:51:42,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 648 states have (on average 1.220679012345679) internal successors, (791), 666 states have internal predecessors, (791), 226 states have call successors, (226), 70 states have call predecessors, (226), 70 states have return successors, (222), 208 states have call predecessors, (222), 222 states have call successors, (222) [2025-03-03 13:51:42,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1239 transitions. [2025-03-03 13:51:42,019 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1239 transitions. Word has length 63 [2025-03-03 13:51:42,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:51:42,019 INFO L471 AbstractCegarLoop]: Abstraction has 945 states and 1239 transitions. [2025-03-03 13:51:42,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 13:51:42,019 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1239 transitions. [2025-03-03 13:51:42,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 13:51:42,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:51:42,020 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:51:42,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-03 13:51:42,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:51:42,220 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:51:42,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:51:42,221 INFO L85 PathProgramCache]: Analyzing trace with hash 186070766, now seen corresponding path program 1 times [2025-03-03 13:51:42,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:51:42,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747866987] [2025-03-03 13:51:42,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:51:42,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:51:42,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 13:51:42,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 13:51:42,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:51:42,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:51:42,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1518579712] [2025-03-03 13:51:42,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:51:42,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:51:42,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:51:42,235 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:51:42,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-03 13:51:42,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 13:51:42,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 13:51:42,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:51:42,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:51:42,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-03 13:51:42,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:51:42,611 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 8 proven. 34 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 13:51:42,611 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:51:42,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:51:42,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747866987] [2025-03-03 13:51:42,720 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:51:42,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518579712] [2025-03-03 13:51:42,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518579712] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:51:42,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 13:51:42,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2025-03-03 13:51:42,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204765769] [2025-03-03 13:51:42,720 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 13:51:42,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 13:51:42,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:51:42,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 13:51:42,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-03-03 13:51:42,721 INFO L87 Difference]: Start difference. First operand 945 states and 1239 transitions. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 13 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-03 13:51:43,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:51:43,225 INFO L93 Difference]: Finished difference Result 1066 states and 1417 transitions. [2025-03-03 13:51:43,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 13:51:43,226 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 13 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 66 [2025-03-03 13:51:43,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:51:43,230 INFO L225 Difference]: With dead ends: 1066 [2025-03-03 13:51:43,230 INFO L226 Difference]: Without dead ends: 1064 [2025-03-03 13:51:43,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2025-03-03 13:51:43,231 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 107 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:51:43,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 757 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:51:43,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2025-03-03 13:51:43,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 1050. [2025-03-03 13:51:43,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 719 states have (on average 1.235048678720445) internal successors, (888), 740 states have internal predecessors, (888), 258 states have call successors, (258), 72 states have call predecessors, (258), 72 states have return successors, (254), 237 states have call predecessors, (254), 254 states have call successors, (254) [2025-03-03 13:51:43,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1400 transitions. [2025-03-03 13:51:43,397 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1400 transitions. Word has length 66 [2025-03-03 13:51:43,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:51:43,397 INFO L471 AbstractCegarLoop]: Abstraction has 1050 states and 1400 transitions. [2025-03-03 13:51:43,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 13 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-03 13:51:43,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1400 transitions. [2025-03-03 13:51:43,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 13:51:43,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:51:43,398 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:51:43,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-03 13:51:43,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:51:43,602 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:51:43,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:51:43,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1212046358, now seen corresponding path program 2 times [2025-03-03 13:51:43,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:51:43,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738802153] [2025-03-03 13:51:43,602 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:51:43,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:51:43,605 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 2 equivalence classes. [2025-03-03 13:51:43,610 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 13:51:43,610 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:51:43,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:51:43,651 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-03 13:51:43,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:51:43,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738802153] [2025-03-03 13:51:43,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738802153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:51:43,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:51:43,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:51:43,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902017565] [2025-03-03 13:51:43,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:51:43,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:51:43,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:51:43,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:51:43,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:51:43,653 INFO L87 Difference]: Start difference. First operand 1050 states and 1400 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 13:51:43,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:51:43,827 INFO L93 Difference]: Finished difference Result 1548 states and 2100 transitions. [2025-03-03 13:51:43,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:51:43,827 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 69 [2025-03-03 13:51:43,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:51:43,832 INFO L225 Difference]: With dead ends: 1548 [2025-03-03 13:51:43,832 INFO L226 Difference]: Without dead ends: 1023 [2025-03-03 13:51:43,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:51:43,834 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 3 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:51:43,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 131 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:51:43,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2025-03-03 13:51:43,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 995. [2025-03-03 13:51:43,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 696 states have (on average 1.2327586206896552) internal successors, (858), 700 states have internal predecessors, (858), 226 states have call successors, (226), 72 states have call predecessors, (226), 72 states have return successors, (222), 222 states have call predecessors, (222), 222 states have call successors, (222) [2025-03-03 13:51:43,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1306 transitions. [2025-03-03 13:51:43,964 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1306 transitions. Word has length 69 [2025-03-03 13:51:43,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:51:43,965 INFO L471 AbstractCegarLoop]: Abstraction has 995 states and 1306 transitions. [2025-03-03 13:51:43,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 13:51:43,965 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1306 transitions. [2025-03-03 13:51:43,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 13:51:43,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:51:43,965 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:51:43,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 13:51:43,966 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:51:43,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:51:43,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1177494785, now seen corresponding path program 3 times [2025-03-03 13:51:43,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:51:43,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950515508] [2025-03-03 13:51:43,966 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:51:43,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:51:43,970 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 71 statements into 6 equivalence classes. [2025-03-03 13:51:43,983 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 13:51:43,983 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-03 13:51:43,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:51:43,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1281385786] [2025-03-03 13:51:43,984 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:51:43,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:51:43,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:51:43,986 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:51:43,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-03 13:51:44,008 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 71 statements into 6 equivalence classes. [2025-03-03 13:51:44,026 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 56 of 71 statements. [2025-03-03 13:51:44,027 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 13:51:44,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:51:44,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-03-03 13:51:44,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:51:44,663 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 10 proven. 35 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-03 13:51:44,663 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:51:45,102 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-03 13:51:45,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:51:45,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950515508] [2025-03-03 13:51:45,102 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:51:45,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281385786] [2025-03-03 13:51:45,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281385786] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:51:45,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:51:45,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 29 [2025-03-03 13:51:45,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897089433] [2025-03-03 13:51:45,102 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:51:45,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-03 13:51:45,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:51:45,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-03 13:51:45,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2025-03-03 13:51:45,103 INFO L87 Difference]: Start difference. First operand 995 states and 1306 transitions. Second operand has 29 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 26 states have internal predecessors, (76), 6 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-03 13:51:49,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 13:51:53,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.70s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 13:51:54,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:51:54,581 INFO L93 Difference]: Finished difference Result 1438 states and 1975 transitions. [2025-03-03 13:51:54,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-03-03 13:51:54,581 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 26 states have internal predecessors, (76), 6 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 71 [2025-03-03 13:51:54,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:51:54,586 INFO L225 Difference]: With dead ends: 1438 [2025-03-03 13:51:54,586 INFO L226 Difference]: Without dead ends: 1436 [2025-03-03 13:51:54,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1650 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1176, Invalid=4524, Unknown=0, NotChecked=0, Total=5700 [2025-03-03 13:51:54,589 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 495 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 313 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2025-03-03 13:51:54,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 952 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [313 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2025-03-03 13:51:54,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2025-03-03 13:51:54,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1194. [2025-03-03 13:51:54,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1194 states, 854 states have (on average 1.2611241217798594) internal successors, (1077), 858 states have internal predecessors, (1077), 258 states have call successors, (258), 81 states have call predecessors, (258), 81 states have return successors, (254), 254 states have call predecessors, (254), 254 states have call successors, (254) [2025-03-03 13:51:54,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 1589 transitions. [2025-03-03 13:51:54,834 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 1589 transitions. Word has length 71 [2025-03-03 13:51:54,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:51:54,834 INFO L471 AbstractCegarLoop]: Abstraction has 1194 states and 1589 transitions. [2025-03-03 13:51:54,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 26 states have internal predecessors, (76), 6 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-03 13:51:54,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1589 transitions. [2025-03-03 13:51:54,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-03 13:51:54,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:51:54,835 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:51:54,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-03 13:51:55,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-03 13:51:55,036 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:51:55,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:51:55,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1979991359, now seen corresponding path program 1 times [2025-03-03 13:51:55,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:51:55,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102908970] [2025-03-03 13:51:55,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:51:55,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:51:55,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-03 13:51:55,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-03 13:51:55,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:51:55,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:51:55,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [965994937] [2025-03-03 13:51:55,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:51:55,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:51:55,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:51:55,052 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:51:55,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-03 13:51:55,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-03 13:51:55,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-03 13:51:55,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:51:55,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:51:55,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-03 13:51:55,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:51:55,275 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 20 proven. 23 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2025-03-03 13:51:55,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:51:55,511 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 23 proven. 17 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-03-03 13:51:55,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:51:55,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102908970] [2025-03-03 13:51:55,511 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:51:55,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965994937] [2025-03-03 13:51:55,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965994937] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:51:55,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:51:55,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2025-03-03 13:51:55,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440436543] [2025-03-03 13:51:55,511 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:51:55,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 13:51:55,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:51:55,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 13:51:55,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2025-03-03 13:51:55,512 INFO L87 Difference]: Start difference. First operand 1194 states and 1589 transitions. Second operand has 21 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 18 states have internal predecessors, (52), 8 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 8 states have call predecessors, (24), 8 states have call successors, (24) [2025-03-03 13:51:56,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:51:56,643 INFO L93 Difference]: Finished difference Result 1937 states and 2781 transitions. [2025-03-03 13:51:56,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 13:51:56,644 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 18 states have internal predecessors, (52), 8 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 8 states have call predecessors, (24), 8 states have call successors, (24) Word has length 85 [2025-03-03 13:51:56,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:51:56,653 INFO L225 Difference]: With dead ends: 1937 [2025-03-03 13:51:56,653 INFO L226 Difference]: Without dead ends: 1933 [2025-03-03 13:51:56,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=345, Invalid=1215, Unknown=0, NotChecked=0, Total=1560 [2025-03-03 13:51:56,655 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 174 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 13:51:56,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 541 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 13:51:56,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2025-03-03 13:51:57,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1799. [2025-03-03 13:51:57,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1799 states, 1164 states have (on average 1.3307560137457044) internal successors, (1549), 1167 states have internal predecessors, (1549), 542 states have call successors, (542), 93 states have call predecessors, (542), 92 states have return successors, (538), 538 states have call predecessors, (538), 538 states have call successors, (538) [2025-03-03 13:51:57,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2629 transitions. [2025-03-03 13:51:57,226 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2629 transitions. Word has length 85 [2025-03-03 13:51:57,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:51:57,226 INFO L471 AbstractCegarLoop]: Abstraction has 1799 states and 2629 transitions. [2025-03-03 13:51:57,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 18 states have internal predecessors, (52), 8 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 8 states have call predecessors, (24), 8 states have call successors, (24) [2025-03-03 13:51:57,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2629 transitions. [2025-03-03 13:51:57,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-03 13:51:57,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:51:57,228 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:51:57,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-03 13:51:57,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:51:57,432 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:51:57,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:51:57,433 INFO L85 PathProgramCache]: Analyzing trace with hash -748950492, now seen corresponding path program 1 times [2025-03-03 13:51:57,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:51:57,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824705709] [2025-03-03 13:51:57,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:51:57,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:51:57,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-03 13:51:57,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-03 13:51:57,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:51:57,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:51:57,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [409292350] [2025-03-03 13:51:57,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:51:57,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:51:57,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:51:57,449 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:51:57,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-03 13:51:57,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-03 13:51:57,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-03 13:51:57,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:51:57,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:51:57,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-03-03 13:51:57,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:51:58,231 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 30 proven. 36 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-03 13:51:58,231 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:51:58,986 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-03 13:51:58,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:51:58,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824705709] [2025-03-03 13:51:58,987 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:51:58,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409292350] [2025-03-03 13:51:58,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409292350] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:51:58,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:51:58,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 33 [2025-03-03 13:51:58,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110909665] [2025-03-03 13:51:58,987 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:51:58,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-03 13:51:58,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:51:58,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-03 13:51:58,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=905, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 13:51:58,988 INFO L87 Difference]: Start difference. First operand 1799 states and 2629 transitions. Second operand has 33 states, 31 states have (on average 2.4838709677419355) internal successors, (77), 31 states have internal predecessors, (77), 9 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 7 states have call predecessors, (20), 7 states have call successors, (20) [2025-03-03 13:52:03,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 13:52:07,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:52:07,741 INFO L93 Difference]: Finished difference Result 2471 states and 3649 transitions. [2025-03-03 13:52:07,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-03-03 13:52:07,742 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 2.4838709677419355) internal successors, (77), 31 states have internal predecessors, (77), 9 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 7 states have call predecessors, (20), 7 states have call successors, (20) Word has length 84 [2025-03-03 13:52:07,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:52:07,750 INFO L225 Difference]: With dead ends: 2471 [2025-03-03 13:52:07,750 INFO L226 Difference]: Without dead ends: 2454 [2025-03-03 13:52:07,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2304 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1654, Invalid=6178, Unknown=0, NotChecked=0, Total=7832 [2025-03-03 13:52:07,752 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 477 mSDsluCounter, 1485 mSDsCounter, 0 mSdLazyCounter, 1406 mSolverCounterSat, 346 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 1567 SdHoareTripleChecker+Invalid, 1752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 346 IncrementalHoareTripleChecker+Valid, 1406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:52:07,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 1567 Invalid, 1752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [346 Valid, 1406 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-03-03 13:52:07,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2454 states. [2025-03-03 13:52:08,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2454 to 2169. [2025-03-03 13:52:08,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2169 states, 1446 states have (on average 1.3547717842323652) internal successors, (1959), 1449 states have internal predecessors, (1959), 625 states have call successors, (625), 97 states have call predecessors, (625), 97 states have return successors, (622), 622 states have call predecessors, (622), 622 states have call successors, (622) [2025-03-03 13:52:08,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 3206 transitions. [2025-03-03 13:52:08,860 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 3206 transitions. Word has length 84 [2025-03-03 13:52:08,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:52:08,860 INFO L471 AbstractCegarLoop]: Abstraction has 2169 states and 3206 transitions. [2025-03-03 13:52:08,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 2.4838709677419355) internal successors, (77), 31 states have internal predecessors, (77), 9 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 7 states have call predecessors, (20), 7 states have call successors, (20) [2025-03-03 13:52:08,861 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 3206 transitions. [2025-03-03 13:52:08,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 13:52:08,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:52:08,861 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:52:08,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-03 13:52:09,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:52:09,062 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:52:09,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:52:09,062 INFO L85 PathProgramCache]: Analyzing trace with hash 235898092, now seen corresponding path program 1 times [2025-03-03 13:52:09,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:52:09,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695876364] [2025-03-03 13:52:09,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:52:09,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:52:09,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 13:52:09,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 13:52:09,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:52:09,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:52:09,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [970202117] [2025-03-03 13:52:09,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:52:09,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:52:09,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:52:09,075 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:52:09,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-03 13:52:09,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 13:52:09,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 13:52:09,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:52:09,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:52:09,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-03 13:52:09,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:52:09,662 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-03 13:52:09,662 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:52:09,993 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-03 13:52:09,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:52:09,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695876364] [2025-03-03 13:52:09,993 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:52:09,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970202117] [2025-03-03 13:52:09,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970202117] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:52:09,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:52:09,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2025-03-03 13:52:09,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348828700] [2025-03-03 13:52:09,993 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:52:09,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 13:52:09,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:52:09,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 13:52:09,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2025-03-03 13:52:09,994 INFO L87 Difference]: Start difference. First operand 2169 states and 3206 transitions. Second operand has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 20 states have internal predecessors, (68), 8 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (22), 8 states have call predecessors, (22), 8 states have call successors, (22) [2025-03-03 13:52:15,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 13:52:20,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:52:20,717 INFO L93 Difference]: Finished difference Result 2891 states and 4391 transitions. [2025-03-03 13:52:20,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-03-03 13:52:20,717 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 20 states have internal predecessors, (68), 8 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (22), 8 states have call predecessors, (22), 8 states have call successors, (22) Word has length 87 [2025-03-03 13:52:20,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:52:20,727 INFO L225 Difference]: With dead ends: 2891 [2025-03-03 13:52:20,727 INFO L226 Difference]: Without dead ends: 2885 [2025-03-03 13:52:20,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1475 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1114, Invalid=4142, Unknown=0, NotChecked=0, Total=5256 [2025-03-03 13:52:20,728 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 310 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 203 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2025-03-03 13:52:20,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 1004 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 836 Invalid, 1 Unknown, 0 Unchecked, 6.3s Time] [2025-03-03 13:52:20,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2885 states. [2025-03-03 13:52:22,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2885 to 2504. [2025-03-03 13:52:22,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2504 states, 1645 states have (on average 1.3732522796352584) internal successors, (2259), 1646 states have internal predecessors, (2259), 756 states have call successors, (756), 103 states have call predecessors, (756), 102 states have return successors, (754), 754 states have call predecessors, (754), 754 states have call successors, (754) [2025-03-03 13:52:22,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 3769 transitions. [2025-03-03 13:52:22,114 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 3769 transitions. Word has length 87 [2025-03-03 13:52:22,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:52:22,114 INFO L471 AbstractCegarLoop]: Abstraction has 2504 states and 3769 transitions. [2025-03-03 13:52:22,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 20 states have internal predecessors, (68), 8 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (22), 8 states have call predecessors, (22), 8 states have call successors, (22) [2025-03-03 13:52:22,114 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 3769 transitions. [2025-03-03 13:52:22,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 13:52:22,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:52:22,116 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:52:22,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-03 13:52:22,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:52:22,318 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:52:22,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:52:22,319 INFO L85 PathProgramCache]: Analyzing trace with hash -992822478, now seen corresponding path program 1 times [2025-03-03 13:52:22,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:52:22,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769371296] [2025-03-03 13:52:22,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:52:22,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:52:22,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 13:52:22,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 13:52:22,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:52:22,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:52:22,500 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 24 proven. 44 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-03 13:52:22,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:52:22,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769371296] [2025-03-03 13:52:22,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769371296] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:52:22,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971447301] [2025-03-03 13:52:22,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:52:22,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:52:22,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:52:22,503 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:52:22,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-03 13:52:22,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 13:52:22,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 13:52:22,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:52:22,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:52:22,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-03 13:52:22,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:52:22,623 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 24 proven. 108 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-03 13:52:22,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:52:22,739 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 24 proven. 44 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-03 13:52:22,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971447301] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:52:22,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:52:22,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 13 [2025-03-03 13:52:22,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129973998] [2025-03-03 13:52:22,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:52:22,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 13:52:22,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:52:22,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 13:52:22,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2025-03-03 13:52:22,740 INFO L87 Difference]: Start difference. First operand 2504 states and 3769 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 4 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-03 13:52:24,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:52:24,160 INFO L93 Difference]: Finished difference Result 3452 states and 5331 transitions. [2025-03-03 13:52:24,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 13:52:24,160 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 4 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 93 [2025-03-03 13:52:24,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:52:24,169 INFO L225 Difference]: With dead ends: 3452 [2025-03-03 13:52:24,169 INFO L226 Difference]: Without dead ends: 2474 [2025-03-03 13:52:24,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 175 SyntacticMatches, 11 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=139, Invalid=241, Unknown=0, NotChecked=0, Total=380 [2025-03-03 13:52:24,171 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 149 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:52:24,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 231 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:52:24,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2025-03-03 13:52:25,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 2467. [2025-03-03 13:52:25,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2467 states, 1612 states have (on average 1.3591811414392059) internal successors, (2191), 1613 states have internal predecessors, (2191), 752 states have call successors, (752), 103 states have call predecessors, (752), 102 states have return successors, (750), 750 states have call predecessors, (750), 750 states have call successors, (750) [2025-03-03 13:52:25,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 3693 transitions. [2025-03-03 13:52:25,551 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 3693 transitions. Word has length 93 [2025-03-03 13:52:25,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:52:25,552 INFO L471 AbstractCegarLoop]: Abstraction has 2467 states and 3693 transitions. [2025-03-03 13:52:25,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 4 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-03 13:52:25,552 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 3693 transitions. [2025-03-03 13:52:25,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 13:52:25,553 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:52:25,553 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:52:25,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-03 13:52:25,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-03 13:52:25,756 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:52:25,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:52:25,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1739702727, now seen corresponding path program 4 times [2025-03-03 13:52:25,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:52:25,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471788297] [2025-03-03 13:52:25,758 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:52:25,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:52:25,762 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 93 statements into 2 equivalence classes. [2025-03-03 13:52:25,772 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 13:52:25,773 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:52:25,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:52:25,948 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 68 proven. 2 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-03 13:52:25,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:52:25,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471788297] [2025-03-03 13:52:25,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471788297] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:52:25,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910160245] [2025-03-03 13:52:25,948 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:52:25,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:52:25,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:52:25,950 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:52:25,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-03 13:52:25,977 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 93 statements into 2 equivalence classes. [2025-03-03 13:52:25,997 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 91 of 93 statements. [2025-03-03 13:52:25,998 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 13:52:25,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:52:26,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-03 13:52:26,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:52:26,768 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 30 proven. 64 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-03 13:52:26,768 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:52:26,941 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 65 proven. 10 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-03-03 13:52:26,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910160245] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:52:26,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:52:26,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19, 8] total 36 [2025-03-03 13:52:26,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589323079] [2025-03-03 13:52:26,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:52:26,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-03 13:52:26,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:52:26,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-03 13:52:26,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1096, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 13:52:26,943 INFO L87 Difference]: Start difference. First operand 2467 states and 3693 transitions. Second operand has 36 states, 36 states have (on average 3.5) internal successors, (126), 33 states have internal predecessors, (126), 11 states have call successors, (30), 4 states have call predecessors, (30), 3 states have return successors, (29), 8 states have call predecessors, (29), 8 states have call successors, (29) [2025-03-03 13:52:32,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:52:32,993 INFO L93 Difference]: Finished difference Result 3199 states and 4719 transitions. [2025-03-03 13:52:32,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2025-03-03 13:52:32,993 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.5) internal successors, (126), 33 states have internal predecessors, (126), 11 states have call successors, (30), 4 states have call predecessors, (30), 3 states have return successors, (29), 8 states have call predecessors, (29), 8 states have call successors, (29) Word has length 93 [2025-03-03 13:52:32,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:52:33,000 INFO L225 Difference]: With dead ends: 3199 [2025-03-03 13:52:33,000 INFO L226 Difference]: Without dead ends: 1592 [2025-03-03 13:52:33,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5460 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2606, Invalid=15754, Unknown=0, NotChecked=0, Total=18360 [2025-03-03 13:52:33,008 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 367 mSDsluCounter, 2218 mSDsCounter, 0 mSdLazyCounter, 4765 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 2411 SdHoareTripleChecker+Invalid, 4963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 4765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-03 13:52:33,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 2411 Invalid, 4963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 4765 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-03 13:52:33,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2025-03-03 13:52:33,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 985. [2025-03-03 13:52:33,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 707 states have (on average 1.123055162659123) internal successors, (794), 714 states have internal predecessors, (794), 175 states have call successors, (175), 103 states have call predecessors, (175), 102 states have return successors, (173), 167 states have call predecessors, (173), 173 states have call successors, (173) [2025-03-03 13:52:33,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1142 transitions. [2025-03-03 13:52:33,307 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1142 transitions. Word has length 93 [2025-03-03 13:52:33,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:52:33,308 INFO L471 AbstractCegarLoop]: Abstraction has 985 states and 1142 transitions. [2025-03-03 13:52:33,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.5) internal successors, (126), 33 states have internal predecessors, (126), 11 states have call successors, (30), 4 states have call predecessors, (30), 3 states have return successors, (29), 8 states have call predecessors, (29), 8 states have call successors, (29) [2025-03-03 13:52:33,308 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1142 transitions. [2025-03-03 13:52:33,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 13:52:33,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:52:33,309 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:52:33,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-03 13:52:33,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-03 13:52:33,513 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:52:33,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:52:33,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1897042790, now seen corresponding path program 2 times [2025-03-03 13:52:33,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:52:33,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102406709] [2025-03-03 13:52:33,513 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:52:33,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:52:33,517 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 94 statements into 2 equivalence classes. [2025-03-03 13:52:33,526 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 13:52:33,527 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:52:33,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:52:33,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1097790201] [2025-03-03 13:52:33,528 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:52:33,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:52:33,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:52:33,529 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:52:33,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-03 13:52:33,555 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 94 statements into 2 equivalence classes. [2025-03-03 13:52:33,587 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 13:52:33,587 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:52:33,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 13:52:33,587 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 13:52:33,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 13:52:33,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 13:52:33,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:52:33,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 13:52:33,637 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 13:52:33,637 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 13:52:33,638 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 13:52:33,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-03-03 13:52:33,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-03 13:52:33,842 INFO L422 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:52:33,872 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 13:52:33,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 01:52:33 BoogieIcfgContainer [2025-03-03 13:52:33,874 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 13:52:33,875 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 13:52:33,875 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 13:52:33,875 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 13:52:33,875 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:51:30" (3/4) ... [2025-03-03 13:52:33,875 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-03 13:52:33,926 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 65. [2025-03-03 13:52:33,985 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 13:52:33,985 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 13:52:33,985 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 13:52:33,986 INFO L158 Benchmark]: Toolchain (without parser) took 63637.20ms. Allocated memory was 201.3MB in the beginning and 1.2GB in the end (delta: 998.2MB). Free memory was 158.6MB in the beginning and 664.3MB in the end (delta: -505.7MB). Peak memory consumption was 491.8MB. Max. memory is 16.1GB. [2025-03-03 13:52:33,986 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:52:33,986 INFO L158 Benchmark]: CACSL2BoogieTranslator took 142.05ms. Allocated memory is still 201.3MB. Free memory was 158.3MB in the beginning and 146.8MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 13:52:33,986 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.99ms. Allocated memory is still 201.3MB. Free memory was 146.8MB in the beginning and 145.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:52:33,986 INFO L158 Benchmark]: Boogie Preprocessor took 28.30ms. Allocated memory is still 201.3MB. Free memory was 145.6MB in the beginning and 144.4MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 13:52:33,986 INFO L158 Benchmark]: IcfgBuilder took 254.46ms. Allocated memory is still 201.3MB. Free memory was 144.4MB in the beginning and 131.0MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 13:52:33,986 INFO L158 Benchmark]: TraceAbstraction took 63071.26ms. Allocated memory was 201.3MB in the beginning and 1.2GB in the end (delta: 998.2MB). Free memory was 130.4MB in the beginning and 676.9MB in the end (delta: -546.5MB). Peak memory consumption was 458.2MB. Max. memory is 16.1GB. [2025-03-03 13:52:33,987 INFO L158 Benchmark]: Witness Printer took 110.67ms. Allocated memory is still 1.2GB. Free memory was 672.7MB in the beginning and 664.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 13:52:33,987 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 142.05ms. Allocated memory is still 201.3MB. Free memory was 158.3MB in the beginning and 146.8MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.99ms. Allocated memory is still 201.3MB. Free memory was 146.8MB in the beginning and 145.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.30ms. Allocated memory is still 201.3MB. Free memory was 145.6MB in the beginning and 144.4MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 254.46ms. Allocated memory is still 201.3MB. Free memory was 144.4MB in the beginning and 131.0MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 63071.26ms. Allocated memory was 201.3MB in the beginning and 1.2GB in the end (delta: 998.2MB). Free memory was 130.4MB in the beginning and 676.9MB in the end (delta: -546.5MB). Peak memory consumption was 458.2MB. Max. memory is 16.1GB. * Witness Printer took 110.67ms. Allocated memory is still 1.2GB. Free memory was 672.7MB in the beginning and 664.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int counter = 0; VAL [counter=0] [L20] int x, y; [L21] long long a, b, p, q, r, s; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L24] CALL assume_abort_if_not(x >= 1) VAL [\old(cond)=1, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L24] RET assume_abort_if_not(x >= 1) VAL [counter=0, x=3, y=5] [L25] CALL assume_abort_if_not(y >= 1) VAL [\old(cond)=1, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L25] RET assume_abort_if_not(y >= 1) VAL [counter=0, x=3, y=5] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 VAL [a=3, b=5, counter=0, p=1, q=0, r=0, s=1, x=3, y=5] [L34] COND TRUE counter++<10 [L34] EXPR counter++ VAL [a=3, b=5, counter=1, p=1, q=0, r=0, s=1, x=3, y=5] [L34] COND TRUE counter++<10 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [a=3, b=5, c=3, counter=1, k=0, p=1, q=0, r=0, s=1, x=3, y=5] [L41] COND TRUE counter++<10 [L41] EXPR counter++ VAL [a=3, b=5, c=3, counter=2, k=0, p=1, q=0, r=0, s=1, x=3, y=5] [L41] COND TRUE counter++<10 [L42] COND TRUE !(c >= b) VAL [a=3, b=5, c=3, counter=2, k=0, p=1, q=0, r=0, s=1, x=3, y=5] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k [L34] COND TRUE counter++<10 [L34] EXPR counter++ VAL [a=5, b=3, counter=3, p=0, q=1, r=1, s=0, x=3, y=5] [L34] COND TRUE counter++<10 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [a=5, b=3, c=5, counter=3, k=0, p=0, q=1, r=1, s=0, x=3, y=5] [L41] COND TRUE counter++<10 [L41] EXPR counter++ VAL [a=5, b=3, c=5, counter=4, k=0, p=0, q=1, r=1, s=0, x=3, y=5] [L41] COND TRUE counter++<10 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [a=5, b=3, c=5, counter=4, d=1, k=0, p=0, q=1, r=1, s=0, v=3, x=3, y=5] [L48] COND TRUE counter++<10 [L48] EXPR counter++ VAL [a=5, b=3, c=5, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, v=3, x=3, y=5] [L48] COND TRUE counter++<10 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=5, b=3, c=5, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, v=3, x=3, y=5] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=5, b=3, c=5, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, v=3, x=3, y=5] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [a=5, b=3, c=5, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, v=3, x=3, y=5] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L52] RET __VERIFIER_assert(v == b * d) VAL [a=5, b=3, c=5, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, v=3, x=3, y=5] [L54] COND TRUE !(c >= 2 * v) VAL [a=5, b=3, c=5, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, v=3, x=3, y=5] [L59] c = c - v [L60] k = k + d [L41] COND TRUE counter++<10 [L41] EXPR counter++ VAL [a=5, b=3, c=2, counter=6, k=1, p=0, q=1, r=1, s=0, x=3, y=5] [L41] COND TRUE counter++<10 [L42] COND TRUE !(c >= b) VAL [a=5, b=3, c=2, counter=6, k=1, p=0, q=1, r=1, s=0, x=3, y=5] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k [L34] COND TRUE counter++<10 [L34] EXPR counter++ VAL [a=3, b=2, counter=7, p=1, q=-1, r=0, s=1, x=3, y=5] [L34] COND TRUE counter++<10 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [a=3, b=2, c=3, counter=7, k=0, p=1, q=-1, r=0, s=1, x=3, y=5] [L41] COND TRUE counter++<10 [L41] EXPR counter++ VAL [a=3, b=2, c=3, counter=8, k=0, p=1, q=-1, r=0, s=1, x=3, y=5] [L41] COND TRUE counter++<10 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [a=3, b=2, c=3, counter=8, d=1, k=0, p=1, q=-1, r=0, s=1, v=2, x=3, y=5] [L48] COND TRUE counter++<10 [L48] EXPR counter++ VAL [a=3, b=2, c=3, counter=9, d=1, k=0, p=1, q=-1, r=0, s=1, v=2, x=3, y=5] [L48] COND TRUE counter++<10 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=3, b=2, c=3, counter=9, d=1, k=0, p=1, q=-1, r=0, s=1, v=2, x=3, y=5] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=3, b=2, c=3, counter=9, d=1, k=0, p=1, q=-1, r=0, s=1, v=2, x=3, y=5] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [a=3, b=2, c=3, counter=9, d=1, k=0, p=1, q=-1, r=0, s=1, v=2, x=3, y=5] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L52] RET __VERIFIER_assert(v == b * d) VAL [a=3, b=2, c=3, counter=9, d=1, k=0, p=1, q=-1, r=0, s=1, v=2, x=3, y=5] [L54] COND TRUE !(c >= 2 * v) VAL [a=3, b=2, c=3, counter=9, d=1, k=0, p=1, q=-1, r=0, s=1, v=2, x=3, y=5] [L59] c = c - v [L60] k = k + d [L41] COND TRUE counter++<10 [L41] EXPR counter++ VAL [a=3, b=2, c=1, counter=10, k=1, p=1, q=-1, r=0, s=1, x=3, y=5] [L41] COND TRUE counter++<10 [L42] COND TRUE !(c >= b) VAL [a=3, b=2, c=1, counter=10, k=1, p=1, q=-1, r=0, s=1, x=3, y=5] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k [L34] COND TRUE counter++<10 [L34] EXPR counter++ VAL [a=2, b=1, counter=11, p=-1, q=2, r=1, s=-1, x=3, y=5] [L34] COND FALSE !(counter++<10) [L73] CALL __VERIFIER_assert(p*x - q*x + r*y - s*y == a) VAL [\old(cond)=0, counter=11] [L11] COND TRUE !(cond) VAL [\old(cond)=0, counter=11] [L13] reach_error() VAL [\old(cond)=0, counter=11] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 63.0s, OverallIterations: 28, TraceHistogramMax: 11, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 42.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 3234 SdHoareTripleChecker+Valid, 21.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3165 mSDsluCounter, 11514 SdHoareTripleChecker+Invalid, 20.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10080 mSDsCounter, 1586 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10281 IncrementalHoareTripleChecker+Invalid, 11868 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1586 mSolverCounterUnsat, 1434 mSDtfsCounter, 10281 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2417 GetRequests, 1764 SyntacticMatches, 26 SemanticMatches, 627 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11967 ImplicationChecksByTransitivity, 16.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2504occurred in iteration=25, InterpolantAutomatonStates: 534, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.1s AutomataMinimizationTime, 27 MinimizatonAttempts, 2162 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 2596 NumberOfCodeBlocks, 2579 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 2501 ConstructedInterpolants, 16 QuantifiedInterpolants, 15863 SizeOfPredicates, 61 NumberOfNonLiveVariables, 3287 ConjunctsInSsa, 522 ConjunctsInUnsatCore, 49 InterpolantComputations, 12 PerfectInterpolantSequences, 2652/3340 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-03 13:52:34,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE