/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 false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-47.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 22:12:51,566 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 22:12:51,633 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-20 22:12:51,637 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 22:12:51,638 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 22:12:51,659 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 22:12:51,660 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 22:12:51,660 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 22:12:51,661 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 22:12:51,664 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 22:12:51,664 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 22:12:51,664 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 22:12:51,664 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 22:12:51,665 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 22:12:51,665 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 22:12:51,666 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 22:12:51,666 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 22:12:51,666 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 22:12:51,666 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 22:12:51,667 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 22:12:51,667 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 22:12:51,667 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 22:12:51,667 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 22:12:51,668 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 22:12:51,668 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 22:12:51,668 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 22:12:51,668 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 22:12:51,668 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 22:12:51,669 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 22:12:51,669 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 22:12:51,669 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 22:12:51,670 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 22:12:51,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 22:12:51,670 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 22:12:51,670 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 22:12:51,670 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 22:12:51,670 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 22:12:51,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 22:12:51,670 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 22:12:51,670 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 22:12:51,671 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 22:12:51,671 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 22:12:51,671 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 22:12:51,671 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 -> false [2023-12-20 22:12:51,879 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 22:12:51,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 22:12:51,895 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 22:12:51,896 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 22:12:51,912 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 22:12:51,913 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-47.i [2023-12-20 22:12:52,956 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 22:12:53,085 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 22:12:53,085 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-47.i [2023-12-20 22:12:53,090 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/126c96f3e/48957900013d4ee4873ea23140c09bcf/FLAG0bf71b44a [2023-12-20 22:12:53,099 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/126c96f3e/48957900013d4ee4873ea23140c09bcf [2023-12-20 22:12:53,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 22:12:53,102 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 22:12:53,102 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 22:12:53,103 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 22:12:53,107 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 22:12:53,107 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 10:12:53" (1/1) ... [2023-12-20 22:12:53,108 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42e46b61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:12:53, skipping insertion in model container [2023-12-20 22:12:53,108 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 10:12:53" (1/1) ... [2023-12-20 22:12:53,125 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 22:12:53,229 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-47.i[916,929] [2023-12-20 22:12:53,252 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 22:12:53,259 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 22:12:53,269 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-47.i[916,929] [2023-12-20 22:12:53,278 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 22:12:53,288 INFO L206 MainTranslator]: Completed translation [2023-12-20 22:12:53,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:12:53 WrapperNode [2023-12-20 22:12:53,289 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 22:12:53,289 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 22:12:53,290 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 22:12:53,290 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 22:12:53,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:12:53" (1/1) ... [2023-12-20 22:12:53,298 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:12:53" (1/1) ... [2023-12-20 22:12:53,312 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 88 [2023-12-20 22:12:53,312 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 22:12:53,313 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 22:12:53,313 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 22:12:53,313 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 22:12:53,320 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:12:53" (1/1) ... [2023-12-20 22:12:53,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:12:53" (1/1) ... [2023-12-20 22:12:53,321 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:12:53" (1/1) ... [2023-12-20 22:12:53,329 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-20 22:12:53,329 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:12:53" (1/1) ... [2023-12-20 22:12:53,329 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:12:53" (1/1) ... [2023-12-20 22:12:53,332 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:12:53" (1/1) ... [2023-12-20 22:12:53,334 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:12:53" (1/1) ... [2023-12-20 22:12:53,335 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:12:53" (1/1) ... [2023-12-20 22:12:53,335 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:12:53" (1/1) ... [2023-12-20 22:12:53,337 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 22:12:53,337 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 22:12:53,337 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 22:12:53,338 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 22:12:53,338 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:12:53" (1/1) ... [2023-12-20 22:12:53,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 22:12:53,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 22:12:53,366 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-20 22:12:53,396 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-20 22:12:53,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 22:12:53,400 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-20 22:12:53,400 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-20 22:12:53,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 22:12:53,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 22:12:53,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 22:12:53,445 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 22:12:53,446 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 22:12:53,629 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 22:12:53,657 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 22:12:53,657 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-20 22:12:53,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 10:12:53 BoogieIcfgContainer [2023-12-20 22:12:53,657 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 22:12:53,659 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 22:12:53,659 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 22:12:53,661 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 22:12:53,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 10:12:53" (1/3) ... [2023-12-20 22:12:53,662 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e5d74bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 10:12:53, skipping insertion in model container [2023-12-20 22:12:53,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:12:53" (2/3) ... [2023-12-20 22:12:53,662 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e5d74bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 10:12:53, skipping insertion in model container [2023-12-20 22:12:53,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 10:12:53" (3/3) ... [2023-12-20 22:12:53,663 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-47.i [2023-12-20 22:12:53,681 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 22:12:53,681 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 22:12:53,710 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 22:12:53,714 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;@3f0bb2fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 22:12:53,714 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 22:12:53,717 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 24 states have (on average 1.5) internal successors, (36), 25 states have internal predecessors, (36), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-20 22:12:53,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-20 22:12:53,725 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:12:53,726 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 22:12:53,726 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:12:53,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:12:53,730 INFO L85 PathProgramCache]: Analyzing trace with hash 205245354, now seen corresponding path program 1 times [2023-12-20 22:12:53,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:12:53,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808918196] [2023-12-20 22:12:53,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:12:53,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:12:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:53,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:12:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:53,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:12:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:53,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:12:53,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:53,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:12:53,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:53,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:12:53,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:53,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 22:12:53,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:53,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 22:12:53,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:53,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 22:12:53,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:53,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 22:12:53,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:53,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 22:12:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:53,951 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-20 22:12:53,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:12:53,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808918196] [2023-12-20 22:12:53,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808918196] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:12:53,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:12:53,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 22:12:53,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250023212] [2023-12-20 22:12:53,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:12:53,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-20 22:12:53,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:12:53,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-20 22:12:53,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 22:12:53,989 INFO L87 Difference]: Start difference. First operand has 37 states, 24 states have (on average 1.5) internal successors, (36), 25 states have internal predecessors, (36), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-20 22:12:54,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:12:54,011 INFO L93 Difference]: Finished difference Result 70 states and 118 transitions. [2023-12-20 22:12:54,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-20 22:12:54,013 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 66 [2023-12-20 22:12:54,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:12:54,017 INFO L225 Difference]: With dead ends: 70 [2023-12-20 22:12:54,017 INFO L226 Difference]: Without dead ends: 34 [2023-12-20 22:12:54,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 22:12:54,022 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 22:12:54,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 22:12:54,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-20 22:12:54,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-12-20 22:12:54,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-20 22:12:54,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2023-12-20 22:12:54,047 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 66 [2023-12-20 22:12:54,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:12:54,047 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2023-12-20 22:12:54,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-20 22:12:54,047 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2023-12-20 22:12:54,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-20 22:12:54,049 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:12:54,049 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 22:12:54,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 22:12:54,050 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:12:54,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:12:54,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1507019096, now seen corresponding path program 1 times [2023-12-20 22:12:54,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:12:54,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9620299] [2023-12-20 22:12:54,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:12:54,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:12:54,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:54,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:12:54,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:54,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:12:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:54,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:12:54,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:54,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:12:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:54,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:12:54,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:54,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 22:12:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:54,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 22:12:54,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:54,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 22:12:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:54,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 22:12:54,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:54,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 22:12:54,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:54,757 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-20 22:12:54,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:12:54,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9620299] [2023-12-20 22:12:54,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9620299] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:12:54,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:12:54,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-20 22:12:54,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152283561] [2023-12-20 22:12:54,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:12:54,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-20 22:12:54,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:12:54,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-20 22:12:54,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-20 22:12:54,765 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-20 22:12:55,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:12:55,003 INFO L93 Difference]: Finished difference Result 61 states and 79 transitions. [2023-12-20 22:12:55,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-20 22:12:55,003 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 66 [2023-12-20 22:12:55,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:12:55,007 INFO L225 Difference]: With dead ends: 61 [2023-12-20 22:12:55,008 INFO L226 Difference]: Without dead ends: 59 [2023-12-20 22:12:55,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2023-12-20 22:12:55,009 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 41 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 22:12:55,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 192 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 22:12:55,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-12-20 22:12:55,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 41. [2023-12-20 22:12:55,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-20 22:12:55,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 57 transitions. [2023-12-20 22:12:55,015 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 57 transitions. Word has length 66 [2023-12-20 22:12:55,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:12:55,016 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 57 transitions. [2023-12-20 22:12:55,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-20 22:12:55,016 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 57 transitions. [2023-12-20 22:12:55,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-20 22:12:55,017 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:12:55,018 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 22:12:55,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 22:12:55,018 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:12:55,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:12:55,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1507078678, now seen corresponding path program 1 times [2023-12-20 22:12:55,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:12:55,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588996325] [2023-12-20 22:12:55,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:12:55,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:12:55,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:55,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:12:55,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:55,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:12:55,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:55,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:12:55,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:55,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:12:55,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:55,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:12:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:55,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 22:12:55,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:55,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 22:12:55,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:55,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 22:12:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:55,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 22:12:55,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:55,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 22:12:55,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:55,388 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-20 22:12:55,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:12:55,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588996325] [2023-12-20 22:12:55,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588996325] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:12:55,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:12:55,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-20 22:12:55,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702043104] [2023-12-20 22:12:55,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:12:55,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-20 22:12:55,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:12:55,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-20 22:12:55,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-20 22:12:55,392 INFO L87 Difference]: Start difference. First operand 41 states and 57 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-20 22:12:55,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:12:55,573 INFO L93 Difference]: Finished difference Result 59 states and 77 transitions. [2023-12-20 22:12:55,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-20 22:12:55,573 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 66 [2023-12-20 22:12:55,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:12:55,578 INFO L225 Difference]: With dead ends: 59 [2023-12-20 22:12:55,578 INFO L226 Difference]: Without dead ends: 57 [2023-12-20 22:12:55,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2023-12-20 22:12:55,581 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 36 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 22:12:55,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 158 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 22:12:55,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-12-20 22:12:55,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2023-12-20 22:12:55,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-20 22:12:55,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 57 transitions. [2023-12-20 22:12:55,598 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 57 transitions. Word has length 66 [2023-12-20 22:12:55,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:12:55,598 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 57 transitions. [2023-12-20 22:12:55,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-20 22:12:55,599 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 57 transitions. [2023-12-20 22:12:55,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-20 22:12:55,600 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:12:55,600 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 22:12:55,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-20 22:12:55,600 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:12:55,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:12:55,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1991980763, now seen corresponding path program 1 times [2023-12-20 22:12:55,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:12:55,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149864646] [2023-12-20 22:12:55,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:12:55,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:12:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:55,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:12:55,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:55,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:12:55,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:55,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:12:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:55,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:12:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:55,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:12:55,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:55,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 22:12:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:55,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 22:12:55,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:55,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 22:12:55,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:55,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 22:12:55,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:55,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 22:12:55,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:55,693 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-20 22:12:55,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:12:55,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149864646] [2023-12-20 22:12:55,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149864646] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:12:55,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:12:55,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 22:12:55,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988805353] [2023-12-20 22:12:55,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:12:55,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 22:12:55,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:12:55,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 22:12:55,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 22:12:55,695 INFO L87 Difference]: Start difference. First operand 41 states and 57 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-20 22:12:55,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:12:55,756 INFO L93 Difference]: Finished difference Result 120 states and 166 transitions. [2023-12-20 22:12:55,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 22:12:55,757 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 67 [2023-12-20 22:12:55,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:12:55,759 INFO L225 Difference]: With dead ends: 120 [2023-12-20 22:12:55,759 INFO L226 Difference]: Without dead ends: 80 [2023-12-20 22:12:55,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-20 22:12:55,764 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 45 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 22:12:55,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 124 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 22:12:55,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-12-20 22:12:55,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2023-12-20 22:12:55,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 47 states have internal predecessors, (57), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-20 22:12:55,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 97 transitions. [2023-12-20 22:12:55,777 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 97 transitions. Word has length 67 [2023-12-20 22:12:55,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:12:55,779 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 97 transitions. [2023-12-20 22:12:55,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-20 22:12:55,782 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 97 transitions. [2023-12-20 22:12:55,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-20 22:12:55,785 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:12:55,785 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 22:12:55,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-20 22:12:55,785 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:12:55,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:12:55,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1754511740, now seen corresponding path program 1 times [2023-12-20 22:12:55,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:12:55,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398016066] [2023-12-20 22:12:55,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:12:55,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:12:55,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:55,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:12:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:55,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:12:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:55,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:12:55,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:55,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:12:55,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:55,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:12:55,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:55,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 22:12:55,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:55,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 22:12:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:55,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 22:12:55,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:55,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 22:12:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:55,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 22:12:55,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:55,873 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-20 22:12:55,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:12:55,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398016066] [2023-12-20 22:12:55,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398016066] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:12:55,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:12:55,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 22:12:55,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304551027] [2023-12-20 22:12:55,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:12:55,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 22:12:55,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:12:55,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 22:12:55,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 22:12:55,875 INFO L87 Difference]: Start difference. First operand 70 states and 97 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-20 22:12:55,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:12:55,894 INFO L93 Difference]: Finished difference Result 143 states and 200 transitions. [2023-12-20 22:12:55,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 22:12:55,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 67 [2023-12-20 22:12:55,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:12:55,896 INFO L225 Difference]: With dead ends: 143 [2023-12-20 22:12:55,896 INFO L226 Difference]: Without dead ends: 103 [2023-12-20 22:12:55,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 22:12:55,897 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 40 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 22:12:55,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 120 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 22:12:55,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-12-20 22:12:55,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2023-12-20 22:12:55,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 66 states have internal predecessors, (80), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2023-12-20 22:12:55,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 140 transitions. [2023-12-20 22:12:55,906 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 140 transitions. Word has length 67 [2023-12-20 22:12:55,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:12:55,906 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 140 transitions. [2023-12-20 22:12:55,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-20 22:12:55,906 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 140 transitions. [2023-12-20 22:12:55,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-20 22:12:55,907 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:12:55,907 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 22:12:55,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-20 22:12:55,907 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:12:55,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:12:55,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1754452158, now seen corresponding path program 1 times [2023-12-20 22:12:55,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:12:55,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723221676] [2023-12-20 22:12:55,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:12:55,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:12:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:12:56,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:12:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:12:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:12:56,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:12:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 22:12:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 22:12:56,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 22:12:56,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 22:12:56,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 22:12:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,218 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-20 22:12:56,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:12:56,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723221676] [2023-12-20 22:12:56,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723221676] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:12:56,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:12:56,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-20 22:12:56,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375933879] [2023-12-20 22:12:56,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:12:56,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 22:12:56,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:12:56,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 22:12:56,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-20 22:12:56,221 INFO L87 Difference]: Start difference. First operand 100 states and 140 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-20 22:12:56,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:12:56,319 INFO L93 Difference]: Finished difference Result 128 states and 170 transitions. [2023-12-20 22:12:56,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-20 22:12:56,320 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 67 [2023-12-20 22:12:56,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:12:56,321 INFO L225 Difference]: With dead ends: 128 [2023-12-20 22:12:56,321 INFO L226 Difference]: Without dead ends: 126 [2023-12-20 22:12:56,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-12-20 22:12:56,321 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 27 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 22:12:56,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 172 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 22:12:56,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-12-20 22:12:56,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 114. [2023-12-20 22:12:56,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 77 states have (on average 1.1948051948051948) internal successors, (92), 78 states have internal predecessors, (92), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-20 22:12:56,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 156 transitions. [2023-12-20 22:12:56,331 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 156 transitions. Word has length 67 [2023-12-20 22:12:56,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:12:56,332 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 156 transitions. [2023-12-20 22:12:56,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-20 22:12:56,332 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 156 transitions. [2023-12-20 22:12:56,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-20 22:12:56,332 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:12:56,333 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 22:12:56,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-20 22:12:56,333 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:12:56,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:12:56,333 INFO L85 PathProgramCache]: Analyzing trace with hash -765507776, now seen corresponding path program 1 times [2023-12-20 22:12:56,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:12:56,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572002226] [2023-12-20 22:12:56,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:12:56,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:12:56,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:12:56,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:12:56,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:12:56,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:12:56,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:12:56,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 22:12:56,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 22:12:56,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 22:12:56,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 22:12:56,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 22:12:56,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,524 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-20 22:12:56,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:12:56,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572002226] [2023-12-20 22:12:56,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572002226] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:12:56,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:12:56,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-20 22:12:56,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391543369] [2023-12-20 22:12:56,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:12:56,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 22:12:56,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:12:56,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 22:12:56,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-20 22:12:56,525 INFO L87 Difference]: Start difference. First operand 114 states and 156 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-20 22:12:56,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:12:56,583 INFO L93 Difference]: Finished difference Result 125 states and 167 transitions. [2023-12-20 22:12:56,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-20 22:12:56,583 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 67 [2023-12-20 22:12:56,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:12:56,585 INFO L225 Difference]: With dead ends: 125 [2023-12-20 22:12:56,585 INFO L226 Difference]: Without dead ends: 123 [2023-12-20 22:12:56,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-12-20 22:12:56,586 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 15 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 22:12:56,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 149 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 22:12:56,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-12-20 22:12:56,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2023-12-20 22:12:56,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 82 states have (on average 1.1829268292682926) internal successors, (97), 83 states have internal predecessors, (97), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-20 22:12:56,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 161 transitions. [2023-12-20 22:12:56,594 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 161 transitions. Word has length 67 [2023-12-20 22:12:56,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:12:56,594 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 161 transitions. [2023-12-20 22:12:56,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-20 22:12:56,594 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 161 transitions. [2023-12-20 22:12:56,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-20 22:12:56,595 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:12:56,595 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 22:12:56,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-20 22:12:56,596 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:12:56,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:12:56,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1115906407, now seen corresponding path program 1 times [2023-12-20 22:12:56,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:12:56,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123353206] [2023-12-20 22:12:56,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:12:56,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:12:56,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:12:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:12:56,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:12:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:12:56,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:12:56,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 22:12:56,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 22:12:56,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 22:12:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 22:12:56,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 22:12:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 22:12:56,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 22:12:56,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 22:12:56,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 22:12:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 22:12:56,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 22:12:56,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 22:12:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-20 22:12:56,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-20 22:12:56,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-20 22:12:56,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,671 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 777 trivial. 0 not checked. [2023-12-20 22:12:56,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:12:56,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123353206] [2023-12-20 22:12:56,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123353206] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:12:56,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:12:56,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 22:12:56,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754530106] [2023-12-20 22:12:56,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:12:56,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 22:12:56,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:12:56,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 22:12:56,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 22:12:56,674 INFO L87 Difference]: Start difference. First operand 119 states and 161 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-20 22:12:56,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:12:56,694 INFO L93 Difference]: Finished difference Result 212 states and 285 transitions. [2023-12-20 22:12:56,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 22:12:56,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 133 [2023-12-20 22:12:56,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:12:56,696 INFO L225 Difference]: With dead ends: 212 [2023-12-20 22:12:56,696 INFO L226 Difference]: Without dead ends: 123 [2023-12-20 22:12:56,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 22:12:56,699 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 15 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 93 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-20 22:12:56,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 93 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 22:12:56,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-12-20 22:12:56,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2023-12-20 22:12:56,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 82 states have (on average 1.1585365853658536) internal successors, (95), 83 states have internal predecessors, (95), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-20 22:12:56,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 159 transitions. [2023-12-20 22:12:56,713 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 159 transitions. Word has length 133 [2023-12-20 22:12:56,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:12:56,714 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 159 transitions. [2023-12-20 22:12:56,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-20 22:12:56,714 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 159 transitions. [2023-12-20 22:12:56,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-20 22:12:56,717 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:12:56,717 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 22:12:56,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-20 22:12:56,717 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:12:56,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:12:56,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1795905195, now seen corresponding path program 1 times [2023-12-20 22:12:56,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:12:56,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147256791] [2023-12-20 22:12:56,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:12:56,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:12:56,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:12:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:12:56,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:12:56,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:12:56,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:12:56,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 22:12:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 22:12:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 22:12:56,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 22:12:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 22:12:56,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 22:12:56,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 22:12:56,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 22:12:56,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 22:12:56,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 22:12:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 22:12:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 22:12:56,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-20 22:12:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-20 22:12:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-20 22:12:56,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:56,873 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-20 22:12:56,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:12:56,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147256791] [2023-12-20 22:12:56,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147256791] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:12:56,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:12:56,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 22:12:56,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332353899] [2023-12-20 22:12:56,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:12:56,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 22:12:56,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:12:56,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 22:12:56,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-20 22:12:56,875 INFO L87 Difference]: Start difference. First operand 119 states and 159 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-20 22:12:56,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:12:56,965 INFO L93 Difference]: Finished difference Result 315 states and 426 transitions. [2023-12-20 22:12:56,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 22:12:56,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 133 [2023-12-20 22:12:56,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:12:56,968 INFO L225 Difference]: With dead ends: 315 [2023-12-20 22:12:56,968 INFO L226 Difference]: Without dead ends: 226 [2023-12-20 22:12:56,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-20 22:12:56,970 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 54 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 22:12:56,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 143 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 22:12:56,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2023-12-20 22:12:57,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 124. [2023-12-20 22:12:57,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 87 states have (on average 1.160919540229885) internal successors, (101), 88 states have internal predecessors, (101), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-20 22:12:57,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 165 transitions. [2023-12-20 22:12:57,005 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 165 transitions. Word has length 133 [2023-12-20 22:12:57,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:12:57,006 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 165 transitions. [2023-12-20 22:12:57,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-20 22:12:57,006 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 165 transitions. [2023-12-20 22:12:57,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-20 22:12:57,007 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:12:57,007 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 22:12:57,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-20 22:12:57,008 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:12:57,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:12:57,008 INFO L85 PathProgramCache]: Analyzing trace with hash -115137363, now seen corresponding path program 1 times [2023-12-20 22:12:57,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:12:57,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172653114] [2023-12-20 22:12:57,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:12:57,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:12:57,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:57,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:12:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:57,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:12:57,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:57,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:12:57,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:57,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:12:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:57,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:12:57,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:57,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 22:12:57,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:57,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 22:12:57,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:57,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 22:12:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:57,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 22:12:57,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:57,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 22:12:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:57,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 22:12:57,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:57,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 22:12:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:57,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 22:12:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:57,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 22:12:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:57,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 22:12:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:57,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 22:12:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:57,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 22:12:57,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:57,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-20 22:12:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:57,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-20 22:12:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:57,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-20 22:12:57,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:57,433 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-20 22:12:57,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:12:57,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172653114] [2023-12-20 22:12:57,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172653114] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 22:12:57,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509764046] [2023-12-20 22:12:57,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:12:57,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 22:12:57,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 22:12:57,436 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-20 22:12:57,442 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-20 22:12:57,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:12:57,525 INFO L262 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-20 22:12:57,534 INFO L285 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2023-12-20 22:27:32,883 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-20 22:27:32,884 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-20 22:27:32,954 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-20 22:27:32,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-20 22:27:33,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-20 22:27:33,161 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 134 with TraceHistMax 20,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-9-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-3-2-3-2-3-2-3-2-3-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-57-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-1 context. [2023-12-20 22:27:33,166 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 22:27:33,168 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 22:27:33,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 10:27:33 BoogieIcfgContainer [2023-12-20 22:27:33,169 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 22:27:33,170 INFO L158 Benchmark]: Toolchain (without parser) took 880068.16ms. Allocated memory was 420.5MB in the beginning and 1.4GB in the end (delta: 989.9MB). Free memory was 369.2MB in the beginning and 946.0MB in the end (delta: -576.8MB). Peak memory consumption was 858.7MB. Max. memory is 8.0GB. [2023-12-20 22:27:33,170 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 226.5MB. Free memory is still 175.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 22:27:33,170 INFO L158 Benchmark]: CACSL2BoogieTranslator took 186.51ms. Allocated memory is still 420.5MB. Free memory was 369.2MB in the beginning and 357.0MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-20 22:27:33,170 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.04ms. Allocated memory is still 420.5MB. Free memory was 357.0MB in the beginning and 355.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-20 22:27:33,170 INFO L158 Benchmark]: Boogie Preprocessor took 23.84ms. Allocated memory is still 420.5MB. Free memory was 355.2MB in the beginning and 353.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-20 22:27:33,171 INFO L158 Benchmark]: RCFGBuilder took 320.16ms. Allocated memory is still 420.5MB. Free memory was 352.8MB in the beginning and 338.4MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-20 22:27:33,171 INFO L158 Benchmark]: TraceAbstraction took 879510.49ms. Allocated memory was 420.5MB in the beginning and 1.4GB in the end (delta: 989.9MB). Free memory was 337.8MB in the beginning and 946.0MB in the end (delta: -608.2MB). Peak memory consumption was 827.3MB. Max. memory is 8.0GB. [2023-12-20 22:27:33,172 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.13ms. Allocated memory is still 226.5MB. Free memory is still 175.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 186.51ms. Allocated memory is still 420.5MB. Free memory was 369.2MB in the beginning and 357.0MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.04ms. Allocated memory is still 420.5MB. Free memory was 357.0MB in the beginning and 355.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.84ms. Allocated memory is still 420.5MB. Free memory was 355.2MB in the beginning and 353.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 320.16ms. Allocated memory is still 420.5MB. Free memory was 352.8MB in the beginning and 338.4MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 879510.49ms. Allocated memory was 420.5MB in the beginning and 1.4GB in the end (delta: 989.9MB). Free memory was 337.8MB in the beginning and 946.0MB in the end (delta: -608.2MB). Peak memory consumption was 827.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 - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while NwaCegarLoop was analyzing trace of length 134 with TraceHistMax 20,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-9-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-3-2-3-2-3-2-3-2-3-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-57-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 879.5s, OverallIterations: 10, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 273 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 273 mSDsluCounter, 1196 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 753 mSDsCounter, 85 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 424 IncrementalHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 85 mSolverCounterUnsat, 443 mSDtfsCounter, 424 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 301 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=9, InterpolantAutomatonStates: 61, 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, 9 MinimizatonAttempts, 169 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 732 NumberOfCodeBlocks, 732 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 723 ConstructedInterpolants, 0 QuantifiedInterpolants, 1592 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 2828/2828 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 could not prove your program: Timeout Completed graceful shutdown