/usr/bin/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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/array-tiling/poly1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:27:52,197 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:27:52,199 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:27:52,211 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:27:52,211 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:27:52,212 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:27:52,214 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:27:52,216 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:27:52,221 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:27:52,227 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:27:52,228 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:27:52,230 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:27:52,230 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:27:52,231 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:27:52,232 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:27:52,233 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:27:52,234 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:27:52,234 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:27:52,236 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:27:52,238 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:27:52,239 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:27:52,240 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:27:52,241 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:27:52,242 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:27:52,244 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:27:52,245 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:27:52,245 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:27:52,246 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:27:52,246 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:27:52,247 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:27:52,247 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:27:52,248 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:27:52,249 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:27:52,249 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:27:52,250 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:27:52,250 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:27:52,251 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:27:52,251 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:27:52,252 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:27:52,252 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:27:52,253 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:27:52,254 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-11-06 22:27:52,268 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:27:52,269 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:27:52,270 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:27:52,270 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:27:52,270 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:27:52,271 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:27:52,271 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:27:52,271 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:27:52,271 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:27:52,271 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:27:52,272 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:27:52,272 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:27:52,272 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:27:52,272 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:27:52,272 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:27:52,273 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:27:52,273 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:27:52,273 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:27:52,273 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:27:52,273 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:27:52,274 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:27:52,274 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:27:52,274 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:27:52,274 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:27:52,274 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:27:52,275 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:27:52,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:27:52,275 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:27:52,275 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-06 22:27:52,549 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:27:52,561 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:27:52,565 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:27:52,566 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:27:52,566 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:27:52,567 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/poly1.c [2019-11-06 22:27:52,644 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19d829388/56b0da42b25444dca708eea76cf3850d/FLAGe0073edb9 [2019-11-06 22:27:53,127 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:27:53,128 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/poly1.c [2019-11-06 22:27:53,137 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19d829388/56b0da42b25444dca708eea76cf3850d/FLAGe0073edb9 [2019-11-06 22:27:53,502 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19d829388/56b0da42b25444dca708eea76cf3850d [2019-11-06 22:27:53,510 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:27:53,512 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:27:53,513 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:27:53,513 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:27:53,516 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:27:53,517 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:27:53" (1/1) ... [2019-11-06 22:27:53,520 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fe6b01c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:53, skipping insertion in model container [2019-11-06 22:27:53,520 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:27:53" (1/1) ... [2019-11-06 22:27:53,528 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:27:53,548 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:27:53,710 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:27:53,723 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:27:53,741 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:27:53,757 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:27:53,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:53 WrapperNode [2019-11-06 22:27:53,758 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:27:53,759 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:27:53,759 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:27:53,759 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:27:53,858 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:53" (1/1) ... [2019-11-06 22:27:53,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:53" (1/1) ... [2019-11-06 22:27:53,869 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:53" (1/1) ... [2019-11-06 22:27:53,869 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:53" (1/1) ... [2019-11-06 22:27:53,875 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:53" (1/1) ... [2019-11-06 22:27:53,881 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:53" (1/1) ... [2019-11-06 22:27:53,882 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:53" (1/1) ... [2019-11-06 22:27:53,884 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:27:53,884 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:27:53,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:27:53,885 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:27:53,885 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:53" (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-11-06 22:27:53,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:27:53,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:27:53,947 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-06 22:27:53,947 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:27:53,947 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:27:53,947 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-06 22:27:53,948 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-06 22:27:53,948 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 22:27:53,949 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-06 22:27:53,949 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:27:53,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-06 22:27:53,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 22:27:53,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 22:27:53,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:27:53,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:27:53,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 22:27:54,197 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:27:54,197 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-06 22:27:54,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:27:54 BoogieIcfgContainer [2019-11-06 22:27:54,199 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:27:54,210 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:27:54,210 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:27:54,214 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:27:54,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:27:53" (1/3) ... [2019-11-06 22:27:54,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15f3066f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:27:54, skipping insertion in model container [2019-11-06 22:27:54,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:53" (2/3) ... [2019-11-06 22:27:54,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15f3066f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:27:54, skipping insertion in model container [2019-11-06 22:27:54,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:27:54" (3/3) ... [2019-11-06 22:27:54,218 INFO L109 eAbstractionObserver]: Analyzing ICFG poly1.c [2019-11-06 22:27:54,227 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:27:54,234 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 22:27:54,245 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 22:27:54,273 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:27:54,274 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:27:54,274 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:27:54,274 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:27:54,274 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:27:54,274 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:27:54,274 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:27:54,275 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:27:54,298 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-11-06 22:27:54,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-06 22:27:54,303 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:27:54,304 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:27:54,305 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:27:54,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:27:54,310 INFO L82 PathProgramCache]: Analyzing trace with hash -516860939, now seen corresponding path program 1 times [2019-11-06 22:27:54,317 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:27:54,317 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037974514] [2019-11-06 22:27:54,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:27:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:27:54,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:27:54,441 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037974514] [2019-11-06 22:27:54,442 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:27:54,442 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-06 22:27:54,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418112643] [2019-11-06 22:27:54,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-06 22:27:54,449 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:27:54,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-06 22:27:54,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-06 22:27:54,467 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2019-11-06 22:27:54,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:27:54,491 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2019-11-06 22:27:54,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-06 22:27:54,493 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-11-06 22:27:54,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:27:54,501 INFO L225 Difference]: With dead ends: 41 [2019-11-06 22:27:54,502 INFO L226 Difference]: Without dead ends: 20 [2019-11-06 22:27:54,505 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-06 22:27:54,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-11-06 22:27:54,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-06 22:27:54,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-06 22:27:54,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-11-06 22:27:54,553 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 14 [2019-11-06 22:27:54,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:27:54,554 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-11-06 22:27:54,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-06 22:27:54,554 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-11-06 22:27:54,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-06 22:27:54,556 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:27:54,556 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:27:54,556 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:27:54,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:27:54,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1546915729, now seen corresponding path program 1 times [2019-11-06 22:27:54,557 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:27:54,557 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770498180] [2019-11-06 22:27:54,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:27:54,614 ERROR L268 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-06 22:27:54,614 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [173879627] [2019-11-06 22:27:54,614 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-11-06 22:27:54,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:27:54,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-06 22:27:54,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:27:54,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:27:54,752 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-06 22:27:54,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:27:54,778 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770498180] [2019-11-06 22:27:54,779 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-06 22:27:54,779 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173879627] [2019-11-06 22:27:54,779 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:27:54,780 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-06 22:27:54,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191383579] [2019-11-06 22:27:54,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:27:54,782 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:27:54,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:27:54,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:27:54,783 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 4 states. [2019-11-06 22:27:54,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:27:54,866 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-11-06 22:27:54,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:27:54,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-06 22:27:54,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:27:54,868 INFO L225 Difference]: With dead ends: 34 [2019-11-06 22:27:54,868 INFO L226 Difference]: Without dead ends: 23 [2019-11-06 22:27:54,869 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:27:54,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-06 22:27:54,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-06 22:27:54,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-06 22:27:54,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-11-06 22:27:54,881 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 14 [2019-11-06 22:27:54,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:27:54,882 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-11-06 22:27:54,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:27:54,883 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-11-06 22:27:54,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-06 22:27:54,885 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:27:54,885 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:27:55,089 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:27:55,089 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:27:55,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:27:55,091 INFO L82 PathProgramCache]: Analyzing trace with hash -600111765, now seen corresponding path program 1 times [2019-11-06 22:27:55,091 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:27:55,092 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310455950] [2019-11-06 22:27:55,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:27:55,110 ERROR L268 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-06 22:27:55,111 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1072939123] [2019-11-06 22:27:55,111 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-11-06 22:27:55,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:27:55,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-06 22:27:55,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:27:55,255 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2019-11-06 22:27:55,256 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 22:27:55,424 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 16 [2019-11-06 22:27:55,425 INFO L567 ElimStorePlain]: treesize reduction 36, result has 34.5 percent of original size [2019-11-06 22:27:55,425 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_6| vanished before elimination [2019-11-06 22:27:55,425 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 22:27:55,426 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:19 [2019-11-06 22:27:55,538 INFO L341 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2019-11-06 22:27:55,539 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2019-11-06 22:27:55,540 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 22:27:55,548 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:27:55,548 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 22:27:55,550 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-11-06 22:27:55,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:27:55,627 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-06 22:27:55,627 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 22:27:55,667 INFO L341 Elim1Store]: treesize reduction 10, result has 75.6 percent of original size [2019-11-06 22:27:55,667 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 48 [2019-11-06 22:27:55,670 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 22:27:55,688 INFO L567 ElimStorePlain]: treesize reduction 32, result has 17.9 percent of original size [2019-11-06 22:27:55,688 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 22:27:55,688 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:7 [2019-11-06 22:27:55,755 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:27:55,756 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-06 22:27:57,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:27:57,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:27:57,399 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 42 treesize of output 40 [2019-11-06 22:27:57,409 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 22:27:57,414 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 22:27:57,421 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 40 treesize of output 38 [2019-11-06 22:27:57,422 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-06 22:27:58,004 WARN L191 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 11 [2019-11-06 22:27:58,005 INFO L567 ElimStorePlain]: treesize reduction 12, result has 55.6 percent of original size [2019-11-06 22:27:58,006 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 22:27:58,013 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 42 treesize of output 40 [2019-11-06 22:27:58,028 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 22:27:58,036 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 22:27:58,041 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 32 treesize of output 30 [2019-11-06 22:27:58,042 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-11-06 22:27:58,192 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 10 [2019-11-06 22:27:58,193 INFO L567 ElimStorePlain]: treesize reduction 10, result has 54.5 percent of original size [2019-11-06 22:27:58,193 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 22:27:59,285 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 72 treesize of output 68 [2019-11-06 22:28:01,642 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 451 treesize of output 443 [2019-11-06 22:28:01,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:28:01,725 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-06 22:28:18,910 WARN L191 SmtUtils]: Spent 17.18 s on a formula simplification. DAG size of input: 66 DAG size of output: 9 [2019-11-06 22:28:18,911 INFO L567 ElimStorePlain]: treesize reduction 1782, result has 0.8 percent of original size [2019-11-06 22:28:18,911 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 22:28:25,325 WARN L191 SmtUtils]: Spent 6.41 s on a formula simplification. DAG size of input: 17 DAG size of output: 9 [2019-11-06 22:28:25,325 INFO L567 ElimStorePlain]: treesize reduction 28, result has 34.9 percent of original size [2019-11-06 22:28:25,326 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 22:28:25,326 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:157, output treesize:15 [2019-11-06 22:28:29,550 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:28:29,550 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310455950] [2019-11-06 22:28:29,550 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-06 22:28:29,551 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072939123] [2019-11-06 22:28:29,551 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [722564151] [2019-11-06 22:28:29,557 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 19 [2019-11-06 22:28:29,591 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-06 22:28:29,592 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-06 22:28:29,653 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-11-06 22:28:29,655 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 24 root evaluator evaluations with a maximum evaluation depth of 3. Performed 24 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 24 variables. [2019-11-06 22:28:29,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:28:29,658 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-11-06 22:28:29,691 INFO L227 lantSequenceWeakener]: Weakened 5 states. On average, predicates are now at 77.5% of their original sizes. [2019-11-06 22:28:29,691 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-11-06 22:28:29,696 INFO L553 sIntCurrentIteration]: We unified 17 AI predicates to 17 [2019-11-06 22:28:29,696 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-11-06 22:28:29,697 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-06 22:28:29,697 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10, 10] total 20 [2019-11-06 22:28:29,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366976126] [2019-11-06 22:28:29,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:28:29,699 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:28:29,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 22:28:29,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=239, Unknown=8, NotChecked=0, Total=306 [2019-11-06 22:28:29,700 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 4 states. [2019-11-06 22:28:29,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-06 22:28:29,904 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:28:29,905 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: at least one of both input predicates is unknown: 275#true or 423#(= ~MAX~0 100000) ([#1{~MAX~0 = [100000;100000]; }]) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$CoverageRelation.isCovered(PredicateUnifier.java:593) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.SdHoareTripleChecker$CheckHelper.check(SdHoareTripleChecker.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.SdHoareTripleChecker.checkCall(SdHoareTripleChecker.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.checkCall(EfficientHoareTripleChecker.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkCall(CachingHoareTripleChecker.java:125) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$CallSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:403) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.callSuccessors(AbstractInterpolantAutomaton.java:257) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.callSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.callSuccessors(TotalizeNwa.java:260) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.callSuccessors(ComplementDeterministicNwa.java:131) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.callSuccessors(ProductNwa.java:252) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.callSuccessors(ProductNwa.java:244) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addCallsAndSuccessors(NestedWordAutomatonReachableStates.java:1089) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:969) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:698) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:627) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-06 22:28:29,927 INFO L168 Benchmark]: Toolchain (without parser) took 36413.22 ms. Allocated memory was 139.5 MB in the beginning and 235.9 MB in the end (delta: 96.5 MB). Free memory was 103.5 MB in the beginning and 119.4 MB in the end (delta: -15.9 MB). Peak memory consumption was 80.5 MB. Max. memory is 7.1 GB. [2019-11-06 22:28:29,938 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 139.5 MB. Free memory is still 121.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-11-06 22:28:29,941 INFO L168 Benchmark]: CACSL2BoogieTranslator took 245.78 ms. Allocated memory is still 139.5 MB. Free memory was 103.1 MB in the beginning and 92.9 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2019-11-06 22:28:29,942 INFO L168 Benchmark]: Boogie Preprocessor took 125.26 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 92.9 MB in the beginning and 180.5 MB in the end (delta: -87.6 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. [2019-11-06 22:28:29,945 INFO L168 Benchmark]: RCFGBuilder took 322.44 ms. Allocated memory is still 202.9 MB. Free memory was 180.5 MB in the beginning and 166.4 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2019-11-06 22:28:29,946 INFO L168 Benchmark]: TraceAbstraction took 35712.73 ms. Allocated memory was 202.9 MB in the beginning and 235.9 MB in the end (delta: 33.0 MB). Free memory was 166.4 MB in the beginning and 119.4 MB in the end (delta: 47.0 MB). Peak memory consumption was 80.1 MB. Max. memory is 7.1 GB. [2019-11-06 22:28:29,959 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 139.5 MB. Free memory is still 121.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 245.78 ms. Allocated memory is still 139.5 MB. Free memory was 103.1 MB in the beginning and 92.9 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 125.26 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 92.9 MB in the beginning and 180.5 MB in the end (delta: -87.6 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 322.44 ms. Allocated memory is still 202.9 MB. Free memory was 180.5 MB in the beginning and 166.4 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 35712.73 ms. Allocated memory was 202.9 MB in the beginning and 235.9 MB in the end (delta: 33.0 MB). Free memory was 166.4 MB in the beginning and 119.4 MB in the end (delta: 47.0 MB). Peak memory consumption was 80.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: at least one of both input predicates is unknown: 275#true or 423#(= ~MAX~0 100000) ([#1{~MAX~0 = [100000;100000]; }]) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: at least one of both input predicates is unknown: 275#true or 423#(= ~MAX~0 100000) ([#1{~MAX~0 = [100000;100000]; }]): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$CoverageRelation.isCovered(PredicateUnifier.java:593) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...