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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/array-industry-pattern/array_single_elem_init.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 00:38:08,675 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 00:38:08,678 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 00:38:08,697 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 00:38:08,697 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 00:38:08,699 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 00:38:08,701 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 00:38:08,711 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 00:38:08,717 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 00:38:08,721 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 00:38:08,722 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 00:38:08,724 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 00:38:08,724 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 00:38:08,726 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 00:38:08,727 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 00:38:08,728 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 00:38:08,728 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 00:38:08,729 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 00:38:08,731 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 00:38:08,732 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 00:38:08,734 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 00:38:08,735 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 00:38:08,736 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 00:38:08,737 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 00:38:08,739 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 00:38:08,739 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 00:38:08,739 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 00:38:08,740 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 00:38:08,741 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 00:38:08,741 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 00:38:08,742 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 00:38:08,742 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 00:38:08,743 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 00:38:08,744 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 00:38:08,745 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 00:38:08,745 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 00:38:08,746 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 00:38:08,746 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 00:38:08,746 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 00:38:08,747 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 00:38:08,748 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 00:38:08,749 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-10-07 00:38:08,775 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 00:38:08,776 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 00:38:08,779 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 00:38:08,779 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 00:38:08,779 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 00:38:08,780 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 00:38:08,780 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 00:38:08,780 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 00:38:08,780 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 00:38:08,780 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 00:38:08,781 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 00:38:08,781 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 00:38:08,781 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 00:38:08,781 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 00:38:08,781 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 00:38:08,782 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 00:38:08,782 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 00:38:08,782 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 00:38:08,782 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 00:38:08,782 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 00:38:08,783 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 00:38:08,783 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:38:08,783 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 00:38:08,783 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 00:38:08,783 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 00:38:08,784 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 00:38:08,784 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 00:38:08,784 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 00:38:08,784 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 00:38:09,080 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 00:38:09,093 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 00:38:09,097 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 00:38:09,098 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 00:38:09,099 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 00:38:09,100 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-industry-pattern/array_single_elem_init.i [2019-10-07 00:38:09,166 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1946c0017/25a33e7d76d54e29b7c5b4f5a7ccc28f/FLAG0b8a02858 [2019-10-07 00:38:09,640 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 00:38:09,643 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-industry-pattern/array_single_elem_init.i [2019-10-07 00:38:09,650 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1946c0017/25a33e7d76d54e29b7c5b4f5a7ccc28f/FLAG0b8a02858 [2019-10-07 00:38:10,024 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1946c0017/25a33e7d76d54e29b7c5b4f5a7ccc28f [2019-10-07 00:38:10,035 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 00:38:10,037 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 00:38:10,038 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 00:38:10,038 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 00:38:10,042 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 00:38:10,043 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:38:10" (1/1) ... [2019-10-07 00:38:10,046 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b22563b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:38:10, skipping insertion in model container [2019-10-07 00:38:10,046 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:38:10" (1/1) ... [2019-10-07 00:38:10,055 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 00:38:10,073 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 00:38:10,283 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:38:10,288 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 00:38:10,311 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:38:10,331 INFO L192 MainTranslator]: Completed translation [2019-10-07 00:38:10,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:38:10 WrapperNode [2019-10-07 00:38:10,332 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 00:38:10,333 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 00:38:10,333 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 00:38:10,333 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 00:38:10,424 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:38:10" (1/1) ... [2019-10-07 00:38:10,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:38:10" (1/1) ... [2019-10-07 00:38:10,436 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:38:10" (1/1) ... [2019-10-07 00:38:10,438 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:38:10" (1/1) ... [2019-10-07 00:38:10,461 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:38:10" (1/1) ... [2019-10-07 00:38:10,466 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:38:10" (1/1) ... [2019-10-07 00:38:10,468 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:38:10" (1/1) ... [2019-10-07 00:38:10,470 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 00:38:10,471 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 00:38:10,471 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 00:38:10,471 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 00:38:10,472 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:38:10" (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-10-07 00:38:10,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 00:38:10,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 00:38:10,536 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 00:38:10,536 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 00:38:10,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 00:38:10,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 00:38:10,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 00:38:10,537 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 00:38:10,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 00:38:10,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 00:38:10,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 00:38:10,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 00:38:10,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 00:38:10,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 00:38:11,044 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 00:38:11,044 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-07 00:38:11,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:38:11 BoogieIcfgContainer [2019-10-07 00:38:11,046 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 00:38:11,047 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 00:38:11,047 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 00:38:11,051 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 00:38:11,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:38:10" (1/3) ... [2019-10-07 00:38:11,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ca9c871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:38:11, skipping insertion in model container [2019-10-07 00:38:11,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:38:10" (2/3) ... [2019-10-07 00:38:11,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ca9c871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:38:11, skipping insertion in model container [2019-10-07 00:38:11,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:38:11" (3/3) ... [2019-10-07 00:38:11,055 INFO L109 eAbstractionObserver]: Analyzing ICFG array_single_elem_init.i [2019-10-07 00:38:11,065 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 00:38:11,074 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 00:38:11,086 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 00:38:11,110 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 00:38:11,110 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 00:38:11,110 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 00:38:11,110 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 00:38:11,111 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 00:38:11,111 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 00:38:11,111 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 00:38:11,111 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 00:38:11,130 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-10-07 00:38:11,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-07 00:38:11,136 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:38:11,136 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:38:11,138 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:38:11,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:38:11,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1264123479, now seen corresponding path program 1 times [2019-10-07 00:38:11,151 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:38:11,151 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:38:11,152 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:38:11,152 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:38:11,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:38:11,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:38:11,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:38:11,325 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:38:11,326 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:38:11,326 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:38:11,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:38:11,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:38:11,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:38:11,352 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2019-10-07 00:38:11,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:38:11,437 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2019-10-07 00:38:11,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:38:11,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-07 00:38:11,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:38:11,454 INFO L225 Difference]: With dead ends: 38 [2019-10-07 00:38:11,454 INFO L226 Difference]: Without dead ends: 21 [2019-10-07 00:38:11,463 INFO L606 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-10-07 00:38:11,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-07 00:38:11,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-10-07 00:38:11,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-07 00:38:11,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-10-07 00:38:11,524 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 12 [2019-10-07 00:38:11,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:38:11,525 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-10-07 00:38:11,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:38:11,527 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2019-10-07 00:38:11,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-07 00:38:11,528 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:38:11,529 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:38:11,530 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:38:11,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:38:11,531 INFO L82 PathProgramCache]: Analyzing trace with hash -392956526, now seen corresponding path program 1 times [2019-10-07 00:38:11,532 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:38:11,532 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:38:11,532 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:38:11,533 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:38:11,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:38:11,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:38:11,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 00:38:11,699 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:38:11,700 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:38:11,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:38:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:38:11,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 00:38:11,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:38:11,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 00:38:11,805 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:38:11,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 00:38:11,852 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:38:11,887 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 00:38:11,887 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:38:11,912 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:38:11,925 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:38:11,925 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:38:12,167 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:38:12,557 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:38:12,695 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 221 [2019-10-07 00:38:12,727 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:38:12,926 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 211 [2019-10-07 00:38:13,078 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 206 [2019-10-07 00:38:13,222 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2019-10-07 00:38:13,243 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:38:13,517 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2019-10-07 00:38:13,632 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:38:13,976 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:38:14,169 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:38:14,783 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 28 for LOIs [2019-10-07 00:38:14,805 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:38:14,814 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:38:14,815 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:38:14,816 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 216#(and (exists ((v_prenex_11 Int) (|v_main_~#c~0.base_BEFORE_CALL_1| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= 0 (select (select |#memory_int| |v_main_~#c~0.base_BEFORE_CALL_1|) 60000))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= 0 (select (select |#memory_int| v_prenex_11) 60000)) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:38:14,817 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 226#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_11 Int) (|v_main_~#c~0.base_BEFORE_CALL_1| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= 0 (select (select |#memory_int| |v_main_~#c~0.base_BEFORE_CALL_1|) 60000))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= 0 (select (select |#memory_int| v_prenex_11) 60000)) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:38:14,817 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 221#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_11 Int) (|v_main_~#c~0.base_BEFORE_CALL_1| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= 0 (select (select |#memory_int| |v_main_~#c~0.base_BEFORE_CALL_1|) 60000))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= 0 (select (select |#memory_int| v_prenex_11) 60000)) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:38:14,818 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 230#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:38:14,819 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 197#(and (or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (= |main_~#c~0.offset| 0) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (= |#NULL.base| 0) (< main_~i~0 100000) (= |main_~#c~0.offset| 0) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0))) (or (and (<= 0 main_~i~0) (<= |main_~#c~0.offset| 0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#b~0.offset|) (<= main_~i~0 100000) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |main_~#c~0.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (<= 1 main_~i~0) (<= |main_~#c~0.offset| 0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#b~0.offset|) (<= main_~i~0 100000) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |main_~#c~0.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 00:38:14,819 INFO L193 IcfgInterpreter]: Reachable states at location L36 satisfy 202#(and (= |#NULL.base| 0) (< main_~i~0 100000) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (= |main_~#c~0.offset| 0) (= main_~i~0 15000) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 15000 main_~i~0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= (select (select |#memory_int| |main_~#c~0.base|) (+ |main_~#c~0.offset| (* 4 main_~i~0))) |main_#t~mem5|) (<= 1 main_~i~0) (<= |main_~#c~0.offset| 0) (<= 0 |main_~#b~0.offset|) (= |main_~#b~0.offset| 0) (<= main_~i~0 15000) (= |#NULL.offset| 0) (<= 0 |main_~#c~0.offset|) (= |main_~#a~0.offset| 0)) [2019-10-07 00:38:14,819 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:38:14,820 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:38:14,820 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 235#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:38:14,821 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:38:14,821 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 115#(and (or (and (= |#NULL.base| 0) (= |main_~#c~0.offset| 0) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (< |main_~#a~0.base| |#StackHeapBarrier|) (= 0 |#NULL.base|) (= |main_~#c~0.offset| 0) (not (= |main_~#b~0.base| 0)) (not (= 0 |main_~#a~0.base|)) (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |main_~#b~0.offset| 0) (= (store (store (store |old(#length)| |main_~#a~0.base| 400000) |main_~#b~0.base| 400000) |main_~#c~0.base| 400000) |#length|) (= |main_~#a~0.offset| 0) (< |main_~#b~0.base| |#StackHeapBarrier|) (not (= 0 |main_~#c~0.base|)) (= (select (store (store |old(#valid)| |main_~#a~0.base| 1) |main_~#b~0.base| 1) |main_~#c~0.base|) 0) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (< |main_~#c~0.base| |#StackHeapBarrier|) (= (select (store |old(#valid)| |main_~#a~0.base| 1) |main_~#b~0.base|) 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |#valid| (store (store (store |old(#valid)| |main_~#a~0.base| 1) |main_~#b~0.base| 1) |main_~#c~0.base| 1)) (= main_~i~0 0))) (<= 0 main_~i~0) (<= |main_~#c~0.offset| 0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#b~0.offset|) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |main_~#c~0.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:38:14,825 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 179#(and (or (and (= |#NULL.base| 0) (= |main_~#c~0.offset| 0) (<= 1 main_~i~0) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (= |#NULL.base| 0) (= |main_~#c~0.offset| 0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 60000))) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))) (or (and (<= 0 main_~i~0) (<= |main_~#c~0.offset| 0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#b~0.offset|) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |main_~#c~0.offset|) (<= main_~i~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (<= 1 main_~i~0) (<= |main_~#c~0.offset| 0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#b~0.offset|) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |main_~#c~0.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 00:38:14,826 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 211#(exists ((v_prenex_11 Int) (|v_main_~#c~0.base_BEFORE_CALL_1| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= 0 (select (select |#memory_int| |v_main_~#c~0.base_BEFORE_CALL_1|) 60000))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= 0 (select (select |#memory_int| v_prenex_11) 60000)) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 00:38:14,827 INFO L193 IcfgInterpreter]: Reachable states at location L32-2 satisfy 174#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (= |main_~#c~0.offset| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |main_~#c~0.offset| 0) (<= 0 |main_~#b~0.offset|) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (<= 0 |main_~#c~0.offset|) (= |main_~#a~0.offset| 0)) [2019-10-07 00:38:15,313 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 25 [2019-10-07 00:38:15,608 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:38:15,609 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 10] total 17 [2019-10-07 00:38:15,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-07 00:38:15,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-07 00:38:15,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2019-10-07 00:38:15,620 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 17 states. [2019-10-07 00:38:15,945 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2019-10-07 00:38:16,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:38:16,756 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2019-10-07 00:38:16,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-07 00:38:16,758 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2019-10-07 00:38:16,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:38:16,759 INFO L225 Difference]: With dead ends: 44 [2019-10-07 00:38:16,759 INFO L226 Difference]: Without dead ends: 31 [2019-10-07 00:38:16,762 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2019-10-07 00:38:16,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-07 00:38:16,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2019-10-07 00:38:16,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-07 00:38:16,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-10-07 00:38:16,776 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 16 [2019-10-07 00:38:16,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:38:16,777 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-10-07 00:38:16,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-07 00:38:16,777 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-10-07 00:38:16,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-07 00:38:16,778 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:38:16,778 INFO L385 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:38:16,982 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:38:16,983 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:38:16,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:38:16,984 INFO L82 PathProgramCache]: Analyzing trace with hash -127994615, now seen corresponding path program 2 times [2019-10-07 00:38:16,984 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:38:16,984 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:38:16,985 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:38:16,985 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:38:16,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:38:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:38:17,131 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 00:38:17,132 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:38:17,132 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:38:17,132 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:38:17,238 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-07 00:38:17,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:38:17,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-07 00:38:17,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:38:17,262 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-07 00:38:17,263 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:38:17,375 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-07 00:38:17,376 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:38:17,378 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 00:38:17,378 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:38:17,379 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:38:17,379 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:38:17,379 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:38:17,420 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:38:17,625 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:38:17,753 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 221 [2019-10-07 00:38:17,893 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 216 [2019-10-07 00:38:17,915 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:38:18,198 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:38:18,676 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:38:18,847 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:38:18,990 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:38:19,417 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 28 for LOIs [2019-10-07 00:38:19,428 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:38:19,432 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:38:19,432 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:38:19,433 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 217#(and (exists ((v_prenex_24 Int) (|v_main_~#c~0.base_BEFORE_CALL_2| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_24) 60000) 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (not (= (select (select |#memory_int| |v_main_~#c~0.base_BEFORE_CALL_2|) 60000) 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:38:19,433 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 227#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_24 Int) (|v_main_~#c~0.base_BEFORE_CALL_2| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_24) 60000) 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (not (= (select (select |#memory_int| |v_main_~#c~0.base_BEFORE_CALL_2|) 60000) 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:38:19,433 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 222#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_24 Int) (|v_main_~#c~0.base_BEFORE_CALL_2| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_24) 60000) 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (not (= (select (select |#memory_int| |v_main_~#c~0.base_BEFORE_CALL_2|) 60000) 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:38:19,433 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 231#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:38:19,434 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 198#(and (or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (= |main_~#c~0.offset| 0) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (= |#NULL.base| 0) (< main_~i~0 100000) (= |main_~#c~0.offset| 0) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0))) (or (and (<= 0 main_~i~0) (<= |main_~#c~0.offset| 0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#b~0.offset|) (<= main_~i~0 100000) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |main_~#c~0.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (<= 1 main_~i~0) (<= |main_~#c~0.offset| 0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#b~0.offset|) (<= main_~i~0 100000) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |main_~#c~0.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 00:38:19,434 INFO L193 IcfgInterpreter]: Reachable states at location L36 satisfy 203#(and (= |#NULL.base| 0) (< main_~i~0 100000) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (= |main_~#c~0.offset| 0) (= main_~i~0 15000) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 15000 main_~i~0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= (select (select |#memory_int| |main_~#c~0.base|) (+ |main_~#c~0.offset| (* 4 main_~i~0))) |main_#t~mem5|) (<= 1 main_~i~0) (<= |main_~#c~0.offset| 0) (<= 0 |main_~#b~0.offset|) (= |main_~#b~0.offset| 0) (<= main_~i~0 15000) (= |#NULL.offset| 0) (<= 0 |main_~#c~0.offset|) (= |main_~#a~0.offset| 0)) [2019-10-07 00:38:19,435 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:38:19,436 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:38:19,436 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 236#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:38:19,436 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:38:19,436 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 116#(and (or (and (= |#NULL.base| 0) (= |main_~#c~0.offset| 0) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (< |main_~#a~0.base| |#StackHeapBarrier|) (= 0 |#NULL.base|) (= |main_~#c~0.offset| 0) (not (= |main_~#b~0.base| 0)) (not (= 0 |main_~#a~0.base|)) (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |main_~#b~0.offset| 0) (= (store (store (store |old(#length)| |main_~#a~0.base| 400000) |main_~#b~0.base| 400000) |main_~#c~0.base| 400000) |#length|) (= |main_~#a~0.offset| 0) (< |main_~#b~0.base| |#StackHeapBarrier|) (not (= 0 |main_~#c~0.base|)) (= (select (store (store |old(#valid)| |main_~#a~0.base| 1) |main_~#b~0.base| 1) |main_~#c~0.base|) 0) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (< |main_~#c~0.base| |#StackHeapBarrier|) (= (select (store |old(#valid)| |main_~#a~0.base| 1) |main_~#b~0.base|) 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |#valid| (store (store (store |old(#valid)| |main_~#a~0.base| 1) |main_~#b~0.base| 1) |main_~#c~0.base| 1)) (= main_~i~0 0))) (<= 0 main_~i~0) (<= |main_~#c~0.offset| 0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#b~0.offset|) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |main_~#c~0.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:38:19,437 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 180#(and (or (and (= |#NULL.base| 0) (= |main_~#c~0.offset| 0) (<= 1 main_~i~0) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (= |#NULL.base| 0) (= |main_~#c~0.offset| 0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 60000))) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))) (or (and (<= 0 main_~i~0) (<= |main_~#c~0.offset| 0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#b~0.offset|) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |main_~#c~0.offset|) (<= main_~i~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (<= 1 main_~i~0) (<= |main_~#c~0.offset| 0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#b~0.offset|) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |main_~#c~0.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 00:38:19,438 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 212#(exists ((v_prenex_24 Int) (|v_main_~#c~0.base_BEFORE_CALL_2| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_24) 60000) 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (not (= (select (select |#memory_int| |v_main_~#c~0.base_BEFORE_CALL_2|) 60000) 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 00:38:19,438 INFO L193 IcfgInterpreter]: Reachable states at location L32-2 satisfy 175#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (= |main_~#c~0.offset| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |main_~#c~0.offset| 0) (<= 0 |main_~#b~0.offset|) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (<= 0 |main_~#c~0.offset|) (= |main_~#a~0.offset| 0)) [2019-10-07 00:38:19,790 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 25 [2019-10-07 00:38:20,065 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:38:20,066 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7, 11] total 24 [2019-10-07 00:38:20,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-07 00:38:20,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-07 00:38:20,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=436, Unknown=0, NotChecked=0, Total=552 [2019-10-07 00:38:20,068 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 24 states. [2019-10-07 00:38:20,496 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2019-10-07 00:38:21,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:38:21,957 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2019-10-07 00:38:21,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-07 00:38:21,958 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 22 [2019-10-07 00:38:21,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:38:21,961 INFO L225 Difference]: With dead ends: 71 [2019-10-07 00:38:21,961 INFO L226 Difference]: Without dead ends: 55 [2019-10-07 00:38:21,963 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=364, Invalid=1276, Unknown=0, NotChecked=0, Total=1640 [2019-10-07 00:38:21,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-07 00:38:21,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 41. [2019-10-07 00:38:21,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-07 00:38:21,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2019-10-07 00:38:21,973 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 22 [2019-10-07 00:38:21,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:38:21,974 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2019-10-07 00:38:21,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-07 00:38:21,974 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2019-10-07 00:38:21,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-07 00:38:21,975 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:38:21,975 INFO L385 BasicCegarLoop]: trace histogram [10, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:38:22,187 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:38:22,188 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:38:22,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:38:22,188 INFO L82 PathProgramCache]: Analyzing trace with hash 701320466, now seen corresponding path program 3 times [2019-10-07 00:38:22,188 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:38:22,188 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:38:22,188 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:38:22,189 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:38:22,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:38:22,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:38:22,376 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-07 00:38:22,376 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:38:22,376 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:38:22,377 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:38:22,492 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:38:22,492 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:38:22,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-07 00:38:22,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:38:22,511 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-07 00:38:22,511 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:38:22,577 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-07 00:38:22,578 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:38:22,579 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 00:38:22,579 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:38:22,580 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:38:22,580 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:38:22,580 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:38:22,615 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:38:22,846 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:38:22,922 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:38:23,032 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:38:23,681 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:38:23,705 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:38:24,136 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 28 for LOIs [2019-10-07 00:38:24,147 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:38:24,150 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:38:24,150 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:38:24,150 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 222#(and (exists ((v_prenex_35 Int) (|v_main_~#c~0.base_BEFORE_CALL_3| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_35) 60000) 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (not (= (select (select |#memory_int| |v_main_~#c~0.base_BEFORE_CALL_3|) 60000) 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:38:24,151 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 232#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_35 Int) (|v_main_~#c~0.base_BEFORE_CALL_3| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_35) 60000) 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (not (= (select (select |#memory_int| |v_main_~#c~0.base_BEFORE_CALL_3|) 60000) 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:38:24,151 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 227#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_35 Int) (|v_main_~#c~0.base_BEFORE_CALL_3| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_35) 60000) 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (not (= (select (select |#memory_int| |v_main_~#c~0.base_BEFORE_CALL_3|) 60000) 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:38:24,151 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 236#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:38:24,151 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 203#(and (or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (= |main_~#c~0.offset| 0) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (= |#NULL.base| 0) (< main_~i~0 100000) (= |main_~#c~0.offset| 0) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0))) (or (and (<= 0 main_~i~0) (<= |main_~#c~0.offset| 0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#b~0.offset|) (<= main_~i~0 100000) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |main_~#c~0.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (<= 1 main_~i~0) (<= |main_~#c~0.offset| 0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#b~0.offset|) (<= main_~i~0 100000) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |main_~#c~0.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 00:38:24,152 INFO L193 IcfgInterpreter]: Reachable states at location L36 satisfy 208#(and (= |#NULL.base| 0) (< main_~i~0 100000) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (= |main_~#c~0.offset| 0) (= main_~i~0 15000) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 15000 main_~i~0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= (select (select |#memory_int| |main_~#c~0.base|) (+ |main_~#c~0.offset| (* 4 main_~i~0))) |main_#t~mem5|) (<= 1 main_~i~0) (<= |main_~#c~0.offset| 0) (<= 0 |main_~#b~0.offset|) (= |main_~#b~0.offset| 0) (<= main_~i~0 15000) (= |#NULL.offset| 0) (<= 0 |main_~#c~0.offset|) (= |main_~#a~0.offset| 0)) [2019-10-07 00:38:24,152 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:38:24,152 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:38:24,152 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 241#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:38:24,152 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:38:24,153 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 121#(and (or (and (= |#NULL.base| 0) (= |main_~#c~0.offset| 0) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (< |main_~#a~0.base| |#StackHeapBarrier|) (= 0 |#NULL.base|) (= |main_~#c~0.offset| 0) (not (= |main_~#b~0.base| 0)) (not (= 0 |main_~#a~0.base|)) (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |main_~#b~0.offset| 0) (= (store (store (store |old(#length)| |main_~#a~0.base| 400000) |main_~#b~0.base| 400000) |main_~#c~0.base| 400000) |#length|) (= |main_~#a~0.offset| 0) (< |main_~#b~0.base| |#StackHeapBarrier|) (not (= 0 |main_~#c~0.base|)) (= (select (store (store |old(#valid)| |main_~#a~0.base| 1) |main_~#b~0.base| 1) |main_~#c~0.base|) 0) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (< |main_~#c~0.base| |#StackHeapBarrier|) (= (select (store |old(#valid)| |main_~#a~0.base| 1) |main_~#b~0.base|) 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |#valid| (store (store (store |old(#valid)| |main_~#a~0.base| 1) |main_~#b~0.base| 1) |main_~#c~0.base| 1)) (= main_~i~0 0))) (<= 0 main_~i~0) (<= |main_~#c~0.offset| 0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#b~0.offset|) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |main_~#c~0.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:38:24,153 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 185#(and (or (and (= |#NULL.base| 0) (= |main_~#c~0.offset| 0) (<= 1 main_~i~0) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (= |#NULL.base| 0) (= |main_~#c~0.offset| 0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 60000))) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))) (or (and (<= 0 main_~i~0) (<= |main_~#c~0.offset| 0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#b~0.offset|) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |main_~#c~0.offset|) (<= main_~i~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (<= 1 main_~i~0) (<= |main_~#c~0.offset| 0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#b~0.offset|) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |main_~#c~0.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 00:38:24,153 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 217#(exists ((v_prenex_35 Int) (|v_main_~#c~0.base_BEFORE_CALL_3| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_35) 60000) 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (not (= (select (select |#memory_int| |v_main_~#c~0.base_BEFORE_CALL_3|) 60000) 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 00:38:24,153 INFO L193 IcfgInterpreter]: Reachable states at location L32-2 satisfy 180#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (= |main_~#c~0.offset| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |main_~#c~0.offset| 0) (<= 0 |main_~#b~0.offset|) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (<= 0 |main_~#c~0.offset|) (= |main_~#a~0.offset| 0)) [2019-10-07 00:38:24,815 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:38:24,815 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 11] total 26 [2019-10-07 00:38:24,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-07 00:38:24,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-07 00:38:24,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2019-10-07 00:38:24,817 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 26 states. [2019-10-07 00:38:26,228 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2019-10-07 00:38:26,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:38:26,993 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2019-10-07 00:38:26,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-07 00:38:26,994 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 37 [2019-10-07 00:38:26,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:38:26,996 INFO L225 Difference]: With dead ends: 91 [2019-10-07 00:38:26,996 INFO L226 Difference]: Without dead ends: 66 [2019-10-07 00:38:26,998 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 101 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=455, Invalid=1615, Unknown=0, NotChecked=0, Total=2070 [2019-10-07 00:38:26,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-07 00:38:27,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-10-07 00:38:27,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-07 00:38:27,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2019-10-07 00:38:27,011 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 37 [2019-10-07 00:38:27,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:38:27,012 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2019-10-07 00:38:27,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-07 00:38:27,012 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2019-10-07 00:38:27,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-07 00:38:27,014 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:38:27,014 INFO L385 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:38:27,214 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:38:27,215 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:38:27,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:38:27,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1575063017, now seen corresponding path program 4 times [2019-10-07 00:38:27,216 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:38:27,216 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:38:27,216 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:38:27,217 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:38:27,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:38:27,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:38:27,451 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-07 00:38:27,451 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:38:27,452 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:38:27,452 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:38:27,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:38:27,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-07 00:38:27,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:38:27,561 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-10-07 00:38:27,561 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:38:27,802 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-10-07 00:38:27,802 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:38:27,803 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 00:38:27,804 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:38:27,804 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:38:27,804 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:38:27,805 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:38:27,831 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:38:27,925 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:38:28,216 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:38:28,272 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:38:28,319 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:38:28,859 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:38:28,912 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:38:29,013 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:38:29,391 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 28 for LOIs [2019-10-07 00:38:29,405 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:38:29,408 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:38:29,408 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:38:29,408 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 223#(and (exists ((v_prenex_48 Int) (|v_main_~#c~0.base_BEFORE_CALL_4| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_48) 60000) 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (select (select |#memory_int| |v_main_~#c~0.base_BEFORE_CALL_4|) 60000) 0)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:38:29,409 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 233#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_48 Int) (|v_main_~#c~0.base_BEFORE_CALL_4| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_48) 60000) 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (select (select |#memory_int| |v_main_~#c~0.base_BEFORE_CALL_4|) 60000) 0)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:38:29,409 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 228#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_48 Int) (|v_main_~#c~0.base_BEFORE_CALL_4| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_48) 60000) 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (select (select |#memory_int| |v_main_~#c~0.base_BEFORE_CALL_4|) 60000) 0)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:38:29,409 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 237#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:38:29,410 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 204#(and (or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (= |main_~#c~0.offset| 0) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (= |#NULL.base| 0) (< main_~i~0 100000) (= |main_~#c~0.offset| 0) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0))) (or (and (<= 0 main_~i~0) (<= |main_~#c~0.offset| 0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#b~0.offset|) (<= main_~i~0 100000) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |main_~#c~0.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (<= 1 main_~i~0) (<= |main_~#c~0.offset| 0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#b~0.offset|) (<= main_~i~0 100000) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |main_~#c~0.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 00:38:29,410 INFO L193 IcfgInterpreter]: Reachable states at location L36 satisfy 209#(and (= |#NULL.base| 0) (< main_~i~0 100000) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (= |main_~#c~0.offset| 0) (= main_~i~0 15000) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 15000 main_~i~0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= (select (select |#memory_int| |main_~#c~0.base|) (+ |main_~#c~0.offset| (* 4 main_~i~0))) |main_#t~mem5|) (<= 1 main_~i~0) (<= |main_~#c~0.offset| 0) (<= 0 |main_~#b~0.offset|) (= |main_~#b~0.offset| 0) (<= main_~i~0 15000) (= |#NULL.offset| 0) (<= 0 |main_~#c~0.offset|) (= |main_~#a~0.offset| 0)) [2019-10-07 00:38:29,410 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:38:29,410 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:38:29,411 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 242#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:38:29,411 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:38:29,411 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 122#(and (or (and (= |#NULL.base| 0) (= |main_~#c~0.offset| 0) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (< |main_~#a~0.base| |#StackHeapBarrier|) (= 0 |#NULL.base|) (= |main_~#c~0.offset| 0) (not (= |main_~#b~0.base| 0)) (not (= 0 |main_~#a~0.base|)) (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |main_~#b~0.offset| 0) (= (store (store (store |old(#length)| |main_~#a~0.base| 400000) |main_~#b~0.base| 400000) |main_~#c~0.base| 400000) |#length|) (= |main_~#a~0.offset| 0) (< |main_~#b~0.base| |#StackHeapBarrier|) (not (= 0 |main_~#c~0.base|)) (= (select (store (store |old(#valid)| |main_~#a~0.base| 1) |main_~#b~0.base| 1) |main_~#c~0.base|) 0) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (< |main_~#c~0.base| |#StackHeapBarrier|) (= (select (store |old(#valid)| |main_~#a~0.base| 1) |main_~#b~0.base|) 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |#valid| (store (store (store |old(#valid)| |main_~#a~0.base| 1) |main_~#b~0.base| 1) |main_~#c~0.base| 1)) (= main_~i~0 0))) (<= 0 main_~i~0) (<= |main_~#c~0.offset| 0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#b~0.offset|) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |main_~#c~0.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:38:29,411 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 186#(and (or (and (= |#NULL.base| 0) (= |main_~#c~0.offset| 0) (<= 1 main_~i~0) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (= |#NULL.base| 0) (= |main_~#c~0.offset| 0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 60000))) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))) (or (and (<= 0 main_~i~0) (<= |main_~#c~0.offset| 0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#b~0.offset|) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |main_~#c~0.offset|) (<= main_~i~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (<= 1 main_~i~0) (<= |main_~#c~0.offset| 0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#b~0.offset|) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |main_~#c~0.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 00:38:29,411 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 218#(exists ((v_prenex_48 Int) (|v_main_~#c~0.base_BEFORE_CALL_4| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_48) 60000) 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (select (select |#memory_int| |v_main_~#c~0.base_BEFORE_CALL_4|) 60000) 0)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 00:38:29,412 INFO L193 IcfgInterpreter]: Reachable states at location L32-2 satisfy 181#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (= |main_~#c~0.offset| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |main_~#c~0.offset| 0) (<= 0 |main_~#b~0.offset|) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (<= 0 |main_~#c~0.offset|) (= |main_~#a~0.offset| 0)) [2019-10-07 00:38:30,259 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:38:30,259 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 11] total 40 [2019-10-07 00:38:30,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-07 00:38:30,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-07 00:38:30,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=452, Invalid=1108, Unknown=0, NotChecked=0, Total=1560 [2019-10-07 00:38:30,262 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 40 states. [2019-10-07 00:38:32,391 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2019-10-07 00:38:34,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:38:34,418 INFO L93 Difference]: Finished difference Result 165 states and 195 transitions. [2019-10-07 00:38:34,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-07 00:38:34,418 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 60 [2019-10-07 00:38:34,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:38:34,420 INFO L225 Difference]: With dead ends: 165 [2019-10-07 00:38:34,420 INFO L226 Difference]: Without dead ends: 119 [2019-10-07 00:38:34,423 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 170 SyntacticMatches, 12 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1761 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1420, Invalid=3836, Unknown=0, NotChecked=0, Total=5256 [2019-10-07 00:38:34,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-10-07 00:38:34,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 81. [2019-10-07 00:38:34,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-07 00:38:34,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2019-10-07 00:38:34,439 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 60 [2019-10-07 00:38:34,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:38:34,439 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2019-10-07 00:38:34,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-07 00:38:34,439 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2019-10-07 00:38:34,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-07 00:38:34,442 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:38:34,442 INFO L385 BasicCegarLoop]: trace histogram [26, 14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:38:34,647 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:38:34,648 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:38:34,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:38:34,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1748959122, now seen corresponding path program 5 times [2019-10-07 00:38:34,648 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:38:34,649 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:38:34,649 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:38:34,649 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:38:34,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:38:34,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:38:34,938 INFO L134 CoverageAnalysis]: Checked inductivity of 611 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-10-07 00:38:34,939 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:38:34,939 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:38:34,939 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true