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/pr3.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:39:16,052 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:39:16,054 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:39:16,068 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:39:16,068 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:39:16,070 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:39:16,071 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:39:16,081 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:39:16,086 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:39:16,087 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:39:16,088 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:39:16,089 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:39:16,090 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:39:16,091 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:39:16,092 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:39:16,094 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:39:16,095 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:39:16,098 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:39:16,099 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:39:16,103 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:39:16,106 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:39:16,110 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:39:16,111 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:39:16,112 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:39:16,116 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:39:16,116 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:39:16,116 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:39:16,119 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:39:16,120 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:39:16,122 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:39:16,122 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:39:16,124 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:39:16,125 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:39:16,125 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:39:16,129 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:39:16,129 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:39:16,130 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:39:16,130 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:39:16,130 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:39:16,132 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:39:16,135 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:39:16,135 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:16,153 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:39:16,153 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:39:16,154 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:39:16,155 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:39:16,155 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:39:16,155 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:39:16,155 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:39:16,156 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:39:16,156 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:39:16,156 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:39:16,156 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:39:16,156 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:39:16,157 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:39:16,157 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:39:16,158 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:39:16,158 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:39:16,158 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:39:16,158 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:39:16,158 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:39:16,159 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:39:16,159 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:39:16,159 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:39:16,159 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:39:16,160 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:39:16,160 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:39:16,160 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:39:16,160 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:39:16,160 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:39:16,161 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:16,437 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:39:16,450 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:39:16,453 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:39:16,455 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:39:16,455 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:39:16,456 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/pr3.c [2019-10-13 21:39:16,515 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba7043b08/4c1de007db51485fb533c42e6a168ef2/FLAGaa5fbaaf7 [2019-10-13 21:39:16,936 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:39:16,938 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/pr3.c [2019-10-13 21:39:16,945 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba7043b08/4c1de007db51485fb533c42e6a168ef2/FLAGaa5fbaaf7 [2019-10-13 21:39:17,307 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba7043b08/4c1de007db51485fb533c42e6a168ef2 [2019-10-13 21:39:17,317 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:39:17,319 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:39:17,320 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:39:17,320 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:39:17,323 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:39:17,324 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:39:17" (1/1) ... [2019-10-13 21:39:17,327 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@663c421b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:17, skipping insertion in model container [2019-10-13 21:39:17,327 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:39:17" (1/1) ... [2019-10-13 21:39:17,334 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:39:17,354 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:39:17,548 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:39:17,552 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:39:17,575 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:39:17,671 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:39:17,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:17 WrapperNode [2019-10-13 21:39:17,672 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:39:17,672 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:39:17,672 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:39:17,673 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:39:17,684 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:17" (1/1) ... [2019-10-13 21:39:17,684 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:17" (1/1) ... [2019-10-13 21:39:17,690 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:17" (1/1) ... [2019-10-13 21:39:17,691 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:17" (1/1) ... [2019-10-13 21:39:17,699 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:17" (1/1) ... [2019-10-13 21:39:17,704 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:17" (1/1) ... [2019-10-13 21:39:17,705 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:17" (1/1) ... [2019-10-13 21:39:17,709 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:39:17,709 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:39:17,710 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:39:17,710 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:39:17,711 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:17" (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:17,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:39:17,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:39:17,784 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:39:17,784 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:39:17,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:39:17,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:39:17,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:39:17,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:39:17,785 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:39:17,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:39:17,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:39:17,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:39:17,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:39:17,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:39:17,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:39:18,284 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:39:18,285 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-13 21:39:18,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:39:18 BoogieIcfgContainer [2019-10-13 21:39:18,288 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:39:18,289 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:39:18,290 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:39:18,294 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:39:18,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:39:17" (1/3) ... [2019-10-13 21:39:18,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77f99e64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:39:18, skipping insertion in model container [2019-10-13 21:39:18,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:17" (2/3) ... [2019-10-13 21:39:18,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77f99e64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:39:18, skipping insertion in model container [2019-10-13 21:39:18,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:39:18" (3/3) ... [2019-10-13 21:39:18,299 INFO L109 eAbstractionObserver]: Analyzing ICFG pr3.c [2019-10-13 21:39:18,309 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:39:18,316 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:39:18,326 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:39:18,352 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:39:18,352 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:39:18,352 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:39:18,352 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:39:18,352 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:39:18,353 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:39:18,353 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:39:18,353 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:39:18,368 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-10-13 21:39:18,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 21:39:18,373 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:39:18,374 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:39:18,375 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:39:18,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:39:18,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1379838131, now seen corresponding path program 1 times [2019-10-13 21:39:18,386 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:39:18,387 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627555699] [2019-10-13 21:39:18,387 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:39:18,387 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:39:18,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:39:18,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:39:18,730 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:18,731 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627555699] [2019-10-13 21:39:18,732 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:39:18,732 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:39:18,733 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17432356] [2019-10-13 21:39:18,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:39:18,738 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:39:18,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:39:18,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:39:18,756 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 4 states. [2019-10-13 21:39:18,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:39:18,837 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2019-10-13 21:39:18,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:39:18,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-13 21:39:18,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:39:18,847 INFO L225 Difference]: With dead ends: 42 [2019-10-13 21:39:18,847 INFO L226 Difference]: Without dead ends: 18 [2019-10-13 21:39:18,850 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:18,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-13 21:39:18,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-13 21:39:18,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-13 21:39:18,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-10-13 21:39:18,888 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2019-10-13 21:39:18,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:39:18,889 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-10-13 21:39:18,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:39:18,890 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-10-13 21:39:18,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 21:39:18,890 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:39:18,891 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:39:18,891 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:39:18,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:39:18,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1391156721, now seen corresponding path program 1 times [2019-10-13 21:39:18,892 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:39:18,892 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036798868] [2019-10-13 21:39:18,892 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:39:18,893 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:39:18,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:39:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:39:19,387 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:19,388 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036798868] [2019-10-13 21:39:19,388 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348495915] [2019-10-13 21:39:19,388 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:19,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:39:19,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-13 21:39:19,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:39:19,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:19,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:19,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:19,651 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:19,652 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 21:39:19,965 WARN L191 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 55 [2019-10-13 21:39:19,966 INFO L567 ElimStorePlain]: treesize reduction 123, result has 51.2 percent of original size [2019-10-13 21:39:19,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:19,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:19,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:19,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:19,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:20,010 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 31 treesize of output 35 [2019-10-13 21:39:20,011 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 21:39:20,104 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:39:20,104 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_47| vanished before elimination [2019-10-13 21:39:20,112 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:20,114 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:20,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:20,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:20,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:20,120 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:20,134 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 34 treesize of output 38 [2019-10-13 21:39:20,135 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 21:39:20,233 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:39:20,233 INFO L464 ElimStorePlain]: Eliminatee v_prenex_4 vanished before elimination [2019-10-13 21:39:20,233 INFO L464 ElimStorePlain]: Eliminatee v_prenex_5 vanished before elimination [2019-10-13 21:39:20,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:20,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:20,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:20,254 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2019-10-13 21:39:20,255 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 21:39:20,348 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:39:20,357 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:20,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:20,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:20,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:20,368 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 39 [2019-10-13 21:39:20,369 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-13 21:39:20,435 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:39:20,437 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 8 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-10-13 21:39:20,438 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 10 variables, input treesize:289, output treesize:143 [2019-10-13 21:39:20,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 21:39:20,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:20,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:20,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:20,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:20,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:20,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:20,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:20,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:20,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:20,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:20,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:20,714 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:20,714 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:39:20,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:20,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:20,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:20,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:20,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:20,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:20,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:20,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:20,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:20,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:20,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:20,823 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 75 treesize of output 71 [2019-10-13 21:39:20,827 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:39:20,828 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:39:20,838 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:39:20,839 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:39:20,846 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:20,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:20,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:20,848 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 21:39:20,860 INFO L567 ElimStorePlain]: treesize reduction 12, result has 61.3 percent of original size [2019-10-13 21:39:20,861 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 21:39:21,087 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 105 [2019-10-13 21:39:21,088 INFO L567 ElimStorePlain]: treesize reduction 43, result has 93.4 percent of original size [2019-10-13 21:39:21,097 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 75 treesize of output 71 [2019-10-13 21:39:21,102 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:39:21,102 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:39:21,111 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:39:21,114 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:39:21,120 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:21,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:21,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:21,122 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 21:39:21,138 INFO L567 ElimStorePlain]: treesize reduction 12, result has 61.3 percent of original size [2019-10-13 21:39:21,138 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 21:39:21,350 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 95 [2019-10-13 21:39:21,351 INFO L567 ElimStorePlain]: treesize reduction 5, result has 99.1 percent of original size [2019-10-13 21:39:21,379 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 103 treesize of output 97 [2019-10-13 21:39:21,385 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:39:21,385 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:39:21,392 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:39:21,393 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:39:21,398 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 84 treesize of output 78 [2019-10-13 21:39:21,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:21,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:21,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:21,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:21,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:21,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:21,404 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-13 21:39:21,417 INFO L567 ElimStorePlain]: treesize reduction 26, result has 35.0 percent of original size [2019-10-13 21:39:21,417 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 21:39:21,540 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 81 [2019-10-13 21:39:21,541 INFO L567 ElimStorePlain]: treesize reduction 57, result has 87.7 percent of original size [2019-10-13 21:39:21,548 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 98 treesize of output 92 [2019-10-13 21:39:21,553 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:39:21,553 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:39:21,560 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:39:21,565 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:39:21,571 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 84 treesize of output 78 [2019-10-13 21:39:21,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:21,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:21,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:21,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:21,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:21,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:21,575 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-10-13 21:39:21,594 INFO L567 ElimStorePlain]: treesize reduction 27, result has 22.9 percent of original size [2019-10-13 21:39:21,595 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 21:39:21,608 INFO L567 ElimStorePlain]: treesize reduction 308, result has 2.5 percent of original size [2019-10-13 21:39:21,609 INFO L464 ElimStorePlain]: Eliminatee v_prenex_11 vanished before elimination [2019-10-13 21:39:21,609 INFO L464 ElimStorePlain]: Eliminatee v_prenex_17 vanished before elimination [2019-10-13 21:39:21,609 INFO L464 ElimStorePlain]: Eliminatee |#memory_int| vanished before elimination [2019-10-13 21:39:21,609 INFO L464 ElimStorePlain]: Eliminatee v_prenex_15 vanished before elimination [2019-10-13 21:39:21,610 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 8 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 21:39:21,610 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 16 variables, input treesize:712, output treesize:8 [2019-10-13 21:39:21,641 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:21,641 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1849966882] [2019-10-13 21:39:21,664 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:39:21,665 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:39:21,670 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:39:21,677 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:39:21,677 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:39:21,787 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-13 21:39:22,207 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:22,234 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:22,262 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:22,629 WARN L191 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 212 [2019-10-13 21:39:22,651 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:22,674 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:23,949 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 208 [2019-10-13 21:39:24,457 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:24,624 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2019-10-13 21:39:24,646 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:24,668 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:24,704 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:24,847 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 192 [2019-10-13 21:39:24,866 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:24,885 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:24,903 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:25,034 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2019-10-13 21:39:25,055 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:25,074 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:25,165 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:25,238 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:25,349 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-10-13 21:39:25,460 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-10-13 21:39:25,543 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:25,556 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:25,569 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:25,651 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:25,664 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:25,675 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:25,738 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:25,751 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:25,764 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:25,818 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:25,980 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:25,993 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:26,004 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:26,075 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:26,260 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:26,389 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:26,516 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 28 for LOIs [2019-10-13 21:39:26,533 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-13 21:39:26,539 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:39:26,539 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:39:26,539 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:26,539 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 162#(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:26,540 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 171#(and (= |old(~CELLCOUNT~0)| ~CELLCOUNT~0) (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:39:26,540 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 157#(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:26,541 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:26,541 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:26,541 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 176#(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:26,542 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:39:26,542 INFO L193 IcfgInterpreter]: Reachable states at location L53-3 satisfy 139#(and (<= |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) (= |#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)) [2019-10-13 21:39:26,542 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 167#(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:26,543 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 152#(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:26,543 INFO L193 IcfgInterpreter]: Reachable states at location L20 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) (= 3 main_~CCCELVOL2~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)) [2019-10-13 21:39:26,543 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 134#(and (or (and (<= |main_~#volArray~0.offset| 0) (= 0 |#NULL.base|) (not (= 0 (ite (= 0 (ite (and (not (= (mod ~CELLCOUNT~0 3) 0)) (< ~CELLCOUNT~0 0)) (+ (mod ~CELLCOUNT~0 3) (- 3)) (mod ~CELLCOUNT~0 3))) 1 0))) (<= 0 |main_~#volArray~0.offset|) (= 0 (ite (and (not (= (mod ~CELLCOUNT~0 3) 0)) (< ~CELLCOUNT~0 0)) (+ (mod ~CELLCOUNT~0 3) (- 3)) (mod ~CELLCOUNT~0 3))) (= |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) (<= main_~i~0 1) (= 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) (= 7 main_~CCCELVOL3~0) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (< 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (= 0 (select |old(#valid)| |main_~#volArray~0.base|)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (<= 0 (+ ~CELLCOUNT~0 2147483648)) (= |old(~CELLCOUNT~0)| 0)) (and (= |#NULL.base| 0) (= main_~CCCELVOL1~0 1) (<= |main_~#volArray~0.offset| 0) (<= 1 ~CELLCOUNT~0) (<= |#NULL.base| 0) (<= 0 |main_~#volArray~0.offset|) (<= 1 main_~CCCELVOL1~0) (= |main_~#volArray~0.offset| 0) (<= 0 |#NULL.base|) (<= |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) (= main_~CCCELVOL3~0 7) (= main_~CCCELVOL2~0 3) (= |#NULL.offset| 0) (= |old(~CELLCOUNT~0)| 0))) (<= 1 main_~i~0) (<= main_~CCCELVOL1~0 1) (<= 3 main_~CCCELVOL2~0) (<= main_~CCCELVOL2~0 3)) [2019-10-13 21:39:26,543 INFO L193 IcfgInterpreter]: Reachable states at location L55-2 satisfy 147#(and (<= |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) (= |#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)) [2019-10-13 21:39:27,042 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-10-13 21:39:27,398 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:39:27,399 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8, 11] total 29 [2019-10-13 21:39:27,399 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572985167] [2019-10-13 21:39:27,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-13 21:39:27,406 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:39:27,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-13 21:39:27,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2019-10-13 21:39:27,409 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 29 states. [2019-10-13 21:39:27,678 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-10-13 21:39:27,954 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2019-10-13 21:39:28,259 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-10-13 21:39:28,464 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2019-10-13 21:39:28,688 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-10-13 21:39:29,113 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-10-13 21:39:29,359 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-10-13 21:39:29,653 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2019-10-13 21:39:29,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:39:29,798 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2019-10-13 21:39:29,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-13 21:39:29,798 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 14 [2019-10-13 21:39:29,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:39:29,801 INFO L225 Difference]: With dead ends: 34 [2019-10-13 21:39:29,801 INFO L226 Difference]: Without dead ends: 32 [2019-10-13 21:39:29,802 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=210, Invalid=1430, Unknown=0, NotChecked=0, Total=1640 [2019-10-13 21:39:29,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-13 21:39:29,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-10-13 21:39:29,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-13 21:39:29,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-10-13 21:39:29,815 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 14 [2019-10-13 21:39:29,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:39:29,815 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-10-13 21:39:29,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-13 21:39:29,815 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-10-13 21:39:29,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-13 21:39:29,817 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:39:29,817 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:39:30,020 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:39:30,020 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:39:30,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:39:30,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1243584095, now seen corresponding path program 1 times [2019-10-13 21:39:30,021 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:39:30,022 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820962100] [2019-10-13 21:39:30,022 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:39:30,023 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:39:30,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:39:30,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:39:30,340 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:39:30,340 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820962100] [2019-10-13 21:39:30,341 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30149123] [2019-10-13 21:39:30,341 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:39:30,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:39:30,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-13 21:39:30,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:39:30,588 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:39:30,588 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:39:30,712 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:39:30,713 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1994643087] [2019-10-13 21:39:30,716 INFO L162 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-10-13 21:39:30,717 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:39:30,717 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:39:30,717 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:39:30,718 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:39:30,757 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-13 21:39:31,333 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:31,563 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 229 [2019-10-13 21:39:31,954 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:32,147 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 223 [2019-10-13 21:39:32,183 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:33,146 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 215 [2019-10-13 21:39:33,369 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:33,683 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 208 [2019-10-13 21:39:33,711 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:33,730 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:33,749 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:33,858 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 198 [2019-10-13 21:39:33,878 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:33,895 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:33,913 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:34,025 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:34,042 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:34,058 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:34,156 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:34,171 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:34,193 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:34,297 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-10-13 21:39:34,467 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-10-13 21:39:34,551 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:34,566 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:34,579 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:34,751 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:34,828 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:34,841 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:34,852 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:34,910 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:34,922 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:34,931 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:35,015 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:35,086 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:35,096 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:35,107 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:35,139 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:35,243 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:35,509 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 19 for LOIs [2019-10-13 21:39:35,544 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-13 21:39:35,548 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:39:35,548 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:39:35,548 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 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 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:35,548 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 249#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (<= __VERIFIER_assert_~cond 0) (<= |#NULL.base| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:39:35,549 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 258#(and (= |old(~CELLCOUNT~0)| ~CELLCOUNT~0) (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:39:35,549 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 244#(and (or (and (= |#NULL.base| 0) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= |#NULL.base| 0) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:39:35,549 INFO L193 IcfgInterpreter]: Reachable states at location L3-3 satisfy 239#(and (or (and (= |#NULL.base| 0) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= |#NULL.base| 0) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:39:35,549 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 234#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (or (and (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (<= __VERIFIER_assert_~cond 0) (<= |#NULL.base| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (<= |#NULL.base| 0) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-13 21:39:35,549 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:35,550 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 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 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:35,550 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 263#(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:35,550 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:39:35,550 INFO L193 IcfgInterpreter]: Reachable states at location L53-3 satisfy 224#(or (and (<= |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) (= |#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)) (and (<= |main_~#volArray~0.offset| 0) (= |#NULL.base| 0) (= main_~CCCELVOL1~0 1) (<= 1 ~CELLCOUNT~0) (<= |#NULL.base| 0) (<= 0 |main_~#volArray~0.offset|) (<= 1 main_~CCCELVOL1~0) (= |main_~#volArray~0.offset| 0) (<= 0 |#NULL.base|) (<= |old(~CELLCOUNT~0)| 0) (<= main_~CCCELVOL3~0 7) (<= 7 main_~CCCELVOL3~0) (<= 0 |#NULL.offset|) (<= 0 |old(~CELLCOUNT~0)|) (<= |#NULL.offset| 0) (<= ~CELLCOUNT~0 2147483647) (<= 1 main_~i~0) (<= main_~CCCELVOL1~0 1) (<= 3 main_~CCCELVOL2~0) (<= main_~CCCELVOL2~0 3) (= main_~CCCELVOL3~0 7) (= main_~CCCELVOL2~0 3) (= |#NULL.offset| 0) (= |old(~CELLCOUNT~0)| 0))) [2019-10-13 21:39:35,550 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 254#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (<= __VERIFIER_assert_~cond 0) (<= |#NULL.base| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:39:35,551 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 229#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (= |#NULL.offset| 0))) (or (and (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (<= |#NULL.base| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-13 21:39:35,551 INFO L193 IcfgInterpreter]: Reachable states at location L20 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) (= 3 main_~CCCELVOL2~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) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 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)) [2019-10-13 21:39:35,551 INFO L193 IcfgInterpreter]: Reachable states at location L55-3 satisfy 215#(and (<= |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) (= |#NULL.base| 0) (= main_~CCCELVOL1~0 1) (<= 1 ~CELLCOUNT~0) |main_#t~short6| (<= |#NULL.base| 0) (<= 1 main_~CCCELVOL1~0) (<= |old(~CELLCOUNT~0)| 0) (<= 7 main_~CCCELVOL3~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)) [2019-10-13 21:39:35,551 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 134#(and (or (and (= |#NULL.base| 0) (= main_~CCCELVOL1~0 1) (<= |main_~#volArray~0.offset| 0) (<= 1 ~CELLCOUNT~0) (<= |#NULL.base| 0) (<= 0 |main_~#volArray~0.offset|) (<= 1 main_~CCCELVOL1~0) (= |main_~#volArray~0.offset| 0) (<= 0 |#NULL.base|) (<= |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_~CCCELVOL3~0 7) (= main_~CCCELVOL2~0 3) (= |#NULL.offset| 0) (= |old(~CELLCOUNT~0)| 0)) (and (<= |main_~#volArray~0.offset| 0) (= 0 |#NULL.base|) (not (= 0 (ite (= 0 (ite (and (not (= (mod ~CELLCOUNT~0 3) 0)) (< ~CELLCOUNT~0 0)) (+ (mod ~CELLCOUNT~0 3) (- 3)) (mod ~CELLCOUNT~0 3))) 1 0))) (<= 0 |main_~#volArray~0.offset|) (= 0 (ite (and (not (= (mod ~CELLCOUNT~0 3) 0)) (< ~CELLCOUNT~0 0)) (+ (mod ~CELLCOUNT~0 3) (- 3)) (mod ~CELLCOUNT~0 3))) (= |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)) (<= 1 main_~i~0) (= |#valid| (store |old(#valid)| |main_~#volArray~0.base| 1)) (= 1 main_~CCCELVOL1~0) (<= main_~i~0 1) (= 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) (= 7 main_~CCCELVOL3~0) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (< 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (= 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_~CCCELVOL1~0 1) (<= 3 main_~CCCELVOL2~0) (<= main_~CCCELVOL2~0 3)) [2019-10-13 21:39:35,552 INFO L193 IcfgInterpreter]: Reachable states at location L55-2 satisfy 203#(and (= |#NULL.base| 0) (= main_~CCCELVOL1~0 1) (<= |main_~#volArray~0.offset| 0) (<= 1 ~CELLCOUNT~0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#volArray~0.offset|) (<= 1 main_~CCCELVOL1~0) (= |main_~#volArray~0.offset| 0) (<= 0 |#NULL.base|) (<= |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) (<= main_~CCCELVOL1~0 1) (<= 3 main_~CCCELVOL2~0) (= main_~CCCELVOL3~0 7) (<= main_~CCCELVOL2~0 3) (= main_~CCCELVOL2~0 3) (= |#NULL.offset| 0) (= |old(~CELLCOUNT~0)| 0)) [2019-10-13 21:39:35,991 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-10-13 21:39:36,348 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 31 [2019-10-13 21:39:36,834 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:39:36,834 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8, 13] total 35 [2019-10-13 21:39:36,834 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214010646] [2019-10-13 21:39:36,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-13 21:39:36,835 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:39:36,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-13 21:39:36,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1029, Unknown=0, NotChecked=0, Total=1190 [2019-10-13 21:39:36,837 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 35 states. [2019-10-13 21:39:37,080 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-10-13 21:39:37,534 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-10-13 21:39:37,862 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-10-13 21:39:39,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:39:39,246 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2019-10-13 21:39:39,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-13 21:39:39,247 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-10-13 21:39:39,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:39:39,250 INFO L225 Difference]: With dead ends: 54 [2019-10-13 21:39:39,250 INFO L226 Difference]: Without dead ends: 31 [2019-10-13 21:39:39,253 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 74 SyntacticMatches, 6 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1036 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=454, Invalid=2852, Unknown=0, NotChecked=0, Total=3306 [2019-10-13 21:39:39,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-13 21:39:39,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-10-13 21:39:39,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-13 21:39:39,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-10-13 21:39:39,261 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 35 [2019-10-13 21:39:39,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:39:39,261 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-10-13 21:39:39,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-13 21:39:39,262 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-10-13 21:39:39,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-13 21:39:39,263 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:39:39,263 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:39:39,467 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:39:39,468 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:39:39,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:39:39,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1261021469, now seen corresponding path program 2 times [2019-10-13 21:39:39,469 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:39:39,470 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267148006] [2019-10-13 21:39:39,470 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:39:39,470 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:39:39,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:39:39,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:39:39,871 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:39:39,872 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267148006] [2019-10-13 21:39:39,872 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470358288] [2019-10-13 21:39:39,872 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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-13 21:39:39,953 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-13 21:39:39,954 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:39:39,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-13 21:39:39,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:39:40,055 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:40,321 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 58 [2019-10-13 21:39:41,786 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:39:41,787 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:39:42,255 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 106 [2019-10-13 21:39:42,369 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:39:42,370 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1770572843] [2019-10-13 21:39:42,371 INFO L162 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-10-13 21:39:42,371 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:39:42,372 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:39:42,372 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:39:42,373 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:39:42,404 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-13 21:39:42,589 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:43,218 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 229 [2019-10-13 21:39:44,114 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:44,271 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 222 [2019-10-13 21:39:44,819 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:44,937 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 215 [2019-10-13 21:39:45,365 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:45,475 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 208 [2019-10-13 21:39:45,492 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:45,509 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:45,525 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:45,631 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 198 [2019-10-13 21:39:45,647 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:45,662 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:45,679 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:45,784 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:45,802 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:45,817 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:45,927 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:45,942 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:45,958 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:46,061 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-10-13 21:39:46,213 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:46,224 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:46,239 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:46,290 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:46,305 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:46,320 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:46,366 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:46,376 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:46,386 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:46,423 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:46,433 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:46,443 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:46,513 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:46,606 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:46,654 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:46,740 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:47,038 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 19 for LOIs [2019-10-13 21:39:47,074 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-13 21:39:47,081 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:39:47,081 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:39:47,082 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:47,083 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 249#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (<= __VERIFIER_assert_~cond 0) (<= |#NULL.base| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:39:47,083 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 258#(and (= |old(~CELLCOUNT~0)| ~CELLCOUNT~0) (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:39:47,085 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 244#(and (or (and (= |#NULL.base| 0) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= |#NULL.base| 0) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:39:47,085 INFO L193 IcfgInterpreter]: Reachable states at location L3-3 satisfy 239#(and (or (and (= |#NULL.base| 0) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= |#NULL.base| 0) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:39:47,085 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 234#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (or (and (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (<= __VERIFIER_assert_~cond 0) (<= |#NULL.base| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (<= |#NULL.base| 0) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-13 21:39:47,085 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:47,085 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:47,086 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 263#(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:47,086 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:39:47,086 INFO L193 IcfgInterpreter]: Reachable states at location L53-3 satisfy 224#(or (and (<= |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) (= |#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)) (and (<= |main_~#volArray~0.offset| 0) (= |#NULL.base| 0) (= main_~CCCELVOL1~0 1) (<= 1 ~CELLCOUNT~0) (<= |#NULL.base| 0) (<= 0 |main_~#volArray~0.offset|) (<= 1 main_~CCCELVOL1~0) (= |main_~#volArray~0.offset| 0) (<= 0 |#NULL.base|) (<= |old(~CELLCOUNT~0)| 0) (<= main_~CCCELVOL3~0 7) (<= 7 main_~CCCELVOL3~0) (<= 0 |#NULL.offset|) (<= 0 |old(~CELLCOUNT~0)|) (<= |#NULL.offset| 0) (<= ~CELLCOUNT~0 2147483647) (<= 1 main_~i~0) (<= main_~CCCELVOL1~0 1) (<= 3 main_~CCCELVOL2~0) (<= main_~CCCELVOL2~0 3) (= main_~CCCELVOL3~0 7) (= main_~CCCELVOL2~0 3) (= |#NULL.offset| 0) (= |old(~CELLCOUNT~0)| 0))) [2019-10-13 21:39:47,086 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 254#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (<= __VERIFIER_assert_~cond 0) (<= |#NULL.base| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:39:47,086 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 229#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (= |#NULL.offset| 0))) (or (and (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (<= |#NULL.base| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-13 21:39:47,087 INFO L193 IcfgInterpreter]: Reachable states at location L20 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) (= 3 main_~CCCELVOL2~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)) [2019-10-13 21:39:47,087 INFO L193 IcfgInterpreter]: Reachable states at location L55-3 satisfy 215#(and (<= |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) (= |#NULL.base| 0) (= main_~CCCELVOL1~0 1) (<= 1 ~CELLCOUNT~0) |main_#t~short6| (<= |#NULL.base| 0) (<= 1 main_~CCCELVOL1~0) (<= |old(~CELLCOUNT~0)| 0) (<= 7 main_~CCCELVOL3~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)) [2019-10-13 21:39:47,087 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 134#(and (or (and (<= |main_~#volArray~0.offset| 0) (= 0 |#NULL.base|) (not (= 0 (ite (= 0 (ite (and (not (= (mod ~CELLCOUNT~0 3) 0)) (< ~CELLCOUNT~0 0)) (+ (mod ~CELLCOUNT~0 3) (- 3)) (mod ~CELLCOUNT~0 3))) 1 0))) (<= 0 |main_~#volArray~0.offset|) (= 0 (ite (and (not (= (mod ~CELLCOUNT~0 3) 0)) (< ~CELLCOUNT~0 0)) (+ (mod ~CELLCOUNT~0 3) (- 3)) (mod ~CELLCOUNT~0 3))) (= |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) (<= main_~i~0 1) (= 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) (= 7 main_~CCCELVOL3~0) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (< 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (= 0 (select |old(#valid)| |main_~#volArray~0.base|)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (<= 0 (+ ~CELLCOUNT~0 2147483648)) (= |old(~CELLCOUNT~0)| 0)) (and (= |#NULL.base| 0) (= main_~CCCELVOL1~0 1) (<= |main_~#volArray~0.offset| 0) (<= 1 ~CELLCOUNT~0) (<= |#NULL.base| 0) (<= 0 |main_~#volArray~0.offset|) (<= 1 main_~CCCELVOL1~0) (= |main_~#volArray~0.offset| 0) (<= 0 |#NULL.base|) (<= |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) (= main_~CCCELVOL3~0 7) (= main_~CCCELVOL2~0 3) (= |#NULL.offset| 0) (= |old(~CELLCOUNT~0)| 0))) (<= 1 main_~i~0) (<= main_~CCCELVOL1~0 1) (<= 3 main_~CCCELVOL2~0) (<= main_~CCCELVOL2~0 3)) [2019-10-13 21:39:47,087 INFO L193 IcfgInterpreter]: Reachable states at location L55-2 satisfy 203#(and (= |#NULL.base| 0) (= main_~CCCELVOL1~0 1) (<= |main_~#volArray~0.offset| 0) (<= 1 ~CELLCOUNT~0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#volArray~0.offset|) (<= 1 main_~CCCELVOL1~0) (= |main_~#volArray~0.offset| 0) (<= 0 |#NULL.base|) (<= |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) (<= main_~CCCELVOL1~0 1) (<= 3 main_~CCCELVOL2~0) (= main_~CCCELVOL3~0 7) (<= main_~CCCELVOL2~0 3) (= main_~CCCELVOL2~0 3) (= |#NULL.offset| 0) (= |old(~CELLCOUNT~0)| 0)) [2019-10-13 21:39:47,879 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-10-13 21:39:48,174 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 29 [2019-10-13 21:39:48,545 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 31 [2019-10-13 21:39:49,058 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 25 [2019-10-13 21:39:49,730 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:39:49,731 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 12, 13] total 44 [2019-10-13 21:39:49,731 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011638043] [2019-10-13 21:39:49,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-13 21:39:49,733 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:39:49,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-13 21:39:49,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1728, Unknown=0, NotChecked=0, Total=1892 [2019-10-13 21:39:49,734 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 44 states. [2019-10-13 21:39:50,107 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-10-13 21:39:50,702 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-10-13 21:39:51,081 WARN L191 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 84 [2019-10-13 21:39:51,309 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57