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-tiling/pr4.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:39:21,675 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:39:21,679 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:39:21,691 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:39:21,691 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:39:21,692 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:39:21,693 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:39:21,697 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:39:21,699 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:39:21,701 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:39:21,703 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:39:21,709 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:39:21,710 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:39:21,711 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:39:21,714 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:39:21,715 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:39:21,716 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:39:21,717 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:39:21,719 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:39:21,720 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:39:21,722 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:39:21,726 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:39:21,727 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:39:21,728 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:39:21,732 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:39:21,732 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:39:21,732 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:39:21,733 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:39:21,733 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:39:21,734 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:39:21,734 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:39:21,735 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:39:21,736 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:39:21,736 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:39:21,737 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:39:21,738 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:39:21,738 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:39:21,739 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:39:21,739 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:39:21,740 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:39:21,740 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:39:21,741 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-13 21:39:21,755 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:39:21,755 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:39:21,756 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:39:21,756 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:39:21,756 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:39:21,757 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:39:21,757 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:39:21,757 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:39:21,757 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:39:21,758 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:39:21,758 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:39:21,758 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:39:21,758 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:39:21,758 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:39:21,758 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:39:21,759 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:39:21,759 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:39:21,759 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:39:21,759 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:39:21,759 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:39:21,760 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:39:21,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:39:21,760 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:39:21,760 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:39:21,761 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:39:21,761 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:39:21,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:39:21,761 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:39:21,761 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-13 21:39:22,052 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:39:22,065 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:39:22,068 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:39:22,069 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:39:22,070 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:39:22,070 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/pr4.c [2019-10-13 21:39:22,129 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e639b083a/0046a5d3fd5c4e0194481ace72aa2021/FLAG47dfc7659 [2019-10-13 21:39:22,536 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:39:22,537 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/pr4.c [2019-10-13 21:39:22,543 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e639b083a/0046a5d3fd5c4e0194481ace72aa2021/FLAG47dfc7659 [2019-10-13 21:39:22,948 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e639b083a/0046a5d3fd5c4e0194481ace72aa2021 [2019-10-13 21:39:22,958 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:39:22,959 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:39:22,960 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:39:22,960 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:39:22,965 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:39:22,966 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:39:22" (1/1) ... [2019-10-13 21:39:22,968 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32777701 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:22, skipping insertion in model container [2019-10-13 21:39:22,969 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:39:22" (1/1) ... [2019-10-13 21:39:22,977 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:39:23,001 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:39:23,196 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:39:23,200 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:39:23,227 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:39:23,317 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:39:23,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:23 WrapperNode [2019-10-13 21:39:23,318 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:39:23,320 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:39:23,320 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:39:23,320 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:39:23,331 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:23" (1/1) ... [2019-10-13 21:39:23,332 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:23" (1/1) ... [2019-10-13 21:39:23,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:23" (1/1) ... [2019-10-13 21:39:23,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:23" (1/1) ... [2019-10-13 21:39:23,346 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:23" (1/1) ... [2019-10-13 21:39:23,352 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:23" (1/1) ... [2019-10-13 21:39:23,354 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:23" (1/1) ... [2019-10-13 21:39:23,356 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:39:23,356 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:39:23,357 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:39:23,357 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:39:23,358 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:23" (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-13 21:39:23,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:39:23,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:39:23,418 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:39:23,418 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:39:23,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:39:23,419 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:39:23,419 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:39:23,419 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:39:23,419 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:39:23,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:39:23,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:39:23,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:39:23,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:39:23,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:39:23,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:39:23,936 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:39:23,936 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-13 21:39:23,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:39:23 BoogieIcfgContainer [2019-10-13 21:39:23,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:39:23,939 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:39:23,939 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:39:23,942 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:39:23,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:39:22" (1/3) ... [2019-10-13 21:39:23,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f9f0946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:39:23, skipping insertion in model container [2019-10-13 21:39:23,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:23" (2/3) ... [2019-10-13 21:39:23,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f9f0946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:39:23, skipping insertion in model container [2019-10-13 21:39:23,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:39:23" (3/3) ... [2019-10-13 21:39:23,945 INFO L109 eAbstractionObserver]: Analyzing ICFG pr4.c [2019-10-13 21:39:23,955 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:39:23,963 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:39:23,974 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:39:23,995 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:39:23,996 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:39:23,996 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:39:23,996 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:39:23,996 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:39:23,996 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:39:23,997 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:39:23,997 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:39:24,014 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-10-13 21:39:24,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 21:39:24,020 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:39:24,021 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:39:24,023 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:39:24,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:39:24,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1208735159, now seen corresponding path program 1 times [2019-10-13 21:39:24,037 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:39:24,037 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240856379] [2019-10-13 21:39:24,038 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:39:24,038 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:39:24,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:39:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:39:24,355 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-13 21:39:24,355 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240856379] [2019-10-13 21:39:24,356 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:39:24,357 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:39:24,357 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528526181] [2019-10-13 21:39:24,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:39:24,363 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:39:24,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:39:24,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:39:24,381 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 4 states. [2019-10-13 21:39:24,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:39:24,473 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2019-10-13 21:39:24,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:39:24,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-13 21:39:24,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:39:24,485 INFO L225 Difference]: With dead ends: 42 [2019-10-13 21:39:24,485 INFO L226 Difference]: Without dead ends: 18 [2019-10-13 21:39:24,490 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:39:24,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-13 21:39:24,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-13 21:39:24,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-13 21:39:24,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-10-13 21:39:24,537 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2019-10-13 21:39:24,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:39:24,538 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-10-13 21:39:24,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:39:24,539 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-10-13 21:39:24,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 21:39:24,541 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:39:24,541 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:39:24,541 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:39:24,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:39:24,543 INFO L82 PathProgramCache]: Analyzing trace with hash -269262317, now seen corresponding path program 1 times [2019-10-13 21:39:24,543 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:39:24,544 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604104427] [2019-10-13 21:39:24,544 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:39:24,544 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:39:24,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:39:24,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:39:25,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:39:25,127 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604104427] [2019-10-13 21:39:25,127 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832661590] [2019-10-13 21:39:25,128 INFO L94 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-13 21:39:25,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:39:25,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-13 21:39:25,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:39:25,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:25,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:25,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:25,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:25,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:25,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:25,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:25,411 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:25,411 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 21:39:28,260 WARN L191 SmtUtils]: Spent 2.85 s on a formula simplification. DAG size of input: 163 DAG size of output: 73 [2019-10-13 21:39:28,261 INFO L567 ElimStorePlain]: treesize reduction 481, result has 28.2 percent of original size [2019-10-13 21:39:28,262 INFO L464 ElimStorePlain]: Eliminatee v_prenex_9 vanished before elimination [2019-10-13 21:39:28,262 INFO L464 ElimStorePlain]: Eliminatee v_prenex_10 vanished before elimination [2019-10-13 21:39:28,262 INFO L464 ElimStorePlain]: Eliminatee v_prenex_14 vanished before elimination [2019-10-13 21:39:28,295 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:28,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:28,308 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:28,318 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:28,325 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:28,336 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:28,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:28,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:28,355 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:28,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:28,367 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:28,490 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 12 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 47 [2019-10-13 21:39:28,491 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 21:39:28,758 WARN L191 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-10-13 21:39:28,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:39:28,776 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:28,778 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:28,782 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:28,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:28,786 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:28,790 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:28,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:28,796 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:28,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:28,845 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 12 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 44 [2019-10-13 21:39:28,845 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 21:39:29,084 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-10-13 21:39:29,084 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:39:29,085 INFO L464 ElimStorePlain]: Eliminatee v_prenex_11 vanished before elimination [2019-10-13 21:39:29,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:29,099 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:29,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:29,107 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:29,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:29,112 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:29,144 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 41 [2019-10-13 21:39:29,144 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 21:39:29,293 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-10-13 21:39:29,294 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:39:29,294 INFO L464 ElimStorePlain]: Eliminatee v_prenex_15 vanished before elimination [2019-10-13 21:39:29,294 INFO L464 ElimStorePlain]: Eliminatee v_prenex_1 vanished before elimination [2019-10-13 21:39:29,294 INFO L464 ElimStorePlain]: Eliminatee v_prenex_2 vanished before elimination [2019-10-13 21:39:29,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:29,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:29,307 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:29,308 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:29,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:29,310 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:29,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:29,322 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2019-10-13 21:39:29,322 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-13 21:39:29,477 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-10-13 21:39:29,478 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:39:29,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:29,494 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:29,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:29,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:29,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:29,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:29,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:29,500 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:29,514 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2019-10-13 21:39:29,514 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-13 21:39:29,614 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:39:29,615 INFO L464 ElimStorePlain]: Eliminatee v_prenex_5 vanished before elimination [2019-10-13 21:39:29,615 INFO L464 ElimStorePlain]: Eliminatee v_prenex_6 vanished before elimination [2019-10-13 21:39:29,615 INFO L464 ElimStorePlain]: Eliminatee v_prenex_7 vanished before elimination [2019-10-13 21:39:29,617 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 16 dim-2 vars, End of recursive call: and 5 xjuncts. [2019-10-13 21:39:29,617 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 18 variables, input treesize:713, output treesize:226 [2019-10-13 21:39:29,873 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-10-13 21:39:29,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-13 21:39:29,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:29,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:29,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:29,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:29,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:29,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:29,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:29,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:29,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:29,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:29,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:29,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:29,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:29,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:29,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:29,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:39:29,947 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:39:29,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:29,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:29,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:29,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:30,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:30,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:30,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:30,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:30,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:30,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:30,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:30,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:30,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:30,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:30,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:30,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:30,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:30,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:30,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:30,127 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 92 [2019-10-13 21:39:30,138 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:39:30,140 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:39:30,143 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:39:30,165 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:39:30,166 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:39:30,168 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:39:30,181 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2019-10-13 21:39:30,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:30,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:30,183 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 21:39:30,200 INFO L567 ElimStorePlain]: treesize reduction 12, result has 66.7 percent of original size [2019-10-13 21:39:30,201 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 21:39:30,835 WARN L191 SmtUtils]: Spent 633.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 228 [2019-10-13 21:39:30,836 INFO L567 ElimStorePlain]: treesize reduction 153, result has 92.8 percent of original size [2019-10-13 21:39:30,849 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 170 [2019-10-13 21:39:30,857 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:39:30,858 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:39:30,858 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:39:30,868 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:39:30,868 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:39:30,869 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:39:30,877 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 103 [2019-10-13 21:39:30,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:30,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:30,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:30,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:30,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:30,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:30,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:30,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:30,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:30,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:30,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:30,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:30,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:30,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:30,892 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 21:39:30,910 INFO L567 ElimStorePlain]: treesize reduction 36, result has 40.0 percent of original size [2019-10-13 21:39:30,911 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 21:39:31,532 WARN L191 SmtUtils]: Spent 620.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 215 [2019-10-13 21:39:31,533 INFO L567 ElimStorePlain]: treesize reduction 30, result has 98.3 percent of original size [2019-10-13 21:39:31,553 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 87 [2019-10-13 21:39:31,564 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:39:31,565 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:39:31,565 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:39:31,579 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:39:31,580 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:39:31,581 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:39:31,594 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2019-10-13 21:39:31,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:31,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:31,597 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-13 21:39:31,621 INFO L567 ElimStorePlain]: treesize reduction 12, result has 61.3 percent of original size [2019-10-13 21:39:31,622 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 21:39:32,205 WARN L191 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 201 [2019-10-13 21:39:32,206 INFO L567 ElimStorePlain]: treesize reduction 121, result has 92.9 percent of original size [2019-10-13 21:39:32,222 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 194 [2019-10-13 21:39:32,231 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:39:32,233 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:39:32,235 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:39:32,246 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:39:32,247 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:39:32,248 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:39:32,256 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 136 [2019-10-13 21:39:32,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:32,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:32,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:32,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:32,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:32,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:32,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:32,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:32,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:32,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:32,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:32,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:32,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:32,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:32,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:32,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:32,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:32,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:32,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:32,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:32,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:32,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:32,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:32,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:32,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:32,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:32,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:32,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:32,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:32,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:32,283 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-10-13 21:39:32,294 INFO L567 ElimStorePlain]: treesize reduction 55, result has 12.7 percent of original size [2019-10-13 21:39:32,295 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 21:39:32,359 INFO L567 ElimStorePlain]: treesize reduction 1386, result has 0.6 percent of original size [2019-10-13 21:39:32,359 INFO L464 ElimStorePlain]: Eliminatee v_prenex_25 vanished before elimination [2019-10-13 21:39:32,359 INFO L464 ElimStorePlain]: Eliminatee v_prenex_35 vanished before elimination [2019-10-13 21:39:32,359 INFO L464 ElimStorePlain]: Eliminatee v_prenex_45 vanished before elimination [2019-10-13 21:39:32,360 INFO L464 ElimStorePlain]: Eliminatee v_prenex_23 vanished before elimination [2019-10-13 21:39:32,360 INFO L464 ElimStorePlain]: Eliminatee v_prenex_33 vanished before elimination [2019-10-13 21:39:32,360 INFO L464 ElimStorePlain]: Eliminatee v_prenex_29 vanished before elimination [2019-10-13 21:39:32,360 INFO L464 ElimStorePlain]: Eliminatee v_prenex_17 vanished before elimination [2019-10-13 21:39:32,360 INFO L464 ElimStorePlain]: Eliminatee v_prenex_39 vanished before elimination [2019-10-13 21:39:32,361 INFO L464 ElimStorePlain]: Eliminatee v_prenex_27 vanished before elimination [2019-10-13 21:39:32,361 INFO L464 ElimStorePlain]: Eliminatee |#memory_int| vanished before elimination [2019-10-13 21:39:32,361 INFO L464 ElimStorePlain]: Eliminatee v_prenex_37 vanished before elimination [2019-10-13 21:39:32,361 INFO L464 ElimStorePlain]: Eliminatee v_prenex_19 vanished before elimination [2019-10-13 21:39:32,361 INFO L496 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 16 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 21:39:32,362 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 32 variables, input treesize:2192, output treesize:8 [2019-10-13 21:39:32,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:39:32,385 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [889108345] [2019-10-13 21:39:32,421 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:39:32,422 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:39:32,428 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:39:32,435 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:39:32,436 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:39:32,568 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-13 21:39:33,151 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:34,809 WARN L191 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 400 DAG size of output: 384 [2019-10-13 21:39:38,532 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:39,190 WARN L191 SmtUtils]: Spent 656.00 ms on a formula simplification that was a NOOP. DAG size: 377 [2019-10-13 21:39:39,238 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:39,281 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:39,328 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:39,830 WARN L191 SmtUtils]: Spent 499.00 ms on a formula simplification that was a NOOP. DAG size: 366 [2019-10-13 21:39:40,795 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:41,762 WARN L191 SmtUtils]: Spent 416.00 ms on a formula simplification that was a NOOP. DAG size: 358 [2019-10-13 21:39:41,791 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:41,825 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:41,855 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:42,202 WARN L191 SmtUtils]: Spent 344.00 ms on a formula simplification that was a NOOP. DAG size: 347 [2019-10-13 21:39:42,233 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:42,267 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:42,295 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:42,614 WARN L191 SmtUtils]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 336 [2019-10-13 21:39:42,889 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:43,370 WARN L191 SmtUtils]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 327 [2019-10-13 21:39:43,406 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:43,437 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:43,474 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:43,844 WARN L191 SmtUtils]: Spent 367.00 ms on a formula simplification that was a NOOP. DAG size: 316 [2019-10-13 21:39:43,876 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:43,918 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:43,945 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:44,202 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 305 [2019-10-13 21:39:44,225 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:44,251 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:44,277 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:44,526 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 294 [2019-10-13 21:39:44,558 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:44,593 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:44,620 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:44,864 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 283 [2019-10-13 21:39:44,894 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:44,918 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:44,940 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:45,169 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 272 [2019-10-13 21:39:48,500 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:51,483 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 264 [2019-10-13 21:39:51,513 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:51,542 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:51,569 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:51,781 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 253 [2019-10-13 21:39:51,806 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:51,827 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:51,846 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:52,028 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 242 [2019-10-13 21:39:52,049 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:52,071 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:52,090 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:52,274 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 231 [2019-10-13 21:39:52,448 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 231 [2019-10-13 21:39:52,588 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:54,014 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 253 [2019-10-13 21:39:54,033 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:54,052 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:54,070 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:54,258 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 242 [2019-10-13 21:39:54,277 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:55,873 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 236 [2019-10-13 21:39:56,210 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:56,525 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 228 [2019-10-13 21:39:56,543 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:56,558 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:56,576 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:56,686 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 217 [2019-10-13 21:39:56,702 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:56,718 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:56,745 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:56,858 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 206 [2019-10-13 21:39:56,874 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:56,890 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:56,905 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:57,026 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:57,045 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:57,060 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:57,164 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:57,184 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:57,204 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:57,579 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:57,662 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:57,680 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:57,700 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:57,788 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:57,803 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:57,816 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:57,890 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:57,900 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:57,909 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:57,967 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:57,977 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:57,987 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:58,031 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:58,139 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:58,149 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:58,163 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:58,313 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 28 for LOIs [2019-10-13 21:39:58,333 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-13 21:39:58,340 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:39:58,340 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:39:58,340 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 38#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |old(~CELLCOUNT~0)| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~CELLCOUNT~0)|) (<= ~CELLCOUNT~0 2147483647) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (<= 0 (+ ~CELLCOUNT~0 2147483648)) (= |old(~CELLCOUNT~0)| 0) (= |old(#length)| |#length|)) [2019-10-13 21:39:58,341 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 222#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (or (and (= |#NULL.base| 0) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (< 0 ~CELLCOUNT~0) (not (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 0))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (< 0 ~CELLCOUNT~0) (<= 0 |#NULL.base|) (= |#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-13 21:39:58,341 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 231#(and (= |old(~CELLCOUNT~0)| ~CELLCOUNT~0) (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:39:58,341 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 217#(and (exists ((|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (or (and (= |#NULL.base| 0) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (< 0 ~CELLCOUNT~0) (not (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 0))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (< 0 ~CELLCOUNT~0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:39:58,341 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= ~CELLCOUNT~0 0) (<= ~CELLCOUNT~0 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 ~CELLCOUNT~0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:39:58,342 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |old(~CELLCOUNT~0)| 0) (<= 0 ~CELLCOUNT~0) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~CELLCOUNT~0)|) (= |old(~CELLCOUNT~0)| ~CELLCOUNT~0) (<= ~CELLCOUNT~0 0) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(~CELLCOUNT~0)| 0) (= |old(#length)| |#length|)) [2019-10-13 21:39:58,342 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 236#(and (= ~CELLCOUNT~0 0) (= |#valid| (store |old(#valid)| 0 0)) (<= ~CELLCOUNT~0 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 ~CELLCOUNT~0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:39:58,342 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:39:58,342 INFO L193 IcfgInterpreter]: Reachable states at location L63-3 satisfy 199#(and (= main_~CCCELVOL4~0 5) (<= |main_~#volArray~0.offset| 0) (<= 0 main_~i~0) (<= 0 |main_~#volArray~0.offset|) (= |main_~#volArray~0.offset| 0) (<= 0 |#NULL.base|) (<= main_~CCCELVOL3~0 7) (<= 0 |#NULL.offset|) (<= 0 |old(~CELLCOUNT~0)|) (<= 3 main_~CCCELVOL2~0) (<= main_~CCCELVOL2~0 3) (<= 5 main_~CCCELVOL4~0) (= |#NULL.base| 0) (= main_~CCCELVOL1~0 1) (<= 1 ~CELLCOUNT~0) (<= |#NULL.base| 0) (<= 1 main_~CCCELVOL1~0) (<= |old(~CELLCOUNT~0)| 0) (<= 7 main_~CCCELVOL3~0) (<= main_~i~0 0) (<= |#NULL.offset| 0) (<= ~CELLCOUNT~0 2147483647) (<= main_~CCCELVOL1~0 1) (= main_~CCCELVOL3~0 7) (= main_~CCCELVOL2~0 3) (= |#NULL.offset| 0) (= |old(~CELLCOUNT~0)| 0) (= main_~i~0 0) (<= main_~CCCELVOL4~0 5)) [2019-10-13 21:39:58,342 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 212#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (or (and (= |#NULL.base| 0) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (< 0 ~CELLCOUNT~0) (not (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 0))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (< 0 ~CELLCOUNT~0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-13 21:39:58,343 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 227#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (or (and (= |#NULL.base| 0) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (< 0 ~CELLCOUNT~0) (not (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 0))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (< 0 ~CELLCOUNT~0) (<= 0 |#NULL.base|) (= |#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-13 21:39:58,344 INFO L193 IcfgInterpreter]: Reachable states at location L65-2 satisfy 207#(and (= main_~CCCELVOL4~0 5) (<= |main_~#volArray~0.offset| 0) (<= 0 main_~i~0) (<= 0 |main_~#volArray~0.offset|) (= |main_~#volArray~0.offset| 0) (<= 0 |#NULL.base|) (<= main_~CCCELVOL3~0 7) (<= 0 |#NULL.offset|) (<= 0 |old(~CELLCOUNT~0)|) (<= 3 main_~CCCELVOL2~0) (<= main_~CCCELVOL2~0 3) (<= 5 main_~CCCELVOL4~0) (= |#NULL.base| 0) (= main_~CCCELVOL1~0 1) (<= 1 ~CELLCOUNT~0) (<= |#NULL.base| 0) (<= 1 main_~CCCELVOL1~0) (<= |old(~CELLCOUNT~0)| 0) (<= 7 main_~CCCELVOL3~0) (<= main_~i~0 0) (<= |#NULL.offset| 0) (<= ~CELLCOUNT~0 2147483647) (<= main_~CCCELVOL1~0 1) (= main_~CCCELVOL3~0 7) (= main_~CCCELVOL2~0 3) (= |#NULL.offset| 0) (= |old(~CELLCOUNT~0)| 0) (= main_~i~0 0) (<= main_~CCCELVOL4~0 5)) [2019-10-13 21:39:58,345 INFO L193 IcfgInterpreter]: Reachable states at location L21 satisfy 43#(and (<= |main_~#volArray~0.offset| 0) (= 0 |#NULL.base|) (<= 0 |main_~#volArray~0.offset|) (= |main_~#volArray~0.offset| 0) (<= 0 |#NULL.base|) (<= main_~CCCELVOL3~0 7) (<= 0 |#NULL.offset|) (<= 0 |old(~CELLCOUNT~0)|) (= (store |old(#length)| |main_~#volArray~0.base| (* ~CELLCOUNT~0 4)) |#length|) (not (= |main_~#volArray~0.base| 0)) (= |#valid| (store |old(#valid)| |main_~#volArray~0.base| 1)) (= 1 main_~CCCELVOL1~0) (<= 3 main_~CCCELVOL2~0) (<= main_~CCCELVOL2~0 3) (= 5 main_~CCCELVOL4~0) (= 3 main_~CCCELVOL2~0) (<= 5 main_~CCCELVOL4~0) (<= 1 ~CELLCOUNT~0) (<= |#NULL.base| 0) (<= 1 main_~CCCELVOL1~0) (<= |old(~CELLCOUNT~0)| 0) (< |main_~#volArray~0.base| |#StackHeapBarrier|) (<= 7 main_~CCCELVOL3~0) (= 7 main_~CCCELVOL3~0) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (< 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (<= main_~CCCELVOL1~0 1) (= 0 (select |old(#valid)| |main_~#volArray~0.base|)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (<= 0 (+ ~CELLCOUNT~0 2147483648)) (= |old(~CELLCOUNT~0)| 0) (<= main_~CCCELVOL4~0 5)) [2019-10-13 21:39:58,345 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 194#(and (or (and (<= |main_~#volArray~0.offset| 0) (= 0 |#NULL.base|) (<= 0 |main_~#volArray~0.offset|) (= |main_~#volArray~0.offset| 0) (<= 0 |#NULL.base|) (not (= (ite (= (ite (and (< ~CELLCOUNT~0 0) (not (= (mod ~CELLCOUNT~0 4) 0))) (+ (mod ~CELLCOUNT~0 4) (- 4)) (mod ~CELLCOUNT~0 4)) 0) 1 0) 0)) (= (store |old(#length)| |main_~#volArray~0.base| (* ~CELLCOUNT~0 4)) |#length|) (not (= |main_~#volArray~0.base| 0)) (= |#valid| (store |old(#valid)| |main_~#volArray~0.base| 1)) (= 1 main_~CCCELVOL1~0) (<= main_~i~0 1) (= 5 main_~CCCELVOL4~0) (= 3 main_~CCCELVOL2~0) (<= 1 ~CELLCOUNT~0) (<= |#NULL.base| 0) (<= 1 main_~CCCELVOL1~0) (= main_~i~0 1) (<= |old(~CELLCOUNT~0)| 0) (< |main_~#volArray~0.base| |#StackHeapBarrier|) (= 7 main_~CCCELVOL3~0) (= 0 (select |old(#valid)| 0)) (< 1 ~CELLCOUNT~0) (= 0 (select |old(#valid)| |main_~#volArray~0.base|)) (= (ite (and (< ~CELLCOUNT~0 0) (not (= (mod ~CELLCOUNT~0 4) 0))) (+ (mod ~CELLCOUNT~0 4) (- 4)) (mod ~CELLCOUNT~0 4)) 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (<= 0 (+ ~CELLCOUNT~0 2147483648)) (= |old(~CELLCOUNT~0)| 0)) (and (= main_~CCCELVOL4~0 5) (<= |main_~#volArray~0.offset| 0) (<= 0 |main_~#volArray~0.offset|) (= |main_~#volArray~0.offset| 0) (<= 0 |#NULL.base|) (= |#NULL.base| 0) (= main_~CCCELVOL1~0 1) (<= 1 ~CELLCOUNT~0) (<= |#NULL.base| 0) (<= 1 main_~CCCELVOL1~0) (<= |old(~CELLCOUNT~0)| 0) (= main_~CCCELVOL3~0 7) (= main_~CCCELVOL2~0 3) (= |#NULL.offset| 0) (= |old(~CELLCOUNT~0)| 0))) (<= 7 main_~CCCELVOL3~0) (<= main_~CCCELVOL3~0 7) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~CELLCOUNT~0)|) (<= ~CELLCOUNT~0 2147483647) (<= 1 main_~i~0) (<= main_~CCCELVOL1~0 1) (<= 3 main_~CCCELVOL2~0) (<= main_~CCCELVOL2~0 3) (<= 5 main_~CCCELVOL4~0) (<= main_~CCCELVOL4~0 5)) [2019-10-13 21:39:58,843 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-10-13 21:39:59,013 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 35 [2019-10-13 21:39:59,212 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:39:59,212 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8, 11] total 29 [2019-10-13 21:39:59,212 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122597631] [2019-10-13 21:39:59,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-13 21:39:59,216 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:39:59,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-13 21:39:59,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2019-10-13 21:39:59,219 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 29 states. [2019-10-13 21:39:59,504 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-10-13 21:39:59,942 WARN L191 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 76 [2019-10-13 21:40:00,466 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 69 [2019-10-13 21:40:00,737 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-10-13 21:40:01,027 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 66 [2019-10-13 21:40:01,572 WARN L191 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2019-10-13 21:40:01,900 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2019-10-13 21:40:02,308 WARN L191 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 77 [2019-10-13 21:40:02,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:40:02,456 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2019-10-13 21:40:02,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-13 21:40:02,456 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 14 [2019-10-13 21:40:02,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:40:02,459 INFO L225 Difference]: With dead ends: 34 [2019-10-13 21:40:02,459 INFO L226 Difference]: Without dead ends: 32 [2019-10-13 21:40:02,461 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=210, Invalid=1430, Unknown=0, NotChecked=0, Total=1640 [2019-10-13 21:40:02,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-13 21:40:02,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-10-13 21:40:02,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-13 21:40:02,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-10-13 21:40:02,473 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 14 [2019-10-13 21:40:02,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:40:02,474 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-10-13 21:40:02,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-13 21:40:02,474 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-10-13 21:40:02,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-13 21:40:02,475 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:40:02,476 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:40:02,676 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:40:02,677 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:40:02,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:40:02,678 INFO L82 PathProgramCache]: Analyzing trace with hash 749776737, now seen corresponding path program 1 times [2019-10-13 21:40:02,678 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:40:02,678 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999828328] [2019-10-13 21:40:02,679 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:02,679 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:02,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:40:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:02,913 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:40:02,913 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999828328] [2019-10-13 21:40:02,914 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071893942] [2019-10-13 21:40:02,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-13 21:40:02,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:02,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-13 21:40:02,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:40:03,276 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:40:03,276 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:40:03,376 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:40:03,376 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2139276983] [2019-10-13 21:40:03,378 INFO L162 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-10-13 21:40:03,378 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:40:03,380 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:40:03,380 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:40:03,380 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:40:03,417 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-13 21:40:03,782 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:40:03,822 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:40:03,856 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:40:04,618 WARN L191 SmtUtils]: Spent 759.00 ms on a formula simplification. DAG size of input: 369 DAG size of output: 353 [2019-10-13 21:40:04,653 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:40:04,692 WARN L225 Elim1Store]: Array PQE input equivalent to false