java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-industry-pattern/array_of_struct_ptr_flag_init.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 12:59:11,000 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 12:59:11,002 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 12:59:11,013 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 12:59:11,014 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 12:59:11,015 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 12:59:11,016 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 12:59:11,018 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 12:59:11,020 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 12:59:11,020 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 12:59:11,021 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 12:59:11,023 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 12:59:11,023 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 12:59:11,024 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 12:59:11,025 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 12:59:11,026 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 12:59:11,027 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 12:59:11,028 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 12:59:11,030 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 12:59:11,032 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 12:59:11,034 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 12:59:11,035 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 12:59:11,036 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 12:59:11,037 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 12:59:11,039 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 12:59:11,040 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 12:59:11,040 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 12:59:11,041 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 12:59:11,041 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 12:59:11,042 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 12:59:11,043 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 12:59:11,043 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 12:59:11,044 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 12:59:11,045 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 12:59:11,046 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 12:59:11,047 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 12:59:11,047 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 12:59:11,048 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 12:59:11,048 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 12:59:11,049 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 12:59:11,050 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 12:59:11,050 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-20 12:59:11,065 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 12:59:11,065 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 12:59:11,067 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 12:59:11,067 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 12:59:11,067 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 12:59:11,067 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 12:59:11,068 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 12:59:11,068 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 12:59:11,068 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 12:59:11,068 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 12:59:11,068 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 12:59:11,069 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 12:59:11,069 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 12:59:11,069 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 12:59:11,069 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 12:59:11,069 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 12:59:11,070 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 12:59:11,070 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 12:59:11,070 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 12:59:11,070 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 12:59:11,070 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 12:59:11,071 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 12:59:11,071 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 12:59:11,071 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 12:59:11,071 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 12:59:11,071 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 12:59:11,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 12:59:11,072 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 12:59:11,072 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 12:59:11,100 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 12:59:11,112 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 12:59:11,115 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 12:59:11,116 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 12:59:11,117 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 12:59:11,117 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-industry-pattern/array_of_struct_ptr_flag_init.i [2019-09-20 12:59:11,177 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c9483ebe/955ab4cf935c45599e397a3310175899/FLAG8ff2fd5f5 [2019-09-20 12:59:11,581 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 12:59:11,582 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-industry-pattern/array_of_struct_ptr_flag_init.i [2019-09-20 12:59:11,588 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c9483ebe/955ab4cf935c45599e397a3310175899/FLAG8ff2fd5f5 [2019-09-20 12:59:12,010 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c9483ebe/955ab4cf935c45599e397a3310175899 [2019-09-20 12:59:12,022 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 12:59:12,025 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 12:59:12,026 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 12:59:12,026 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 12:59:12,030 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 12:59:12,031 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:59:12" (1/1) ... [2019-09-20 12:59:12,035 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e5baefa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:12, skipping insertion in model container [2019-09-20 12:59:12,035 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:59:12" (1/1) ... [2019-09-20 12:59:12,043 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 12:59:12,066 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 12:59:12,296 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 12:59:12,302 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 12:59:12,322 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 12:59:12,430 INFO L192 MainTranslator]: Completed translation [2019-09-20 12:59:12,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:12 WrapperNode [2019-09-20 12:59:12,431 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 12:59:12,431 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 12:59:12,432 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 12:59:12,432 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 12:59:12,444 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:12" (1/1) ... [2019-09-20 12:59:12,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:12" (1/1) ... [2019-09-20 12:59:12,451 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:12" (1/1) ... [2019-09-20 12:59:12,451 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:12" (1/1) ... [2019-09-20 12:59:12,460 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:12" (1/1) ... [2019-09-20 12:59:12,469 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:12" (1/1) ... [2019-09-20 12:59:12,476 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:12" (1/1) ... [2019-09-20 12:59:12,479 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 12:59:12,482 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 12:59:12,482 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 12:59:12,482 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 12:59:12,483 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 12:59:12,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 12:59:12,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 12:59:12,545 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-20 12:59:12,546 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-20 12:59:12,546 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 12:59:12,546 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 12:59:12,546 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 12:59:12,546 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-20 12:59:12,546 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-20 12:59:12,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 12:59:12,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 12:59:12,547 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 12:59:12,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-20 12:59:12,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 12:59:12,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 12:59:12,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 12:59:12,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 12:59:12,850 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 12:59:12,850 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-20 12:59:12,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:59:12 BoogieIcfgContainer [2019-09-20 12:59:12,852 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 12:59:12,861 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 12:59:12,861 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 12:59:12,870 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 12:59:12,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 12:59:12" (1/3) ... [2019-09-20 12:59:12,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17ea18c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:59:12, skipping insertion in model container [2019-09-20 12:59:12,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:12" (2/3) ... [2019-09-20 12:59:12,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17ea18c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:59:12, skipping insertion in model container [2019-09-20 12:59:12,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:59:12" (3/3) ... [2019-09-20 12:59:12,877 INFO L109 eAbstractionObserver]: Analyzing ICFG array_of_struct_ptr_flag_init.i [2019-09-20 12:59:12,886 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 12:59:12,893 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 12:59:12,909 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 12:59:12,935 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 12:59:12,936 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 12:59:12,936 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 12:59:12,936 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 12:59:12,936 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 12:59:12,936 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 12:59:12,937 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 12:59:12,937 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 12:59:12,937 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 12:59:12,952 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-09-20 12:59:12,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 12:59:12,957 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:12,958 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:12,959 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:12,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:12,964 INFO L82 PathProgramCache]: Analyzing trace with hash -850547107, now seen corresponding path program 1 times [2019-09-20 12:59:12,966 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:12,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:13,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:13,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:13,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:13,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:13,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:13,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-20 12:59:13,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-20 12:59:13,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-20 12:59:13,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 12:59:13,140 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2019-09-20 12:59:13,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:13,160 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2019-09-20 12:59:13,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-20 12:59:13,161 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2019-09-20 12:59:13,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:13,170 INFO L225 Difference]: With dead ends: 56 [2019-09-20 12:59:13,171 INFO L226 Difference]: Without dead ends: 28 [2019-09-20 12:59:13,176 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 12:59:13,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-20 12:59:13,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-09-20 12:59:13,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-20 12:59:13,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-09-20 12:59:13,213 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 20 [2019-09-20 12:59:13,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:13,222 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-09-20 12:59:13,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-20 12:59:13,223 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-09-20 12:59:13,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 12:59:13,224 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:13,224 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:13,224 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:13,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:13,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1453375688, now seen corresponding path program 1 times [2019-09-20 12:59:13,225 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:13,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:13,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:13,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:13,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:13,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:13,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:13,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:13,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:13,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:13,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:13,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:13,291 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2019-09-20 12:59:13,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:13,331 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2019-09-20 12:59:13,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:13,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-20 12:59:13,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:13,334 INFO L225 Difference]: With dead ends: 48 [2019-09-20 12:59:13,335 INFO L226 Difference]: Without dead ends: 36 [2019-09-20 12:59:13,336 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:13,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-20 12:59:13,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2019-09-20 12:59:13,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-20 12:59:13,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-09-20 12:59:13,350 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 20 [2019-09-20 12:59:13,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:13,351 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-09-20 12:59:13,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:13,351 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-09-20 12:59:13,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 12:59:13,353 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:13,353 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:13,353 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:13,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:13,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1976547036, now seen corresponding path program 1 times [2019-09-20 12:59:13,354 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:13,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:13,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:13,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:13,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:13,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:13,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:13,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:13,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:13,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:13,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:13,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:13,427 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 3 states. [2019-09-20 12:59:13,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:13,458 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2019-09-20 12:59:13,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:13,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-20 12:59:13,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:13,463 INFO L225 Difference]: With dead ends: 47 [2019-09-20 12:59:13,463 INFO L226 Difference]: Without dead ends: 29 [2019-09-20 12:59:13,464 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:13,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-20 12:59:13,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-09-20 12:59:13,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-20 12:59:13,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-09-20 12:59:13,473 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 23 [2019-09-20 12:59:13,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:13,474 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-09-20 12:59:13,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:13,475 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-09-20 12:59:13,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 12:59:13,476 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:13,476 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:13,476 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:13,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:13,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1583520026, now seen corresponding path program 1 times [2019-09-20 12:59:13,478 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:13,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:13,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:13,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:13,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:13,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:13,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 12:59:13,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:13,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 12:59:13,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 12:59:13,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 12:59:13,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 12:59:13,565 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 4 states. [2019-09-20 12:59:13,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:13,608 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2019-09-20 12:59:13,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 12:59:13,609 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-09-20 12:59:13,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:13,610 INFO L225 Difference]: With dead ends: 50 [2019-09-20 12:59:13,610 INFO L226 Difference]: Without dead ends: 31 [2019-09-20 12:59:13,611 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 12:59:13,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-20 12:59:13,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-09-20 12:59:13,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-20 12:59:13,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-09-20 12:59:13,616 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 23 [2019-09-20 12:59:13,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:13,617 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-09-20 12:59:13,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 12:59:13,617 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-09-20 12:59:13,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 12:59:13,618 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:13,618 INFO L407 BasicCegarLoop]: trace histogram [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] [2019-09-20 12:59:13,618 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:13,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:13,619 INFO L82 PathProgramCache]: Analyzing trace with hash -596099560, now seen corresponding path program 1 times [2019-09-20 12:59:13,619 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:13,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:13,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:13,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:13,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:13,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:13,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 12:59:13,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:13,722 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:13,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:13,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:13,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-20 12:59:13,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:13,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 12:59:13,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:13,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-09-20 12:59:13,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 12:59:13,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 12:59:13,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-20 12:59:13,877 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 7 states. [2019-09-20 12:59:13,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:13,952 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2019-09-20 12:59:13,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 12:59:13,953 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-09-20 12:59:13,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:13,954 INFO L225 Difference]: With dead ends: 52 [2019-09-20 12:59:13,954 INFO L226 Difference]: Without dead ends: 33 [2019-09-20 12:59:13,955 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-20 12:59:13,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-20 12:59:13,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-09-20 12:59:13,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-20 12:59:13,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2019-09-20 12:59:13,966 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 25 [2019-09-20 12:59:13,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:13,966 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2019-09-20 12:59:13,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 12:59:13,966 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2019-09-20 12:59:13,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-20 12:59:13,967 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:13,968 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:13,968 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:13,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:13,968 INFO L82 PathProgramCache]: Analyzing trace with hash 733518742, now seen corresponding path program 2 times [2019-09-20 12:59:13,969 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:13,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:13,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:13,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:13,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:14,097 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 12:59:14,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:14,098 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:14,141 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 12:59:14,175 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 12:59:14,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:59:14,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-20 12:59:14,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:14,212 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-20 12:59:14,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:14,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-09-20 12:59:14,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 12:59:14,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 12:59:14,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-20 12:59:14,218 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 8 states. [2019-09-20 12:59:14,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:14,338 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2019-09-20 12:59:14,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 12:59:14,340 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-09-20 12:59:14,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:14,341 INFO L225 Difference]: With dead ends: 69 [2019-09-20 12:59:14,342 INFO L226 Difference]: Without dead ends: 50 [2019-09-20 12:59:14,342 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-20 12:59:14,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-20 12:59:14,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 37. [2019-09-20 12:59:14,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-20 12:59:14,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2019-09-20 12:59:14,350 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 27 [2019-09-20 12:59:14,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:14,350 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2019-09-20 12:59:14,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 12:59:14,350 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2019-09-20 12:59:14,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-20 12:59:14,351 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:14,352 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:14,352 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:14,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:14,354 INFO L82 PathProgramCache]: Analyzing trace with hash 64390350, now seen corresponding path program 3 times [2019-09-20 12:59:14,354 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:14,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:14,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:14,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:59:14,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:14,482 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-20 12:59:14,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:14,483 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-20 12:59:14,508 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:14,548 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-20 12:59:14,548 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:59:14,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-20 12:59:14,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:14,596 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-20 12:59:14,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:14,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-09-20 12:59:14,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 12:59:14,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 12:59:14,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-20 12:59:14,602 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 10 states. [2019-09-20 12:59:14,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:14,755 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2019-09-20 12:59:14,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-20 12:59:14,755 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-09-20 12:59:14,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:14,756 INFO L225 Difference]: With dead ends: 82 [2019-09-20 12:59:14,757 INFO L226 Difference]: Without dead ends: 60 [2019-09-20 12:59:14,758 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-09-20 12:59:14,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-20 12:59:14,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-09-20 12:59:14,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-20 12:59:14,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-09-20 12:59:14,772 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 32 [2019-09-20 12:59:14,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:14,773 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-09-20 12:59:14,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 12:59:14,773 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-09-20 12:59:14,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-20 12:59:14,776 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:14,776 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:14,776 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:14,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:14,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1628887214, now seen corresponding path program 4 times [2019-09-20 12:59:14,777 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:14,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:14,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:14,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:59:14,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:14,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:14,904 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-20 12:59:14,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:14,904 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:14,934 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-20 12:59:14,969 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-20 12:59:14,970 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:59:14,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-20 12:59:14,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:15,042 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-20 12:59:15,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:15,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-09-20 12:59:15,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-20 12:59:15,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-20 12:59:15,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-09-20 12:59:15,050 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 13 states. [2019-09-20 12:59:15,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:15,116 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2019-09-20 12:59:15,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 12:59:15,117 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2019-09-20 12:59:15,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:15,118 INFO L225 Difference]: With dead ends: 70 [2019-09-20 12:59:15,118 INFO L226 Difference]: Without dead ends: 45 [2019-09-20 12:59:15,119 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-09-20 12:59:15,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-20 12:59:15,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-09-20 12:59:15,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-20 12:59:15,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2019-09-20 12:59:15,125 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 37 [2019-09-20 12:59:15,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:15,126 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2019-09-20 12:59:15,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-20 12:59:15,126 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2019-09-20 12:59:15,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-20 12:59:15,128 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:15,128 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:15,128 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:15,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:15,129 INFO L82 PathProgramCache]: Analyzing trace with hash 201537488, now seen corresponding path program 5 times [2019-09-20 12:59:15,129 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:15,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:15,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:15,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:59:15,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:15,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:15,245 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-20 12:59:15,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:15,246 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-20 12:59:15,284 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:15,341 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-20 12:59:15,342 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:59:15,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-20 12:59:15,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:15,402 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-20 12:59:15,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:15,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2019-09-20 12:59:15,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-20 12:59:15,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-20 12:59:15,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-09-20 12:59:15,409 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 13 states. [2019-09-20 12:59:15,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:15,555 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2019-09-20 12:59:15,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-20 12:59:15,556 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2019-09-20 12:59:15,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:15,557 INFO L225 Difference]: With dead ends: 97 [2019-09-20 12:59:15,557 INFO L226 Difference]: Without dead ends: 72 [2019-09-20 12:59:15,558 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-09-20 12:59:15,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-20 12:59:15,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 49. [2019-09-20 12:59:15,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-20 12:59:15,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2019-09-20 12:59:15,564 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 39 [2019-09-20 12:59:15,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:15,565 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2019-09-20 12:59:15,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-20 12:59:15,565 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2019-09-20 12:59:15,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-20 12:59:15,566 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:15,566 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:15,567 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:15,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:15,567 INFO L82 PathProgramCache]: Analyzing trace with hash 596570964, now seen corresponding path program 6 times [2019-09-20 12:59:15,567 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:15,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:15,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:15,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:59:15,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:15,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:15,701 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-20 12:59:15,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:15,701 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-20 12:59:15,729 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:15,765 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-09-20 12:59:15,765 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:59:15,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-20 12:59:15,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:15,934 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-20 12:59:15,934 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:15,948 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:15,950 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-20 12:59:15,950 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:15,954 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:15,955 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:59:15,955 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-09-20 12:59:15,998 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-09-20 12:59:16,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:16,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-09-20 12:59:16,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-20 12:59:16,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-20 12:59:16,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2019-09-20 12:59:16,003 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 18 states. [2019-09-20 12:59:16,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:16,251 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2019-09-20 12:59:16,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-20 12:59:16,252 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 44 [2019-09-20 12:59:16,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:16,253 INFO L225 Difference]: With dead ends: 89 [2019-09-20 12:59:16,253 INFO L226 Difference]: Without dead ends: 61 [2019-09-20 12:59:16,254 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2019-09-20 12:59:16,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-20 12:59:16,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2019-09-20 12:59:16,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-20 12:59:16,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-09-20 12:59:16,260 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 44 [2019-09-20 12:59:16,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:16,261 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2019-09-20 12:59:16,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-20 12:59:16,261 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2019-09-20 12:59:16,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-20 12:59:16,262 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:16,262 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:16,262 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:16,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:16,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1525406971, now seen corresponding path program 1 times [2019-09-20 12:59:16,263 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:16,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:16,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:16,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:59:16,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:16,305 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-09-20 12:59:16,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:16,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:16,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:16,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:16,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:16,307 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 3 states. [2019-09-20 12:59:16,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:16,313 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2019-09-20 12:59:16,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:16,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-09-20 12:59:16,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:16,316 INFO L225 Difference]: With dead ends: 69 [2019-09-20 12:59:16,316 INFO L226 Difference]: Without dead ends: 58 [2019-09-20 12:59:16,317 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:16,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-20 12:59:16,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-09-20 12:59:16,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-20 12:59:16,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-09-20 12:59:16,324 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 49 [2019-09-20 12:59:16,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:16,325 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-09-20 12:59:16,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:16,325 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-09-20 12:59:16,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-20 12:59:16,326 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:16,326 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 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] [2019-09-20 12:59:16,326 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:16,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:16,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1923347340, now seen corresponding path program 1 times [2019-09-20 12:59:16,327 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:16,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:16,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:16,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:16,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:16,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:16,481 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 2 proven. 49 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-20 12:59:16,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:16,481 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:16,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:16,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-20 12:59:16,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:16,721 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-20 12:59:16,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:16,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2019-09-20 12:59:16,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-20 12:59:16,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-20 12:59:16,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=208, Unknown=0, NotChecked=0, Total=342 [2019-09-20 12:59:16,731 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 19 states. [2019-09-20 12:59:16,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:16,807 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2019-09-20 12:59:16,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 12:59:16,809 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2019-09-20 12:59:16,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:16,810 INFO L225 Difference]: With dead ends: 96 [2019-09-20 12:59:16,810 INFO L226 Difference]: Without dead ends: 61 [2019-09-20 12:59:16,811 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=241, Unknown=0, NotChecked=0, Total=380 [2019-09-20 12:59:16,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-20 12:59:16,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-09-20 12:59:16,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-20 12:59:16,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-09-20 12:59:16,819 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 55 [2019-09-20 12:59:16,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:16,819 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-09-20 12:59:16,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-20 12:59:16,819 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-09-20 12:59:16,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-20 12:59:16,820 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:16,820 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 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] [2019-09-20 12:59:16,821 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:16,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:16,821 INFO L82 PathProgramCache]: Analyzing trace with hash -2014430862, now seen corresponding path program 2 times [2019-09-20 12:59:16,822 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:16,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:16,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:16,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:16,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:16,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:16,959 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 2 proven. 64 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-20 12:59:16,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:16,960 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:16,985 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 12:59:17,029 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 12:59:17,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:59:17,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-20 12:59:17,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:17,221 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-20 12:59:17,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:17,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2019-09-20 12:59:17,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-20 12:59:17,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-20 12:59:17,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=256, Unknown=0, NotChecked=0, Total=420 [2019-09-20 12:59:17,230 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 21 states. [2019-09-20 12:59:17,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:17,325 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2019-09-20 12:59:17,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-20 12:59:17,327 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 57 [2019-09-20 12:59:17,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:17,328 INFO L225 Difference]: With dead ends: 98 [2019-09-20 12:59:17,328 INFO L226 Difference]: Without dead ends: 63 [2019-09-20 12:59:17,331 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=293, Unknown=0, NotChecked=0, Total=462 [2019-09-20 12:59:17,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-20 12:59:17,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-09-20 12:59:17,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-20 12:59:17,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-09-20 12:59:17,347 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 57 [2019-09-20 12:59:17,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:17,347 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-09-20 12:59:17,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-20 12:59:17,348 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-09-20 12:59:17,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-20 12:59:17,348 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:17,349 INFO L407 BasicCegarLoop]: trace histogram [9, 9, 4, 4, 4, 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] [2019-09-20 12:59:17,349 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:17,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:17,349 INFO L82 PathProgramCache]: Analyzing trace with hash 648617712, now seen corresponding path program 3 times [2019-09-20 12:59:17,350 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:17,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:17,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:17,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:59:17,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:17,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:17,524 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 2 proven. 81 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-20 12:59:17,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:17,525 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:17,556 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-20 12:59:17,598 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-20 12:59:17,598 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:59:17,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-20 12:59:17,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:17,638 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-20 12:59:17,639 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:17,647 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:17,648 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:59:17,649 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-09-20 12:59:17,794 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:17,795 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 24 [2019-09-20 12:59:17,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:17,798 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-20 12:59:17,808 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:17,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:17,811 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:59:17,812 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:15 [2019-09-20 12:59:17,899 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-09-20 12:59:17,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:17,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2019-09-20 12:59:17,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-20 12:59:17,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-20 12:59:17,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2019-09-20 12:59:17,906 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 21 states. [2019-09-20 12:59:19,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:19,075 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2019-09-20 12:59:19,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-20 12:59:19,079 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 59 [2019-09-20 12:59:19,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:19,079 INFO L225 Difference]: With dead ends: 81 [2019-09-20 12:59:19,079 INFO L226 Difference]: Without dead ends: 0 [2019-09-20 12:59:19,081 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=496, Invalid=1760, Unknown=0, NotChecked=0, Total=2256 [2019-09-20 12:59:19,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-20 12:59:19,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-20 12:59:19,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-20 12:59:19,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-20 12:59:19,082 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 59 [2019-09-20 12:59:19,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:19,083 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-20 12:59:19,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-20 12:59:19,083 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-20 12:59:19,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-20 12:59:19,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-20 12:59:19,248 INFO L446 ceAbstractionStarter]: At program point initENTRY(lines 9 16) the Hoare annotation is: true [2019-09-20 12:59:19,248 INFO L443 ceAbstractionStarter]: For program point initEXIT(lines 9 16) no Hoare annotation was computed. [2019-09-20 12:59:19,248 INFO L443 ceAbstractionStarter]: For program point L12-2(lines 12 15) no Hoare annotation was computed. [2019-09-20 12:59:19,249 INFO L439 ceAbstractionStarter]: At program point L12-3(lines 12 15) the Hoare annotation is: (let ((.cse0 (= init_~a.base |init_#in~a.base|)) (.cse1 (= |init_#in~size| init_~size)) (.cse2 (= init_~a.offset |init_#in~a.offset|))) (or (and .cse0 (= init_~i~0 0) .cse1 .cse2) (and (exists ((v_init_~i~0_27 Int)) (and (< v_init_~i~0_27 init_~size) (<= init_~i~0 (+ v_init_~i~0_27 1)) (not (= 0 (select (select |#memory_$Pointer$.base| |init_#in~a.base|) (+ |init_#in~a.offset| (* 4 v_init_~i~0_27))))))) .cse0 .cse1 .cse2))) [2019-09-20 12:59:19,249 INFO L443 ceAbstractionStarter]: For program point L12-4(lines 9 16) no Hoare annotation was computed. [2019-09-20 12:59:19,249 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-20 12:59:19,249 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-09-20 12:59:19,249 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-20 12:59:19,249 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-20 12:59:19,249 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-20 12:59:19,250 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-20 12:59:19,250 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-20 12:59:19,250 INFO L443 ceAbstractionStarter]: For program point L33(lines 33 34) no Hoare annotation was computed. [2019-09-20 12:59:19,250 INFO L443 ceAbstractionStarter]: For program point L31-2(lines 31 35) no Hoare annotation was computed. [2019-09-20 12:59:19,250 INFO L439 ceAbstractionStarter]: At program point L31-3(lines 31 35) the Hoare annotation is: (= main_~flag~0 1) [2019-09-20 12:59:19,250 INFO L443 ceAbstractionStarter]: For program point L31-4(lines 31 35) no Hoare annotation was computed. [2019-09-20 12:59:19,251 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 17 37) no Hoare annotation was computed. [2019-09-20 12:59:19,251 INFO L439 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (and (= main_~flag~0 0) (= |main_~#a~0.offset| 0)) [2019-09-20 12:59:19,251 INFO L443 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2019-09-20 12:59:19,251 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 17 37) no Hoare annotation was computed. [2019-09-20 12:59:19,251 INFO L439 ceAbstractionStarter]: At program point L34(line 34) the Hoare annotation is: false [2019-09-20 12:59:19,251 INFO L443 ceAbstractionStarter]: For program point L34-1(line 34) no Hoare annotation was computed. [2019-09-20 12:59:19,252 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 17 37) the Hoare annotation is: true [2019-09-20 12:59:19,252 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 29) no Hoare annotation was computed. [2019-09-20 12:59:19,252 INFO L443 ceAbstractionStarter]: For program point L24-2(lines 24 30) no Hoare annotation was computed. [2019-09-20 12:59:19,252 INFO L439 ceAbstractionStarter]: At program point L24-3(lines 24 30) the Hoare annotation is: (let ((.cse0 (= main_~flag~0 0)) (.cse1 (exists ((v_init_~i~0_27 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* 4 v_init_~i~0_27) |main_~#a~0.offset|)) 0)) (< v_init_~i~0_27 100000) (<= 99999 v_init_~i~0_27)))) (.cse2 (= |main_~#a~0.offset| 0))) (or (and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (<= main_~i~1 99999) .cse0 (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|) 0) .cse1 .cse2) (and .cse0 (= main_~i~1 0) .cse1 .cse2) (= main_~flag~0 1))) [2019-09-20 12:59:19,252 INFO L443 ceAbstractionStarter]: For program point L24-4(lines 24 30) no Hoare annotation was computed. [2019-09-20 12:59:19,253 INFO L443 ceAbstractionStarter]: For program point L4-3(line 4) no Hoare annotation was computed. [2019-09-20 12:59:19,253 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(line 4) the Hoare annotation is: true [2019-09-20 12:59:19,253 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2019-09-20 12:59:19,253 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(line 4) no Hoare annotation was computed. [2019-09-20 12:59:19,254 INFO L443 ceAbstractionStarter]: For program point L4(line 4) no Hoare annotation was computed. [2019-09-20 12:59:19,254 INFO L443 ceAbstractionStarter]: For program point L4-1(line 4) no Hoare annotation was computed. [2019-09-20 12:59:19,270 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-20 12:59:19,271 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-20 12:59:19,272 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-20 12:59:19,272 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-09-20 12:59:19,273 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-09-20 12:59:19,273 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-09-20 12:59:19,273 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-20 12:59:19,273 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-09-20 12:59:19,274 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-09-20 12:59:19,274 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-09-20 12:59:19,285 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-20 12:59:19,286 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-20 12:59:19,286 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-20 12:59:19,286 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-20 12:59:19,289 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-20 12:59:19,290 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-20 12:59:19,290 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-20 12:59:19,290 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-09-20 12:59:19,290 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-09-20 12:59:19,291 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-09-20 12:59:19,291 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-20 12:59:19,291 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-09-20 12:59:19,292 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-09-20 12:59:19,292 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-09-20 12:59:19,292 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-20 12:59:19,292 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-20 12:59:19,292 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-20 12:59:19,293 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-20 12:59:19,295 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-09-20 12:59:19,295 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-09-20 12:59:19,295 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-20 12:59:19,296 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-09-20 12:59:19,297 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-20 12:59:19,297 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-09-20 12:59:19,301 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-09-20 12:59:19,301 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-20 12:59:19,301 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-09-20 12:59:19,303 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-20 12:59:19,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 12:59:19 BoogieIcfgContainer [2019-09-20 12:59:19,313 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 12:59:19,315 INFO L168 Benchmark]: Toolchain (without parser) took 7292.05 ms. Allocated memory was 135.8 MB in the beginning and 328.2 MB in the end (delta: 192.4 MB). Free memory was 85.2 MB in the beginning and 297.2 MB in the end (delta: -212.0 MB). Peak memory consumption was 199.7 MB. Max. memory is 7.1 GB. [2019-09-20 12:59:19,315 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 135.8 MB. Free memory is still 102.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-20 12:59:19,316 INFO L168 Benchmark]: CACSL2BoogieTranslator took 405.00 ms. Allocated memory was 135.8 MB in the beginning and 198.7 MB in the end (delta: 62.9 MB). Free memory was 85.2 MB in the beginning and 176.8 MB in the end (delta: -91.6 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. [2019-09-20 12:59:19,317 INFO L168 Benchmark]: Boogie Preprocessor took 47.51 ms. Allocated memory is still 198.7 MB. Free memory was 176.8 MB in the beginning and 174.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-09-20 12:59:19,318 INFO L168 Benchmark]: RCFGBuilder took 370.09 ms. Allocated memory is still 198.7 MB. Free memory was 174.6 MB in the beginning and 157.4 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 7.1 GB. [2019-09-20 12:59:19,319 INFO L168 Benchmark]: TraceAbstraction took 6452.22 ms. Allocated memory was 198.7 MB in the beginning and 328.2 MB in the end (delta: 129.5 MB). Free memory was 157.4 MB in the beginning and 297.2 MB in the end (delta: -139.8 MB). Peak memory consumption was 209.0 MB. Max. memory is 7.1 GB. [2019-09-20 12:59:19,322 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 135.8 MB. Free memory is still 102.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 405.00 ms. Allocated memory was 135.8 MB in the beginning and 198.7 MB in the end (delta: 62.9 MB). Free memory was 85.2 MB in the beginning and 176.8 MB in the end (delta: -91.6 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.51 ms. Allocated memory is still 198.7 MB. Free memory was 176.8 MB in the beginning and 174.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 370.09 ms. Allocated memory is still 198.7 MB. Free memory was 174.6 MB in the beginning and 157.4 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6452.22 ms. Allocated memory was 198.7 MB in the beginning and 328.2 MB in the end (delta: 129.5 MB). Free memory was 157.4 MB in the beginning and 297.2 MB in the end (delta: -139.8 MB). Peak memory consumption was 209.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: flag == 1 - InvariantResult [Line: 24]: Loop Invariant [2019-09-20 12:59:19,332 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-20 12:59:19,332 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-20 12:59:19,332 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-20 12:59:19,332 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-09-20 12:59:19,333 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-09-20 12:59:19,333 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-09-20 12:59:19,333 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-20 12:59:19,335 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-09-20 12:59:19,336 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-09-20 12:59:19,336 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-09-20 12:59:19,336 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-20 12:59:19,336 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-20 12:59:19,336 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-20 12:59:19,337 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-20 12:59:19,337 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-20 12:59:19,337 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-20 12:59:19,338 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-20 12:59:19,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-09-20 12:59:19,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-09-20 12:59:19,339 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-09-20 12:59:19,339 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-20 12:59:19,339 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-09-20 12:59:19,339 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-09-20 12:59:19,339 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-09-20 12:59:19,340 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-20 12:59:19,340 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-20 12:59:19,340 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-20 12:59:19,340 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((0 == #memory_$Pointer$[a][a] && i <= 99999) && flag == 0) && #memory_$Pointer$[a][a] == 0) && (\exists v_init_~i~0_27 : int :: (!(#memory_$Pointer$[a][4 * v_init_~i~0_27 + a] == 0) && v_init_~i~0_27 < 100000) && 99999 <= v_init_~i~0_27)) && a == 0) || (((flag == 0 && i == 0) && (\exists v_init_~i~0_27 : int :: (!(#memory_$Pointer$[a][4 * v_init_~i~0_27 + a] == 0) && v_init_~i~0_27 < 100000) && 99999 <= v_init_~i~0_27)) && a == 0)) || flag == 1 - InvariantResult [Line: 12]: Loop Invariant [2019-09-20 12:59:19,342 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-09-20 12:59:19,342 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-09-20 12:59:19,342 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-20 12:59:19,342 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-09-20 12:59:19,342 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-20 12:59:19,343 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-09-20 12:59:19,343 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-09-20 12:59:19,343 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-20 12:59:19,343 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-09-20 12:59:19,344 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((a == a && i == 0) && \old(size) == size) && a == a) || ((((\exists v_init_~i~0_27 : int :: (v_init_~i~0_27 < size && i <= v_init_~i~0_27 + 1) && !(0 == #memory_$Pointer$[a][a + 4 * v_init_~i~0_27])) && a == a) && \old(size) == size) && a == a) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. SAFE Result, 6.3s OverallTime, 14 OverallIterations, 9 TraceHistogramMax, 2.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 376 SDtfs, 206 SDslu, 1763 SDs, 0 SdLazy, 759 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 501 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 927 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 69 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 27 PreInvPairs, 44 NumberOfFragments, 141 HoareAnnotationTreeSize, 27 FomulaSimplifications, 540 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 9 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 885 NumberOfCodeBlocks, 853 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 862 ConstructedInterpolants, 14 QuantifiedInterpolants, 121513 SizeOfPredicates, 28 NumberOfNonLiveVariables, 1519 ConjunctsInSsa, 96 ConjunctsInUnsatCore, 23 InterpolantComputations, 5 PerfectInterpolantSequences, 446/913 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...