/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-16 03:34:55,895 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 03:34:55,983 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-16 03:34:55,988 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 03:34:55,988 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 03:34:56,021 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 03:34:56,022 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 03:34:56,022 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 03:34:56,023 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 03:34:56,026 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 03:34:56,027 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 03:34:56,027 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 03:34:56,028 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 03:34:56,029 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 03:34:56,029 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 03:34:56,029 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 03:34:56,030 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 03:34:56,030 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 03:34:56,030 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 03:34:56,030 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 03:34:56,031 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 03:34:56,031 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 03:34:56,031 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 03:34:56,032 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 03:34:56,032 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 03:34:56,032 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 03:34:56,032 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 03:34:56,032 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 03:34:56,033 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 03:34:56,033 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 03:34:56,034 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 03:34:56,034 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 03:34:56,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 03:34:56,035 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 03:34:56,035 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 03:34:56,035 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 03:34:56,035 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 03:34:56,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 03:34:56,036 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 03:34:56,036 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 03:34:56,036 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 03:34:56,036 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 03:34:56,036 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 03:34:56,037 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-16 03:34:56,283 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 03:34:56,308 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 03:34:56,311 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 03:34:56,311 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 03:34:56,312 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 03:34:56,313 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-16 03:34:57,469 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 03:34:57,689 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 03:34:57,689 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-47.i [2023-12-16 03:34:57,700 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f17dde2e/b7c644aa15c04273a550571507979424/FLAGec87eed31 [2023-12-16 03:34:57,717 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f17dde2e/b7c644aa15c04273a550571507979424 [2023-12-16 03:34:57,720 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 03:34:57,721 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 03:34:57,724 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 03:34:57,724 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 03:34:57,729 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 03:34:57,729 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:34:57" (1/1) ... [2023-12-16 03:34:57,730 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ec61a16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:34:57, skipping insertion in model container [2023-12-16 03:34:57,730 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:34:57" (1/1) ... [2023-12-16 03:34:57,761 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 03:34:57,898 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-16 03:34:57,950 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 03:34:57,964 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 03:34:57,975 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-16 03:34:57,996 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 03:34:58,010 INFO L206 MainTranslator]: Completed translation [2023-12-16 03:34:58,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:34:58 WrapperNode [2023-12-16 03:34:58,011 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 03:34:58,012 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 03:34:58,012 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 03:34:58,013 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 03:34:58,018 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:34:58" (1/1) ... [2023-12-16 03:34:58,023 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:34:58" (1/1) ... [2023-12-16 03:34:58,050 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 88 [2023-12-16 03:34:58,051 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 03:34:58,052 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 03:34:58,052 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 03:34:58,052 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 03:34:58,060 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:34:58" (1/1) ... [2023-12-16 03:34:58,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:34:58" (1/1) ... [2023-12-16 03:34:58,062 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:34:58" (1/1) ... [2023-12-16 03:34:58,074 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-16 03:34:58,074 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:34:58" (1/1) ... [2023-12-16 03:34:58,074 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:34:58" (1/1) ... [2023-12-16 03:34:58,078 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:34:58" (1/1) ... [2023-12-16 03:34:58,080 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:34:58" (1/1) ... [2023-12-16 03:34:58,081 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:34:58" (1/1) ... [2023-12-16 03:34:58,082 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:34:58" (1/1) ... [2023-12-16 03:34:58,084 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 03:34:58,085 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 03:34:58,085 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 03:34:58,085 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 03:34:58,086 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:34:58" (1/1) ... [2023-12-16 03:34:58,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 03:34:58,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 03:34:58,120 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-16 03:34:58,131 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-16 03:34:58,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 03:34:58,144 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 03:34:58,144 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 03:34:58,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 03:34:58,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 03:34:58,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 03:34:58,196 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 03:34:58,198 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 03:34:58,386 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 03:34:58,418 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 03:34:58,418 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 03:34:58,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:34:58 BoogieIcfgContainer [2023-12-16 03:34:58,419 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 03:34:58,421 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 03:34:58,421 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 03:34:58,424 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 03:34:58,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 03:34:57" (1/3) ... [2023-12-16 03:34:58,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fb4a82d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:34:58, skipping insertion in model container [2023-12-16 03:34:58,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:34:58" (2/3) ... [2023-12-16 03:34:58,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fb4a82d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:34:58, skipping insertion in model container [2023-12-16 03:34:58,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:34:58" (3/3) ... [2023-12-16 03:34:58,426 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-47.i [2023-12-16 03:34:58,441 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 03:34:58,441 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 03:34:58,482 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 03:34:58,487 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;@1cf1d912, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 03:34:58,488 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 03:34:58,491 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-16 03:34:58,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-16 03:34:58,500 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:34:58,500 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-16 03:34:58,501 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:34:58,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:34:58,508 INFO L85 PathProgramCache]: Analyzing trace with hash 205245354, now seen corresponding path program 1 times [2023-12-16 03:34:58,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:34:58,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100107677] [2023-12-16 03:34:58,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:34:58,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:34:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:58,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:34:58,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:58,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:34:58,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:58,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:34:58,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:58,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:34:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:58,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:34:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:58,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:34:58,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:58,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:34:58,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:58,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:34:58,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:58,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:34:58,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:58,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:34:58,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:58,787 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-16 03:34:58,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:34:58,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100107677] [2023-12-16 03:34:58,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100107677] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:34:58,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:34:58,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 03:34:58,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867066259] [2023-12-16 03:34:58,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:34:58,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 03:34:58,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:34:58,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 03:34:58,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 03:34:58,827 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-16 03:34:58,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:34:58,878 INFO L93 Difference]: Finished difference Result 70 states and 118 transitions. [2023-12-16 03:34:58,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 03:34:58,881 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-16 03:34:58,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:34:58,887 INFO L225 Difference]: With dead ends: 70 [2023-12-16 03:34:58,887 INFO L226 Difference]: Without dead ends: 34 [2023-12-16 03:34:58,890 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-16 03:34:58,893 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-16 03:34:58,894 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-16 03:34:58,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-16 03:34:58,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-12-16 03:34:58,931 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-16 03:34:58,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2023-12-16 03:34:58,933 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 66 [2023-12-16 03:34:58,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:34:58,934 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2023-12-16 03:34:58,934 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-16 03:34:58,934 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2023-12-16 03:34:58,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-16 03:34:58,935 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:34:58,936 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-16 03:34:58,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 03:34:58,936 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:34:58,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:34:58,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1507019096, now seen corresponding path program 1 times [2023-12-16 03:34:58,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:34:58,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981672487] [2023-12-16 03:34:58,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:34:58,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:34:58,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:59,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:34:59,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:59,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:34:59,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:59,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:34:59,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:59,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:34:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:59,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:34:59,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:59,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:34:59,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:59,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:34:59,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:59,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:34:59,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:59,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:34:59,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:59,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:34:59,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:34:59,758 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-16 03:34:59,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:34:59,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981672487] [2023-12-16 03:34:59,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981672487] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:34:59,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:34:59,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 03:34:59,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526724144] [2023-12-16 03:34:59,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:34:59,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 03:34:59,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:34:59,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 03:34:59,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-16 03:34:59,768 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-16 03:35:00,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:35:00,071 INFO L93 Difference]: Finished difference Result 61 states and 79 transitions. [2023-12-16 03:35:00,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 03:35:00,072 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-16 03:35:00,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:35:00,078 INFO L225 Difference]: With dead ends: 61 [2023-12-16 03:35:00,078 INFO L226 Difference]: Without dead ends: 59 [2023-12-16 03:35:00,079 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-16 03:35:00,082 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-16 03:35:00,082 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-16 03:35:00,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-12-16 03:35:00,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 41. [2023-12-16 03:35:00,098 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-16 03:35:00,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 57 transitions. [2023-12-16 03:35:00,100 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 57 transitions. Word has length 66 [2023-12-16 03:35:00,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:35:00,101 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 57 transitions. [2023-12-16 03:35:00,101 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-16 03:35:00,101 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 57 transitions. [2023-12-16 03:35:00,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-16 03:35:00,103 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:35:00,103 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-16 03:35:00,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 03:35:00,104 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:35:00,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:35:00,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1507078678, now seen corresponding path program 1 times [2023-12-16 03:35:00,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:35:00,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642546678] [2023-12-16 03:35:00,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:35:00,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:35:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:00,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:35:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:00,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:35:00,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:00,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:35:00,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:00,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:35:00,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:00,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:35:00,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:00,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:35:00,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:00,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:35:00,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:00,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:35:00,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:00,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:35:00,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:00,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:35:00,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:00,552 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-16 03:35:00,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:35:00,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642546678] [2023-12-16 03:35:00,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642546678] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:35:00,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:35:00,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 03:35:00,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761798927] [2023-12-16 03:35:00,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:35:00,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 03:35:00,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:35:00,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 03:35:00,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-16 03:35:00,558 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-16 03:35:00,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:35:00,812 INFO L93 Difference]: Finished difference Result 59 states and 77 transitions. [2023-12-16 03:35:00,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 03:35:00,813 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-16 03:35:00,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:35:00,817 INFO L225 Difference]: With dead ends: 59 [2023-12-16 03:35:00,817 INFO L226 Difference]: Without dead ends: 57 [2023-12-16 03:35:00,820 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-16 03:35:00,823 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-16 03:35:00,824 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-16 03:35:00,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-12-16 03:35:00,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2023-12-16 03:35:00,836 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-16 03:35:00,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 57 transitions. [2023-12-16 03:35:00,841 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 57 transitions. Word has length 66 [2023-12-16 03:35:00,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:35:00,842 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 57 transitions. [2023-12-16 03:35:00,842 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-16 03:35:00,842 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 57 transitions. [2023-12-16 03:35:00,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-16 03:35:00,844 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:35:00,844 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-16 03:35:00,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 03:35:00,845 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:35:00,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:35:00,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1991980763, now seen corresponding path program 1 times [2023-12-16 03:35:00,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:35:00,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005499304] [2023-12-16 03:35:00,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:35:00,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:35:00,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:00,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:35:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:00,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:35:00,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:00,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:35:00,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:00,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:35:00,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:00,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:35:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:00,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:35:00,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:00,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:35:00,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:00,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:35:00,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:00,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:35:00,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:00,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:35:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:00,964 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-16 03:35:00,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:35:00,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005499304] [2023-12-16 03:35:00,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005499304] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:35:00,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:35:00,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 03:35:00,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498400619] [2023-12-16 03:35:00,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:35:00,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 03:35:00,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:35:00,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 03:35:00,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 03:35:00,968 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-16 03:35:01,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:35:01,047 INFO L93 Difference]: Finished difference Result 120 states and 166 transitions. [2023-12-16 03:35:01,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 03:35:01,048 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-16 03:35:01,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:35:01,050 INFO L225 Difference]: With dead ends: 120 [2023-12-16 03:35:01,050 INFO L226 Difference]: Without dead ends: 80 [2023-12-16 03:35:01,051 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-16 03:35:01,056 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-16 03:35:01,057 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-16 03:35:01,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-12-16 03:35:01,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2023-12-16 03:35:01,071 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-16 03:35:01,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 97 transitions. [2023-12-16 03:35:01,073 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 97 transitions. Word has length 67 [2023-12-16 03:35:01,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:35:01,074 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 97 transitions. [2023-12-16 03:35:01,075 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-16 03:35:01,077 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 97 transitions. [2023-12-16 03:35:01,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-16 03:35:01,082 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:35:01,082 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-16 03:35:01,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 03:35:01,082 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:35:01,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:35:01,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1754511740, now seen corresponding path program 1 times [2023-12-16 03:35:01,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:35:01,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555681228] [2023-12-16 03:35:01,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:35:01,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:35:01,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:01,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:35:01,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:01,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:35:01,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:01,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:35:01,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:01,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:35:01,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:01,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:35:01,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:01,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:35:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:01,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:35:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:01,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:35:01,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:01,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:35:01,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:01,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:35:01,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:01,198 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-16 03:35:01,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:35:01,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555681228] [2023-12-16 03:35:01,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555681228] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:35:01,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:35:01,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 03:35:01,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011820660] [2023-12-16 03:35:01,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:35:01,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 03:35:01,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:35:01,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 03:35:01,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 03:35:01,200 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-16 03:35:01,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:35:01,230 INFO L93 Difference]: Finished difference Result 143 states and 200 transitions. [2023-12-16 03:35:01,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 03:35:01,231 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-16 03:35:01,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:35:01,232 INFO L225 Difference]: With dead ends: 143 [2023-12-16 03:35:01,232 INFO L226 Difference]: Without dead ends: 103 [2023-12-16 03:35:01,233 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-16 03:35:01,233 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-16 03:35:01,234 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-16 03:35:01,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-12-16 03:35:01,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2023-12-16 03:35:01,246 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-16 03:35:01,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 140 transitions. [2023-12-16 03:35:01,247 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 140 transitions. Word has length 67 [2023-12-16 03:35:01,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:35:01,247 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 140 transitions. [2023-12-16 03:35:01,247 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-16 03:35:01,247 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 140 transitions. [2023-12-16 03:35:01,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-16 03:35:01,248 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:35:01,249 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-16 03:35:01,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 03:35:01,249 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:35:01,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:35:01,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1754452158, now seen corresponding path program 1 times [2023-12-16 03:35:01,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:35:01,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978770079] [2023-12-16 03:35:01,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:35:01,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:35:01,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:01,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:35:01,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:01,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:35:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:01,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:35:01,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:01,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:35:01,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:01,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:35:01,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:01,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:35:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:01,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:35:01,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:01,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:35:01,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:01,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:35:01,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:01,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:35:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:01,637 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-16 03:35:01,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:35:01,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978770079] [2023-12-16 03:35:01,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978770079] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:35:01,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:35:01,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 03:35:01,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715707747] [2023-12-16 03:35:01,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:35:01,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 03:35:01,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:35:01,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 03:35:01,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 03:35:01,641 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-16 03:35:01,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:35:01,780 INFO L93 Difference]: Finished difference Result 128 states and 170 transitions. [2023-12-16 03:35:01,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 03:35:01,781 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-16 03:35:01,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:35:01,782 INFO L225 Difference]: With dead ends: 128 [2023-12-16 03:35:01,783 INFO L226 Difference]: Without dead ends: 126 [2023-12-16 03:35:01,784 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-16 03:35:01,784 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 27 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-16 03:35:01,785 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-16 03:35:01,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-12-16 03:35:01,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 114. [2023-12-16 03:35:01,816 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-16 03:35:01,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 156 transitions. [2023-12-16 03:35:01,818 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 156 transitions. Word has length 67 [2023-12-16 03:35:01,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:35:01,819 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 156 transitions. [2023-12-16 03:35:01,821 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-16 03:35:01,821 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 156 transitions. [2023-12-16 03:35:01,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-16 03:35:01,824 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:35:01,825 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-16 03:35:01,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 03:35:01,825 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:35:01,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:35:01,826 INFO L85 PathProgramCache]: Analyzing trace with hash -765507776, now seen corresponding path program 1 times [2023-12-16 03:35:01,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:35:01,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478872638] [2023-12-16 03:35:01,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:35:01,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:35:01,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:35:02,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:35:02,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:35:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:35:02,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:35:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:35:02,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:35:02,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:35:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:35:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:35:02,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,137 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-16 03:35:02,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:35:02,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478872638] [2023-12-16 03:35:02,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478872638] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:35:02,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:35:02,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 03:35:02,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779093932] [2023-12-16 03:35:02,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:35:02,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 03:35:02,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:35:02,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 03:35:02,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 03:35:02,140 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-16 03:35:02,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:35:02,232 INFO L93 Difference]: Finished difference Result 125 states and 167 transitions. [2023-12-16 03:35:02,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 03:35:02,233 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-16 03:35:02,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:35:02,236 INFO L225 Difference]: With dead ends: 125 [2023-12-16 03:35:02,236 INFO L226 Difference]: Without dead ends: 123 [2023-12-16 03:35:02,236 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-16 03:35:02,237 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.1s IncrementalHoareTripleChecker+Time [2023-12-16 03:35:02,237 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.1s Time] [2023-12-16 03:35:02,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-12-16 03:35:02,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2023-12-16 03:35:02,255 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-16 03:35:02,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 161 transitions. [2023-12-16 03:35:02,256 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 161 transitions. Word has length 67 [2023-12-16 03:35:02,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:35:02,257 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 161 transitions. [2023-12-16 03:35:02,258 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-16 03:35:02,258 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 161 transitions. [2023-12-16 03:35:02,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-16 03:35:02,259 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:35:02,259 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-16 03:35:02,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 03:35:02,259 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:35:02,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:35:02,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1115906407, now seen corresponding path program 1 times [2023-12-16 03:35:02,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:35:02,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466020079] [2023-12-16 03:35:02,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:35:02,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:35:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:35:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:35:02,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:35:02,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:35:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:35:02,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:35:02,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:35:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:35:02,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:35:02,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:35:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:35:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:35:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:35:02,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:35:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 03:35:02,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 03:35:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 03:35:02,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-16 03:35:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-16 03:35:02,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 03:35:02,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,368 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-16 03:35:02,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:35:02,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466020079] [2023-12-16 03:35:02,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466020079] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:35:02,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:35:02,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 03:35:02,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000655087] [2023-12-16 03:35:02,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:35:02,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 03:35:02,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:35:02,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 03:35:02,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 03:35:02,370 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-16 03:35:02,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:35:02,390 INFO L93 Difference]: Finished difference Result 212 states and 285 transitions. [2023-12-16 03:35:02,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 03:35:02,390 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-16 03:35:02,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:35:02,391 INFO L225 Difference]: With dead ends: 212 [2023-12-16 03:35:02,391 INFO L226 Difference]: Without dead ends: 123 [2023-12-16 03:35:02,392 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-16 03:35:02,393 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-16 03:35:02,393 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-16 03:35:02,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-12-16 03:35:02,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2023-12-16 03:35:02,402 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-16 03:35:02,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 159 transitions. [2023-12-16 03:35:02,403 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 159 transitions. Word has length 133 [2023-12-16 03:35:02,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:35:02,404 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 159 transitions. [2023-12-16 03:35:02,404 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-16 03:35:02,404 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 159 transitions. [2023-12-16 03:35:02,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-16 03:35:02,405 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:35:02,405 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-16 03:35:02,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 03:35:02,406 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:35:02,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:35:02,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1795905195, now seen corresponding path program 1 times [2023-12-16 03:35:02,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:35:02,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35953990] [2023-12-16 03:35:02,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:35:02,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:35:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:35:02,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:35:02,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:35:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:35:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:35:02,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:35:02,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:35:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:35:02,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:35:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:35:02,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:35:02,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:35:02,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:35:02,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:35:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 03:35:02,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 03:35:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 03:35:02,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-16 03:35:02,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-16 03:35:02,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 03:35:02,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:02,655 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-16 03:35:02,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:35:02,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35953990] [2023-12-16 03:35:02,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35953990] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:35:02,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:35:02,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 03:35:02,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592383406] [2023-12-16 03:35:02,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:35:02,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 03:35:02,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:35:02,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 03:35:02,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 03:35:02,658 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-16 03:35:02,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:35:02,791 INFO L93 Difference]: Finished difference Result 315 states and 426 transitions. [2023-12-16 03:35:02,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 03:35:02,791 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-16 03:35:02,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:35:02,794 INFO L225 Difference]: With dead ends: 315 [2023-12-16 03:35:02,795 INFO L226 Difference]: Without dead ends: 226 [2023-12-16 03:35:02,796 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-16 03:35:02,798 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 54 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-16 03:35:02,798 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-16 03:35:02,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2023-12-16 03:35:02,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 124. [2023-12-16 03:35:02,821 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-16 03:35:02,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 165 transitions. [2023-12-16 03:35:02,822 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 165 transitions. Word has length 133 [2023-12-16 03:35:02,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:35:02,822 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 165 transitions. [2023-12-16 03:35:02,823 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-16 03:35:02,823 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 165 transitions. [2023-12-16 03:35:02,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-16 03:35:02,825 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:35:02,825 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-16 03:35:02,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-16 03:35:02,825 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:35:02,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:35:02,825 INFO L85 PathProgramCache]: Analyzing trace with hash -115137363, now seen corresponding path program 1 times [2023-12-16 03:35:02,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:35:02,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145304030] [2023-12-16 03:35:02,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:35:02,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:35:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:03,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:35:03,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:03,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:35:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:03,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:35:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:03,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:35:03,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:03,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:35:03,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:03,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:35:03,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:03,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:35:03,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:03,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:35:03,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:03,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:35:03,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:03,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:35:03,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:03,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:35:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:03,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:35:03,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:03,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:35:03,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:03,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:35:03,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:03,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 03:35:03,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:03,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 03:35:03,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:03,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 03:35:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:03,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-16 03:35:03,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:03,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-16 03:35:03,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:03,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 03:35:03,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:03,375 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-16 03:35:03,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:35:03,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145304030] [2023-12-16 03:35:03,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145304030] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 03:35:03,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090871483] [2023-12-16 03:35:03,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:35:03,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 03:35:03,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 03:35:03,379 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-16 03:35:03,395 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-16 03:35:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:03,469 INFO L262 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-16 03:35:03,481 INFO L285 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2023-12-16 03:36:07,557 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-16 03:36:07,558 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-16 03:36:07,673 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 03:36:07,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-16 03:36:07,882 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-16 03:36:07,882 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 ∧-51-4-2-3-2-3-2-3-2-3-2-3-2-4-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-16 03:36:07,888 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:36:07,890 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 03:36:07,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 03:36:07 BoogieIcfgContainer [2023-12-16 03:36:07,897 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 03:36:07,897 INFO L158 Benchmark]: Toolchain (without parser) took 70176.04ms. Allocated memory was 313.5MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 251.9MB in the beginning and 1.1GB in the end (delta: -816.8MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2023-12-16 03:36:07,898 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 178.3MB. Free memory is still 128.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 03:36:07,898 INFO L158 Benchmark]: CACSL2BoogieTranslator took 287.30ms. Allocated memory is still 313.5MB. Free memory was 251.9MB in the beginning and 239.7MB in the end (delta: 12.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 03:36:07,898 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.68ms. Allocated memory is still 313.5MB. Free memory was 239.7MB in the beginning and 237.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 03:36:07,899 INFO L158 Benchmark]: Boogie Preprocessor took 32.72ms. Allocated memory is still 313.5MB. Free memory was 237.8MB in the beginning and 235.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 03:36:07,899 INFO L158 Benchmark]: RCFGBuilder took 333.92ms. Allocated memory is still 313.5MB. Free memory was 235.7MB in the beginning and 274.0MB in the end (delta: -38.3MB). Peak memory consumption was 14.4MB. Max. memory is 8.0GB. [2023-12-16 03:36:07,899 INFO L158 Benchmark]: TraceAbstraction took 69476.00ms. Allocated memory was 313.5MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 272.9MB in the beginning and 1.1GB in the end (delta: -795.8MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2023-12-16 03:36:07,901 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 178.3MB. Free memory is still 128.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 287.30ms. Allocated memory is still 313.5MB. Free memory was 251.9MB in the beginning and 239.7MB in the end (delta: 12.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.68ms. Allocated memory is still 313.5MB. Free memory was 239.7MB in the beginning and 237.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.72ms. Allocated memory is still 313.5MB. Free memory was 237.8MB in the beginning and 235.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 333.92ms. Allocated memory is still 313.5MB. Free memory was 235.7MB in the beginning and 274.0MB in the end (delta: -38.3MB). Peak memory consumption was 14.4MB. Max. memory is 8.0GB. * TraceAbstraction took 69476.00ms. Allocated memory was 313.5MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 272.9MB in the beginning and 1.1GB in the end (delta: -795.8MB). Peak memory consumption was 1.1GB. 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 ∧-51-4-2-3-2-3-2-3-2-3-2-3-2-4-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: 69.4s, OverallIterations: 10, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 273 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 273 mSDsluCounter, 1196 SdHoareTripleChecker+Invalid, 0.4s 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.7s 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.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 169 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.5s 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