java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/loops/linear_sea.ch_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 10:26:59,097 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 10:26:59,099 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 10:26:59,116 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 10:26:59,116 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 10:26:59,118 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 10:26:59,119 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 10:26:59,121 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 10:26:59,124 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 10:26:59,126 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 10:26:59,127 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 10:26:59,127 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 10:26:59,130 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 10:26:59,131 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 10:26:59,132 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 10:26:59,134 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 10:26:59,136 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 10:26:59,138 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 10:26:59,149 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 10:26:59,151 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 10:26:59,155 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 10:26:59,156 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 10:26:59,161 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 10:26:59,161 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 10:26:59,161 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 10:26:59,162 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 10:26:59,166 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 10:26:59,167 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 10:26:59,168 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 10:26:59,170 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 10:26:59,171 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 10:26:59,171 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 10:26:59,172 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 10:26:59,172 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 10:26:59,173 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 10:26:59,175 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 10:26:59,176 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-11-07 10:26:59,198 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 10:26:59,199 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 10:26:59,199 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 10:26:59,200 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 10:26:59,200 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 10:26:59,200 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 10:26:59,200 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 10:26:59,201 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 10:26:59,201 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 10:26:59,201 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 10:26:59,201 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 10:26:59,201 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 10:26:59,201 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 10:26:59,202 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 10:26:59,202 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 10:26:59,203 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 10:26:59,203 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 10:26:59,203 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 10:26:59,203 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 10:26:59,203 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 10:26:59,204 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 10:26:59,204 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 10:26:59,204 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 10:26:59,204 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 10:26:59,204 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 10:26:59,204 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 10:26:59,205 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 10:26:59,205 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 10:26:59,205 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 10:26:59,205 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 10:26:59,205 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 10:26:59,206 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 10:26:59,206 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 10:26:59,206 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 10:26:59,206 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 10:26:59,206 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 10:26:59,271 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 10:26:59,297 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 10:26:59,301 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 10:26:59,303 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 10:26:59,303 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 10:26:59,305 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/linear_sea.ch_true-unreach-call.i [2018-11-07 10:26:59,373 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b9fd29b0/1bb1e36196c54c549d4a4f8465f65331/FLAG80a071f28 [2018-11-07 10:26:59,789 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 10:26:59,790 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_sea.ch_true-unreach-call.i [2018-11-07 10:26:59,796 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b9fd29b0/1bb1e36196c54c549d4a4f8465f65331/FLAG80a071f28 [2018-11-07 10:26:59,813 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b9fd29b0/1bb1e36196c54c549d4a4f8465f65331 [2018-11-07 10:26:59,824 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 10:26:59,825 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 10:26:59,826 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 10:26:59,826 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 10:26:59,829 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 10:26:59,830 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:26:59" (1/1) ... [2018-11-07 10:26:59,833 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e77fec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:26:59, skipping insertion in model container [2018-11-07 10:26:59,833 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:26:59" (1/1) ... [2018-11-07 10:26:59,843 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 10:26:59,870 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 10:27:00,130 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:27:00,145 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 10:27:00,167 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:27:00,183 INFO L193 MainTranslator]: Completed translation [2018-11-07 10:27:00,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:27:00 WrapperNode [2018-11-07 10:27:00,183 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 10:27:00,184 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 10:27:00,184 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 10:27:00,184 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 10:27:00,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:27:00" (1/1) ... [2018-11-07 10:27:00,200 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:27:00" (1/1) ... [2018-11-07 10:27:00,206 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 10:27:00,206 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 10:27:00,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 10:27:00,207 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 10:27:00,215 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:27:00" (1/1) ... [2018-11-07 10:27:00,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:27:00" (1/1) ... [2018-11-07 10:27:00,216 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:27:00" (1/1) ... [2018-11-07 10:27:00,217 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:27:00" (1/1) ... [2018-11-07 10:27:00,223 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:27:00" (1/1) ... [2018-11-07 10:27:00,229 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:27:00" (1/1) ... [2018-11-07 10:27:00,231 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:27:00" (1/1) ... [2018-11-07 10:27:00,238 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 10:27:00,238 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 10:27:00,239 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 10:27:00,239 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 10:27:00,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:27:00" (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 [2018-11-07 10:27:00,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-07 10:27:00,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 10:27:00,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 10:27:00,384 INFO L130 BoogieDeclarations]: Found specification of procedure linear_search [2018-11-07 10:27:00,384 INFO L138 BoogieDeclarations]: Found implementation of procedure linear_search [2018-11-07 10:27:00,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-07 10:27:00,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 10:27:00,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 10:27:00,385 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 10:27:00,385 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 10:27:00,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-07 10:27:00,385 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 10:27:00,385 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 10:27:00,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-07 10:27:00,791 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 10:27:00,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:27:00 BoogieIcfgContainer [2018-11-07 10:27:00,792 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 10:27:00,793 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 10:27:00,793 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 10:27:00,796 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 10:27:00,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:26:59" (1/3) ... [2018-11-07 10:27:00,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17ce7f38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:27:00, skipping insertion in model container [2018-11-07 10:27:00,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:27:00" (2/3) ... [2018-11-07 10:27:00,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17ce7f38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:27:00, skipping insertion in model container [2018-11-07 10:27:00,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:27:00" (3/3) ... [2018-11-07 10:27:00,800 INFO L112 eAbstractionObserver]: Analyzing ICFG linear_sea.ch_true-unreach-call.i [2018-11-07 10:27:00,810 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 10:27:00,819 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 10:27:00,837 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 10:27:00,873 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 10:27:00,873 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 10:27:00,873 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 10:27:00,873 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 10:27:00,874 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 10:27:00,874 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 10:27:00,874 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 10:27:00,874 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 10:27:00,892 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-07 10:27:00,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 10:27:00,899 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:27:00,900 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:27:00,903 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:27:00,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:27:00,909 INFO L82 PathProgramCache]: Analyzing trace with hash -519389311, now seen corresponding path program 1 times [2018-11-07 10:27:00,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:27:00,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:00,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:27:00,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:00,960 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:27:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:27:01,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:27:01,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:27:01,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 10:27:01,086 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:27:01,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 10:27:01,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 10:27:01,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 10:27:01,104 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-07 10:27:01,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:27:01,125 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2018-11-07 10:27:01,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 10:27:01,126 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-11-07 10:27:01,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:27:01,135 INFO L225 Difference]: With dead ends: 52 [2018-11-07 10:27:01,135 INFO L226 Difference]: Without dead ends: 25 [2018-11-07 10:27:01,139 INFO L604 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 [2018-11-07 10:27:01,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-07 10:27:01,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-07 10:27:01,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-07 10:27:01,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-11-07 10:27:01,183 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 19 [2018-11-07 10:27:01,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:27:01,184 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-07 10:27:01,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 10:27:01,184 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-07 10:27:01,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-07 10:27:01,185 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:27:01,185 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:27:01,186 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:27:01,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:27:01,186 INFO L82 PathProgramCache]: Analyzing trace with hash -277831210, now seen corresponding path program 1 times [2018-11-07 10:27:01,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:27:01,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:01,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:27:01,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:01,189 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:27:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:27:01,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:27:01,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:27:01,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 10:27:01,415 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:27:01,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 10:27:01,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 10:27:01,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-07 10:27:01,418 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 6 states. [2018-11-07 10:27:01,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:27:01,502 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-11-07 10:27:01,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 10:27:01,504 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-07 10:27:01,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:27:01,505 INFO L225 Difference]: With dead ends: 33 [2018-11-07 10:27:01,505 INFO L226 Difference]: Without dead ends: 25 [2018-11-07 10:27:01,506 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-07 10:27:01,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-07 10:27:01,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-07 10:27:01,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-07 10:27:01,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-11-07 10:27:01,512 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2018-11-07 10:27:01,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:27:01,512 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-07 10:27:01,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 10:27:01,513 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-07 10:27:01,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-07 10:27:01,514 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:27:01,514 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:27:01,514 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:27:01,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:27:01,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1464979125, now seen corresponding path program 1 times [2018-11-07 10:27:01,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:27:01,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:01,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:27:01,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:01,516 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:27:01,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:27:02,047 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 8 [2018-11-07 10:27:02,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:27:02,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:27:02,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 10:27:02,051 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:27:02,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 10:27:02,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 10:27:02,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-07 10:27:02,052 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 6 states. [2018-11-07 10:27:02,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:27:02,181 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-07 10:27:02,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 10:27:02,182 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-07 10:27:02,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:27:02,184 INFO L225 Difference]: With dead ends: 40 [2018-11-07 10:27:02,184 INFO L226 Difference]: Without dead ends: 31 [2018-11-07 10:27:02,185 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-07 10:27:02,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-07 10:27:02,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-07 10:27:02,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-07 10:27:02,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-11-07 10:27:02,193 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 22 [2018-11-07 10:27:02,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:27:02,193 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-11-07 10:27:02,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 10:27:02,193 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-07 10:27:02,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-07 10:27:02,194 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:27:02,194 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:27:02,195 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:27:02,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:27:02,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1882483549, now seen corresponding path program 1 times [2018-11-07 10:27:02,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:27:02,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:02,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:27:02,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:02,197 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:27:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:27:02,259 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:27:02,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:27:02,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 10:27:02,260 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:27:02,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 10:27:02,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 10:27:02,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:27:02,261 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 3 states. [2018-11-07 10:27:02,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:27:02,305 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-11-07 10:27:02,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 10:27:02,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-07 10:27:02,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:27:02,307 INFO L225 Difference]: With dead ends: 48 [2018-11-07 10:27:02,307 INFO L226 Difference]: Without dead ends: 32 [2018-11-07 10:27:02,308 INFO L604 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 [2018-11-07 10:27:02,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-07 10:27:02,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-07 10:27:02,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-07 10:27:02,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-11-07 10:27:02,314 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 26 [2018-11-07 10:27:02,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:27:02,315 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-11-07 10:27:02,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 10:27:02,315 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-07 10:27:02,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-07 10:27:02,316 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:27:02,316 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:27:02,317 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:27:02,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:27:02,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1265780096, now seen corresponding path program 1 times [2018-11-07 10:27:02,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:27:02,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:02,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:27:02,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:02,319 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:27:02,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:27:05,082 WARN L179 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 27 [2018-11-07 10:27:05,302 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 18 [2018-11-07 10:27:05,555 WARN L179 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 17 [2018-11-07 10:27:05,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:27:05,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:27:05,910 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:27:05,911 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-11-07 10:27:05,913 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [11], [12], [13], [15], [19], [21], [28], [29], [33], [34], [35], [37], [43], [46], [48], [54], [55], [56], [58], [59], [60] [2018-11-07 10:27:05,951 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:27:05,951 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:27:06,374 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:27:06,376 INFO L272 AbstractInterpreter]: Visited 26 different actions 52 times. Merged at 10 different actions 20 times. Never widened. Found 7 fixpoints after 4 different actions. Largest state had 25 variables. [2018-11-07 10:27:06,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:27:06,419 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:27:06,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:27:06,420 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:27:06,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:27:06,438 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:27:06,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:27:06,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:27:06,531 INFO L477 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 0 case distinctions, treesize of input 27 treesize of output 24 [2018-11-07 10:27:06,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 17 [2018-11-07 10:27:06,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:27:06,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:27:06,569 INFO L477 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 0 case distinctions, treesize of input 28 treesize of output 25 [2018-11-07 10:27:06,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 17 [2018-11-07 10:27:06,572 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-07 10:27:06,584 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:27:06,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:27:06,630 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:91, output treesize:17 [2018-11-07 10:27:07,929 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:27:07,929 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:27:08,095 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2018-11-07 10:27:09,161 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:27:09,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:27:09,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 30 [2018-11-07 10:27:09,182 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:27:09,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 10:27:09,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 10:27:09,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=746, Unknown=1, NotChecked=0, Total=870 [2018-11-07 10:27:09,185 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 20 states. [2018-11-07 10:27:11,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:27:11,231 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-11-07 10:27:11,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 10:27:11,234 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 28 [2018-11-07 10:27:11,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:27:11,236 INFO L225 Difference]: With dead ends: 48 [2018-11-07 10:27:11,236 INFO L226 Difference]: Without dead ends: 38 [2018-11-07 10:27:11,238 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=192, Invalid=997, Unknown=1, NotChecked=0, Total=1190 [2018-11-07 10:27:11,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-07 10:27:11,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-07 10:27:11,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-07 10:27:11,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-11-07 10:27:11,244 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 28 [2018-11-07 10:27:11,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:27:11,245 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-11-07 10:27:11,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 10:27:11,245 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-11-07 10:27:11,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-07 10:27:11,246 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:27:11,247 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:27:11,247 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:27:11,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:27:11,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1149133323, now seen corresponding path program 2 times [2018-11-07 10:27:11,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:27:11,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:11,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:27:11,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:11,249 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:27:11,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:27:12,102 WARN L179 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 24 [2018-11-07 10:27:12,496 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 36 [2018-11-07 10:27:12,656 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2018-11-07 10:27:12,955 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2018-11-07 10:27:13,120 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2018-11-07 10:27:13,307 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2018-11-07 10:27:13,456 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2018-11-07 10:27:13,604 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 42 [2018-11-07 10:27:14,321 WARN L179 SmtUtils]: Spent 600.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2018-11-07 10:27:14,497 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2018-11-07 10:27:14,761 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 39 [2018-11-07 10:27:14,773 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:27:14,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:27:14,774 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:27:14,774 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:27:14,774 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:27:14,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:27:14,774 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:27:14,784 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:27:14,785 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:27:14,925 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 10:27:14,925 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:27:14,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:27:23,069 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 35 DAG size of output: 13 [2018-11-07 10:27:23,111 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-07 10:27:23,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-07 10:27:23,180 INFO L477 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 0 case distinctions, treesize of input 21 treesize of output 18 [2018-11-07 10:27:23,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 17 [2018-11-07 10:27:23,193 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-07 10:27:23,196 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:27:23,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-07 10:27:23,207 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:142, output treesize:30 [2018-11-07 10:27:24,171 WARN L179 SmtUtils]: Spent 402.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-07 10:27:26,291 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 41 [2018-11-07 10:27:27,100 WARN L179 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-07 10:27:31,417 WARN L179 SmtUtils]: Spent 4.18 s on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2018-11-07 10:27:31,684 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:27:31,684 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:27:31,814 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2018-11-07 10:27:32,586 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2018-11-07 10:27:34,217 WARN L179 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2018-11-07 10:27:34,488 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-07 10:27:34,501 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 10:27:34,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-07 10:27:34,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:27:34,514 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:181, output treesize:1 [2018-11-07 10:27:34,533 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:27:34,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:27:34,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 13] total 41 [2018-11-07 10:27:34,554 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:27:34,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-07 10:27:34,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-07 10:27:34,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1453, Unknown=2, NotChecked=0, Total=1640 [2018-11-07 10:27:34,556 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 30 states. [2018-11-07 10:27:38,334 WARN L179 SmtUtils]: Spent 3.38 s on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2018-11-07 10:27:40,593 WARN L179 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2018-11-07 10:27:43,013 WARN L179 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2018-11-07 10:27:47,541 WARN L179 SmtUtils]: Spent 4.35 s on a formula simplification. DAG size of input: 117 DAG size of output: 88 [2018-11-07 10:27:48,968 WARN L179 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 86 DAG size of output: 43 [2018-11-07 10:27:49,190 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 49 [2018-11-07 10:27:50,072 WARN L179 SmtUtils]: Spent 809.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2018-11-07 10:27:53,702 WARN L179 SmtUtils]: Spent 3.52 s on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2018-11-07 10:27:54,350 WARN L179 SmtUtils]: Spent 575.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2018-11-07 10:27:56,939 WARN L179 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2018-11-07 10:27:57,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:27:57,026 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-11-07 10:27:57,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 10:27:57,027 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 34 [2018-11-07 10:27:57,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:27:57,028 INFO L225 Difference]: With dead ends: 57 [2018-11-07 10:27:57,028 INFO L226 Difference]: Without dead ends: 44 [2018-11-07 10:27:57,030 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 43.7s TimeCoverageRelationStatistics Valid=391, Invalid=2469, Unknown=2, NotChecked=0, Total=2862 [2018-11-07 10:27:57,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-07 10:27:57,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-07 10:27:57,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-07 10:27:57,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-11-07 10:27:57,038 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 34 [2018-11-07 10:27:57,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:27:57,039 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-11-07 10:27:57,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-07 10:27:57,039 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-11-07 10:27:57,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-07 10:27:57,040 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:27:57,041 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:27:57,041 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:27:57,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:27:57,041 INFO L82 PathProgramCache]: Analyzing trace with hash 169342294, now seen corresponding path program 3 times [2018-11-07 10:27:57,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:27:57,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:57,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:27:57,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:57,043 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:27:57,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:27:57,997 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 49 [2018-11-07 10:27:58,150 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 29 [2018-11-07 10:27:58,521 WARN L179 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 41 [2018-11-07 10:27:58,715 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 42 [2018-11-07 10:27:58,902 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 43 [2018-11-07 10:27:59,182 WARN L179 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 59 [2018-11-07 10:27:59,428 WARN L179 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 57 [2018-11-07 10:27:59,764 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 43 [2018-11-07 10:27:59,917 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 43 [2018-11-07 10:28:02,373 WARN L179 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 116 DAG size of output: 48 [2018-11-07 10:28:02,387 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:28:02,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:28:02,388 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:28:02,388 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:28:02,388 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:28:02,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:28:02,388 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:28:02,399 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:28:02,399 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:28:02,457 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:28:02,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:28:02,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:28:02,470 INFO L477 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 0 case distinctions, treesize of input 31 treesize of output 28 [2018-11-07 10:28:02,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 17 [2018-11-07 10:28:02,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:28:02,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:28:02,489 INFO L477 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 0 case distinctions, treesize of input 30 treesize of output 27 [2018-11-07 10:28:02,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 17 [2018-11-07 10:28:02,495 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-07 10:28:02,505 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:28:04,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:28:04,542 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:100, output treesize:21 [2018-11-07 10:28:05,810 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:28:05,811 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:28:05,972 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2018-11-07 10:28:07,603 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2018-11-07 10:28:08,414 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-11-07 10:28:08,504 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 10:28:08,505 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-07 10:28:20,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 20 dim-0 vars, 10 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:28:20,624 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 30 variables, input treesize:798, output treesize:1 [2018-11-07 10:28:20,641 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:28:20,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:28:20,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 16] total 47 [2018-11-07 10:28:20,661 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:28:20,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-07 10:28:20,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-07 10:28:20,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1983, Unknown=0, NotChecked=0, Total=2162 [2018-11-07 10:28:20,663 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 33 states. [2018-11-07 10:28:21,458 WARN L179 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2018-11-07 10:28:21,666 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 71 [2018-11-07 10:28:21,880 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2018-11-07 10:28:22,315 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 64 [2018-11-07 10:28:22,728 WARN L179 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 73 [2018-11-07 10:28:23,008 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 49 [2018-11-07 10:28:23,283 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 54 [2018-11-07 10:28:23,626 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 59 [2018-11-07 10:28:24,063 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 102 [2018-11-07 10:28:24,346 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 100 [2018-11-07 10:28:25,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:28:25,096 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-11-07 10:28:25,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 10:28:25,098 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 40 [2018-11-07 10:28:25,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:28:25,099 INFO L225 Difference]: With dead ends: 60 [2018-11-07 10:28:25,099 INFO L226 Difference]: Without dead ends: 50 [2018-11-07 10:28:25,102 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=396, Invalid=3510, Unknown=0, NotChecked=0, Total=3906 [2018-11-07 10:28:25,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-07 10:28:25,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-07 10:28:25,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-07 10:28:25,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2018-11-07 10:28:25,116 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 40 [2018-11-07 10:28:25,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:28:25,116 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-11-07 10:28:25,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-07 10:28:25,116 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-11-07 10:28:25,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-07 10:28:25,118 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:28:25,118 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:28:25,118 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:28:25,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:28:25,119 INFO L82 PathProgramCache]: Analyzing trace with hash 745186401, now seen corresponding path program 4 times [2018-11-07 10:28:25,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:28:25,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:28:25,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:28:25,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:28:25,124 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:28:25,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:28:25,736 WARN L179 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 24 [2018-11-07 10:28:25,996 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2018-11-07 10:28:26,786 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:28:26,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:28:26,787 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:28:26,787 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:28:26,787 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:28:26,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:28:26,787 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:28:26,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:28:26,796 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:28:26,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:28:26,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:28:45,003 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 35 DAG size of output: 13 [2018-11-07 10:28:45,061 INFO L477 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 0 case distinctions, treesize of input 45 treesize of output 42 [2018-11-07 10:28:45,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 17 [2018-11-07 10:28:45,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:28:45,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:28:45,084 INFO L477 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 0 case distinctions, treesize of input 44 treesize of output 41 [2018-11-07 10:28:45,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 17 [2018-11-07 10:28:45,089 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-07 10:28:45,106 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:28:45,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-07 10:28:45,139 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:142, output treesize:30 [2018-11-07 10:28:45,380 WARN L179 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-11-07 10:28:45,585 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-07 10:28:48,016 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 48 [2018-11-07 10:28:48,776 WARN L179 SmtUtils]: Spent 676.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-07 10:28:49,471 WARN L179 SmtUtils]: Spent 639.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-11-07 10:28:51,489 WARN L179 SmtUtils]: Spent 1.95 s on a formula simplification that was a NOOP. DAG size: 55 [2018-11-07 10:28:53,719 WARN L179 SmtUtils]: Spent 2.13 s on a formula simplification that was a NOOP. DAG size: 59 [2018-11-07 10:28:55,826 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 57 [2018-11-07 10:28:58,282 WARN L179 SmtUtils]: Spent 2.31 s on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2018-11-07 10:29:01,028 WARN L179 SmtUtils]: Spent 2.11 s on a formula simplification that was a NOOP. DAG size: 61 [2018-11-07 10:29:07,024 WARN L179 SmtUtils]: Spent 5.49 s on a formula simplification. DAG size of input: 66 DAG size of output: 66 [2018-11-07 10:29:08,195 WARN L179 SmtUtils]: Spent 826.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2018-11-07 10:29:08,365 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:08,366 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:10,746 WARN L179 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 103 DAG size of output: 71 [2018-11-07 10:29:11,679 WARN L179 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2018-11-07 10:29:12,384 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-11-07 10:29:12,672 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-11-07 10:29:13,035 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-11-07 10:29:14,624 WARN L179 SmtUtils]: Spent 1.34 s on a formula simplification that was a NOOP. DAG size: 62 [2018-11-07 10:29:14,979 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-11-07 10:29:15,482 WARN L179 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-11-07 10:29:16,328 WARN L179 SmtUtils]: Spent 605.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-11-07 10:29:17,128 WARN L179 SmtUtils]: Spent 385.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-11-07 10:29:26,308 WARN L179 SmtUtils]: Spent 6.69 s on a formula simplification that was a NOOP. DAG size: 69 [2018-11-07 10:29:30,593 WARN L179 SmtUtils]: Spent 3.59 s on a formula simplification that was a NOOP. DAG size: 73 [2018-11-07 10:29:36,533 WARN L179 SmtUtils]: Spent 5.34 s on a formula simplification that was a NOOP. DAG size: 72 [2018-11-07 10:29:44,732 WARN L179 SmtUtils]: Spent 4.82 s on a formula simplification that was a NOOP. DAG size: 75 [2018-11-07 10:30:06,067 WARN L179 SmtUtils]: Spent 18.55 s on a formula simplification that was a NOOP. DAG size: 78 [2018-11-07 10:31:22,344 WARN L179 SmtUtils]: Spent 1.23 m on a formula simplification. DAG size of input: 76 DAG size of output: 75 [2018-11-07 10:31:22,466 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 10:31:22,466 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-07 10:31:22,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 34 dim-0 vars, 34 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:31:22,731 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 68 variables, input treesize:3701, output treesize:1 [2018-11-07 10:31:22,768 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:31:22,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:31:22,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 25, 22] total 59 [2018-11-07 10:31:22,788 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:31:22,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 10:31:22,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 10:31:22,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=3125, Unknown=8, NotChecked=0, Total=3422 [2018-11-07 10:31:22,790 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 39 states. [2018-11-07 10:31:23,316 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2018-11-07 10:31:23,570 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2018-11-07 10:31:23,872 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2018-11-07 10:31:28,014 WARN L179 SmtUtils]: Spent 3.73 s on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2018-11-07 10:31:30,351 WARN L179 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2018-11-07 10:31:30,662 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 68 [2018-11-07 10:31:35,151 WARN L179 SmtUtils]: Spent 4.33 s on a formula simplification. DAG size of input: 102 DAG size of output: 77 [2018-11-07 10:31:35,709 WARN L179 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 96 Received shutdown request... [2018-11-07 10:31:41,391 WARN L187 SmtUtils]: Removed 2 from assertion stack [2018-11-07 10:31:41,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 10:31:41,392 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 10:31:41,396 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 10:31:41,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:31:41 BoogieIcfgContainer [2018-11-07 10:31:41,396 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 10:31:41,397 INFO L168 Benchmark]: Toolchain (without parser) took 281572.74 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 988.3 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -176.2 MB). Peak memory consumption was 812.1 MB. Max. memory is 7.1 GB. [2018-11-07 10:31:41,398 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:31:41,398 INFO L168 Benchmark]: CACSL2BoogieTranslator took 357.79 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 10:31:41,399 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.94 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:31:41,399 INFO L168 Benchmark]: Boogie Preprocessor took 31.77 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:31:41,400 INFO L168 Benchmark]: RCFGBuilder took 553.72 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 732.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -764.3 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2018-11-07 10:31:41,401 INFO L168 Benchmark]: TraceAbstraction took 280603.54 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 255.9 MB). Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 577.5 MB). Peak memory consumption was 833.3 MB. Max. memory is 7.1 GB. [2018-11-07 10:31:41,404 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 357.79 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 21.94 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.77 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 553.72 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 732.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -764.3 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 280603.54 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 255.9 MB). Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 577.5 MB). Peak memory consumption was 833.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (50states) and FLOYD_HOARE automaton (currently 20 states, 39 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 130. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 34 locations, 1 error locations. TIMEOUT Result, 280.5s OverallTime, 8 OverallIterations, 5 TraceHistogramMax, 47.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 182 SDtfs, 297 SDslu, 1152 SDs, 0 SdLazy, 1601 SolverSat, 90 SolverUnsat, 19 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 420 GetRequests, 187 SyntacticMatches, 10 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2968 ImplicationChecksByTransitivity, 248.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 231.0s InterpolantComputationTime, 385 NumberOfCodeBlocks, 385 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 517 ConstructedInterpolants, 108 QuantifiedInterpolants, 1097834 SizeOfPredicates, 73 NumberOfNonLiveVariables, 442 ConjunctsInSsa, 155 ConjunctsInUnsatCore, 16 InterpolantComputations, 4 PerfectInterpolantSequences, 8/304 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown