/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/recursive-simple/fibo_7-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 23:00:03,949 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 23:00:03,999 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 23:00:04,001 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 23:00:04,002 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 23:00:04,015 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 23:00:04,015 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 23:00:04,016 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 23:00:04,016 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 23:00:04,016 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 23:00:04,016 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 23:00:04,017 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 23:00:04,017 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 23:00:04,017 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 23:00:04,017 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 23:00:04,018 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 23:00:04,018 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 23:00:04,018 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 23:00:04,018 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 23:00:04,018 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 23:00:04,019 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 23:00:04,019 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 23:00:04,019 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 23:00:04,020 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 23:00:04,020 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 23:00:04,020 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 23:00:04,020 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 23:00:04,020 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 23:00:04,021 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 23:00:04,021 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 23:00:04,021 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 23:00:04,021 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 23:00:04,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 23:00:04,022 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 23:00:04,022 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 23:00:04,022 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 23:00:04,022 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 23:00:04,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 23:00:04,022 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 23:00:04,023 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 23:00:04,023 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 23:00:04,024 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 23:00:04,024 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 23:00:04,024 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: Use bitabs translation -> true [2023-12-15 23:00:04,203 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 23:00:04,220 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 23:00:04,222 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 23:00:04,222 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 23:00:04,226 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 23:00:04,227 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_7-2.c [2023-12-15 23:00:05,180 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 23:00:05,309 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 23:00:05,310 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_7-2.c [2023-12-15 23:00:05,314 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eafdabe58/bc4cf04e9ef1457e94f5d51d90181990/FLAG1f5165d0c [2023-12-15 23:00:05,323 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eafdabe58/bc4cf04e9ef1457e94f5d51d90181990 [2023-12-15 23:00:05,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 23:00:05,326 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 23:00:05,328 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 23:00:05,328 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 23:00:05,331 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 23:00:05,332 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 11:00:05" (1/1) ... [2023-12-15 23:00:05,332 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7793c8b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:00:05, skipping insertion in model container [2023-12-15 23:00:05,333 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 11:00:05" (1/1) ... [2023-12-15 23:00:05,348 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 23:00:05,446 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_7-2.c[741,754] [2023-12-15 23:00:05,448 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 23:00:05,455 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 23:00:05,467 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_7-2.c[741,754] [2023-12-15 23:00:05,468 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 23:00:05,478 INFO L206 MainTranslator]: Completed translation [2023-12-15 23:00:05,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:00:05 WrapperNode [2023-12-15 23:00:05,479 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 23:00:05,479 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 23:00:05,480 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 23:00:05,480 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 23:00:05,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:00:05" (1/1) ... [2023-12-15 23:00:05,488 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:00:05" (1/1) ... [2023-12-15 23:00:05,501 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2023-12-15 23:00:05,502 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 23:00:05,502 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 23:00:05,502 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 23:00:05,502 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 23:00:05,509 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:00:05" (1/1) ... [2023-12-15 23:00:05,509 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:00:05" (1/1) ... [2023-12-15 23:00:05,510 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:00:05" (1/1) ... [2023-12-15 23:00:05,517 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]. [2023-12-15 23:00:05,517 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:00:05" (1/1) ... [2023-12-15 23:00:05,517 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:00:05" (1/1) ... [2023-12-15 23:00:05,519 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:00:05" (1/1) ... [2023-12-15 23:00:05,520 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:00:05" (1/1) ... [2023-12-15 23:00:05,520 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:00:05" (1/1) ... [2023-12-15 23:00:05,521 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:00:05" (1/1) ... [2023-12-15 23:00:05,522 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 23:00:05,522 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 23:00:05,522 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 23:00:05,522 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 23:00:05,523 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:00:05" (1/1) ... [2023-12-15 23:00:05,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 23:00:05,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:00:05,546 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) [2023-12-15 23:00:05,548 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 [2023-12-15 23:00:05,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 23:00:05,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 23:00:05,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 23:00:05,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 23:00:05,565 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2023-12-15 23:00:05,566 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2023-12-15 23:00:05,605 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 23:00:05,606 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 23:00:05,681 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 23:00:05,701 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 23:00:05,701 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-15 23:00:05,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 11:00:05 BoogieIcfgContainer [2023-12-15 23:00:05,702 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 23:00:05,729 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 23:00:05,730 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 23:00:05,732 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 23:00:05,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 11:00:05" (1/3) ... [2023-12-15 23:00:05,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f515ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 11:00:05, skipping insertion in model container [2023-12-15 23:00:05,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:00:05" (2/3) ... [2023-12-15 23:00:05,733 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f515ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 11:00:05, skipping insertion in model container [2023-12-15 23:00:05,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 11:00:05" (3/3) ... [2023-12-15 23:00:05,734 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_7-2.c [2023-12-15 23:00:05,747 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 23:00:05,747 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 23:00:05,777 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 23:00:05,782 INFO L357 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, mHoare=true, 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;@7dc92fe3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 23:00:05,783 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 23:00:05,786 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-15 23:00:05,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-15 23:00:05,791 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:00:05,792 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:00:05,792 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:00:05,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:00:05,795 INFO L85 PathProgramCache]: Analyzing trace with hash -798924922, now seen corresponding path program 1 times [2023-12-15 23:00:05,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:00:05,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529113186] [2023-12-15 23:00:05,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:00:05,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:00:05,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:05,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 23:00:05,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:05,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:00:05,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:00:05,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529113186] [2023-12-15 23:00:05,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529113186] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:00:05,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:00:05,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 23:00:05,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110144533] [2023-12-15 23:00:05,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:00:05,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 23:00:05,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:00:05,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 23:00:05,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 23:00:05,990 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-15 23:00:06,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:00:06,027 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2023-12-15 23:00:06,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 23:00:06,031 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2023-12-15 23:00:06,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:00:06,036 INFO L225 Difference]: With dead ends: 26 [2023-12-15 23:00:06,036 INFO L226 Difference]: Without dead ends: 17 [2023-12-15 23:00:06,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 23:00:06,040 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 23:00:06,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 60 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 23:00:06,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-15 23:00:06,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-12-15 23:00:06,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-15 23:00:06,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2023-12-15 23:00:06,063 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2023-12-15 23:00:06,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:00:06,063 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2023-12-15 23:00:06,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-15 23:00:06,064 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2023-12-15 23:00:06,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-15 23:00:06,065 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:00:06,065 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:00:06,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 23:00:06,065 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:00:06,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:00:06,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1717873930, now seen corresponding path program 1 times [2023-12-15 23:00:06,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:00:06,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406080591] [2023-12-15 23:00:06,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:00:06,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:00:06,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:06,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 23:00:06,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:06,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:00:06,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:00:06,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406080591] [2023-12-15 23:00:06,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406080591] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:00:06,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:00:06,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 23:00:06,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2894181] [2023-12-15 23:00:06,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:00:06,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 23:00:06,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:00:06,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 23:00:06,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 23:00:06,135 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-15 23:00:06,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:00:06,154 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2023-12-15 23:00:06,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 23:00:06,157 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2023-12-15 23:00:06,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:00:06,157 INFO L225 Difference]: With dead ends: 23 [2023-12-15 23:00:06,157 INFO L226 Difference]: Without dead ends: 19 [2023-12-15 23:00:06,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 23:00:06,159 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 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 [2023-12-15 23:00:06,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 23:00:06,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-12-15 23:00:06,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2023-12-15 23:00:06,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-15 23:00:06,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2023-12-15 23:00:06,163 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2023-12-15 23:00:06,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:00:06,163 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2023-12-15 23:00:06,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-15 23:00:06,164 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2023-12-15 23:00:06,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-15 23:00:06,164 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:00:06,164 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:00:06,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 23:00:06,165 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:00:06,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:00:06,165 INFO L85 PathProgramCache]: Analyzing trace with hash 913644549, now seen corresponding path program 1 times [2023-12-15 23:00:06,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:00:06,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850323826] [2023-12-15 23:00:06,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:00:06,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:00:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:06,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 23:00:06,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:06,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 23:00:06,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:06,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-15 23:00:06,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:06,284 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-15 23:00:06,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:00:06,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850323826] [2023-12-15 23:00:06,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850323826] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 23:00:06,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782664873] [2023-12-15 23:00:06,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:00:06,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:00:06,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:00:06,293 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) [2023-12-15 23:00:06,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-15 23:00:06,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:06,335 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-15 23:00:06,339 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 23:00:06,421 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-15 23:00:06,422 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 23:00:06,611 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-15 23:00:06,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782664873] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 23:00:06,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 23:00:06,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2023-12-15 23:00:06,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703205173] [2023-12-15 23:00:06,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 23:00:06,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-15 23:00:06,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:00:06,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-15 23:00:06,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-12-15 23:00:06,633 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 12 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 12 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-15 23:00:06,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:00:06,726 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2023-12-15 23:00:06,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 23:00:06,726 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 12 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 22 [2023-12-15 23:00:06,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:00:06,728 INFO L225 Difference]: With dead ends: 34 [2023-12-15 23:00:06,728 INFO L226 Difference]: Without dead ends: 19 [2023-12-15 23:00:06,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2023-12-15 23:00:06,733 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 31 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 23:00:06,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 38 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 23:00:06,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-12-15 23:00:06,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-12-15 23:00:06,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 14 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-15 23:00:06,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2023-12-15 23:00:06,753 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 22 [2023-12-15 23:00:06,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:00:06,754 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2023-12-15 23:00:06,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 12 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-15 23:00:06,754 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2023-12-15 23:00:06,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-15 23:00:06,768 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:00:06,771 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:00:06,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-15 23:00:06,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:00:06,976 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:00:06,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:00:06,977 INFO L85 PathProgramCache]: Analyzing trace with hash -252103063, now seen corresponding path program 1 times [2023-12-15 23:00:06,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:00:06,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726751076] [2023-12-15 23:00:06,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:00:06,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:00:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:07,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 23:00:07,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:07,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 23:00:07,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:07,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 23:00:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:07,114 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-15 23:00:07,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:00:07,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726751076] [2023-12-15 23:00:07,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726751076] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 23:00:07,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375500657] [2023-12-15 23:00:07,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:00:07,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:00:07,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:00:07,117 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) [2023-12-15 23:00:07,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-15 23:00:07,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:07,145 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-15 23:00:07,146 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 23:00:07,168 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-15 23:00:07,168 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 23:00:07,290 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-15 23:00:07,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375500657] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 23:00:07,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 23:00:07,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 11 [2023-12-15 23:00:07,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890327319] [2023-12-15 23:00:07,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 23:00:07,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-15 23:00:07,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:00:07,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-15 23:00:07,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-12-15 23:00:07,297 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 11 states, 9 states have (on average 3.0) internal successors, (27), 11 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-15 23:00:07,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:00:07,356 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2023-12-15 23:00:07,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 23:00:07,357 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.0) internal successors, (27), 11 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) Word has length 23 [2023-12-15 23:00:07,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:00:07,372 INFO L225 Difference]: With dead ends: 37 [2023-12-15 23:00:07,372 INFO L226 Difference]: Without dead ends: 33 [2023-12-15 23:00:07,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2023-12-15 23:00:07,373 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 24 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 23:00:07,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 42 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 23:00:07,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-15 23:00:07,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-12-15 23:00:07,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2023-12-15 23:00:07,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2023-12-15 23:00:07,381 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 23 [2023-12-15 23:00:07,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:00:07,381 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2023-12-15 23:00:07,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.0) internal successors, (27), 11 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-15 23:00:07,382 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2023-12-15 23:00:07,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-15 23:00:07,384 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:00:07,384 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:00:07,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-15 23:00:07,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-12-15 23:00:07,590 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:00:07,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:00:07,591 INFO L85 PathProgramCache]: Analyzing trace with hash 659330, now seen corresponding path program 2 times [2023-12-15 23:00:07,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:00:07,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601458912] [2023-12-15 23:00:07,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:00:07,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:00:07,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:07,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 23:00:07,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:07,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 23:00:07,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:07,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 23:00:07,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:07,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 23:00:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:07,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 23:00:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:07,773 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-15 23:00:07,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:00:07,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601458912] [2023-12-15 23:00:07,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601458912] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 23:00:07,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018182089] [2023-12-15 23:00:07,776 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-15 23:00:07,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:00:07,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:00:07,780 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) [2023-12-15 23:00:07,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-15 23:00:07,811 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-15 23:00:07,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-15 23:00:07,811 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-15 23:00:07,813 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 23:00:07,883 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-12-15 23:00:07,883 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 23:00:08,120 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-15 23:00:08,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018182089] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 23:00:08,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 23:00:08,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 17 [2023-12-15 23:00:08,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312157439] [2023-12-15 23:00:08,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 23:00:08,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-15 23:00:08,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:00:08,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-15 23:00:08,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2023-12-15 23:00:08,124 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand has 17 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 17 states have internal predecessors, (43), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) [2023-12-15 23:00:08,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:00:08,239 INFO L93 Difference]: Finished difference Result 68 states and 105 transitions. [2023-12-15 23:00:08,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 23:00:08,239 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 17 states have internal predecessors, (43), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) Word has length 36 [2023-12-15 23:00:08,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:00:08,240 INFO L225 Difference]: With dead ends: 68 [2023-12-15 23:00:08,240 INFO L226 Difference]: Without dead ends: 37 [2023-12-15 23:00:08,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2023-12-15 23:00:08,242 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 31 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 23:00:08,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 67 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 23:00:08,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-12-15 23:00:08,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-12-15 23:00:08,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2023-12-15 23:00:08,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2023-12-15 23:00:08,246 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 36 [2023-12-15 23:00:08,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:00:08,247 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2023-12-15 23:00:08,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 17 states have internal predecessors, (43), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) [2023-12-15 23:00:08,247 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2023-12-15 23:00:08,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-15 23:00:08,248 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:00:08,249 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1] [2023-12-15 23:00:08,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-15 23:00:08,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:00:08,455 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:00:08,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:00:08,456 INFO L85 PathProgramCache]: Analyzing trace with hash -867130448, now seen corresponding path program 3 times [2023-12-15 23:00:08,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:00:08,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376051004] [2023-12-15 23:00:08,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:00:08,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:00:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:08,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 23:00:08,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:08,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 23:00:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:08,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 23:00:08,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:08,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 23:00:08,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:08,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 23:00:08,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:08,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 23:00:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:08,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-15 23:00:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:08,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 23:00:08,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:08,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 23:00:08,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:08,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 23:00:08,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:08,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 23:00:08,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:08,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 23:00:08,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:08,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-15 23:00:08,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:08,786 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2023-12-15 23:00:08,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:00:08,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376051004] [2023-12-15 23:00:08,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376051004] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 23:00:08,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394493033] [2023-12-15 23:00:08,786 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-15 23:00:08,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:00:08,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:00:08,794 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) [2023-12-15 23:00:08,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-15 23:00:08,960 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2023-12-15 23:00:08,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-15 23:00:08,961 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-15 23:00:08,966 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 23:00:09,017 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 174 proven. 17 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2023-12-15 23:00:09,018 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 23:00:09,286 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 174 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-12-15 23:00:09,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394493033] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 23:00:09,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 23:00:09,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 9] total 19 [2023-12-15 23:00:09,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628362975] [2023-12-15 23:00:09,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 23:00:09,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-15 23:00:09,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:00:09,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-15 23:00:09,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2023-12-15 23:00:09,289 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 19 states have internal predecessors, (51), 9 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) [2023-12-15 23:00:09,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:00:09,463 INFO L93 Difference]: Finished difference Result 88 states and 132 transitions. [2023-12-15 23:00:09,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-15 23:00:09,465 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 19 states have internal predecessors, (51), 9 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) Word has length 92 [2023-12-15 23:00:09,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:00:09,469 INFO L225 Difference]: With dead ends: 88 [2023-12-15 23:00:09,469 INFO L226 Difference]: Without dead ends: 52 [2023-12-15 23:00:09,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 196 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=234, Invalid=636, Unknown=0, NotChecked=0, Total=870 [2023-12-15 23:00:09,471 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 47 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 23:00:09,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 89 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 23:00:09,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-12-15 23:00:09,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2023-12-15 23:00:09,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 33 states have internal predecessors, (38), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (16), 9 states have call predecessors, (16), 8 states have call successors, (16) [2023-12-15 23:00:09,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2023-12-15 23:00:09,481 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 92 [2023-12-15 23:00:09,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:00:09,481 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2023-12-15 23:00:09,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 19 states have internal predecessors, (51), 9 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) [2023-12-15 23:00:09,481 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2023-12-15 23:00:09,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-15 23:00:09,482 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:00:09,482 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1] [2023-12-15 23:00:09,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-15 23:00:09,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:00:09,690 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:00:09,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:00:09,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1696376591, now seen corresponding path program 4 times [2023-12-15 23:00:09,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:00:09,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283730785] [2023-12-15 23:00:09,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:00:09,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:00:09,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:09,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 23:00:09,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:09,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 23:00:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:09,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 23:00:09,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:09,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 23:00:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:10,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 23:00:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:10,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 23:00:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:10,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 23:00:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:10,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-15 23:00:10,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:10,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 23:00:10,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:10,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 23:00:10,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:10,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 23:00:10,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:10,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 23:00:10,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:10,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 23:00:10,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:10,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 23:00:10,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:10,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 23:00:10,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:10,074 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2023-12-15 23:00:10,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:00:10,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283730785] [2023-12-15 23:00:10,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283730785] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 23:00:10,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401875993] [2023-12-15 23:00:10,075 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-15 23:00:10,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:00:10,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:00:10,076 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) [2023-12-15 23:00:10,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-15 23:00:10,136 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-15 23:00:10,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-15 23:00:10,138 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-15 23:00:10,146 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 23:00:10,194 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2023-12-15 23:00:10,194 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 23:00:10,847 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 255 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2023-12-15 23:00:10,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401875993] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 23:00:10,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 23:00:10,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 13] total 20 [2023-12-15 23:00:10,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598817807] [2023-12-15 23:00:10,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 23:00:10,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-15 23:00:10,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:00:10,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-15 23:00:10,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2023-12-15 23:00:10,849 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand has 20 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 20 states have internal predecessors, (53), 17 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (24), 10 states have call predecessors, (24), 17 states have call successors, (24) [2023-12-15 23:00:10,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:00:10,977 INFO L93 Difference]: Finished difference Result 121 states and 171 transitions. [2023-12-15 23:00:10,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 23:00:10,977 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 20 states have internal predecessors, (53), 17 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (24), 10 states have call predecessors, (24), 17 states have call successors, (24) Word has length 105 [2023-12-15 23:00:10,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:00:10,979 INFO L225 Difference]: With dead ends: 121 [2023-12-15 23:00:10,979 INFO L226 Difference]: Without dead ends: 117 [2023-12-15 23:00:10,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 226 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2023-12-15 23:00:10,980 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 34 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 23:00:10,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 74 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 23:00:10,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-12-15 23:00:11,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2023-12-15 23:00:11,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 72 states have (on average 1.1388888888888888) internal successors, (82), 70 states have internal predecessors, (82), 22 states have call successors, (22), 11 states have call predecessors, (22), 13 states have return successors, (49), 26 states have call predecessors, (49), 22 states have call successors, (49) [2023-12-15 23:00:11,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 153 transitions. [2023-12-15 23:00:11,009 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 153 transitions. Word has length 105 [2023-12-15 23:00:11,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:00:11,010 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 153 transitions. [2023-12-15 23:00:11,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 20 states have internal predecessors, (53), 17 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (24), 10 states have call predecessors, (24), 17 states have call successors, (24) [2023-12-15 23:00:11,010 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 153 transitions. [2023-12-15 23:00:11,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-12-15 23:00:11,012 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:00:11,012 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1] [2023-12-15 23:00:11,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-15 23:00:11,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:00:11,222 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:00:11,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:00:11,223 INFO L85 PathProgramCache]: Analyzing trace with hash -2122090202, now seen corresponding path program 5 times [2023-12-15 23:00:11,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:00:11,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397797328] [2023-12-15 23:00:11,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:00:11,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:00:11,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:11,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 23:00:11,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:11,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 23:00:11,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:11,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 23:00:11,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:11,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 23:00:11,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:11,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 23:00:11,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:11,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 23:00:11,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:11,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 23:00:11,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:11,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 23:00:11,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:11,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-15 23:00:11,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:11,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 23:00:11,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:11,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 23:00:11,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:11,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 23:00:11,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:11,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 23:00:11,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:11,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 23:00:11,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:11,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 23:00:11,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:11,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 23:00:11,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:11,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-15 23:00:11,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:11,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 23:00:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:11,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 23:00:11,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:11,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 23:00:11,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:11,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 23:00:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:11,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 23:00:11,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:11,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-15 23:00:11,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:11,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 23:00:11,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:11,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 23:00:11,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:00:11,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2023-12-15 23:00:11,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:00:11,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397797328] [2023-12-15 23:00:11,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397797328] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 23:00:11,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173949654] [2023-12-15 23:00:11,646 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-15 23:00:11,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:00:11,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:00:11,647 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) [2023-12-15 23:00:11,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-15 23:00:11,769 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2023-12-15 23:00:11,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-15 23:00:11,771 INFO L262 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-15 23:00:11,776 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 23:00:11,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 328 proven. 115 refuted. 0 times theorem prover too weak. 1211 trivial. 0 not checked. [2023-12-15 23:00:11,818 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 23:00:12,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 330 proven. 130 refuted. 0 times theorem prover too weak. 1194 trivial. 0 not checked. [2023-12-15 23:00:12,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173949654] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 23:00:12,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 23:00:12,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8, 11] total 20 [2023-12-15 23:00:12,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440602506] [2023-12-15 23:00:12,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 23:00:12,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-15 23:00:12,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:00:12,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-15 23:00:12,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2023-12-15 23:00:12,275 INFO L87 Difference]: Start difference. First operand 108 states and 153 transitions. Second operand has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 20 states have internal predecessors, (52), 13 states have call successors, (17), 1 states have call predecessors, (17), 7 states have return successors, (23), 15 states have call predecessors, (23), 13 states have call successors, (23) [2023-12-15 23:00:12,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:00:12,398 INFO L93 Difference]: Finished difference Result 249 states and 383 transitions. [2023-12-15 23:00:12,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-15 23:00:12,399 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 20 states have internal predecessors, (52), 13 states have call successors, (17), 1 states have call predecessors, (17), 7 states have return successors, (23), 15 states have call predecessors, (23), 13 states have call successors, (23) Word has length 173 [2023-12-15 23:00:12,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:00:12,406 INFO L225 Difference]: With dead ends: 249 [2023-12-15 23:00:12,406 INFO L226 Difference]: Without dead ends: 245 [2023-12-15 23:00:12,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 384 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=271, Unknown=0, NotChecked=0, Total=420 [2023-12-15 23:00:12,407 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 48 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 23:00:12,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 70 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 23:00:12,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2023-12-15 23:00:12,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 233. [2023-12-15 23:00:12,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 152 states have (on average 1.144736842105263) internal successors, (174), 148 states have internal predecessors, (174), 52 states have call successors, (52), 21 states have call predecessors, (52), 28 states have return successors, (135), 63 states have call predecessors, (135), 52 states have call successors, (135) [2023-12-15 23:00:12,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 361 transitions. [2023-12-15 23:00:12,428 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 361 transitions. Word has length 173 [2023-12-15 23:00:12,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:00:12,429 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 361 transitions. [2023-12-15 23:00:12,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 20 states have internal predecessors, (52), 13 states have call successors, (17), 1 states have call predecessors, (17), 7 states have return successors, (23), 15 states have call predecessors, (23), 13 states have call successors, (23) [2023-12-15 23:00:12,429 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 361 transitions. [2023-12-15 23:00:12,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2023-12-15 23:00:12,431 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:00:12,431 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1] [2023-12-15 23:00:12,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-15 23:00:12,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:00:12,638 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:00:12,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:00:12,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1893730074, now seen corresponding path program 6 times [2023-12-15 23:00:12,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:00:12,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829065135] [2023-12-15 23:00:12,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:00:12,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:00:12,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 23:00:12,664 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 23:00:12,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 23:00:12,713 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 23:00:12,713 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 23:00:12,714 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 23:00:12,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 23:00:12,717 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1] [2023-12-15 23:00:12,720 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 23:00:12,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 11:00:12 BoogieIcfgContainer [2023-12-15 23:00:12,781 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 23:00:12,782 INFO L158 Benchmark]: Toolchain (without parser) took 7455.93ms. Allocated memory was 227.5MB in the beginning and 341.8MB in the end (delta: 114.3MB). Free memory was 167.6MB in the beginning and 164.6MB in the end (delta: 3.0MB). Peak memory consumption was 118.3MB. Max. memory is 8.0GB. [2023-12-15 23:00:12,782 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 227.5MB. Free memory is still 177.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 23:00:12,782 INFO L158 Benchmark]: CACSL2BoogieTranslator took 150.70ms. Allocated memory is still 227.5MB. Free memory was 167.6MB in the beginning and 157.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-15 23:00:12,782 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.25ms. Allocated memory is still 227.5MB. Free memory was 157.1MB in the beginning and 155.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-15 23:00:12,782 INFO L158 Benchmark]: Boogie Preprocessor took 19.58ms. Allocated memory is still 227.5MB. Free memory was 155.6MB in the beginning and 154.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 23:00:12,782 INFO L158 Benchmark]: RCFGBuilder took 179.63ms. Allocated memory is still 227.5MB. Free memory was 154.0MB in the beginning and 144.3MB in the end (delta: 9.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-12-15 23:00:12,783 INFO L158 Benchmark]: TraceAbstraction took 7051.91ms. Allocated memory was 284.2MB in the beginning and 341.8MB in the end (delta: 57.7MB). Free memory was 250.9MB in the beginning and 164.6MB in the end (delta: 86.3MB). Peak memory consumption was 144.3MB. Max. memory is 8.0GB. [2023-12-15 23:00:12,784 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.12ms. Allocated memory is still 227.5MB. Free memory is still 177.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 150.70ms. Allocated memory is still 227.5MB. Free memory was 167.6MB in the beginning and 157.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.25ms. Allocated memory is still 227.5MB. Free memory was 157.1MB in the beginning and 155.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.58ms. Allocated memory is still 227.5MB. Free memory was 155.6MB in the beginning and 154.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 179.63ms. Allocated memory is still 227.5MB. Free memory was 154.0MB in the beginning and 144.3MB in the end (delta: 9.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 7051.91ms. Allocated memory was 284.2MB in the beginning and 341.8MB in the end (delta: 57.7MB). Free memory was 250.9MB in the beginning and 164.6MB in the end (delta: 86.3MB). Peak memory consumption was 144.3MB. Max. memory is 8.0GB. * 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: 29]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] int x = 7; VAL [x=7] [L27] CALL, EXPR fibo(x) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, n=7] [L13] return fibo(n-1) + fibo(n-2); [L27] RET, EXPR fibo(x) VAL [x=7] [L27] int result = fibo(x); [L28] COND TRUE result == 13 VAL [result=13, x=7] [L29] reach_error() VAL [result=13, x=7] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 9, TraceHistogramMax: 41, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 245 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 216 mSDsluCounter, 511 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 387 mSDsCounter, 223 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 760 IncrementalHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 223 mSolverCounterUnsat, 124 mSDtfsCounter, 760 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1115 GetRequests, 977 SyntacticMatches, 21 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=233occurred in iteration=8, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 26 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 1203 NumberOfCodeBlocks, 1169 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1352 ConstructedInterpolants, 0 QuantifiedInterpolants, 2508 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1057 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 6385/8169 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! [2023-12-15 23:00:12,814 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...