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/rewnif.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:52:55,825 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:52:55,827 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:52:55,839 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:52:55,840 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:52:55,841 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:52:55,842 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:52:55,844 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:52:55,845 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:52:55,846 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:52:55,847 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:52:55,848 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:52:55,849 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:52:55,849 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:52:55,850 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:52:55,851 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:52:55,852 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:52:55,853 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:52:55,855 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:52:55,857 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:52:55,858 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:52:55,859 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:52:55,860 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:52:55,861 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:52:55,863 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:52:55,863 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:52:55,864 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:52:55,865 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:52:55,865 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:52:55,866 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:52:55,866 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:52:55,867 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:52:55,868 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:52:55,868 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:52:55,869 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:52:55,870 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:52:55,870 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:52:55,870 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:52:55,871 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:52:55,871 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:52:55,872 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:52:55,873 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-14 23:52:55,887 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:52:55,887 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:52:55,888 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:52:55,888 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:52:55,889 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:52:55,889 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:52:55,889 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:52:55,889 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:52:55,889 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:52:55,890 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:52:55,890 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:52:55,890 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:52:55,890 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:52:55,890 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:52:55,891 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:52:55,891 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:52:55,891 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:52:55,891 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:52:55,891 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:52:55,891 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:52:55,892 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:52:55,892 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:52:55,892 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:52:55,892 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:52:55,893 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:52:55,893 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:52:55,893 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:52:55,893 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:52:55,893 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-10-14 23:52:56,181 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:52:56,198 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:52:56,203 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:52:56,204 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:52:56,205 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:52:56,205 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/rewnif.c [2019-10-14 23:52:56,290 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a2c2b350/1b4053acfa01474bbeb110a682bf0b64/FLAGd26a33a3d [2019-10-14 23:52:56,781 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:52:56,781 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/rewnif.c [2019-10-14 23:52:56,787 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a2c2b350/1b4053acfa01474bbeb110a682bf0b64/FLAGd26a33a3d [2019-10-14 23:52:57,191 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a2c2b350/1b4053acfa01474bbeb110a682bf0b64 [2019-10-14 23:52:57,199 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:52:57,201 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:52:57,202 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:52:57,202 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:52:57,205 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:52:57,206 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:52:57" (1/1) ... [2019-10-14 23:52:57,209 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@665abbeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:57, skipping insertion in model container [2019-10-14 23:52:57,209 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:52:57" (1/1) ... [2019-10-14 23:52:57,217 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:52:57,231 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:52:57,426 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:52:57,436 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:52:57,451 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:52:57,467 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:52:57,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:57 WrapperNode [2019-10-14 23:52:57,468 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:52:57,468 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:52:57,468 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:52:57,468 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:52:57,566 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:57" (1/1) ... [2019-10-14 23:52:57,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:57" (1/1) ... [2019-10-14 23:52:57,574 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:57" (1/1) ... [2019-10-14 23:52:57,574 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:57" (1/1) ... [2019-10-14 23:52:57,595 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:57" (1/1) ... [2019-10-14 23:52:57,602 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:57" (1/1) ... [2019-10-14 23:52:57,604 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:57" (1/1) ... [2019-10-14 23:52:57,611 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:52:57,612 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:52:57,612 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:52:57,612 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:52:57,613 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:57" (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-14 23:52:57,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:52:57,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:52:57,671 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-14 23:52:57,671 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:52:57,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:52:57,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-14 23:52:57,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-14 23:52:57,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:52:57,672 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-14 23:52:57,672 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:52:57,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-14 23:52:57,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 23:52:57,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 23:52:57,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:52:57,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:52:57,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 23:52:57,917 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:52:57,917 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-14 23:52:57,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:52:57 BoogieIcfgContainer [2019-10-14 23:52:57,919 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:52:57,920 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:52:57,920 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:52:57,924 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:52:57,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:52:57" (1/3) ... [2019-10-14 23:52:57,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@602813e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:52:57, skipping insertion in model container [2019-10-14 23:52:57,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:57" (2/3) ... [2019-10-14 23:52:57,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@602813e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:52:57, skipping insertion in model container [2019-10-14 23:52:57,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:52:57" (3/3) ... [2019-10-14 23:52:57,927 INFO L109 eAbstractionObserver]: Analyzing ICFG rewnif.c [2019-10-14 23:52:57,938 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:52:57,946 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:52:57,958 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:52:57,992 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:52:57,993 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:52:57,993 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:52:57,993 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:52:57,993 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:52:57,993 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:52:57,994 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:52:57,994 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:52:58,013 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-10-14 23:52:58,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-14 23:52:58,019 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:52:58,020 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:52:58,021 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:52:58,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:52:58,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1294486485, now seen corresponding path program 1 times [2019-10-14 23:52:58,033 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:52:58,034 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766903596] [2019-10-14 23:52:58,034 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:58,034 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:58,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:52:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:52:58,176 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-14 23:52:58,176 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766903596] [2019-10-14 23:52:58,177 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:52:58,178 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-14 23:52:58,178 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695841274] [2019-10-14 23:52:58,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-14 23:52:58,184 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:52:58,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-14 23:52:58,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-14 23:52:58,205 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2019-10-14 23:52:58,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:52:58,235 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2019-10-14 23:52:58,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-14 23:52:58,237 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-10-14 23:52:58,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:52:58,247 INFO L225 Difference]: With dead ends: 43 [2019-10-14 23:52:58,248 INFO L226 Difference]: Without dead ends: 22 [2019-10-14 23:52:58,254 INFO L600 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-10-14 23:52:58,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-14 23:52:58,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-14 23:52:58,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-14 23:52:58,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-10-14 23:52:58,304 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 14 [2019-10-14 23:52:58,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:52:58,304 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-10-14 23:52:58,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-14 23:52:58,305 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-10-14 23:52:58,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-14 23:52:58,306 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:52:58,306 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:52:58,306 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:52:58,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:52:58,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1653126776, now seen corresponding path program 1 times [2019-10-14 23:52:58,307 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:52:58,308 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541462846] [2019-10-14 23:52:58,308 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:58,308 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:58,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:52:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:52:58,387 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-14 23:52:58,387 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541462846] [2019-10-14 23:52:58,388 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:52:58,388 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:52:58,388 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956804143] [2019-10-14 23:52:58,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:52:58,390 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:52:58,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:52:58,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:52:58,391 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 3 states. [2019-10-14 23:52:58,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:52:58,453 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2019-10-14 23:52:58,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:52:58,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-14 23:52:58,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:52:58,456 INFO L225 Difference]: With dead ends: 41 [2019-10-14 23:52:58,456 INFO L226 Difference]: Without dead ends: 26 [2019-10-14 23:52:58,457 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:52:58,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-14 23:52:58,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-10-14 23:52:58,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-14 23:52:58,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-10-14 23:52:58,464 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2019-10-14 23:52:58,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:52:58,464 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-10-14 23:52:58,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:52:58,465 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-10-14 23:52:58,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-14 23:52:58,466 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:52:58,466 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:52:58,466 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:52:58,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:52:58,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1007604157, now seen corresponding path program 1 times [2019-10-14 23:52:58,467 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:52:58,467 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708696285] [2019-10-14 23:52:58,468 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:58,468 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:58,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:52:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:52:58,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:52:58,584 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708696285] [2019-10-14 23:52:58,584 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:52:58,584 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:52:58,585 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761761904] [2019-10-14 23:52:58,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:52:58,585 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:52:58,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:52:58,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:52:58,586 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 4 states. [2019-10-14 23:52:58,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:52:58,646 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2019-10-14 23:52:58,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:52:58,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-10-14 23:52:58,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:52:58,648 INFO L225 Difference]: With dead ends: 38 [2019-10-14 23:52:58,648 INFO L226 Difference]: Without dead ends: 27 [2019-10-14 23:52:58,649 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-10-14 23:52:58,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-14 23:52:58,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-10-14 23:52:58,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-14 23:52:58,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-10-14 23:52:58,657 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 18 [2019-10-14 23:52:58,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:52:58,657 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-10-14 23:52:58,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:52:58,658 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-10-14 23:52:58,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 23:52:58,659 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:52:58,659 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:52:58,659 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:52:58,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:52:58,660 INFO L82 PathProgramCache]: Analyzing trace with hash -2051596356, now seen corresponding path program 1 times [2019-10-14 23:52:58,660 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:52:58,660 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450858131] [2019-10-14 23:52:58,661 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:58,661 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:58,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:52:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:52:58,973 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:52:58,974 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450858131] [2019-10-14 23:52:58,974 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704252359] [2019-10-14 23:52:58,974 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-14 23:52:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:52:59,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-14 23:52:59,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:52:59,129 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 15 treesize of output 11 [2019-10-14 23:52:59,129 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:52:59,139 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:52:59,139 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:52:59,140 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-10-14 23:52:59,202 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:52:59,202 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 23 treesize of output 46 [2019-10-14 23:52:59,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:52:59,249 INFO L567 ElimStorePlain]: treesize reduction 24, result has 47.8 percent of original size [2019-10-14 23:52:59,252 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:52:59,252 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:22 [2019-10-14 23:52:59,366 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:52:59,367 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 30 treesize of output 50 [2019-10-14 23:52:59,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:52:59,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:52:59,376 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:52:59,403 INFO L567 ElimStorePlain]: treesize reduction 51, result has 16.4 percent of original size [2019-10-14 23:52:59,404 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:52:59,404 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:7 [2019-10-14 23:52:59,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:52:59,473 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:52:59,474 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-14 23:52:59,658 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 16 treesize of output 14 [2019-10-14 23:52:59,667 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 30 treesize of output 28 [2019-10-14 23:52:59,670 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-10-14 23:52:59,675 INFO L567 ElimStorePlain]: treesize reduction 6, result has 53.8 percent of original size [2019-10-14 23:52:59,675 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:52:59,678 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:52:59,679 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:52:59,679 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:7 [2019-10-14 23:52:59,696 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:52:59,696 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [2015124759] [2019-10-14 23:52:59,704 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 23 [2019-10-14 23:52:59,745 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-14 23:52:59,745 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-14 23:52:59,824 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-14 23:52:59,825 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-10-14 23:52:59,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:52:59,830 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-14 23:52:59,888 INFO L227 lantSequenceWeakener]: Weakened 5 states. On average, predicates are now at 77.5% of their original sizes. [2019-10-14 23:52:59,888 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-10-14 23:52:59,907 INFO L553 sIntCurrentIteration]: We unified 21 AI predicates to 21 [2019-10-14 23:52:59,907 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-14 23:52:59,908 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-14 23:52:59,908 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9, 10, 9] total 23 [2019-10-14 23:52:59,909 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433276273] [2019-10-14 23:52:59,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:52:59,910 INFO L137 tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN [2019-10-14 23:52:59,910 INFO L124 tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy [2019-10-14 23:52:59,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:52:59,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:52:59,911 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 4 states. [2019-10-14 23:52:59,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:52:59,915 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2019-10-14 23:52:59,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:52:59,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-10-14 23:52:59,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:52:59,916 INFO L225 Difference]: With dead ends: 27 [2019-10-14 23:52:59,916 INFO L226 Difference]: Without dead ends: 0 [2019-10-14 23:52:59,916 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 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-10-14 23:52:59,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-14 23:52:59,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-14 23:52:59,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-14 23:52:59,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-14 23:52:59,917 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-10-14 23:52:59,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:52:59,918 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-14 23:52:59,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:52:59,918 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-14 23:52:59,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-14 23:53:00,122 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:53:00,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-14 23:53:00,220 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:53:00,220 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-14 23:53:00,221 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:53:00,221 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:53:00,221 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= 0 (+ ~SIZE~0 2147483648)) (<= ~SIZE~0 2147483647) (= ~MAX~0 100000)) [2019-10-14 23:53:00,221 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-14 23:53:00,221 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:53:00,222 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 11 34) no Hoare annotation was computed. [2019-10-14 23:53:00,222 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 24) no Hoare annotation was computed. [2019-10-14 23:53:00,222 INFO L443 ceAbstractionStarter]: For program point L21-2(lines 21 24) no Hoare annotation was computed. [2019-10-14 23:53:00,222 INFO L443 ceAbstractionStarter]: For program point L19-2(lines 19 26) no Hoare annotation was computed. [2019-10-14 23:53:00,223 INFO L439 ceAbstractionStarter]: At program point L19-3(lines 19 26) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648)))) [2019-10-14 23:53:00,224 INFO L443 ceAbstractionStarter]: For program point L19-4(lines 19 26) no Hoare annotation was computed. [2019-10-14 23:53:00,224 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 11 34) no Hoare annotation was computed. [2019-10-14 23:53:00,224 INFO L439 ceAbstractionStarter]: At program point L30(line 30) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648)))) [2019-10-14 23:53:00,224 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 11 34) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648))) (and (<= 0 (+ ~SIZE~0 2147483648)) (<= ~SIZE~0 2147483647))) [2019-10-14 23:53:00,225 INFO L443 ceAbstractionStarter]: For program point L30-1(line 30) no Hoare annotation was computed. [2019-10-14 23:53:00,225 INFO L443 ceAbstractionStarter]: For program point L28-2(lines 28 31) no Hoare annotation was computed. [2019-10-14 23:53:00,225 INFO L439 ceAbstractionStarter]: At program point L28-3(lines 28 31) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648)))) [2019-10-14 23:53:00,228 INFO L443 ceAbstractionStarter]: For program point L14(lines 14 32) no Hoare annotation was computed. [2019-10-14 23:53:00,228 INFO L443 ceAbstractionStarter]: For program point L14-1(lines 14 32) no Hoare annotation was computed. [2019-10-14 23:53:00,228 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2019-10-14 23:53:00,228 INFO L443 ceAbstractionStarter]: For program point L3-3(line 3) no Hoare annotation was computed. [2019-10-14 23:53:00,228 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(line 3) the Hoare annotation is: true [2019-10-14 23:53:00,229 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(line 3) no Hoare annotation was computed. [2019-10-14 23:53:00,229 INFO L443 ceAbstractionStarter]: For program point L3(line 3) no Hoare annotation was computed. [2019-10-14 23:53:00,229 INFO L443 ceAbstractionStarter]: For program point L3-1(line 3) no Hoare annotation was computed. [2019-10-14 23:53:00,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:53:00 BoogieIcfgContainer [2019-10-14 23:53:00,249 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-14 23:53:00,251 INFO L168 Benchmark]: Toolchain (without parser) took 3049.91 ms. Allocated memory was 145.8 MB in the beginning and 235.9 MB in the end (delta: 90.2 MB). Free memory was 103.3 MB in the beginning and 126.7 MB in the end (delta: -23.3 MB). Peak memory consumption was 66.8 MB. Max. memory is 7.1 GB. [2019-10-14 23:53:00,252 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.8 MB. Free memory is still 121.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-14 23:53:00,253 INFO L168 Benchmark]: CACSL2BoogieTranslator took 266.28 ms. Allocated memory is still 145.8 MB. Free memory was 102.9 MB in the beginning and 93.2 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2019-10-14 23:53:00,254 INFO L168 Benchmark]: Boogie Preprocessor took 143.17 ms. Allocated memory was 145.8 MB in the beginning and 201.9 MB in the end (delta: 56.1 MB). Free memory was 93.2 MB in the beginning and 179.5 MB in the end (delta: -86.2 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2019-10-14 23:53:00,255 INFO L168 Benchmark]: RCFGBuilder took 307.31 ms. Allocated memory is still 201.9 MB. Free memory was 179.5 MB in the beginning and 164.6 MB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2019-10-14 23:53:00,255 INFO L168 Benchmark]: TraceAbstraction took 2329.02 ms. Allocated memory was 201.9 MB in the beginning and 235.9 MB in the end (delta: 34.1 MB). Free memory was 164.6 MB in the beginning and 126.7 MB in the end (delta: 37.9 MB). Peak memory consumption was 72.0 MB. Max. memory is 7.1 GB. [2019-10-14 23:53:00,259 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 145.8 MB. Free memory is still 121.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 266.28 ms. Allocated memory is still 145.8 MB. Free memory was 102.9 MB in the beginning and 93.2 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 143.17 ms. Allocated memory was 145.8 MB in the beginning and 201.9 MB in the end (delta: 56.1 MB). Free memory was 93.2 MB in the beginning and 179.5 MB in the end (delta: -86.2 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 307.31 ms. Allocated memory is still 201.9 MB. Free memory was 179.5 MB in the beginning and 164.6 MB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2329.02 ms. Allocated memory was 201.9 MB in the beginning and 235.9 MB in the end (delta: 34.1 MB). Free memory was 164.6 MB in the beginning and 126.7 MB in the end (delta: 37.9 MB). Peak memory consumption was 72.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (!(\old(SIZE) <= 2147483647) || !(100000 == MAX)) || !(0 <= \old(SIZE) + 2147483648) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: (!(\old(SIZE) <= 2147483647) || !(100000 == MAX)) || !(0 <= \old(SIZE) + 2147483648) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. Result: SAFE, OverallTime: 2.2s, OverallIterations: 4, TraceHistogramMax: 2, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 74 SDtfs, 15 SDslu, 33 SDs, 0 SdLazy, 40 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 11 PreInvPairs, 11 NumberOfFragments, 84 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 3 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 106 ConstructedInterpolants, 4 QuantifiedInterpolants, 10695 SizeOfPredicates, 9 NumberOfNonLiveVariables, 89 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 4/19 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: TIME[ms]: 126, ITERATIONS: 1, WAS_STRONG: 1, WEAKENING_RATIO: 0.9642857142857143, AVG_VARS_REMOVED_DURING_WEAKENING: 0.7619047619047619, AVG_WEAKENED_CONJUNCTS: 1.0476190476190477, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...