./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_unwindbound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_unwindbound5.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 6d288c71d1b2e69759b6f9526e6975c86927bb09c8445c07388947e8f3491289 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 18:51:12,839 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 18:51:12,914 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 18:51:12,919 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 18:51:12,920 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 18:51:12,942 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 18:51:12,942 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 18:51:12,943 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 18:51:12,943 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 18:51:12,944 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 18:51:12,944 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 18:51:12,944 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 18:51:12,945 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 18:51:12,948 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 18:51:12,948 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 18:51:12,949 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 18:51:12,949 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 18:51:12,949 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 18:51:12,950 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 18:51:12,950 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 18:51:12,954 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 18:51:12,955 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 18:51:12,955 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 18:51:12,955 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 18:51:12,955 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 18:51:12,956 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 18:51:12,956 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 18:51:12,956 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 18:51:12,956 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 18:51:12,956 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 18:51:12,957 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 18:51:12,957 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 18:51:12,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:51:12,957 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 18:51:12,958 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 18:51:12,958 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 18:51:12,959 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 18:51:12,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 18:51:12,960 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 18:51:12,960 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 18:51:12,961 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 18:51:12,961 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 18:51:12,961 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 6d288c71d1b2e69759b6f9526e6975c86927bb09c8445c07388947e8f3491289 [2024-10-12 18:51:13,212 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 18:51:13,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 18:51:13,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 18:51:13,240 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 18:51:13,240 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 18:51:13,241 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_unwindbound5.c [2024-10-12 18:51:14,646 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 18:51:14,812 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 18:51:14,812 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_unwindbound5.c [2024-10-12 18:51:14,821 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0944aed16/74919f41c70441d29c87c0c2c38477dd/FLAGb5cdfb49c [2024-10-12 18:51:14,836 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0944aed16/74919f41c70441d29c87c0c2c38477dd [2024-10-12 18:51:14,841 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 18:51:14,843 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 18:51:14,846 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 18:51:14,846 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 18:51:14,851 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 18:51:14,851 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:51:14" (1/1) ... [2024-10-12 18:51:14,854 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7980140b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:51:14, skipping insertion in model container [2024-10-12 18:51:14,854 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:51:14" (1/1) ... [2024-10-12 18:51:14,872 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 18:51:15,025 WARN L248 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_unwindbound5.c[490,503] [2024-10-12 18:51:15,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:51:15,053 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 18:51:15,062 WARN L248 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_unwindbound5.c[490,503] [2024-10-12 18:51:15,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:51:15,091 INFO L204 MainTranslator]: Completed translation [2024-10-12 18:51:15,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:51:15 WrapperNode [2024-10-12 18:51:15,092 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 18:51:15,093 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 18:51:15,093 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 18:51:15,093 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 18:51:15,099 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:51:15" (1/1) ... [2024-10-12 18:51:15,104 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:51:15" (1/1) ... [2024-10-12 18:51:15,123 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 94 [2024-10-12 18:51:15,124 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 18:51:15,125 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 18:51:15,125 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 18:51:15,126 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 18:51:15,133 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:51:15" (1/1) ... [2024-10-12 18:51:15,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:51:15" (1/1) ... [2024-10-12 18:51:15,135 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:51:15" (1/1) ... [2024-10-12 18:51:15,146 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]. [2024-10-12 18:51:15,146 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:51:15" (1/1) ... [2024-10-12 18:51:15,146 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:51:15" (1/1) ... [2024-10-12 18:51:15,149 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:51:15" (1/1) ... [2024-10-12 18:51:15,153 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:51:15" (1/1) ... [2024-10-12 18:51:15,153 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:51:15" (1/1) ... [2024-10-12 18:51:15,154 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:51:15" (1/1) ... [2024-10-12 18:51:15,156 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 18:51:15,157 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 18:51:15,157 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 18:51:15,157 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 18:51:15,158 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:51:15" (1/1) ... [2024-10-12 18:51:15,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:51:15,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:51:15,198 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) [2024-10-12 18:51:15,204 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 [2024-10-12 18:51:15,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 18:51:15,250 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-12 18:51:15,250 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-12 18:51:15,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 18:51:15,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 18:51:15,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 18:51:15,251 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-12 18:51:15,253 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-12 18:51:15,322 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 18:51:15,324 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 18:51:15,519 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-10-12 18:51:15,519 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 18:51:15,551 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 18:51:15,551 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-12 18:51:15,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:51:15 BoogieIcfgContainer [2024-10-12 18:51:15,551 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 18:51:15,555 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 18:51:15,555 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 18:51:15,558 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 18:51:15,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 06:51:14" (1/3) ... [2024-10-12 18:51:15,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3953fec6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:51:15, skipping insertion in model container [2024-10-12 18:51:15,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:51:15" (2/3) ... [2024-10-12 18:51:15,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3953fec6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:51:15, skipping insertion in model container [2024-10-12 18:51:15,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:51:15" (3/3) ... [2024-10-12 18:51:15,561 INFO L112 eAbstractionObserver]: Analyzing ICFG egcd3-ll_unwindbound5.c [2024-10-12 18:51:15,577 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 18:51:15,578 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 18:51:15,641 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 18:51:15,650 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;@245e0f09, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 18:51:15,651 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 18:51:15,656 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 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) [2024-10-12 18:51:15,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-12 18:51:15,662 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:51:15,662 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:51:15,663 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:51:15,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:51:15,667 INFO L85 PathProgramCache]: Analyzing trace with hash -832436526, now seen corresponding path program 1 times [2024-10-12 18:51:15,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:51:15,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901469170] [2024-10-12 18:51:15,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:51:15,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:51:15,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:51:15,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:51:15,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:51:15,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:51:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:51:15,835 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:51:15,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:51:15,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901469170] [2024-10-12 18:51:15,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901469170] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:51:15,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:51:15,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 18:51:15,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008236913] [2024-10-12 18:51:15,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:51:15,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 18:51:15,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:51:15,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 18:51:15,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 18:51:15,865 INFO L87 Difference]: Start difference. First operand has 32 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 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 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2024-10-12 18:51:15,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:51:15,900 INFO L93 Difference]: Finished difference Result 62 states and 98 transitions. [2024-10-12 18:51:15,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 18:51:15,902 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 17 [2024-10-12 18:51:15,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:51:15,909 INFO L225 Difference]: With dead ends: 62 [2024-10-12 18:51:15,909 INFO L226 Difference]: Without dead ends: 30 [2024-10-12 18:51:15,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 18:51:15,915 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:51:15,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:51:15,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-12 18:51:15,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-12 18:51:15,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 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) [2024-10-12 18:51:15,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2024-10-12 18:51:15,953 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 17 [2024-10-12 18:51:15,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:51:15,955 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2024-10-12 18:51:15,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2024-10-12 18:51:15,956 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2024-10-12 18:51:15,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-12 18:51:15,957 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:51:15,957 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:51:15,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 18:51:15,958 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:51:15,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:51:15,958 INFO L85 PathProgramCache]: Analyzing trace with hash 958862887, now seen corresponding path program 1 times [2024-10-12 18:51:15,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:51:15,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33578160] [2024-10-12 18:51:15,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:51:15,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:51:15,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:51:16,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:51:16,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:51:16,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:51:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:51:16,143 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:51:16,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:51:16,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33578160] [2024-10-12 18:51:16,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33578160] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:51:16,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:51:16,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 18:51:16,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926370950] [2024-10-12 18:51:16,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:51:16,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 18:51:16,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:51:16,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 18:51:16,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 18:51:16,149 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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) [2024-10-12 18:51:16,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:51:16,181 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2024-10-12 18:51:16,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 18:51:16,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 18 [2024-10-12 18:51:16,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:51:16,184 INFO L225 Difference]: With dead ends: 39 [2024-10-12 18:51:16,185 INFO L226 Difference]: Without dead ends: 32 [2024-10-12 18:51:16,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 18:51:16,187 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 5 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:51:16,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 100 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:51:16,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-12 18:51:16,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-12 18:51:16,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 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) [2024-10-12 18:51:16,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2024-10-12 18:51:16,198 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 18 [2024-10-12 18:51:16,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:51:16,199 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2024-10-12 18:51:16,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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) [2024-10-12 18:51:16,200 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2024-10-12 18:51:16,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-12 18:51:16,200 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:51:16,201 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:51:16,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 18:51:16,201 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:51:16,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:51:16,202 INFO L85 PathProgramCache]: Analyzing trace with hash -359656705, now seen corresponding path program 1 times [2024-10-12 18:51:16,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:51:16,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737062774] [2024-10-12 18:51:16,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:51:16,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:51:16,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:51:16,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:51:16,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:51:16,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:51:16,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:51:16,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 18:51:16,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:51:16,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737062774] [2024-10-12 18:51:16,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737062774] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:51:16,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:51:16,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 18:51:16,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997107438] [2024-10-12 18:51:16,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:51:16,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 18:51:16,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:51:16,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 18:51:16,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:51:16,423 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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) [2024-10-12 18:51:16,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:51:16,536 INFO L93 Difference]: Finished difference Result 52 states and 70 transitions. [2024-10-12 18:51:16,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 18:51:16,540 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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 19 [2024-10-12 18:51:16,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:51:16,541 INFO L225 Difference]: With dead ends: 52 [2024-10-12 18:51:16,541 INFO L226 Difference]: Without dead ends: 45 [2024-10-12 18:51:16,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 18:51:16,543 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 45 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:51:16,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 130 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:51:16,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-12 18:51:16,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 33. [2024-10-12 18:51:16,555 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) [2024-10-12 18:51:16,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2024-10-12 18:51:16,558 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 19 [2024-10-12 18:51:16,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:51:16,559 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2024-10-12 18:51:16,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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) [2024-10-12 18:51:16,559 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2024-10-12 18:51:16,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-12 18:51:16,561 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:51:16,561 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:51:16,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 18:51:16,562 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:51:16,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:51:16,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1735129581, now seen corresponding path program 1 times [2024-10-12 18:51:16,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:51:16,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647732956] [2024-10-12 18:51:16,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:51:16,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:51:16,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:51:16,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:51:16,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:51:16,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:51:16,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:51:16,744 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:51:16,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:51:16,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647732956] [2024-10-12 18:51:16,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647732956] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:51:16,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:51:16,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 18:51:16,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058371458] [2024-10-12 18:51:16,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:51:16,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 18:51:16,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:51:16,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 18:51:16,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:51:16,748 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 18:51:16,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:51:16,799 INFO L93 Difference]: Finished difference Result 57 states and 77 transitions. [2024-10-12 18:51:16,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 18:51:16,802 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-10-12 18:51:16,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:51:16,803 INFO L225 Difference]: With dead ends: 57 [2024-10-12 18:51:16,803 INFO L226 Difference]: Without dead ends: 35 [2024-10-12 18:51:16,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:51:16,805 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 8 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:51:16,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 126 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:51:16,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-12 18:51:16,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-12 18:51:16,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 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) [2024-10-12 18:51:16,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2024-10-12 18:51:16,818 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 24 [2024-10-12 18:51:16,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:51:16,819 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2024-10-12 18:51:16,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 18:51:16,819 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2024-10-12 18:51:16,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-12 18:51:16,822 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:51:16,822 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:51:16,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 18:51:16,822 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:51:16,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:51:16,823 INFO L85 PathProgramCache]: Analyzing trace with hash 150917056, now seen corresponding path program 1 times [2024-10-12 18:51:16,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:51:16,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214138116] [2024-10-12 18:51:16,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:51:16,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:51:16,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 18:51:16,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [452859858] [2024-10-12 18:51:16,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:51:16,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:51:16,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:51:16,853 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) [2024-10-12 18:51:16,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 18:51:16,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:51:16,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 18:51:16,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:51:17,118 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:51:17,122 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 18:51:17,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:51:17,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214138116] [2024-10-12 18:51:17,123 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-12 18:51:17,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452859858] [2024-10-12 18:51:17,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452859858] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:51:17,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:51:17,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 18:51:17,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61515243] [2024-10-12 18:51:17,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:51:17,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 18:51:17,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:51:17,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 18:51:17,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 18:51:17,125 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 18:51:17,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:51:17,182 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2024-10-12 18:51:17,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:51:17,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-10-12 18:51:17,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:51:17,184 INFO L225 Difference]: With dead ends: 53 [2024-10-12 18:51:17,184 INFO L226 Difference]: Without dead ends: 51 [2024-10-12 18:51:17,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:51:17,185 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 9 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:51:17,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 131 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:51:17,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-12 18:51:17,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2024-10-12 18:51:17,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 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) [2024-10-12 18:51:17,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2024-10-12 18:51:17,204 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 67 transitions. Word has length 24 [2024-10-12 18:51:17,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:51:17,204 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 67 transitions. [2024-10-12 18:51:17,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 18:51:17,205 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2024-10-12 18:51:17,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-12 18:51:17,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:51:17,206 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:51:17,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 18:51:17,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:51:17,407 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:51:17,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:51:17,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1833090586, now seen corresponding path program 1 times [2024-10-12 18:51:17,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:51:17,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936345440] [2024-10-12 18:51:17,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:51:17,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:51:17,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:51:17,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:51:17,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:51:17,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:51:17,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:51:17,532 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:51:17,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:51:17,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936345440] [2024-10-12 18:51:17,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936345440] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:51:17,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937443280] [2024-10-12 18:51:17,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:51:17,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:51:17,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:51:17,537 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) [2024-10-12 18:51:17,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 18:51:17,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:51:17,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 18:51:17,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:51:17,641 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:51:17,641 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:51:17,734 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:51:17,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937443280] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:51:17,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:51:17,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 11 [2024-10-12 18:51:17,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677179135] [2024-10-12 18:51:17,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:51:17,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 18:51:17,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:51:17,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 18:51:17,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-10-12 18:51:17,736 INFO L87 Difference]: Start difference. First operand 50 states and 67 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-12 18:51:17,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:51:17,873 INFO L93 Difference]: Finished difference Result 111 states and 143 transitions. [2024-10-12 18:51:17,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 18:51:17,875 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 25 [2024-10-12 18:51:17,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:51:17,878 INFO L225 Difference]: With dead ends: 111 [2024-10-12 18:51:17,879 INFO L226 Difference]: Without dead ends: 104 [2024-10-12 18:51:17,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-10-12 18:51:17,880 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 47 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:51:17,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 217 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:51:17,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-12 18:51:17,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 95. [2024-10-12 18:51:17,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.328358208955224) internal successors, (89), 70 states have internal predecessors, (89), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-12 18:51:17,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 127 transitions. [2024-10-12 18:51:17,902 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 127 transitions. Word has length 25 [2024-10-12 18:51:17,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:51:17,903 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 127 transitions. [2024-10-12 18:51:17,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-12 18:51:17,903 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 127 transitions. [2024-10-12 18:51:17,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-12 18:51:17,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:51:17,904 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:51:17,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 18:51:18,105 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,SelfDestructingSolverStorable5 [2024-10-12 18:51:18,105 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:51:18,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:51:18,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1010868448, now seen corresponding path program 1 times [2024-10-12 18:51:18,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:51:18,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597732256] [2024-10-12 18:51:18,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:51:18,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:51:18,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:51:18,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:51:18,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:51:18,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:51:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:51:18,212 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 18:51:18,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:51:18,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597732256] [2024-10-12 18:51:18,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597732256] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:51:18,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441649256] [2024-10-12 18:51:18,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:51:18,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:51:18,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:51:18,215 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) [2024-10-12 18:51:18,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 18:51:18,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:51:18,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 18:51:18,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:51:18,319 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 18:51:18,319 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:51:18,395 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 18:51:18,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441649256] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:51:18,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:51:18,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 9 [2024-10-12 18:51:18,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176035523] [2024-10-12 18:51:18,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:51:18,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 18:51:18,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:51:18,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 18:51:18,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-12 18:51:18,397 INFO L87 Difference]: Start difference. First operand 95 states and 127 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 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) [2024-10-12 18:51:18,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:51:18,620 INFO L93 Difference]: Finished difference Result 181 states and 258 transitions. [2024-10-12 18:51:18,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 18:51:18,620 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 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 26 [2024-10-12 18:51:18,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:51:18,623 INFO L225 Difference]: With dead ends: 181 [2024-10-12 18:51:18,626 INFO L226 Difference]: Without dead ends: 169 [2024-10-12 18:51:18,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2024-10-12 18:51:18,627 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 112 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 278 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 [2024-10-12 18:51:18,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 278 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:51:18,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-12 18:51:18,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 126. [2024-10-12 18:51:18,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 95 states have (on average 1.3473684210526315) internal successors, (128), 97 states have internal predecessors, (128), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-12 18:51:18,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 173 transitions. [2024-10-12 18:51:18,660 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 173 transitions. Word has length 26 [2024-10-12 18:51:18,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:51:18,661 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 173 transitions. [2024-10-12 18:51:18,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 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) [2024-10-12 18:51:18,663 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 173 transitions. [2024-10-12 18:51:18,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-12 18:51:18,664 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:51:18,664 INFO L215 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] [2024-10-12 18:51:18,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-12 18:51:18,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:51:18,865 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:51:18,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:51:18,866 INFO L85 PathProgramCache]: Analyzing trace with hash 2130442992, now seen corresponding path program 1 times [2024-10-12 18:51:18,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:51:18,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994020680] [2024-10-12 18:51:18,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:51:18,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:51:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 18:51:18,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1058400862] [2024-10-12 18:51:18,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:51:18,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:51:18,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:51:18,880 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) [2024-10-12 18:51:18,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 18:51:18,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:51:18,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 18:51:18,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:51:19,019 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:51:19,019 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 18:51:19,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:51:19,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994020680] [2024-10-12 18:51:19,020 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-12 18:51:19,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058400862] [2024-10-12 18:51:19,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058400862] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:51:19,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:51:19,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 18:51:19,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560463888] [2024-10-12 18:51:19,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:51:19,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 18:51:19,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:51:19,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 18:51:19,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 18:51:19,024 INFO L87 Difference]: Start difference. First operand 126 states and 173 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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) [2024-10-12 18:51:19,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:51:19,077 INFO L93 Difference]: Finished difference Result 141 states and 187 transitions. [2024-10-12 18:51:19,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:51:19,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 29 [2024-10-12 18:51:19,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:51:19,079 INFO L225 Difference]: With dead ends: 141 [2024-10-12 18:51:19,079 INFO L226 Difference]: Without dead ends: 139 [2024-10-12 18:51:19,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:51:19,080 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 9 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:51:19,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 129 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:51:19,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-12 18:51:19,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2024-10-12 18:51:19,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 104 states have (on average 1.3173076923076923) internal successors, (137), 106 states have internal predecessors, (137), 23 states have call successors, (23), 10 states have call predecessors, (23), 10 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-12 18:51:19,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 182 transitions. [2024-10-12 18:51:19,107 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 182 transitions. Word has length 29 [2024-10-12 18:51:19,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:51:19,107 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 182 transitions. [2024-10-12 18:51:19,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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) [2024-10-12 18:51:19,108 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 182 transitions. [2024-10-12 18:51:19,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-12 18:51:19,108 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:51:19,108 INFO L215 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] [2024-10-12 18:51:19,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-12 18:51:19,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:51:19,309 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:51:19,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:51:19,310 INFO L85 PathProgramCache]: Analyzing trace with hash 2110713919, now seen corresponding path program 1 times [2024-10-12 18:51:19,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:51:19,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379530557] [2024-10-12 18:51:19,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:51:19,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:51:19,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 18:51:19,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [448952886] [2024-10-12 18:51:19,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:51:19,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:51:19,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:51:19,325 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) [2024-10-12 18:51:19,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 18:51:19,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:51:19,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-12 18:51:19,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:51:19,513 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:51:19,514 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:51:19,699 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:51:19,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:51:19,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379530557] [2024-10-12 18:51:19,699 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-12 18:51:19,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448952886] [2024-10-12 18:51:19,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448952886] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:51:19,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:51:19,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-10-12 18:51:19,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472897210] [2024-10-12 18:51:19,700 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:51:19,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 18:51:19,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:51:19,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 18:51:19,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 18:51:19,702 INFO L87 Difference]: Start difference. First operand 138 states and 182 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 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) [2024-10-12 18:51:19,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:51:19,925 INFO L93 Difference]: Finished difference Result 173 states and 234 transitions. [2024-10-12 18:51:19,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 18:51:19,925 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 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 31 [2024-10-12 18:51:19,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:51:19,927 INFO L225 Difference]: With dead ends: 173 [2024-10-12 18:51:19,927 INFO L226 Difference]: Without dead ends: 171 [2024-10-12 18:51:19,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-12 18:51:19,928 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 27 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 18:51:19,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 259 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 18:51:19,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-10-12 18:51:19,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 168. [2024-10-12 18:51:19,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 125 states have (on average 1.344) internal successors, (168), 127 states have internal predecessors, (168), 31 states have call successors, (31), 11 states have call predecessors, (31), 11 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-12 18:51:19,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 229 transitions. [2024-10-12 18:51:19,952 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 229 transitions. Word has length 31 [2024-10-12 18:51:19,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:51:19,953 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 229 transitions. [2024-10-12 18:51:19,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 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) [2024-10-12 18:51:19,953 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 229 transitions. [2024-10-12 18:51:19,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-12 18:51:19,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:51:19,954 INFO L215 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] [2024-10-12 18:51:19,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-12 18:51:20,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:51:20,159 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:51:20,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:51:20,159 INFO L85 PathProgramCache]: Analyzing trace with hash -363027956, now seen corresponding path program 1 times [2024-10-12 18:51:20,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:51:20,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277270463] [2024-10-12 18:51:20,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:51:20,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:51:20,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:51:20,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:51:20,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:51:20,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:51:20,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:51:20,238 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:51:20,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:51:20,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277270463] [2024-10-12 18:51:20,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277270463] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:51:20,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:51:20,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 18:51:20,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935635438] [2024-10-12 18:51:20,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:51:20,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 18:51:20,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:51:20,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 18:51:20,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-12 18:51:20,240 INFO L87 Difference]: Start difference. First operand 168 states and 229 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 18:51:20,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:51:20,287 INFO L93 Difference]: Finished difference Result 235 states and 322 transitions. [2024-10-12 18:51:20,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 18:51:20,288 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2024-10-12 18:51:20,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:51:20,290 INFO L225 Difference]: With dead ends: 235 [2024-10-12 18:51:20,290 INFO L226 Difference]: Without dead ends: 168 [2024-10-12 18:51:20,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-12 18:51:20,291 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 7 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:51:20,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 176 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:51:20,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-12 18:51:20,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2024-10-12 18:51:20,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 125 states have (on average 1.336) internal successors, (167), 127 states have internal predecessors, (167), 31 states have call successors, (31), 11 states have call predecessors, (31), 11 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-12 18:51:20,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 228 transitions. [2024-10-12 18:51:20,309 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 228 transitions. Word has length 31 [2024-10-12 18:51:20,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:51:20,309 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 228 transitions. [2024-10-12 18:51:20,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 18:51:20,310 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 228 transitions. [2024-10-12 18:51:20,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-12 18:51:20,310 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:51:20,311 INFO L215 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] [2024-10-12 18:51:20,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 18:51:20,311 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:51:20,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:51:20,311 INFO L85 PathProgramCache]: Analyzing trace with hash -242784896, now seen corresponding path program 1 times [2024-10-12 18:51:20,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:51:20,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006303418] [2024-10-12 18:51:20,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:51:20,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:51:20,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 18:51:20,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1946163201] [2024-10-12 18:51:20,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:51:20,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:51:20,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:51:20,325 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) [2024-10-12 18:51:20,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-12 18:51:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:51:20,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 18:51:20,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:51:20,416 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 18:51:20,417 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 18:51:20,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:51:20,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006303418] [2024-10-12 18:51:20,417 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-12 18:51:20,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946163201] [2024-10-12 18:51:20,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946163201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:51:20,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:51:20,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 18:51:20,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576760091] [2024-10-12 18:51:20,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:51:20,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 18:51:20,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:51:20,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 18:51:20,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 18:51:20,419 INFO L87 Difference]: Start difference. First operand 168 states and 228 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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) [2024-10-12 18:51:20,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:51:20,483 INFO L93 Difference]: Finished difference Result 233 states and 328 transitions. [2024-10-12 18:51:20,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:51:20,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 34 [2024-10-12 18:51:20,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:51:20,507 INFO L225 Difference]: With dead ends: 233 [2024-10-12 18:51:20,508 INFO L226 Difference]: Without dead ends: 231 [2024-10-12 18:51:20,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:51:20,509 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 8 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:51:20,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 121 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:51:20,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-10-12 18:51:20,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 224. [2024-10-12 18:51:20,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 158 states have (on average 1.3670886075949367) internal successors, (216), 160 states have internal predecessors, (216), 51 states have call successors, (51), 14 states have call predecessors, (51), 14 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-12 18:51:20,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 317 transitions. [2024-10-12 18:51:20,541 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 317 transitions. Word has length 34 [2024-10-12 18:51:20,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:51:20,541 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 317 transitions. [2024-10-12 18:51:20,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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) [2024-10-12 18:51:20,541 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 317 transitions. [2024-10-12 18:51:20,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-12 18:51:20,542 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:51:20,542 INFO L215 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] [2024-10-12 18:51:20,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-12 18:51:20,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:51:20,747 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:51:20,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:51:20,747 INFO L85 PathProgramCache]: Analyzing trace with hash -568879, now seen corresponding path program 1 times [2024-10-12 18:51:20,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:51:20,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012317606] [2024-10-12 18:51:20,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:51:20,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:51:20,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 18:51:20,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1644964736] [2024-10-12 18:51:20,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:51:20,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:51:20,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:51:20,766 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) [2024-10-12 18:51:20,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-12 18:51:20,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:51:20,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-12 18:51:20,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:51:21,067 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 18:51:21,067 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:51:21,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:51:21,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012317606] [2024-10-12 18:51:21,119 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-12 18:51:21,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644964736] [2024-10-12 18:51:21,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644964736] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:51:21,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-12 18:51:21,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2024-10-12 18:51:21,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679491165] [2024-10-12 18:51:21,120 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-12 18:51:21,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 18:51:21,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:51:21,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 18:51:21,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-10-12 18:51:21,121 INFO L87 Difference]: Start difference. First operand 224 states and 317 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 18:51:21,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:51:21,325 INFO L93 Difference]: Finished difference Result 236 states and 327 transitions. [2024-10-12 18:51:21,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 18:51:21,326 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2024-10-12 18:51:21,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:51:21,328 INFO L225 Difference]: With dead ends: 236 [2024-10-12 18:51:21,328 INFO L226 Difference]: Without dead ends: 234 [2024-10-12 18:51:21,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-10-12 18:51:21,329 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 55 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 18:51:21,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 301 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 18:51:21,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-10-12 18:51:21,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 232. [2024-10-12 18:51:21,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 164 states have (on average 1.353658536585366) internal successors, (222), 166 states have internal predecessors, (222), 51 states have call successors, (51), 16 states have call predecessors, (51), 16 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-12 18:51:21,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 323 transitions. [2024-10-12 18:51:21,353 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 323 transitions. Word has length 36 [2024-10-12 18:51:21,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:51:21,354 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 323 transitions. [2024-10-12 18:51:21,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 18:51:21,354 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 323 transitions. [2024-10-12 18:51:21,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-12 18:51:21,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:51:21,355 INFO L215 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] [2024-10-12 18:51:21,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-12 18:51:21,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:51:21,556 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:51:21,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:51:21,556 INFO L85 PathProgramCache]: Analyzing trace with hash 895823024, now seen corresponding path program 1 times [2024-10-12 18:51:21,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:51:21,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127658867] [2024-10-12 18:51:21,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:51:21,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:51:21,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 18:51:21,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1516016850] [2024-10-12 18:51:21,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:51:21,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:51:21,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:51:21,570 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) [2024-10-12 18:51:21,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-12 18:51:21,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:51:21,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 18:51:21,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:51:21,682 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-12 18:51:21,682 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 18:51:21,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:51:21,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127658867] [2024-10-12 18:51:21,682 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-12 18:51:21,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516016850] [2024-10-12 18:51:21,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516016850] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:51:21,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:51:21,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 18:51:21,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203258556] [2024-10-12 18:51:21,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:51:21,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 18:51:21,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:51:21,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 18:51:21,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 18:51:21,684 INFO L87 Difference]: Start difference. First operand 232 states and 323 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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) [2024-10-12 18:51:21,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:51:21,751 INFO L93 Difference]: Finished difference Result 306 states and 450 transitions. [2024-10-12 18:51:21,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:51:21,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 39 [2024-10-12 18:51:21,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:51:21,755 INFO L225 Difference]: With dead ends: 306 [2024-10-12 18:51:21,755 INFO L226 Difference]: Without dead ends: 304 [2024-10-12 18:51:21,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:51:21,756 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 5 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:51:21,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 129 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:51:21,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-10-12 18:51:21,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 290. [2024-10-12 18:51:21,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 185 states have (on average 1.3567567567567567) internal successors, (251), 196 states have internal predecessors, (251), 87 states have call successors, (87), 17 states have call predecessors, (87), 17 states have return successors, (86), 76 states have call predecessors, (86), 86 states have call successors, (86) [2024-10-12 18:51:21,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 424 transitions. [2024-10-12 18:51:21,795 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 424 transitions. Word has length 39 [2024-10-12 18:51:21,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:51:21,796 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 424 transitions. [2024-10-12 18:51:21,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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) [2024-10-12 18:51:21,796 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 424 transitions. [2024-10-12 18:51:21,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-12 18:51:21,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:51:21,797 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:51:21,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-12 18:51:21,997 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,SelfDestructingSolverStorable12 [2024-10-12 18:51:21,998 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:51:21,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:51:21,998 INFO L85 PathProgramCache]: Analyzing trace with hash 184539710, now seen corresponding path program 1 times [2024-10-12 18:51:21,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:51:21,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160660422] [2024-10-12 18:51:21,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:51:21,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:51:22,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:51:22,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:51:22,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:51:22,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:51:22,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:51:22,104 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-12 18:51:22,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:51:22,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160660422] [2024-10-12 18:51:22,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160660422] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:51:22,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245451173] [2024-10-12 18:51:22,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:51:22,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:51:22,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:51:22,106 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) [2024-10-12 18:51:22,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-12 18:51:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:51:22,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 18:51:22,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:51:22,196 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-12 18:51:22,197 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:51:22,257 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-12 18:51:22,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245451173] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:51:22,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:51:22,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 11 [2024-10-12 18:51:22,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360092085] [2024-10-12 18:51:22,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:51:22,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 18:51:22,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:51:22,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 18:51:22,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-12 18:51:22,259 INFO L87 Difference]: Start difference. First operand 290 states and 424 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-12 18:51:22,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:51:22,383 INFO L93 Difference]: Finished difference Result 448 states and 669 transitions. [2024-10-12 18:51:22,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 18:51:22,383 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2024-10-12 18:51:22,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:51:22,386 INFO L225 Difference]: With dead ends: 448 [2024-10-12 18:51:22,386 INFO L226 Difference]: Without dead ends: 298 [2024-10-12 18:51:22,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-10-12 18:51:22,388 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 44 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:51:22,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 179 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:51:22,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-10-12 18:51:22,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 294. [2024-10-12 18:51:22,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 189 states have (on average 1.343915343915344) internal successors, (254), 199 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) [2024-10-12 18:51:22,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 427 transitions. [2024-10-12 18:51:22,429 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 427 transitions. Word has length 37 [2024-10-12 18:51:22,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:51:22,430 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 427 transitions. [2024-10-12 18:51:22,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-12 18:51:22,430 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 427 transitions. [2024-10-12 18:51:22,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-12 18:51:22,430 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:51:22,430 INFO L215 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] [2024-10-12 18:51:22,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-12 18:51:22,635 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,SelfDestructingSolverStorable13 [2024-10-12 18:51:22,636 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:51:22,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:51:22,636 INFO L85 PathProgramCache]: Analyzing trace with hash 430274233, now seen corresponding path program 1 times [2024-10-12 18:51:22,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:51:22,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833341367] [2024-10-12 18:51:22,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:51:22,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:51:22,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:51:22,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:51:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:51:22,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:51:22,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:51:22,750 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:51:22,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:51:22,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833341367] [2024-10-12 18:51:22,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833341367] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:51:22,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649870445] [2024-10-12 18:51:22,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:51:22,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:51:22,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:51:22,753 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) [2024-10-12 18:51:22,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-12 18:51:22,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:51:22,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 18:51:22,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:51:22,846 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:51:22,847 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:51:22,924 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:51:22,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649870445] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:51:22,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:51:22,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 10 [2024-10-12 18:51:22,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047806139] [2024-10-12 18:51:22,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:51:22,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 18:51:22,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:51:22,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 18:51:22,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-10-12 18:51:22,926 INFO L87 Difference]: Start difference. First operand 294 states and 427 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 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) [2024-10-12 18:51:23,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:51:23,049 INFO L93 Difference]: Finished difference Result 493 states and 736 transitions. [2024-10-12 18:51:23,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 18:51:23,050 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 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 37 [2024-10-12 18:51:23,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:51:23,052 INFO L225 Difference]: With dead ends: 493 [2024-10-12 18:51:23,052 INFO L226 Difference]: Without dead ends: 300 [2024-10-12 18:51:23,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 70 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-10-12 18:51:23,053 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 41 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:51:23,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 201 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:51:23,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-10-12 18:51:23,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2024-10-12 18:51:23,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 193 states have (on average 1.3264248704663213) internal successors, (256), 203 states have internal predecessors, (256), 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) [2024-10-12 18:51:23,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 429 transitions. [2024-10-12 18:51:23,087 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 429 transitions. Word has length 37 [2024-10-12 18:51:23,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:51:23,088 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 429 transitions. [2024-10-12 18:51:23,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 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) [2024-10-12 18:51:23,088 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 429 transitions. [2024-10-12 18:51:23,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-12 18:51:23,088 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:51:23,089 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:51:23,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-12 18:51:23,289 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,SelfDestructingSolverStorable14 [2024-10-12 18:51:23,289 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:51:23,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:51:23,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1021659443, now seen corresponding path program 2 times [2024-10-12 18:51:23,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:51:23,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870669077] [2024-10-12 18:51:23,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:51:23,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:51:23,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:51:23,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:51:23,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:51:23,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:51:23,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:51:23,357 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-12 18:51:23,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:51:23,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870669077] [2024-10-12 18:51:23,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870669077] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:51:23,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:51:23,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 18:51:23,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932936196] [2024-10-12 18:51:23,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:51:23,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 18:51:23,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:51:23,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 18:51:23,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 18:51:23,359 INFO L87 Difference]: Start difference. First operand 298 states and 429 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 18:51:23,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:51:23,468 INFO L93 Difference]: Finished difference Result 531 states and 808 transitions. [2024-10-12 18:51:23,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 18:51:23,469 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2024-10-12 18:51:23,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:51:23,472 INFO L225 Difference]: With dead ends: 531 [2024-10-12 18:51:23,472 INFO L226 Difference]: Without dead ends: 425 [2024-10-12 18:51:23,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 18:51:23,473 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 29 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:51:23,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 177 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:51:23,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-10-12 18:51:23,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 322. [2024-10-12 18:51:23,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 217 states have (on average 1.336405529953917) internal successors, (290), 227 states have internal predecessors, (290), 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) [2024-10-12 18:51:23,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 463 transitions. [2024-10-12 18:51:23,511 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 463 transitions. Word has length 38 [2024-10-12 18:51:23,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:51:23,511 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 463 transitions. [2024-10-12 18:51:23,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 18:51:23,511 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 463 transitions. [2024-10-12 18:51:23,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-12 18:51:23,512 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:51:23,512 INFO L215 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] [2024-10-12 18:51:23,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 18:51:23,512 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:51:23,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:51:23,513 INFO L85 PathProgramCache]: Analyzing trace with hash -263121925, now seen corresponding path program 1 times [2024-10-12 18:51:23,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:51:23,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280336639] [2024-10-12 18:51:23,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:51:23,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:51:23,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 18:51:23,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1421681572] [2024-10-12 18:51:23,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:51:23,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:51:23,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:51:23,528 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) [2024-10-12 18:51:23,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-12 18:51:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:51:23,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-10-12 18:51:23,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:51:24,341 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-12 18:51:24,342 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:51:26,061 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 18:51:26,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:51:26,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280336639] [2024-10-12 18:51:26,061 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-12 18:51:26,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421681572] [2024-10-12 18:51:26,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421681572] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:51:26,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:51:26,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2024-10-12 18:51:26,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656378913] [2024-10-12 18:51:26,062 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:51:26,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-12 18:51:26,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:51:26,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-12 18:51:26,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2024-10-12 18:51:26,064 INFO L87 Difference]: Start difference. First operand 322 states and 463 transitions. Second operand has 23 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 20 states have internal predecessors, (51), 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) [2024-10-12 18:51:30,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:51:30,192 INFO L93 Difference]: Finished difference Result 684 states and 1059 transitions. [2024-10-12 18:51:30,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-10-12 18:51:30,193 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 20 states have internal predecessors, (51), 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 53 [2024-10-12 18:51:30,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:51:30,197 INFO L225 Difference]: With dead ends: 684 [2024-10-12 18:51:30,197 INFO L226 Difference]: Without dead ends: 676 [2024-10-12 18:51:30,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=548, Invalid=2532, Unknown=0, NotChecked=0, Total=3080 [2024-10-12 18:51:30,199 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 333 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:51:30,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 957 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-12 18:51:30,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2024-10-12 18:51:30,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 414. [2024-10-12 18:51:30,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 284 states have (on average 1.3556338028169015) internal successors, (385), 294 states have internal predecessors, (385), 111 states have call successors, (111), 18 states have call predecessors, (111), 18 states have return successors, (110), 101 states have call predecessors, (110), 110 states have call successors, (110) [2024-10-12 18:51:30,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 606 transitions. [2024-10-12 18:51:30,311 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 606 transitions. Word has length 53 [2024-10-12 18:51:30,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:51:30,311 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 606 transitions. [2024-10-12 18:51:30,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 20 states have internal predecessors, (51), 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) [2024-10-12 18:51:30,311 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 606 transitions. [2024-10-12 18:51:30,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-12 18:51:30,312 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:51:30,312 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:51:30,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-12 18:51:30,513 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,SelfDestructingSolverStorable16 [2024-10-12 18:51:30,513 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:51:30,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:51:30,514 INFO L85 PathProgramCache]: Analyzing trace with hash -771637809, now seen corresponding path program 1 times [2024-10-12 18:51:30,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:51:30,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090132137] [2024-10-12 18:51:30,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:51:30,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:51:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 18:51:30,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [345352686] [2024-10-12 18:51:30,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:51:30,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:51:30,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:51:30,533 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) [2024-10-12 18:51:30,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-12 18:51:30,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 18:51:30,591 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 18:51:30,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 18:51:30,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 18:51:30,651 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 18:51:30,653 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 18:51:30,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-12 18:51:30,855 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,SelfDestructingSolverStorable17 [2024-10-12 18:51:30,859 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:51:30,894 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 18:51:30,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 06:51:30 BoogieIcfgContainer [2024-10-12 18:51:30,897 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 18:51:30,898 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 18:51:30,898 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 18:51:30,898 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 18:51:30,898 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:51:15" (3/4) ... [2024-10-12 18:51:30,899 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-12 18:51:30,973 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 18:51:30,973 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 18:51:30,974 INFO L158 Benchmark]: Toolchain (without parser) took 16130.51ms. Allocated memory was 134.2MB in the beginning and 257.9MB in the end (delta: 123.7MB). Free memory was 81.2MB in the beginning and 161.3MB in the end (delta: -80.0MB). Peak memory consumption was 46.2MB. Max. memory is 16.1GB. [2024-10-12 18:51:30,974 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 134.2MB. Free memory is still 68.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 18:51:30,975 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.70ms. Allocated memory is still 134.2MB. Free memory was 81.2MB in the beginning and 68.5MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 18:51:30,975 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.93ms. Allocated memory is still 134.2MB. Free memory was 68.5MB in the beginning and 66.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 18:51:30,975 INFO L158 Benchmark]: Boogie Preprocessor took 31.05ms. Allocated memory is still 134.2MB. Free memory was 66.8MB in the beginning and 64.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 18:51:30,976 INFO L158 Benchmark]: RCFGBuilder took 395.02ms. Allocated memory was 134.2MB in the beginning and 178.3MB in the end (delta: 44.0MB). Free memory was 64.7MB in the beginning and 142.1MB in the end (delta: -77.4MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2024-10-12 18:51:30,976 INFO L158 Benchmark]: TraceAbstraction took 15342.27ms. Allocated memory was 178.3MB in the beginning and 257.9MB in the end (delta: 79.7MB). Free memory was 141.4MB in the beginning and 165.5MB in the end (delta: -24.1MB). Peak memory consumption was 56.0MB. Max. memory is 16.1GB. [2024-10-12 18:51:30,977 INFO L158 Benchmark]: Witness Printer took 75.70ms. Allocated memory is still 257.9MB. Free memory was 165.5MB in the beginning and 161.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 18:51:30,978 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.16ms. Allocated memory is still 134.2MB. Free memory is still 68.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.70ms. Allocated memory is still 134.2MB. Free memory was 81.2MB in the beginning and 68.5MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.93ms. Allocated memory is still 134.2MB. Free memory was 68.5MB in the beginning and 66.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.05ms. Allocated memory is still 134.2MB. Free memory was 66.8MB in the beginning and 64.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 395.02ms. Allocated memory was 134.2MB in the beginning and 178.3MB in the end (delta: 44.0MB). Free memory was 64.7MB in the beginning and 142.1MB in the end (delta: -77.4MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * TraceAbstraction took 15342.27ms. Allocated memory was 178.3MB in the beginning and 257.9MB in the end (delta: 79.7MB). Free memory was 141.4MB in the beginning and 165.5MB in the end (delta: -24.1MB). Peak memory consumption was 56.0MB. Max. memory is 16.1GB. * Witness Printer took 75.70ms. Allocated memory is still 257.9MB. Free memory was 165.5MB in the beginning and 161.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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; [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=2, y=3] [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=2, y=3] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 VAL [a=2, b=3, counter=0, p=1, q=0, r=0, s=1, x=2, y=3] [L34] EXPR counter++ VAL [a=2, b=3, counter=1, p=1, q=0, r=0, s=1, x=2, y=3] [L34] COND TRUE counter++<5 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [a=2, b=3, c=2, counter=1, k=0, p=1, q=0, r=0, s=1, x=2, y=3] [L41] EXPR counter++ VAL [a=2, b=3, c=2, counter=2, k=0, p=1, q=0, r=0, s=1, x=2, y=3] [L41] COND TRUE counter++<5 [L42] COND TRUE !(c >= b) VAL [a=2, b=3, c=2, counter=2, k=0, p=1, q=0, r=0, s=1, x=2, y=3] [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] EXPR counter++ VAL [a=3, b=2, counter=3, p=0, q=1, r=1, s=0, x=2, y=3] [L34] COND TRUE counter++<5 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [a=3, b=2, c=3, counter=3, k=0, p=0, q=1, r=1, s=0, x=2, y=3] [L41] EXPR counter++ VAL [a=3, b=2, c=3, counter=4, k=0, p=0, q=1, r=1, s=0, x=2, y=3] [L41] COND TRUE counter++<5 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [a=3, b=2, c=3, counter=4, d=1, k=0, p=0, q=1, r=1, s=0, v=2, x=2, y=3] [L48] EXPR counter++ VAL [a=3, b=2, c=3, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, v=2, x=2, y=3] [L48] COND TRUE counter++<5 [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=3, b=2, c=3, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, v=2, x=2, y=3] [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=3, b=2, c=3, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, v=2, x=2, y=3] [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=3, b=2, c=3, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, v=2, x=2, y=3] [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=3, b=2, c=3, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, v=2, x=2, y=3] [L54] COND TRUE !(c >= 2 * v) VAL [a=3, b=2, c=3, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, v=2, x=2, y=3] [L59] c = c - v [L60] k = k + d [L41] EXPR counter++ VAL [a=3, b=2, c=1, counter=6, k=1, p=0, q=1, r=1, s=0, x=2, y=3] [L41] COND FALSE !(counter++<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] EXPR counter++ VAL [a=2, b=1, counter=7, p=1, q=-1, r=0, s=1, x=2, y=3] [L34] COND FALSE !(counter++<5) [L73] CALL __VERIFIER_assert(p*x - q*x + r*y - s*y == a) VAL [\old(cond)=0, counter=7] [L11] COND TRUE !(cond) VAL [\old(cond)=0, counter=7] [L13] reach_error() VAL [\old(cond)=0, counter=7] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.2s, OverallIterations: 18, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 833 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 784 mSDsluCounter, 3651 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2956 mSDsCounter, 233 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1634 IncrementalHoareTripleChecker+Invalid, 1867 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 233 mSolverCounterUnsat, 695 mSDtfsCounter, 1634 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 719 GetRequests, 548 SyntacticMatches, 16 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 864 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=414occurred in iteration=17, InterpolantAutomatonStates: 151, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 17 MinimizatonAttempts, 463 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 1005 NumberOfCodeBlocks, 1005 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 825 ConstructedInterpolants, 16 QuantifiedInterpolants, 3563 SizeOfPredicates, 21 NumberOfNonLiveVariables, 1320 ConjunctsInSsa, 159 ConjunctsInUnsatCore, 27 InterpolantComputations, 10 PerfectInterpolantSequences, 303/396 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 RESULT: Ultimate proved your program to be incorrect! [2024-10-12 18:51:31,003 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