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/nla-digbench/lcm1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:06:34,089 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:06:34,092 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:06:34,109 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:06:34,110 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:06:34,111 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:06:34,112 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:06:34,113 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:06:34,115 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:06:34,116 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:06:34,117 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:06:34,118 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:06:34,119 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:06:34,120 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:06:34,120 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:06:34,122 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:06:34,122 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:06:34,123 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:06:34,125 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:06:34,127 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:06:34,129 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:06:34,130 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:06:34,131 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:06:34,132 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:06:34,134 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:06:34,134 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:06:34,135 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:06:34,135 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:06:34,136 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:06:34,137 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:06:34,137 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:06:34,138 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:06:34,138 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:06:34,139 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:06:34,140 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:06:34,140 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:06:34,141 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:06:34,141 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:06:34,141 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:06:34,142 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:06:34,143 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:06:34,144 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-15 01:06:34,161 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:06:34,161 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:06:34,164 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:06:34,165 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:06:34,165 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:06:34,165 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:06:34,165 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:06:34,166 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:06:34,166 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:06:34,166 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:06:34,167 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:06:34,167 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:06:34,167 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:06:34,167 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:06:34,168 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:06:34,168 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:06:34,168 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:06:34,168 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:06:34,169 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:06:34,169 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:06:34,169 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:06:34,170 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:06:34,171 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:06:34,171 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:06:34,171 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:06:34,172 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:06:34,172 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:06:34,172 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:06:34,172 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-15 01:06:34,433 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:06:34,445 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:06:34,449 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:06:34,450 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:06:34,451 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:06:34,451 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/lcm1.c [2019-10-15 01:06:34,527 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdc12d6f6/47f04d013e264bf6ad5ba973d36ce212/FLAG2696642e9 [2019-10-15 01:06:34,976 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:06:34,979 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/lcm1.c [2019-10-15 01:06:34,987 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdc12d6f6/47f04d013e264bf6ad5ba973d36ce212/FLAG2696642e9 [2019-10-15 01:06:35,326 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdc12d6f6/47f04d013e264bf6ad5ba973d36ce212 [2019-10-15 01:06:35,336 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:06:35,338 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:06:35,338 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:06:35,339 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:06:35,342 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:06:35,343 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:06:35" (1/1) ... [2019-10-15 01:06:35,346 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@781bead and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:35, skipping insertion in model container [2019-10-15 01:06:35,346 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:06:35" (1/1) ... [2019-10-15 01:06:35,353 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:06:35,371 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:06:35,526 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:06:35,530 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:06:35,550 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:06:35,565 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:06:35,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:35 WrapperNode [2019-10-15 01:06:35,566 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:06:35,567 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:06:35,567 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:06:35,567 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:06:35,581 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:35" (1/1) ... [2019-10-15 01:06:35,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:35" (1/1) ... [2019-10-15 01:06:35,666 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:35" (1/1) ... [2019-10-15 01:06:35,666 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:35" (1/1) ... [2019-10-15 01:06:35,670 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:35" (1/1) ... [2019-10-15 01:06:35,676 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:35" (1/1) ... [2019-10-15 01:06:35,677 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:35" (1/1) ... [2019-10-15 01:06:35,678 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:06:35,679 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:06:35,679 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:06:35,679 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:06:35,680 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:35" (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-15 01:06:35,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:06:35,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:06:35,739 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-15 01:06:35,739 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:06:35,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:06:35,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:06:35,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:06:35,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-15 01:06:35,740 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:06:35,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:06:35,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:06:35,931 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:06:35,932 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-15 01:06:35,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:06:35 BoogieIcfgContainer [2019-10-15 01:06:35,933 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:06:35,934 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:06:35,934 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:06:35,937 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:06:35,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:06:35" (1/3) ... [2019-10-15 01:06:35,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cdf6f34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:06:35, skipping insertion in model container [2019-10-15 01:06:35,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:35" (2/3) ... [2019-10-15 01:06:35,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cdf6f34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:06:35, skipping insertion in model container [2019-10-15 01:06:35,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:06:35" (3/3) ... [2019-10-15 01:06:35,941 INFO L109 eAbstractionObserver]: Analyzing ICFG lcm1.c [2019-10-15 01:06:35,955 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:06:35,965 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:06:35,985 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:06:36,036 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:06:36,037 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:06:36,037 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:06:36,037 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:06:36,037 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:06:36,037 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:06:36,037 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:06:36,037 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:06:36,057 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-10-15 01:06:36,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-15 01:06:36,063 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:36,063 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:36,065 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:36,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:36,073 INFO L82 PathProgramCache]: Analyzing trace with hash -831554694, now seen corresponding path program 1 times [2019-10-15 01:06:36,081 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:36,081 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720711418] [2019-10-15 01:06:36,081 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:36,082 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:36,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:36,192 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-15 01:06:36,193 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720711418] [2019-10-15 01:06:36,194 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:36,195 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-15 01:06:36,195 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923133230] [2019-10-15 01:06:36,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-15 01:06:36,200 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:36,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-15 01:06:36,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-15 01:06:36,214 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2019-10-15 01:06:36,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:36,239 INFO L93 Difference]: Finished difference Result 49 states and 80 transitions. [2019-10-15 01:06:36,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-15 01:06:36,240 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-10-15 01:06:36,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:36,259 INFO L225 Difference]: With dead ends: 49 [2019-10-15 01:06:36,260 INFO L226 Difference]: Without dead ends: 22 [2019-10-15 01:06:36,266 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-15 01:06:36,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-15 01:06:36,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-15 01:06:36,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-15 01:06:36,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2019-10-15 01:06:36,333 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 10 [2019-10-15 01:06:36,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:36,334 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-10-15 01:06:36,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-15 01:06:36,335 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2019-10-15 01:06:36,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-15 01:06:36,336 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:36,337 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:36,337 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:36,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:36,339 INFO L82 PathProgramCache]: Analyzing trace with hash -871444843, now seen corresponding path program 1 times [2019-10-15 01:06:36,340 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:36,340 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587725955] [2019-10-15 01:06:36,340 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:36,340 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:36,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:36,368 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-15 01:06:36,368 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [777681592] [2019-10-15 01:06:36,369 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-15 01:06:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:36,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-15 01:06:36,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:06:36,495 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-15 01:06:36,495 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:06:36,571 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-15 01:06:36,572 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587725955] [2019-10-15 01:06:36,573 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:06:36,574 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777681592] [2019-10-15 01:06:36,574 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:36,574 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-10-15 01:06:36,574 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924189347] [2019-10-15 01:06:36,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:06:36,577 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:36,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:06:36,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:06:36,579 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand 8 states. [2019-10-15 01:06:36,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:36,750 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2019-10-15 01:06:36,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:06:36,751 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-10-15 01:06:36,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:36,753 INFO L225 Difference]: With dead ends: 39 [2019-10-15 01:06:36,753 INFO L226 Difference]: Without dead ends: 37 [2019-10-15 01:06:36,754 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:06:36,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-15 01:06:36,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2019-10-15 01:06:36,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-15 01:06:36,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2019-10-15 01:06:36,767 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 10 [2019-10-15 01:06:36,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:36,768 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2019-10-15 01:06:36,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:06:36,768 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2019-10-15 01:06:36,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-15 01:06:36,769 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:36,770 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:36,973 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:06:36,973 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:36,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:36,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1387131099, now seen corresponding path program 1 times [2019-10-15 01:06:36,974 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:36,974 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400950596] [2019-10-15 01:06:36,975 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:36,975 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:36,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:36,982 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-15 01:06:36,983 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1135467345] [2019-10-15 01:06:36,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:06:37,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:37,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-15 01:06:37,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:06:37,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:37,070 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:06:37,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:37,203 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400950596] [2019-10-15 01:06:37,203 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:06:37,203 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135467345] [2019-10-15 01:06:37,204 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:37,204 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-10-15 01:06:37,204 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293675189] [2019-10-15 01:06:37,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:06:37,205 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:37,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:06:37,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:06:37,206 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand 10 states. [2019-10-15 01:06:37,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:37,466 INFO L93 Difference]: Finished difference Result 73 states and 100 transitions. [2019-10-15 01:06:37,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:06:37,466 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-10-15 01:06:37,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:37,468 INFO L225 Difference]: With dead ends: 73 [2019-10-15 01:06:37,468 INFO L226 Difference]: Without dead ends: 69 [2019-10-15 01:06:37,469 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:06:37,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-15 01:06:37,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-10-15 01:06:37,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-15 01:06:37,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 93 transitions. [2019-10-15 01:06:37,490 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 93 transitions. Word has length 16 [2019-10-15 01:06:37,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:37,491 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 93 transitions. [2019-10-15 01:06:37,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:06:37,491 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 93 transitions. [2019-10-15 01:06:37,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-15 01:06:37,492 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:37,492 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:37,693 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:06:37,693 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:37,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:37,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1615934296, now seen corresponding path program 1 times [2019-10-15 01:06:37,694 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:37,694 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635315430] [2019-10-15 01:06:37,694 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:37,694 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:37,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:37,711 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-15 01:06:37,711 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2047598952] [2019-10-15 01:06:37,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:06:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:37,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-15 01:06:37,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:06:37,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:37,817 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 01:06:37,818 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:06:37,883 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:06:37,883 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635315430] [2019-10-15 01:06:37,884 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:06:37,884 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047598952] [2019-10-15 01:06:37,884 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:06:37,884 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-15 01:06:37,884 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789555517] [2019-10-15 01:06:37,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:06:37,885 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:37,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:06:37,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:06:37,886 INFO L87 Difference]: Start difference. First operand 68 states and 93 transitions. Second operand 5 states. [2019-10-15 01:06:37,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:37,959 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2019-10-15 01:06:37,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:06:37,960 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-10-15 01:06:37,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:37,963 INFO L225 Difference]: With dead ends: 74 [2019-10-15 01:06:37,963 INFO L226 Difference]: Without dead ends: 72 [2019-10-15 01:06:37,964 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:06:37,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-15 01:06:37,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-10-15 01:06:37,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-15 01:06:37,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 96 transitions. [2019-10-15 01:06:37,980 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 96 transitions. Word has length 24 [2019-10-15 01:06:37,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:37,981 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 96 transitions. [2019-10-15 01:06:37,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:06:37,981 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 96 transitions. [2019-10-15 01:06:37,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-15 01:06:37,983 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:37,983 INFO L380 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:38,186 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:06:38,187 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:38,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:38,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1558903376, now seen corresponding path program 1 times [2019-10-15 01:06:38,188 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:38,189 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397551805] [2019-10-15 01:06:38,189 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:38,189 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:38,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:38,200 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-15 01:06:38,200 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1514926285] [2019-10-15 01:06:38,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:06:38,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:38,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-15 01:06:38,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:06:38,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:38,290 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-10-15 01:06:38,290 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:06:38,337 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-10-15 01:06:38,338 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397551805] [2019-10-15 01:06:38,338 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:06:38,338 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514926285] [2019-10-15 01:06:38,338 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:38,338 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2019-10-15 01:06:38,339 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733269554] [2019-10-15 01:06:38,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:06:38,340 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:38,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:06:38,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:06:38,340 INFO L87 Difference]: Start difference. First operand 72 states and 96 transitions. Second operand 8 states. [2019-10-15 01:06:38,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:38,451 INFO L93 Difference]: Finished difference Result 170 states and 234 transitions. [2019-10-15 01:06:38,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:06:38,454 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-10-15 01:06:38,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:38,457 INFO L225 Difference]: With dead ends: 170 [2019-10-15 01:06:38,457 INFO L226 Difference]: Without dead ends: 73 [2019-10-15 01:06:38,459 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:06:38,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-15 01:06:38,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-10-15 01:06:38,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-15 01:06:38,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 95 transitions. [2019-10-15 01:06:38,474 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 95 transitions. Word has length 49 [2019-10-15 01:06:38,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:38,475 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 95 transitions. [2019-10-15 01:06:38,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:06:38,475 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 95 transitions. [2019-10-15 01:06:38,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-15 01:06:38,477 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:38,477 INFO L380 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:38,686 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:06:38,686 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:38,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:38,687 INFO L82 PathProgramCache]: Analyzing trace with hash -250356680, now seen corresponding path program 1 times [2019-10-15 01:06:38,688 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:38,688 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305116500] [2019-10-15 01:06:38,688 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:38,689 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:38,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:38,697 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-15 01:06:38,697 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [179313808] [2019-10-15 01:06:38,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:06:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:38,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-15 01:06:38,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:06:38,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:38,911 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-15 01:06:38,911 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:06:39,145 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-15 01:06:39,145 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305116500] [2019-10-15 01:06:39,146 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:06:39,146 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179313808] [2019-10-15 01:06:39,146 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1640311599] [2019-10-15 01:06:39,152 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 52 [2019-10-15 01:06:39,186 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:06:39,186 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:06:39,295 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:06:39,297 INFO L272 AbstractInterpreter]: Visited 13 different actions 13 times. Never merged. Never widened. Performed 30 root evaluator evaluations with a maximum evaluation depth of 8. Performed 30 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Never found a fixpoint. Largest state had 8 variables. [2019-10-15 01:06:39,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:39,302 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:06:39,302 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:06:39,302 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-10-15 01:06:39,302 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277763465] [2019-10-15 01:06:39,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-15 01:06:39,303 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:39,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-15 01:06:39,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2019-10-15 01:06:39,304 INFO L87 Difference]: Start difference. First operand 72 states and 95 transitions. Second operand 16 states. [2019-10-15 01:06:39,638 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-10-15 01:06:40,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:40,847 INFO L93 Difference]: Finished difference Result 148 states and 207 transitions. [2019-10-15 01:06:40,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-15 01:06:40,848 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 51 [2019-10-15 01:06:40,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:40,850 INFO L225 Difference]: With dead ends: 148 [2019-10-15 01:06:40,850 INFO L226 Difference]: Without dead ends: 142 [2019-10-15 01:06:40,851 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=140, Invalid=460, Unknown=0, NotChecked=0, Total=600 [2019-10-15 01:06:40,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-10-15 01:06:40,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 99. [2019-10-15 01:06:40,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-15 01:06:40,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 135 transitions. [2019-10-15 01:06:40,872 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 135 transitions. Word has length 51 [2019-10-15 01:06:40,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:40,872 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 135 transitions. [2019-10-15 01:06:40,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-15 01:06:40,873 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 135 transitions. [2019-10-15 01:06:40,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-15 01:06:40,875 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:40,875 INFO L380 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:41,087 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:06:41,087 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:41,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:41,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1401665144, now seen corresponding path program 1 times [2019-10-15 01:06:41,088 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:41,088 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228638442] [2019-10-15 01:06:41,089 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:41,089 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:41,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:41,096 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-15 01:06:41,096 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [211622771] [2019-10-15 01:06:41,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:06:41,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:41,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-15 01:06:41,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:06:41,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:41,251 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-10-15 01:06:41,251 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:06:41,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:41,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:41,446 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-10-15 01:06:41,446 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228638442] [2019-10-15 01:06:41,447 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:06:41,447 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211622771] [2019-10-15 01:06:41,447 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [314097659] [2019-10-15 01:06:41,447 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 52 [2019-10-15 01:06:41,450 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:06:41,450 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:06:41,480 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:06:41,480 INFO L272 AbstractInterpreter]: Visited 13 different actions 13 times. Never merged. Never widened. Performed 30 root evaluator evaluations with a maximum evaluation depth of 8. Performed 30 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Never found a fixpoint. Largest state had 8 variables. [2019-10-15 01:06:41,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:41,481 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:06:41,481 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:06:41,481 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2019-10-15 01:06:41,482 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211224025] [2019-10-15 01:06:41,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-15 01:06:41,483 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:41,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-15 01:06:41,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-10-15 01:06:41,483 INFO L87 Difference]: Start difference. First operand 99 states and 135 transitions. Second operand 15 states. [2019-10-15 01:06:41,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:41,816 INFO L93 Difference]: Finished difference Result 146 states and 203 transitions. [2019-10-15 01:06:41,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:06:41,819 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 51 [2019-10-15 01:06:41,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:41,820 INFO L225 Difference]: With dead ends: 146 [2019-10-15 01:06:41,820 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 01:06:41,824 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2019-10-15 01:06:41,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 01:06:41,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 01:06:41,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 01:06:41,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 01:06:41,825 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2019-10-15 01:06:41,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:41,826 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 01:06:41,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-15 01:06:41,826 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 01:06:41,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 01:06:42,026 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:06:42,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 01:06:42,482 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2019-10-15 01:06:42,652 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2019-10-15 01:06:42,655 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-15 01:06:42,655 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:06:42,655 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:06:42,655 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-15 01:06:42,656 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 01:06:42,656 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 01:06:42,656 INFO L439 ceAbstractionStarter]: At program point L35-2(lines 35 41) the Hoare annotation is: (and (<= 1 main_~a~0) (= (* main_~a~0 main_~b~0) (+ (* main_~y~0 main_~v~0) (* main_~x~0 main_~u~0)))) [2019-10-15 01:06:42,656 INFO L439 ceAbstractionStarter]: At program point L31(line 31) the Hoare annotation is: (let ((.cse3 (* main_~a~0 main_~b~0))) (let ((.cse1 (<= main_~y~0 main_~x~0)) (.cse0 (<= 1 main_~a~0)) (.cse2 (= .cse3 (+ (* main_~y~0 main_~v~0) (* main_~x~0 main_~u~0))))) (or (and .cse0 .cse1 .cse2) (and .cse1 (<= main_~x~0 main_~y~0) (= (+ (* main_~v~0 main_~y~0) (* main_~u~0 main_~y~0)) .cse3)) (and .cse0 (= main_~b~0 main_~y~0) (= main_~b~0 main_~u~0) .cse2 (= main_~a~0 main_~x~0))))) [2019-10-15 01:06:42,656 INFO L443 ceAbstractionStarter]: For program point L31-1(lines 30 50) no Hoare annotation was computed. [2019-10-15 01:06:42,656 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 17 58) no Hoare annotation was computed. [2019-10-15 01:06:42,657 INFO L439 ceAbstractionStarter]: At program point L52(line 52) the Hoare annotation is: (and (<= main_~y~0 main_~x~0) (= (* main_~a~0 main_~b~0) (+ (* main_~y~0 main_~v~0) (* main_~x~0 main_~u~0))) (<= main_~x~0 main_~y~0)) [2019-10-15 01:06:42,657 INFO L439 ceAbstractionStarter]: At program point L44(line 44) the Hoare annotation is: (let ((.cse0 (* main_~a~0 main_~b~0))) (or (and (<= 1 main_~a~0) (= .cse0 (+ (* main_~y~0 main_~v~0) (* main_~x~0 main_~u~0)))) (and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0) (= (+ (* main_~v~0 main_~y~0) (* main_~u~0 main_~y~0)) .cse0)))) [2019-10-15 01:06:42,657 INFO L443 ceAbstractionStarter]: For program point L44-1(lines 43 49) no Hoare annotation was computed. [2019-10-15 01:06:42,657 INFO L439 ceAbstractionStarter]: At program point L36(line 36) the Hoare annotation is: (and (<= 1 main_~a~0) (= (* main_~a~0 main_~b~0) (+ (* main_~y~0 main_~v~0) (* main_~x~0 main_~u~0)))) [2019-10-15 01:06:42,657 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 35 41) no Hoare annotation was computed. [2019-10-15 01:06:42,658 INFO L443 ceAbstractionStarter]: For program point L53(line 53) no Hoare annotation was computed. [2019-10-15 01:06:42,658 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 17 58) no Hoare annotation was computed. [2019-10-15 01:06:42,658 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 17 58) the Hoare annotation is: true [2019-10-15 01:06:42,658 INFO L439 ceAbstractionStarter]: At program point L30-2(lines 30 50) the Hoare annotation is: (and (<= main_~y~0 main_~x~0) (= (+ (* main_~v~0 main_~y~0) (* main_~u~0 main_~y~0)) (* main_~a~0 main_~b~0)) (<= main_~x~0 main_~y~0)) [2019-10-15 01:06:42,658 INFO L443 ceAbstractionStarter]: For program point L43-1(lines 30 50) no Hoare annotation was computed. [2019-10-15 01:06:42,658 INFO L439 ceAbstractionStarter]: At program point L43-2(lines 30 50) the Hoare annotation is: (let ((.cse3 (* main_~a~0 main_~b~0))) (let ((.cse1 (<= main_~y~0 main_~x~0)) (.cse0 (<= 1 main_~a~0)) (.cse2 (= .cse3 (+ (* main_~y~0 main_~v~0) (* main_~x~0 main_~u~0))))) (or (and .cse0 .cse1 .cse2) (and .cse1 (<= main_~x~0 main_~y~0) (= (+ (* main_~v~0 main_~y~0) (* main_~u~0 main_~y~0)) .cse3)) (and .cse0 (= main_~b~0 main_~y~0) (= main_~b~0 main_~u~0) .cse2 (= main_~a~0 main_~x~0))))) [2019-10-15 01:06:42,659 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2019-10-15 01:06:42,659 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2019-10-15 01:06:42,659 INFO L443 ceAbstractionStarter]: For program point L11(lines 11 12) no Hoare annotation was computed. [2019-10-15 01:06:42,659 INFO L443 ceAbstractionStarter]: For program point L10(lines 10 13) no Hoare annotation was computed. [2019-10-15 01:06:42,659 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2019-10-15 01:06:42,659 INFO L443 ceAbstractionStarter]: For program point L10-2(lines 9 15) no Hoare annotation was computed. [2019-10-15 01:06:42,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:06:42 BoogieIcfgContainer [2019-10-15 01:06:42,670 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 01:06:42,672 INFO L168 Benchmark]: Toolchain (without parser) took 7334.16 ms. Allocated memory was 138.4 MB in the beginning and 273.7 MB in the end (delta: 135.3 MB). Free memory was 102.1 MB in the beginning and 231.6 MB in the end (delta: -129.6 MB). Peak memory consumption was 117.9 MB. Max. memory is 7.1 GB. [2019-10-15 01:06:42,673 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.4 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-15 01:06:42,674 INFO L168 Benchmark]: CACSL2BoogieTranslator took 227.88 ms. Allocated memory is still 138.4 MB. Free memory was 101.9 MB in the beginning and 92.1 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2019-10-15 01:06:42,675 INFO L168 Benchmark]: Boogie Preprocessor took 111.96 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 92.1 MB in the beginning and 181.2 MB in the end (delta: -89.0 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2019-10-15 01:06:42,675 INFO L168 Benchmark]: RCFGBuilder took 254.35 ms. Allocated memory is still 202.4 MB. Free memory was 181.2 MB in the beginning and 168.4 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. [2019-10-15 01:06:42,676 INFO L168 Benchmark]: TraceAbstraction took 6735.78 ms. Allocated memory was 202.4 MB in the beginning and 273.7 MB in the end (delta: 71.3 MB). Free memory was 168.4 MB in the beginning and 231.6 MB in the end (delta: -63.3 MB). Peak memory consumption was 120.3 MB. Max. memory is 7.1 GB. [2019-10-15 01:06:42,681 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 138.4 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 227.88 ms. Allocated memory is still 138.4 MB. Free memory was 101.9 MB in the beginning and 92.1 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 111.96 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 92.1 MB in the beginning and 181.2 MB in the end (delta: -89.0 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 254.35 ms. Allocated memory is still 202.4 MB. Free memory was 181.2 MB in the beginning and 168.4 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6735.78 ms. Allocated memory was 202.4 MB in the beginning and 273.7 MB in the end (delta: 71.3 MB). Free memory was 168.4 MB in the beginning and 231.6 MB in the end (delta: -63.3 MB). Peak memory consumption was 120.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: 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: 35]: Loop Invariant Derived loop invariant: 1 <= a && a * b == y * v + x * u - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((1 <= a && y <= x) && a * b == y * v + x * u) || ((y <= x && x <= y) && v * y + u * y == a * b)) || ((((1 <= a && b == y) && b == u) && a * b == y * v + x * u) && a == x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. Result: SAFE, OverallTime: 6.6s, OverallIterations: 7, TraceHistogramMax: 7, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, HoareTripleCheckerStatistics: 196 SDtfs, 178 SDslu, 718 SDs, 0 SdLazy, 683 SolverSat, 126 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 415 GetRequests, 341 SyntacticMatches, 4 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 47 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 85 PreInvPairs, 147 NumberOfFragments, 227 HoareAnnotationTreeSize, 85 FomulaSimplifications, 6213 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 12 FomulaSimplificationsInter, 192 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 211 NumberOfCodeBlocks, 211 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 399 ConstructedInterpolants, 6 QuantifiedInterpolants, 84518 SizeOfPredicates, 25 NumberOfNonLiveVariables, 481 ConjunctsInSsa, 98 ConjunctsInUnsatCore, 13 InterpolantComputations, 8 PerfectInterpolantSequences, 476/516 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...