/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-06 19:59:56,477 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-06 19:59:56,478 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-06 19:59:56,528 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-06 19:59:56,529 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-06 19:59:56,529 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-06 19:59:56,530 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-06 19:59:56,534 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-06 19:59:56,535 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-06 19:59:56,535 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-06 19:59:56,536 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-06 19:59:56,536 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-06 19:59:56,537 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-06 19:59:56,537 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-06 19:59:56,538 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-06 19:59:56,538 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-06 19:59:56,539 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-06 19:59:56,539 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-06 19:59:56,540 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-06 19:59:56,541 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-06 19:59:56,542 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-06 19:59:56,543 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-06 19:59:56,543 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-06 19:59:56,544 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-06 19:59:56,544 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-06 19:59:56,546 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-06 19:59:56,546 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-06 19:59:56,546 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-06 19:59:56,547 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-06 19:59:56,547 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-06 19:59:56,548 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-06 19:59:56,548 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-06 19:59:56,548 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-06 19:59:56,548 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-06 19:59:56,549 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-06 19:59:56,549 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-06 19:59:56,550 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-06 19:59:56,550 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-06 19:59:56,550 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-06 19:59:56,550 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-06 19:59:56,551 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-06 19:59:56,551 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-06 19:59:56,552 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-06 19:59:56,558 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-06 19:59:56,558 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-06 19:59:56,559 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-06 19:59:56,559 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-06 19:59:56,559 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-06 19:59:56,559 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-06 19:59:56,559 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-06 19:59:56,559 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-06 19:59:56,559 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-06 19:59:56,559 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-06 19:59:56,560 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-06 19:59:56,560 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-06 19:59:56,560 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-06 19:59:56,560 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-06 19:59:56,560 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-06 19:59:56,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 19:59:56,560 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-06 19:59:56,561 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-06 19:59:56,561 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-06 19:59:56,561 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-06 19:59:56,561 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-06 19:59:56,561 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-06 19:59:56,561 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-06 19:59:56,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-06 19:59:56,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-06 19:59:56,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-06 19:59:56,708 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-06 19:59:56,709 INFO L275 PluginConnector]: CDTParser initialized [2022-04-06 19:59:56,710 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2022-04-06 19:59:56,743 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcaea3a79/1d6f0352b9764a66b8369d5bc0d6b7fa/FLAGffe6bf477 [2022-04-06 19:59:57,119 INFO L306 CDTParser]: Found 1 translation units. [2022-04-06 19:59:57,119 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2022-04-06 19:59:57,125 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcaea3a79/1d6f0352b9764a66b8369d5bc0d6b7fa/FLAGffe6bf477 [2022-04-06 19:59:57,137 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcaea3a79/1d6f0352b9764a66b8369d5bc0d6b7fa [2022-04-06 19:59:57,141 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-06 19:59:57,144 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-06 19:59:57,145 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-06 19:59:57,146 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-06 19:59:57,148 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-06 19:59:57,149 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 07:59:57" (1/1) ... [2022-04-06 19:59:57,150 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@550b42d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:59:57, skipping insertion in model container [2022-04-06 19:59:57,150 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 07:59:57" (1/1) ... [2022-04-06 19:59:57,155 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-06 19:59:57,184 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-06 19:59:57,333 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i[893,906] [2022-04-06 19:59:57,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 19:59:57,363 INFO L203 MainTranslator]: Completed pre-run [2022-04-06 19:59:57,386 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i[893,906] [2022-04-06 19:59:57,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 19:59:57,405 INFO L208 MainTranslator]: Completed translation [2022-04-06 19:59:57,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:59:57 WrapperNode [2022-04-06 19:59:57,406 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-06 19:59:57,406 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-06 19:59:57,406 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-06 19:59:57,406 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-06 19:59:57,424 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:59:57" (1/1) ... [2022-04-06 19:59:57,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:59:57" (1/1) ... [2022-04-06 19:59:57,441 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:59:57" (1/1) ... [2022-04-06 19:59:57,441 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:59:57" (1/1) ... [2022-04-06 19:59:57,444 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:59:57" (1/1) ... [2022-04-06 19:59:57,446 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:59:57" (1/1) ... [2022-04-06 19:59:57,447 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:59:57" (1/1) ... [2022-04-06 19:59:57,448 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-06 19:59:57,448 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-06 19:59:57,448 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-06 19:59:57,448 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-06 19:59:57,450 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:59:57" (1/1) ... [2022-04-06 19:59:57,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 19:59:57,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 19:59:57,486 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-06 19:59:57,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-06 19:59:57,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-06 19:59:57,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-06 19:59:57,512 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-06 19:59:57,512 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-06 19:59:57,512 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-06 19:59:57,512 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-06 19:59:57,512 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-06 19:59:57,512 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-06 19:59:57,512 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-06 19:59:57,512 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-06 19:59:57,512 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-06 19:59:57,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-06 19:59:57,513 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-06 19:59:57,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-06 19:59:57,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-06 19:59:57,513 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-06 19:59:57,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-06 19:59:57,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-06 19:59:57,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-06 19:59:57,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-06 19:59:57,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-06 19:59:57,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-06 19:59:57,559 INFO L234 CfgBuilder]: Building ICFG [2022-04-06 19:59:57,560 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-06 19:59:57,649 INFO L275 CfgBuilder]: Performing block encoding [2022-04-06 19:59:57,653 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-06 19:59:57,654 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-06 19:59:57,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 07:59:57 BoogieIcfgContainer [2022-04-06 19:59:57,655 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-06 19:59:57,656 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-06 19:59:57,656 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-06 19:59:57,659 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-06 19:59:57,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.04 07:59:57" (1/3) ... [2022-04-06 19:59:57,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ed943aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 07:59:57, skipping insertion in model container [2022-04-06 19:59:57,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:59:57" (2/3) ... [2022-04-06 19:59:57,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ed943aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 07:59:57, skipping insertion in model container [2022-04-06 19:59:57,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 07:59:57" (3/3) ... [2022-04-06 19:59:57,661 INFO L111 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2022-04-06 19:59:57,664 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-06 19:59:57,664 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-06 19:59:57,691 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-06 19:59:57,697 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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 [2022-04-06 19:59:57,697 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-06 19:59:57,707 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 21 states have (on average 1.380952380952381) internal successors, (29), 23 states have internal predecessors, (29), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-06 19:59:57,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-06 19:59:57,712 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 19:59:57,712 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 19:59:57,713 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 19:59:57,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 19:59:57,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1361038294, now seen corresponding path program 1 times [2022-04-06 19:59:57,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 19:59:57,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1131506995] [2022-04-06 19:59:57,731 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 19:59:57,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1361038294, now seen corresponding path program 2 times [2022-04-06 19:59:57,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 19:59:57,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775363795] [2022-04-06 19:59:57,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 19:59:57,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 19:59:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 19:59:57,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 19:59:57,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 19:59:57,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 19:59:57,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 19:59:57,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775363795] [2022-04-06 19:59:57,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775363795] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 19:59:57,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 19:59:57,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-06 19:59:57,837 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 19:59:57,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1131506995] [2022-04-06 19:59:57,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1131506995] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 19:59:57,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 19:59:57,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-06 19:59:57,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154288513] [2022-04-06 19:59:57,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 19:59:57,841 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-06 19:59:57,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 19:59:57,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-06 19:59:57,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-06 19:59:57,859 INFO L87 Difference]: Start difference. First operand has 36 states, 21 states have (on average 1.380952380952381) internal successors, (29), 23 states have internal predecessors, (29), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 19:59:57,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 19:59:57,913 INFO L93 Difference]: Finished difference Result 62 states and 93 transitions. [2022-04-06 19:59:57,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-06 19:59:57,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-06 19:59:57,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 19:59:57,920 INFO L225 Difference]: With dead ends: 62 [2022-04-06 19:59:57,921 INFO L226 Difference]: Without dead ends: 30 [2022-04-06 19:59:57,923 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-06 19:59:57,925 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 24 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 19:59:57,926 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 42 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 19:59:57,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-06 19:59:57,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-06 19:59:57,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-06 19:59:57,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2022-04-06 19:59:57,973 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 15 [2022-04-06 19:59:57,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 19:59:57,973 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-04-06 19:59:57,974 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 19:59:57,974 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-06 19:59:57,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-06 19:59:57,975 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 19:59:57,975 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 19:59:57,975 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-06 19:59:57,975 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 19:59:57,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 19:59:57,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1347976123, now seen corresponding path program 1 times [2022-04-06 19:59:57,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 19:59:57,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1537459217] [2022-04-06 19:59:57,977 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 19:59:57,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1347976123, now seen corresponding path program 2 times [2022-04-06 19:59:57,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 19:59:57,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016678554] [2022-04-06 19:59:57,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 19:59:57,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 19:59:58,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 19:59:58,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 19:59:58,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 19:59:58,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 19:59:58,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 19:59:58,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016678554] [2022-04-06 19:59:58,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016678554] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 19:59:58,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 19:59:58,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 19:59:58,119 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 19:59:58,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1537459217] [2022-04-06 19:59:58,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1537459217] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 19:59:58,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 19:59:58,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 19:59:58,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307339187] [2022-04-06 19:59:58,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 19:59:58,120 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 19:59:58,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 19:59:58,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 19:59:58,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-06 19:59:58,121 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 19:59:58,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 19:59:58,276 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-06 19:59:58,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-06 19:59:58,277 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-06 19:59:58,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 19:59:58,281 INFO L225 Difference]: With dead ends: 36 [2022-04-06 19:59:58,281 INFO L226 Difference]: Without dead ends: 34 [2022-04-06 19:59:58,281 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-06 19:59:58,282 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 29 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 19:59:58,283 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 42 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 19:59:58,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-06 19:59:58,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-06 19:59:58,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-06 19:59:58,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-04-06 19:59:58,306 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 16 [2022-04-06 19:59:58,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 19:59:58,306 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-04-06 19:59:58,306 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 19:59:58,306 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-06 19:59:58,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-06 19:59:58,322 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 19:59:58,322 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 19:59:58,323 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-06 19:59:58,323 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 19:59:58,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 19:59:58,324 INFO L85 PathProgramCache]: Analyzing trace with hash -863391162, now seen corresponding path program 1 times [2022-04-06 19:59:58,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 19:59:58,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2090790874] [2022-04-06 19:59:58,327 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 19:59:58,327 INFO L85 PathProgramCache]: Analyzing trace with hash -863391162, now seen corresponding path program 2 times [2022-04-06 19:59:58,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 19:59:58,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814410595] [2022-04-06 19:59:58,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 19:59:58,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 19:59:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 19:59:58,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 19:59:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 19:59:58,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-06 19:59:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 19:59:58,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 19:59:58,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 19:59:58,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814410595] [2022-04-06 19:59:58,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814410595] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 19:59:58,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 19:59:58,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-06 19:59:58,413 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 19:59:58,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2090790874] [2022-04-06 19:59:58,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2090790874] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 19:59:58,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 19:59:58,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-06 19:59:58,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792513235] [2022-04-06 19:59:58,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 19:59:58,415 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-06 19:59:58,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 19:59:58,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-06 19:59:58,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-06 19:59:58,417 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-06 19:59:58,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 19:59:58,573 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2022-04-06 19:59:58,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-06 19:59:58,573 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-06 19:59:58,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 19:59:58,574 INFO L225 Difference]: With dead ends: 49 [2022-04-06 19:59:58,574 INFO L226 Difference]: Without dead ends: 47 [2022-04-06 19:59:58,575 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-06 19:59:58,576 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 44 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 19:59:58,576 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 48 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 19:59:58,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-06 19:59:58,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2022-04-06 19:59:58,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 29 states have internal predecessors, (31), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-06 19:59:58,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2022-04-06 19:59:58,585 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 21 [2022-04-06 19:59:58,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 19:59:58,585 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2022-04-06 19:59:58,585 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-06 19:59:58,585 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2022-04-06 19:59:58,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-06 19:59:58,586 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 19:59:58,586 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 19:59:58,586 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-06 19:59:58,587 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 19:59:58,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 19:59:58,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1742477006, now seen corresponding path program 1 times [2022-04-06 19:59:58,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 19:59:58,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [113616013] [2022-04-06 19:59:58,588 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 19:59:58,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1742477006, now seen corresponding path program 2 times [2022-04-06 19:59:58,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 19:59:58,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111394866] [2022-04-06 19:59:58,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 19:59:58,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 19:59:58,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 19:59:58,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 19:59:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 19:59:58,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-06 19:59:58,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 19:59:58,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-06 19:59:58,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 19:59:58,643 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-06 19:59:58,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 19:59:58,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111394866] [2022-04-06 19:59:58,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111394866] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 19:59:58,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 19:59:58,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-06 19:59:58,644 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 19:59:58,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [113616013] [2022-04-06 19:59:58,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [113616013] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 19:59:58,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 19:59:58,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-06 19:59:58,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633628075] [2022-04-06 19:59:58,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 19:59:58,645 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-06 19:59:58,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 19:59:58,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-06 19:59:58,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-06 19:59:58,646 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-06 19:59:58,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 19:59:58,806 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2022-04-06 19:59:58,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-06 19:59:58,807 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-06 19:59:58,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 19:59:58,810 INFO L225 Difference]: With dead ends: 56 [2022-04-06 19:59:58,810 INFO L226 Difference]: Without dead ends: 54 [2022-04-06 19:59:58,812 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-06 19:59:58,814 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 38 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 19:59:58,817 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 66 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 19:59:58,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-06 19:59:58,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2022-04-06 19:59:58,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 32 states have internal predecessors, (34), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-06 19:59:58,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2022-04-06 19:59:58,836 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 29 [2022-04-06 19:59:58,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 19:59:58,837 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2022-04-06 19:59:58,837 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-06 19:59:58,837 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2022-04-06 19:59:58,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-06 19:59:58,839 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 19:59:58,839 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 19:59:58,839 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-06 19:59:58,839 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 19:59:58,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 19:59:58,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1571308956, now seen corresponding path program 1 times [2022-04-06 19:59:58,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 19:59:58,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1499840873] [2022-04-06 19:59:58,840 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 19:59:58,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1571308956, now seen corresponding path program 2 times [2022-04-06 19:59:58,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 19:59:58,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953382892] [2022-04-06 19:59:58,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 19:59:58,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 19:59:58,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 19:59:58,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 19:59:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 19:59:58,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-06 19:59:58,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 19:59:58,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-06 19:59:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 19:59:58,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-06 19:59:58,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 19:59:58,961 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-06 19:59:58,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 19:59:58,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953382892] [2022-04-06 19:59:58,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953382892] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 19:59:58,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 19:59:58,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-06 19:59:58,962 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 19:59:58,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1499840873] [2022-04-06 19:59:58,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1499840873] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 19:59:58,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 19:59:58,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-06 19:59:58,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668291368] [2022-04-06 19:59:58,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 19:59:58,963 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-06 19:59:58,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 19:59:58,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-06 19:59:58,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-04-06 19:59:58,964 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-06 19:59:59,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 19:59:59,177 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2022-04-06 19:59:59,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-06 19:59:59,177 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2022-04-06 19:59:59,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 19:59:59,178 INFO L225 Difference]: With dead ends: 75 [2022-04-06 19:59:59,178 INFO L226 Difference]: Without dead ends: 68 [2022-04-06 19:59:59,179 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-04-06 19:59:59,179 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 72 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-06 19:59:59,180 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 45 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 19:59:59,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-06 19:59:59,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2022-04-06 19:59:59,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 40 states have (on average 1.125) internal successors, (45), 43 states have internal predecessors, (45), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-06 19:59:59,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2022-04-06 19:59:59,188 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 32 [2022-04-06 19:59:59,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 19:59:59,189 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2022-04-06 19:59:59,189 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-06 19:59:59,189 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2022-04-06 19:59:59,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-06 19:59:59,190 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 19:59:59,190 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 19:59:59,190 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-06 19:59:59,190 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 19:59:59,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 19:59:59,190 INFO L85 PathProgramCache]: Analyzing trace with hash 173943289, now seen corresponding path program 1 times [2022-04-06 19:59:59,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 19:59:59,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [630752197] [2022-04-06 19:59:59,191 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 19:59:59,191 INFO L85 PathProgramCache]: Analyzing trace with hash 173943289, now seen corresponding path program 2 times [2022-04-06 19:59:59,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 19:59:59,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439072348] [2022-04-06 19:59:59,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 19:59:59,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 19:59:59,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 19:59:59,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 19:59:59,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 19:59:59,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-06 19:59:59,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 19:59:59,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-06 19:59:59,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 19:59:59,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-06 19:59:59,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 19:59:59,254 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-06 19:59:59,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 19:59:59,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439072348] [2022-04-06 19:59:59,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439072348] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 19:59:59,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 19:59:59,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-06 19:59:59,255 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 19:59:59,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [630752197] [2022-04-06 19:59:59,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [630752197] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 19:59:59,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 19:59:59,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-06 19:59:59,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576586423] [2022-04-06 19:59:59,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 19:59:59,256 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-06 19:59:59,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 19:59:59,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-06 19:59:59,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-06 19:59:59,256 INFO L87 Difference]: Start difference. First operand 66 states and 79 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-06 19:59:59,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 19:59:59,467 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2022-04-06 19:59:59,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-06 19:59:59,468 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 34 [2022-04-06 19:59:59,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 19:59:59,468 INFO L225 Difference]: With dead ends: 77 [2022-04-06 19:59:59,469 INFO L226 Difference]: Without dead ends: 75 [2022-04-06 19:59:59,469 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-04-06 19:59:59,469 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 85 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 19:59:59,470 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 56 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 19:59:59,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-06 19:59:59,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2022-04-06 19:59:59,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 46 states have internal predecessors, (48), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-06 19:59:59,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2022-04-06 19:59:59,478 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 34 [2022-04-06 19:59:59,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 19:59:59,479 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2022-04-06 19:59:59,479 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-06 19:59:59,479 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2022-04-06 19:59:59,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-06 19:59:59,480 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 19:59:59,480 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 19:59:59,480 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-06 19:59:59,480 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 19:59:59,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 19:59:59,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1755534668, now seen corresponding path program 1 times [2022-04-06 19:59:59,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 19:59:59,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [216447420] [2022-04-06 19:59:59,492 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-06 19:59:59,493 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-06 19:59:59,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1755534668, now seen corresponding path program 2 times [2022-04-06 19:59:59,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 19:59:59,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114484491] [2022-04-06 19:59:59,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 19:59:59,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 19:59:59,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 19:59:59,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 19:59:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 19:59:59,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-06 19:59:59,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 19:59:59,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-06 19:59:59,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 19:59:59,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-06 19:59:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 19:59:59,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-06 19:59:59,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 19:59:59,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-06 19:59:59,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 19:59:59,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-06 19:59:59,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 19:59:59,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-06 19:59:59,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 19:59:59,601 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-06 19:59:59,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 19:59:59,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114484491] [2022-04-06 19:59:59,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114484491] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 19:59:59,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253524845] [2022-04-06 19:59:59,601 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 19:59:59,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 19:59:59,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 19:59:59,603 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) [2022-04-06 19:59:59,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-06 19:59:59,648 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-06 19:59:59,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 19:59:59,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-06 19:59:59,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 19:59:59,891 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-06 19:59:59,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 20:00:00,023 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-06 20:00:00,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253524845] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 20:00:00,023 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 20:00:00,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-06 20:00:00,024 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 20:00:00,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [216447420] [2022-04-06 20:00:00,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [216447420] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 20:00:00,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 20:00:00,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-06 20:00:00,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197839189] [2022-04-06 20:00:00,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 20:00:00,025 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-06 20:00:00,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 20:00:00,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-06 20:00:00,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2022-04-06 20:00:00,025 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-06 20:00:00,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 20:00:00,312 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2022-04-06 20:00:00,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-06 20:00:00,312 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 57 [2022-04-06 20:00:00,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 20:00:00,313 INFO L225 Difference]: With dead ends: 92 [2022-04-06 20:00:00,313 INFO L226 Difference]: Without dead ends: 85 [2022-04-06 20:00:00,314 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 120 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2022-04-06 20:00:00,314 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 82 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-06 20:00:00,314 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 55 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 20:00:00,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-06 20:00:00,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2022-04-06 20:00:00,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 54 states have internal predecessors, (56), 22 states have call successors, (22), 10 states have call predecessors, (22), 9 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-06 20:00:00,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 98 transitions. [2022-04-06 20:00:00,324 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 98 transitions. Word has length 57 [2022-04-06 20:00:00,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 20:00:00,324 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 98 transitions. [2022-04-06 20:00:00,324 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-06 20:00:00,325 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 98 transitions. [2022-04-06 20:00:00,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-06 20:00:00,325 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 20:00:00,325 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 20:00:00,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-06 20:00:00,539 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 20:00:00,539 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 20:00:00,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 20:00:00,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1121193385, now seen corresponding path program 1 times [2022-04-06 20:00:00,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 20:00:00,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1195273304] [2022-04-06 20:00:00,545 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-06 20:00:00,545 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-06 20:00:00,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1121193385, now seen corresponding path program 2 times [2022-04-06 20:00:00,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 20:00:00,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402455833] [2022-04-06 20:00:00,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 20:00:00,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 20:00:00,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 20:00:00,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 20:00:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 20:00:00,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-06 20:00:00,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 20:00:00,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-06 20:00:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 20:00:00,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-06 20:00:00,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 20:00:00,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-06 20:00:00,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 20:00:00,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-06 20:00:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 20:00:00,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-06 20:00:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 20:00:00,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-06 20:00:00,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 20:00:00,672 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-06 20:00:00,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 20:00:00,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402455833] [2022-04-06 20:00:00,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402455833] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 20:00:00,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608610021] [2022-04-06 20:00:00,672 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 20:00:00,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 20:00:00,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 20:00:00,688 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 20:00:00,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-06 20:00:00,726 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-06 20:00:00,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 20:00:00,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-06 20:00:00,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 20:00:00,942 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-06 20:00:00,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 20:00:01,061 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-06 20:00:01,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608610021] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 20:00:01,062 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 20:00:01,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 16 [2022-04-06 20:00:01,063 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 20:00:01,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1195273304] [2022-04-06 20:00:01,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1195273304] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 20:00:01,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 20:00:01,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-06 20:00:01,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166745116] [2022-04-06 20:00:01,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 20:00:01,065 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-06 20:00:01,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 20:00:01,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-06 20:00:01,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-04-06 20:00:01,066 INFO L87 Difference]: Start difference. First operand 83 states and 98 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-06 20:00:01,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 20:00:01,286 INFO L93 Difference]: Finished difference Result 94 states and 109 transitions. [2022-04-06 20:00:01,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-06 20:00:01,287 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 59 [2022-04-06 20:00:01,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 20:00:01,288 INFO L225 Difference]: With dead ends: 94 [2022-04-06 20:00:01,288 INFO L226 Difference]: Without dead ends: 92 [2022-04-06 20:00:01,289 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 125 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2022-04-06 20:00:01,289 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 101 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 20:00:01,290 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 61 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 20:00:01,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-06 20:00:01,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2022-04-06 20:00:01,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 57 states have internal predecessors, (59), 22 states have call successors, (22), 11 states have call predecessors, (22), 10 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-06 20:00:01,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 101 transitions. [2022-04-06 20:00:01,308 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 101 transitions. Word has length 59 [2022-04-06 20:00:01,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 20:00:01,309 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 101 transitions. [2022-04-06 20:00:01,309 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-06 20:00:01,310 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2022-04-06 20:00:01,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-06 20:00:01,313 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 20:00:01,313 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 20:00:01,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-06 20:00:01,527 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-04-06 20:00:01,527 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 20:00:01,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 20:00:01,528 INFO L85 PathProgramCache]: Analyzing trace with hash 525355932, now seen corresponding path program 3 times [2022-04-06 20:00:01,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 20:00:01,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1928842826] [2022-04-06 20:00:01,531 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-06 20:00:01,532 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-06 20:00:01,532 INFO L85 PathProgramCache]: Analyzing trace with hash 525355932, now seen corresponding path program 4 times [2022-04-06 20:00:01,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 20:00:01,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791917460] [2022-04-06 20:00:01,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 20:00:01,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 20:00:01,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 20:00:01,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 20:00:01,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 20:00:01,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-06 20:00:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 20:00:01,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-06 20:00:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 20:00:01,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-06 20:00:01,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 20:00:01,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-06 20:00:01,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 20:00:01,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-06 20:00:01,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 20:00:01,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-06 20:00:01,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 20:00:01,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-06 20:00:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 20:00:01,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-04-06 20:00:01,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 20:00:01,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-04-06 20:00:01,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 20:00:01,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-04-06 20:00:01,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 20:00:01,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-04-06 20:00:01,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 20:00:01,754 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 48 proven. 17 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-04-06 20:00:01,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 20:00:01,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791917460] [2022-04-06 20:00:01,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791917460] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 20:00:01,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358656925] [2022-04-06 20:00:01,754 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-06 20:00:01,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 20:00:01,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 20:00:01,771 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 20:00:01,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-06 20:00:01,836 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-06 20:00:01,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 20:00:01,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-06 20:00:01,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 20:00:02,210 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-06 20:00:02,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 20:00:02,500 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-06 20:00:02,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358656925] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 20:00:02,501 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 20:00:02,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 25 [2022-04-06 20:00:02,501 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 20:00:02,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1928842826] [2022-04-06 20:00:02,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1928842826] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 20:00:02,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 20:00:02,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-06 20:00:02,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465346977] [2022-04-06 20:00:02,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 20:00:02,502 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-06 20:00:02,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 20:00:02,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-06 20:00:02,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2022-04-06 20:00:02,502 INFO L87 Difference]: Start difference. First operand 87 states and 101 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2022-04-06 20:00:02,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 20:00:02,738 INFO L93 Difference]: Finished difference Result 91 states and 105 transitions. [2022-04-06 20:00:02,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-06 20:00:02,739 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) Word has length 82 [2022-04-06 20:00:02,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 20:00:02,741 INFO L225 Difference]: With dead ends: 91 [2022-04-06 20:00:02,741 INFO L226 Difference]: Without dead ends: 82 [2022-04-06 20:00:02,741 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 174 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=213, Invalid=1047, Unknown=0, NotChecked=0, Total=1260 [2022-04-06 20:00:02,742 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 37 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 20:00:02,742 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 73 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 20:00:02,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-06 20:00:02,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-04-06 20:00:02,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 55 states have (on average 1.018181818181818) internal successors, (56), 55 states have internal predecessors, (56), 16 states have call successors, (16), 12 states have call predecessors, (16), 10 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-06 20:00:02,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2022-04-06 20:00:02,756 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 82 [2022-04-06 20:00:02,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 20:00:02,772 INFO L478 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2022-04-06 20:00:02,772 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2022-04-06 20:00:02,772 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2022-04-06 20:00:02,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-06 20:00:02,774 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 20:00:02,774 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 20:00:02,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-06 20:00:02,996 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 20:00:02,996 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 20:00:02,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 20:00:02,996 INFO L85 PathProgramCache]: Analyzing trace with hash 35434489, now seen corresponding path program 3 times [2022-04-06 20:00:02,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 20:00:02,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1893300914] [2022-04-06 20:00:03,000 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-06 20:00:03,000 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-06 20:00:03,000 INFO L85 PathProgramCache]: Analyzing trace with hash 35434489, now seen corresponding path program 4 times [2022-04-06 20:00:03,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 20:00:03,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521586138] [2022-04-06 20:00:03,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 20:00:03,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 20:00:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 20:00:03,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 20:00:03,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 20:00:03,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-06 20:00:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 20:00:03,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-06 20:00:03,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 20:00:03,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-06 20:00:03,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 20:00:03,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-06 20:00:03,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 20:00:03,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-06 20:00:03,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 20:00:03,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-06 20:00:03,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 20:00:03,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-06 20:00:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 20:00:03,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-04-06 20:00:03,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 20:00:03,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-04-06 20:00:03,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 20:00:03,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-04-06 20:00:03,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 20:00:03,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-04-06 20:00:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 20:00:03,186 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 48 proven. 31 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-04-06 20:00:03,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 20:00:03,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521586138] [2022-04-06 20:00:03,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521586138] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 20:00:03,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700526703] [2022-04-06 20:00:03,187 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-06 20:00:03,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 20:00:03,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 20:00:03,196 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 20:00:03,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-06 20:00:03,234 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-06 20:00:03,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 20:00:03,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-06 20:00:03,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 20:00:03,552 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-06 20:00:03,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 20:00:03,763 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-06 20:00:03,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700526703] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 20:00:03,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 20:00:03,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 11] total 29 [2022-04-06 20:00:03,764 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 20:00:03,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1893300914] [2022-04-06 20:00:03,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1893300914] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 20:00:03,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 20:00:03,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-06 20:00:03,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719148618] [2022-04-06 20:00:03,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 20:00:03,765 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-06 20:00:03,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 20:00:03,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-06 20:00:03,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2022-04-06 20:00:03,766 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 5 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-06 20:00:04,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 20:00:04,004 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2022-04-06 20:00:04,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-06 20:00:04,004 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 5 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Word has length 84 [2022-04-06 20:00:04,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 20:00:04,004 INFO L225 Difference]: With dead ends: 82 [2022-04-06 20:00:04,004 INFO L226 Difference]: Without dead ends: 0 [2022-04-06 20:00:04,005 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 174 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=202, Invalid=1280, Unknown=0, NotChecked=0, Total=1482 [2022-04-06 20:00:04,006 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 20:00:04,006 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 62 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 20:00:04,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-06 20:00:04,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-06 20:00:04,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-06 20:00:04,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-06 20:00:04,007 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 84 [2022-04-06 20:00:04,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 20:00:04,007 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-06 20:00:04,007 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 5 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-06 20:00:04,007 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-06 20:00:04,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-06 20:00:04,009 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-06 20:00:04,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-06 20:00:04,209 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 20:00:04,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-06 20:00:04,995 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-06 20:00:04,995 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-06 20:00:04,995 INFO L882 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-06 20:00:04,995 INFO L882 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-06 20:00:04,995 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-06 20:00:04,995 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-06 20:00:04,995 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-06 20:00:04,996 INFO L885 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: true [2022-04-06 20:00:04,996 INFO L878 garLoopResultBuilder]: At program point L31-1(lines 25 56) the Hoare annotation is: (<= 2 main_~bufferlen~0) [2022-04-06 20:00:04,996 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 24 56) the Hoare annotation is: true [2022-04-06 20:00:04,996 INFO L878 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (let ((.cse0 (<= 2 main_~bufferlen~0)) (.cse1 (<= 0 main_~buf~0))) (or (and .cse0 (<= 1 main_~in~0) .cse1) (and (= main_~in~0 0) .cse0 .cse1)))) [2022-04-06 20:00:04,996 INFO L878 garLoopResultBuilder]: At program point L52-1(line 52) the Hoare annotation is: (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (let ((.cse0 (<= 2 main_~bufferlen~0)) (.cse1 (<= 0 main_~buf~0))) (or (and .cse0 (<= 1 main_~in~0) .cse1) (and (= main_~in~0 0) .cse0 .cse1)))) [2022-04-06 20:00:04,996 INFO L878 garLoopResultBuilder]: At program point L44(lines 44 45) the Hoare annotation is: (let ((.cse1 (+ 2 main_~buflim~0))) (and (<= (+ main_~buf~0 2) main_~bufferlen~0) (let ((.cse0 (<= 0 main_~buf~0))) (or (and (= main_~in~0 0) .cse0) (and (<= 1 main_~in~0) .cse0))) (<= (+ main_~bufferlen~0 1) main_~inlen~0) (<= main_~bufferlen~0 .cse1) (<= (+ main_~bufferlen~0 2 main_~in~0) (+ main_~buf~0 main_~inlen~0)) (<= .cse1 main_~bufferlen~0))) [2022-04-06 20:00:04,996 INFO L878 garLoopResultBuilder]: At program point L32(lines 25 56) the Hoare annotation is: (<= 2 main_~bufferlen~0) [2022-04-06 20:00:04,996 INFO L885 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: true [2022-04-06 20:00:04,996 INFO L878 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (let ((.cse0 (<= (+ main_~buf~0 2) main_~bufferlen~0)) (.cse1 (<= 1 main_~in~0)) (.cse2 (<= 0 main_~buf~0))) (or (and (= main_~in~0 0) (<= 2 main_~bufferlen~0) (= main_~buf~0 0)) (let ((.cse3 (+ 2 main_~buflim~0))) (and .cse0 .cse1 .cse2 (<= 3 main_~inlen~0) (<= main_~bufferlen~0 .cse3) (<= .cse3 main_~bufferlen~0))) (and .cse0 .cse1 .cse2 (<= (+ 2 main_~in~0) main_~inlen~0)))) [2022-04-06 20:00:04,996 INFO L878 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (let ((.cse4 (+ 2 main_~buflim~0))) (let ((.cse0 (<= (+ main_~buf~0 3) main_~bufferlen~0)) (.cse1 (<= (+ main_~bufferlen~0 1) main_~inlen~0)) (.cse2 (<= main_~bufferlen~0 .cse4)) (.cse3 (<= .cse4 main_~bufferlen~0))) (or (and .cse0 (= main_~in~0 0) (= main_~buf~0 0) .cse1 .cse2 .cse3) (and (<= (+ main_~bufferlen~0 main_~in~0 1) (+ main_~buf~0 main_~inlen~0)) .cse0 .cse1 (<= 1 main_~in~0) (<= 0 main_~buf~0) .cse2 .cse3)))) [2022-04-06 20:00:04,996 INFO L878 garLoopResultBuilder]: At program point L41-1(line 41) the Hoare annotation is: (let ((.cse4 (+ 2 main_~buflim~0))) (let ((.cse0 (<= (+ main_~buf~0 3) main_~bufferlen~0)) (.cse1 (<= (+ main_~bufferlen~0 1) main_~inlen~0)) (.cse2 (<= main_~bufferlen~0 .cse4)) (.cse3 (<= .cse4 main_~bufferlen~0))) (or (and .cse0 (= main_~in~0 0) (= main_~buf~0 0) .cse1 .cse2 .cse3) (and (<= (+ main_~bufferlen~0 main_~in~0 1) (+ main_~buf~0 main_~inlen~0)) .cse0 .cse1 (<= 1 main_~in~0) (<= 0 main_~buf~0) .cse2 .cse3)))) [2022-04-06 20:00:04,996 INFO L878 garLoopResultBuilder]: At program point L37-1(lines 37 48) the Hoare annotation is: (let ((.cse3 (+ 2 main_~buflim~0))) (let ((.cse0 (<= (+ main_~bufferlen~0 1) main_~inlen~0)) (.cse1 (<= main_~bufferlen~0 .cse3)) (.cse2 (<= .cse3 main_~bufferlen~0))) (or (and (<= (+ main_~bufferlen~0 main_~in~0 1) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 2) main_~bufferlen~0) .cse0 (<= 1 main_~in~0) (<= 0 main_~buf~0) .cse1 .cse2) (and (= main_~in~0 0) (= main_~buf~0 0) .cse0 (or (= main_~buf~0 main_~buflim~0) (not (<= main_~buflim~0 0))) .cse1 .cse2)))) [2022-04-06 20:00:04,997 INFO L878 garLoopResultBuilder]: At program point L37-3(lines 37 48) the Hoare annotation is: (let ((.cse0 (<= (+ main_~buf~0 2) main_~bufferlen~0)) (.cse1 (<= 1 main_~in~0)) (.cse2 (<= 0 main_~buf~0))) (or (and (= main_~in~0 0) (<= 2 main_~bufferlen~0) (= main_~buf~0 0)) (let ((.cse3 (+ 2 main_~buflim~0))) (and .cse0 .cse1 .cse2 (<= 3 main_~inlen~0) (<= main_~bufferlen~0 .cse3) (<= .cse3 main_~bufferlen~0))) (and .cse0 .cse1 .cse2 (<= (+ 2 main_~in~0) main_~inlen~0)))) [2022-04-06 20:00:04,997 INFO L878 garLoopResultBuilder]: At program point L33(line 33) the Hoare annotation is: (and (<= 2 main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2022-04-06 20:00:04,997 INFO L878 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (let ((.cse0 (let ((.cse1 (<= 2 main_~bufferlen~0)) (.cse2 (<= 0 main_~buf~0))) (or (and .cse1 (<= 1 main_~in~0) .cse2) (and (= main_~in~0 0) .cse1 .cse2))))) (or (and (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 3 main_~inlen~0) .cse0) (and (= main_~buf~0 0) .cse0))) [2022-04-06 20:00:04,997 INFO L878 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (let ((.cse0 (+ 2 main_~buflim~0))) (and (<= (+ main_~bufferlen~0 main_~in~0 1) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0) (<= 1 main_~in~0) (<= 0 main_~buf~0) (<= main_~bufferlen~0 .cse0) (<= .cse0 main_~bufferlen~0))) [2022-04-06 20:00:04,997 INFO L878 garLoopResultBuilder]: At program point L46-1(line 46) the Hoare annotation is: (let ((.cse0 (+ 2 main_~buflim~0))) (and (<= (+ main_~bufferlen~0 main_~in~0 1) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0) (<= 1 main_~in~0) (<= 0 main_~buf~0) (<= main_~bufferlen~0 .cse0) (<= .cse0 main_~bufferlen~0))) [2022-04-06 20:00:04,997 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 24 56) the Hoare annotation is: true [2022-04-06 20:00:04,997 INFO L878 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (let ((.cse0 (+ 2 main_~buflim~0))) (and (<= (+ main_~bufferlen~0 main_~in~0 1) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 3) main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0) (<= main_~bufferlen~0 .cse0) (<= .cse0 main_~bufferlen~0) (let ((.cse1 (<= 2 main_~bufferlen~0)) (.cse2 (<= 0 main_~buf~0))) (or (and .cse1 (<= 1 main_~in~0) .cse2) (and (= main_~in~0 0) .cse1 .cse2))))) [2022-04-06 20:00:04,997 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 24 56) the Hoare annotation is: true [2022-04-06 20:00:04,997 INFO L885 garLoopResultBuilder]: At program point L55(lines 25 56) the Hoare annotation is: true [2022-04-06 20:00:04,997 INFO L878 garLoopResultBuilder]: At program point L47(lines 37 48) the Hoare annotation is: (let ((.cse3 (+ 2 main_~buflim~0))) (let ((.cse0 (<= (+ main_~bufferlen~0 1) main_~inlen~0)) (.cse1 (<= main_~bufferlen~0 .cse3)) (.cse2 (<= .cse3 main_~bufferlen~0))) (or (and (<= (+ main_~bufferlen~0 main_~in~0 1) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 2) main_~bufferlen~0) .cse0 (<= 1 main_~in~0) (<= 0 main_~buf~0) .cse1 .cse2) (and (= main_~in~0 0) (= main_~buf~0 0) .cse0 (or (= main_~buf~0 main_~buflim~0) (not (<= main_~buflim~0 0))) .cse1 .cse2)))) [2022-04-06 20:00:04,997 INFO L878 garLoopResultBuilder]: At program point L39(lines 39 40) the Hoare annotation is: (let ((.cse3 (+ 2 main_~buflim~0))) (let ((.cse0 (<= (+ main_~bufferlen~0 1) main_~inlen~0)) (.cse1 (<= main_~bufferlen~0 .cse3)) (.cse2 (<= .cse3 main_~bufferlen~0))) (or (and (<= (+ main_~bufferlen~0 main_~in~0 1) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 2) main_~bufferlen~0) .cse0 (<= 1 main_~in~0) (<= 0 main_~buf~0) .cse1 .cse2) (and (= main_~in~0 0) (= main_~buf~0 0) .cse0 (or (= main_~buf~0 main_~buflim~0) (not (<= main_~buflim~0 0))) .cse1 .cse2)))) [2022-04-06 20:00:04,997 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-06 20:00:04,997 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-06 20:00:04,997 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-06 20:00:04,998 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-06 20:00:04,998 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-06 20:00:04,998 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-06 20:00:04,998 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-06 20:00:04,998 INFO L878 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| 0)) [2022-04-06 20:00:04,998 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-06 20:00:04,998 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| 0)) [2022-04-06 20:00:04,998 INFO L878 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-06 20:00:04,998 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-06 20:00:04,998 INFO L878 garLoopResultBuilder]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| 0)) [2022-04-06 20:00:05,000 INFO L719 BasicCegarLoop]: Path program histogram: [4, 4, 2, 2, 2, 2, 2, 2] [2022-04-06 20:00:05,001 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-06 20:00:05,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 08:00:05 BoogieIcfgContainer [2022-04-06 20:00:05,011 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-06 20:00:05,011 INFO L158 Benchmark]: Toolchain (without parser) took 7866.61ms. Allocated memory was 215.0MB in the beginning and 376.4MB in the end (delta: 161.5MB). Free memory was 161.7MB in the beginning and 251.1MB in the end (delta: -89.4MB). Peak memory consumption was 147.4MB. Max. memory is 8.0GB. [2022-04-06 20:00:05,011 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 215.0MB. Free memory was 178.0MB in the beginning and 178.0MB in the end (delta: 56.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-06 20:00:05,011 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.49ms. Allocated memory is still 215.0MB. Free memory was 161.5MB in the beginning and 186.5MB in the end (delta: -25.0MB). Peak memory consumption was 6.4MB. Max. memory is 8.0GB. [2022-04-06 20:00:05,011 INFO L158 Benchmark]: Boogie Preprocessor took 41.54ms. Allocated memory is still 215.0MB. Free memory was 186.5MB in the beginning and 185.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-06 20:00:05,012 INFO L158 Benchmark]: RCFGBuilder took 206.67ms. Allocated memory is still 215.0MB. Free memory was 185.1MB in the beginning and 173.8MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-06 20:00:05,012 INFO L158 Benchmark]: TraceAbstraction took 7354.56ms. Allocated memory was 215.0MB in the beginning and 376.4MB in the end (delta: 161.5MB). Free memory was 173.3MB in the beginning and 251.1MB in the end (delta: -77.8MB). Peak memory consumption was 158.7MB. Max. memory is 8.0GB. [2022-04-06 20:00:05,013 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 215.0MB. Free memory was 178.0MB in the beginning and 178.0MB in the end (delta: 56.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 260.49ms. Allocated memory is still 215.0MB. Free memory was 161.5MB in the beginning and 186.5MB in the end (delta: -25.0MB). Peak memory consumption was 6.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.54ms. Allocated memory is still 215.0MB. Free memory was 186.5MB in the beginning and 185.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 206.67ms. Allocated memory is still 215.0MB. Free memory was 185.1MB in the beginning and 173.8MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 7354.56ms. Allocated memory was 215.0MB in the beginning and 376.4MB in the end (delta: 161.5MB). Free memory was 173.3MB in the beginning and 251.1MB in the end (delta: -77.8MB). Peak memory consumption was 158.7MB. 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 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.3s, OverallIterations: 10, TraceHistogramMax: 12, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 552 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 544 mSDsluCounter, 550 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 256 mSDsCounter, 605 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1872 IncrementalHoareTripleChecker+Invalid, 2477 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 605 mSolverCounterUnsat, 294 mSDtfsCounter, 1872 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 815 GetRequests, 630 SyntacticMatches, 13 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1064 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=8, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 21 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 36 LocationsWithAnnotation, 246 PreInvPairs, 369 NumberOfFragments, 766 HoareAnnotationTreeSize, 246 FomulaSimplifications, 628 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 36 FomulaSimplificationsInter, 3967 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ((((((bufferlen + in + 1 <= buf + inlen && buf + 2 <= bufferlen) && bufferlen + 1 <= inlen) && 1 <= in) && 0 <= buf) && bufferlen <= 2 + buflim) && 2 + buflim <= bufferlen) || (((((in == 0 && buf == 0) && bufferlen + 1 <= inlen) && (buf == buflim || !(buflim <= 0))) && bufferlen <= 2 + buflim) && 2 + buflim <= bufferlen) - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == cond || \old(cond) == 0 RESULT: Ultimate proved your program to be correct! [2022-04-06 20:00:05,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...