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 -i ../../../trunk/examples/svcomp/nla-digbench/cohendiv.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 12:58:50,533 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 12:58:50,535 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 12:58:50,547 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 12:58:50,548 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 12:58:50,549 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 12:58:50,550 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 12:58:50,552 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 12:58:50,554 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 12:58:50,555 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 12:58:50,556 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 12:58:50,557 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 12:58:50,557 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 12:58:50,558 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 12:58:50,559 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 12:58:50,561 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 12:58:50,561 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 12:58:50,562 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 12:58:50,564 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 12:58:50,567 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 12:58:50,568 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 12:58:50,570 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 12:58:50,571 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 12:58:50,572 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 12:58:50,574 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 12:58:50,575 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 12:58:50,575 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 12:58:50,576 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 12:58:50,576 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 12:58:50,577 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 12:58:50,578 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 12:58:50,581 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 12:58:50,582 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 12:58:50,583 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 12:58:50,584 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 12:58:50,584 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 12:58:50,587 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 12:58:50,587 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 12:58:50,587 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 12:58:50,590 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 12:58:50,591 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 12:58:50,594 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-09-20 12:58:50,610 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 12:58:50,610 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 12:58:50,615 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 12:58:50,615 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 12:58:50,615 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 12:58:50,615 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 12:58:50,616 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 12:58:50,616 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 12:58:50,616 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 12:58:50,616 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 12:58:50,616 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 12:58:50,617 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 12:58:50,617 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 12:58:50,617 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 12:58:50,617 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 12:58:50,617 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 12:58:50,618 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 12:58:50,618 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 12:58:50,619 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 12:58:50,619 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 12:58:50,620 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 12:58:50,620 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 12:58:50,620 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 12:58:50,620 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 12:58:50,620 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 12:58:50,621 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 12:58:50,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 12:58:50,621 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 12:58:50,621 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 12:58:50,670 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 12:58:50,683 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 12:58:50,689 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 12:58:50,691 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 12:58:50,691 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 12:58:50,692 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/cohendiv.c [2019-09-20 12:58:50,765 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e1b63b5f/94b7de8397e2417395653e6fd6dc49d6/FLAG444f37b33 [2019-09-20 12:58:51,211 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 12:58:51,211 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/cohendiv.c [2019-09-20 12:58:51,218 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e1b63b5f/94b7de8397e2417395653e6fd6dc49d6/FLAG444f37b33 [2019-09-20 12:58:51,578 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e1b63b5f/94b7de8397e2417395653e6fd6dc49d6 [2019-09-20 12:58:51,590 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 12:58:51,592 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 12:58:51,592 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 12:58:51,592 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 12:58:51,595 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 12:58:51,596 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:58:51" (1/1) ... [2019-09-20 12:58:51,598 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e48aa35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:51, skipping insertion in model container [2019-09-20 12:58:51,598 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:58:51" (1/1) ... [2019-09-20 12:58:51,604 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 12:58:51,620 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 12:58:51,791 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 12:58:51,796 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 12:58:51,816 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 12:58:51,829 INFO L192 MainTranslator]: Completed translation [2019-09-20 12:58:51,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:51 WrapperNode [2019-09-20 12:58:51,830 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 12:58:51,831 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 12:58:51,831 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 12:58:51,831 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 12:58:51,928 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:51" (1/1) ... [2019-09-20 12:58:51,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:51" (1/1) ... [2019-09-20 12:58:51,933 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:51" (1/1) ... [2019-09-20 12:58:51,934 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:51" (1/1) ... [2019-09-20 12:58:51,938 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:51" (1/1) ... [2019-09-20 12:58:51,943 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:51" (1/1) ... [2019-09-20 12:58:51,944 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:51" (1/1) ... [2019-09-20 12:58:51,948 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 12:58:51,948 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 12:58:51,949 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 12:58:51,949 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 12:58:51,954 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:51" (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-09-20 12:58:52,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 12:58:52,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 12:58:52,006 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-20 12:58:52,006 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 12:58:52,006 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 12:58:52,006 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 12:58:52,006 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-20 12:58:52,006 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-20 12:58:52,006 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 12:58:52,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 12:58:52,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 12:58:52,237 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 12:58:52,238 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-20 12:58:52,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:58:52 BoogieIcfgContainer [2019-09-20 12:58:52,240 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 12:58:52,251 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 12:58:52,251 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 12:58:52,255 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 12:58:52,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 12:58:51" (1/3) ... [2019-09-20 12:58:52,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@650ae1a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:58:52, skipping insertion in model container [2019-09-20 12:58:52,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:51" (2/3) ... [2019-09-20 12:58:52,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@650ae1a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:58:52, skipping insertion in model container [2019-09-20 12:58:52,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:58:52" (3/3) ... [2019-09-20 12:58:52,273 INFO L109 eAbstractionObserver]: Analyzing ICFG cohendiv.c [2019-09-20 12:58:52,295 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 12:58:52,311 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 12:58:52,329 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 12:58:52,363 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 12:58:52,364 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 12:58:52,364 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 12:58:52,364 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 12:58:52,364 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 12:58:52,364 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 12:58:52,364 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 12:58:52,364 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 12:58:52,365 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 12:58:52,386 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-09-20 12:58:52,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-20 12:58:52,391 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:52,392 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:52,395 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:52,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:52,400 INFO L82 PathProgramCache]: Analyzing trace with hash -14138861, now seen corresponding path program 1 times [2019-09-20 12:58:52,401 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:52,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:52,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:52,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:52,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:52,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:52,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:52,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:52,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-20 12:58:52,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-20 12:58:52,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-20 12:58:52,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 12:58:52,554 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2019-09-20 12:58:52,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:52,580 INFO L93 Difference]: Finished difference Result 53 states and 84 transitions. [2019-09-20 12:58:52,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-20 12:58:52,582 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-20 12:58:52,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:52,590 INFO L225 Difference]: With dead ends: 53 [2019-09-20 12:58:52,590 INFO L226 Difference]: Without dead ends: 24 [2019-09-20 12:58:52,595 INFO L636 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-09-20 12:58:52,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-20 12:58:52,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-20 12:58:52,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-20 12:58:52,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2019-09-20 12:58:52,639 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 10 [2019-09-20 12:58:52,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:52,640 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2019-09-20 12:58:52,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-20 12:58:52,640 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2019-09-20 12:58:52,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-20 12:58:52,641 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:52,641 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:52,641 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:52,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:52,642 INFO L82 PathProgramCache]: Analyzing trace with hash -12649311, now seen corresponding path program 1 times [2019-09-20 12:58:52,642 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:52,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:52,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:52,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:52,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:52,653 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-20 12:58:52,653 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-20 12:58:52,653 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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-09-20 12:58:52,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:52,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:52,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-20 12:58:52,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:58:52,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:52,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:52,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 12:58:52,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 12:58:52,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 12:58:52,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 12:58:52,802 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand 5 states. [2019-09-20 12:58:52,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:52,894 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2019-09-20 12:58:52,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 12:58:52,895 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-09-20 12:58:52,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:52,897 INFO L225 Difference]: With dead ends: 35 [2019-09-20 12:58:52,897 INFO L226 Difference]: Without dead ends: 33 [2019-09-20 12:58:52,898 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 12:58:52,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-20 12:58:52,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2019-09-20 12:58:52,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-20 12:58:52,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-09-20 12:58:52,911 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 10 [2019-09-20 12:58:52,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:52,911 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-09-20 12:58:52,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 12:58:52,912 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2019-09-20 12:58:52,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-20 12:58:52,912 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:52,913 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:52,913 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:52,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:52,913 INFO L82 PathProgramCache]: Analyzing trace with hash 71526866, now seen corresponding path program 1 times [2019-09-20 12:58:52,914 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:52,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:52,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:52,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:52,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:52,922 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-20 12:58:52,922 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-20 12:58:52,922 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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) [2019-09-20 12:58:52,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-20 12:58:52,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:52,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-20 12:58:52,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:58:53,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:53,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:53,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 12:58:53,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 12:58:53,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 12:58:53,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 12:58:53,041 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2019-09-20 12:58:53,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:53,163 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2019-09-20 12:58:53,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 12:58:53,164 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-20 12:58:53,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:53,166 INFO L225 Difference]: With dead ends: 47 [2019-09-20 12:58:53,166 INFO L226 Difference]: Without dead ends: 44 [2019-09-20 12:58:53,167 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 12:58:53,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-20 12:58:53,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-09-20 12:58:53,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-20 12:58:53,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2019-09-20 12:58:53,181 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 15 [2019-09-20 12:58:53,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:53,182 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2019-09-20 12:58:53,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 12:58:53,182 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2019-09-20 12:58:53,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-20 12:58:53,184 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:53,184 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:53,185 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:53,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:53,185 INFO L82 PathProgramCache]: Analyzing trace with hash -365378422, now seen corresponding path program 1 times [2019-09-20 12:58:53,186 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:53,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:53,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:53,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:53,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:53,202 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-20 12:58:53,202 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-20 12:58:53,203 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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-09-20 12:58:53,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:53,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:53,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-20 12:58:53,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:58:53,288 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-20 12:58:53,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:53,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 12:58:53,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 12:58:53,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 12:58:53,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-20 12:58:53,293 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand 6 states. [2019-09-20 12:58:53,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:53,429 INFO L93 Difference]: Finished difference Result 69 states and 93 transitions. [2019-09-20 12:58:53,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 12:58:53,431 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-09-20 12:58:53,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:53,433 INFO L225 Difference]: With dead ends: 69 [2019-09-20 12:58:53,433 INFO L226 Difference]: Without dead ends: 67 [2019-09-20 12:58:53,433 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-20 12:58:53,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-20 12:58:53,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2019-09-20 12:58:53,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-20 12:58:53,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 80 transitions. [2019-09-20 12:58:53,452 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 80 transitions. Word has length 22 [2019-09-20 12:58:53,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:53,453 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 80 transitions. [2019-09-20 12:58:53,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 12:58:53,453 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 80 transitions. [2019-09-20 12:58:53,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-20 12:58:53,454 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:53,454 INFO L407 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:53,455 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:53,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:53,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1963256918, now seen corresponding path program 1 times [2019-09-20 12:58:53,455 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:53,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:53,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:53,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:53,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:53,462 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-20 12:58:53,462 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-20 12:58:53,463 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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-09-20 12:58:53,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:53,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:53,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-20 12:58:53,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:58:53,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:58:53,566 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-20 12:58:53,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:53,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 12:58:53,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 12:58:53,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 12:58:53,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 12:58:53,571 INFO L87 Difference]: Start difference. First operand 60 states and 80 transitions. Second operand 6 states. [2019-09-20 12:58:53,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:53,670 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2019-09-20 12:58:53,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 12:58:53,671 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-09-20 12:58:53,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:53,674 INFO L225 Difference]: With dead ends: 66 [2019-09-20 12:58:53,675 INFO L226 Difference]: Without dead ends: 64 [2019-09-20 12:58:53,675 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-20 12:58:53,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-20 12:58:53,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-09-20 12:58:53,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-20 12:58:53,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2019-09-20 12:58:53,689 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 32 [2019-09-20 12:58:53,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:53,690 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2019-09-20 12:58:53,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 12:58:53,690 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2019-09-20 12:58:53,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-20 12:58:53,691 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:53,692 INFO L407 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:53,692 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:53,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:53,693 INFO L82 PathProgramCache]: Analyzing trace with hash -363064690, now seen corresponding path program 1 times [2019-09-20 12:58:53,693 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:53,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:53,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:53,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:53,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:53,699 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-20 12:58:53,700 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-20 12:58:53,700 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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-09-20 12:58:53,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:53,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-20 12:58:53,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:58:53,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:58:53,822 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-20 12:58:53,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:53,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-20 12:58:53,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 12:58:53,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 12:58:53,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-20 12:58:53,827 INFO L87 Difference]: Start difference. First operand 64 states and 83 transitions. Second operand 7 states. [2019-09-20 12:58:53,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:53,998 INFO L93 Difference]: Finished difference Result 77 states and 99 transitions. [2019-09-20 12:58:53,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-20 12:58:53,999 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2019-09-20 12:58:54,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:54,004 INFO L225 Difference]: With dead ends: 77 [2019-09-20 12:58:54,004 INFO L226 Difference]: Without dead ends: 75 [2019-09-20 12:58:54,005 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-20 12:58:54,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-20 12:58:54,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2019-09-20 12:58:54,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-20 12:58:54,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 90 transitions. [2019-09-20 12:58:54,035 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 90 transitions. Word has length 38 [2019-09-20 12:58:54,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:54,036 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 90 transitions. [2019-09-20 12:58:54,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 12:58:54,037 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 90 transitions. [2019-09-20 12:58:54,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-20 12:58:54,041 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:54,042 INFO L407 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:54,042 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:54,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:54,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1044881029, now seen corresponding path program 1 times [2019-09-20 12:58:54,042 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:54,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:54,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:54,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:54,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:54,059 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-20 12:58:54,059 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-20 12:58:54,059 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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) [2019-09-20 12:58:54,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-20 12:58:54,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:54,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-20 12:58:54,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:58:54,190 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-20 12:58:54,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-20 12:58:54,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-09-20 12:58:54,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 12:58:54,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 12:58:54,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-20 12:58:54,198 INFO L87 Difference]: Start difference. First operand 70 states and 90 transitions. Second operand 7 states. [2019-09-20 12:58:54,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:54,387 INFO L93 Difference]: Finished difference Result 103 states and 134 transitions. [2019-09-20 12:58:54,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-20 12:58:54,388 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-09-20 12:58:54,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:54,390 INFO L225 Difference]: With dead ends: 103 [2019-09-20 12:58:54,390 INFO L226 Difference]: Without dead ends: 100 [2019-09-20 12:58:54,391 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-20 12:58:54,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-20 12:58:54,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2019-09-20 12:58:54,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-20 12:58:54,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 126 transitions. [2019-09-20 12:58:54,411 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 126 transitions. Word has length 45 [2019-09-20 12:58:54,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:54,412 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 126 transitions. [2019-09-20 12:58:54,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 12:58:54,413 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 126 transitions. [2019-09-20 12:58:54,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-20 12:58:54,414 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:54,414 INFO L407 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:54,414 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:54,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:54,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1334705699, now seen corresponding path program 1 times [2019-09-20 12:58:54,415 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:54,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:54,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:54,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:54,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:54,422 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-20 12:58:54,422 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-20 12:58:54,422 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-20 12:58:54,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:54,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:54,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-20 12:58:54,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:58:54,545 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-20 12:58:54,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-20 12:58:54,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-09-20 12:58:54,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 12:58:54,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 12:58:54,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-20 12:58:54,550 INFO L87 Difference]: Start difference. First operand 96 states and 126 transitions. Second operand 7 states. [2019-09-20 12:58:54,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:54,747 INFO L93 Difference]: Finished difference Result 135 states and 184 transitions. [2019-09-20 12:58:54,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-20 12:58:54,747 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-09-20 12:58:54,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:54,750 INFO L225 Difference]: With dead ends: 135 [2019-09-20 12:58:54,750 INFO L226 Difference]: Without dead ends: 133 [2019-09-20 12:58:54,751 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-20 12:58:54,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-09-20 12:58:54,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 121. [2019-09-20 12:58:54,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-09-20 12:58:54,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 163 transitions. [2019-09-20 12:58:54,790 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 163 transitions. Word has length 45 [2019-09-20 12:58:54,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:54,791 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 163 transitions. [2019-09-20 12:58:54,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 12:58:54,791 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 163 transitions. [2019-09-20 12:58:54,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-20 12:58:54,795 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:54,796 INFO L407 BasicCegarLoop]: trace histogram [10, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:54,796 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:54,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:54,797 INFO L82 PathProgramCache]: Analyzing trace with hash 228915751, now seen corresponding path program 2 times [2019-09-20 12:58:54,799 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:54,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:54,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:54,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:54,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:54,808 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-20 12:58:54,808 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-20 12:58:54,809 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-20 12:58:54,822 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 12:58:54,845 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 12:58:54,845 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:58:54,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-20 12:58:54,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:58:54,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:58:54,952 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-09-20 12:58:54,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-20 12:58:54,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-09-20 12:58:54,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 12:58:54,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 12:58:54,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-20 12:58:54,958 INFO L87 Difference]: Start difference. First operand 121 states and 163 transitions. Second operand 9 states. [2019-09-20 12:58:55,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:55,116 INFO L93 Difference]: Finished difference Result 127 states and 168 transitions. [2019-09-20 12:58:55,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 12:58:55,117 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2019-09-20 12:58:55,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:55,119 INFO L225 Difference]: With dead ends: 127 [2019-09-20 12:58:55,119 INFO L226 Difference]: Without dead ends: 125 [2019-09-20 12:58:55,120 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-20 12:58:55,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-09-20 12:58:55,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-09-20 12:58:55,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-09-20 12:58:55,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 166 transitions. [2019-09-20 12:58:55,139 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 166 transitions. Word has length 61 [2019-09-20 12:58:55,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:55,140 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 166 transitions. [2019-09-20 12:58:55,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 12:58:55,140 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 166 transitions. [2019-09-20 12:58:55,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-20 12:58:55,141 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:55,142 INFO L407 BasicCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:55,142 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:55,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:55,142 INFO L82 PathProgramCache]: Analyzing trace with hash 578907074, now seen corresponding path program 1 times [2019-09-20 12:58:55,142 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:55,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:55,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:55,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:58:55,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:55,149 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-20 12:58:55,149 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-20 12:58:55,149 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-20 12:58:55,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:55,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-20 12:58:55,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:58:55,293 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-20 12:58:55,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-20 12:58:55,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-09-20 12:58:55,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 12:58:55,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 12:58:55,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-20 12:58:55,308 INFO L87 Difference]: Start difference. First operand 125 states and 166 transitions. Second operand 8 states. [2019-09-20 12:58:55,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:55,559 INFO L93 Difference]: Finished difference Result 166 states and 223 transitions. [2019-09-20 12:58:55,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 12:58:55,560 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2019-09-20 12:58:55,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:55,562 INFO L225 Difference]: With dead ends: 166 [2019-09-20 12:58:55,562 INFO L226 Difference]: Without dead ends: 163 [2019-09-20 12:58:55,563 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-20 12:58:55,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-09-20 12:58:55,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 132. [2019-09-20 12:58:55,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-09-20 12:58:55,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 173 transitions. [2019-09-20 12:58:55,583 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 173 transitions. Word has length 68 [2019-09-20 12:58:55,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:55,583 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 173 transitions. [2019-09-20 12:58:55,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 12:58:55,583 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 173 transitions. [2019-09-20 12:58:55,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-20 12:58:55,585 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:55,585 INFO L407 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:55,586 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:55,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:55,586 INFO L82 PathProgramCache]: Analyzing trace with hash -485536924, now seen corresponding path program 2 times [2019-09-20 12:58:55,586 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:55,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:55,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:55,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:55,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:55,603 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-20 12:58:55,603 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-20 12:58:55,603 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-20 12:58:55,632 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 12:58:55,664 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 12:58:55,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:58:55,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-20 12:58:55,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:58:55,748 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-09-20 12:58:55,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:55,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 12:58:55,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 12:58:55,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 12:58:55,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-20 12:58:55,757 INFO L87 Difference]: Start difference. First operand 132 states and 173 transitions. Second operand 5 states. [2019-09-20 12:58:55,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:55,855 INFO L93 Difference]: Finished difference Result 217 states and 287 transitions. [2019-09-20 12:58:55,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 12:58:55,858 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-09-20 12:58:55,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:55,863 INFO L225 Difference]: With dead ends: 217 [2019-09-20 12:58:55,864 INFO L226 Difference]: Without dead ends: 132 [2019-09-20 12:58:55,865 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-20 12:58:55,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-09-20 12:58:55,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2019-09-20 12:58:55,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-09-20 12:58:55,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 171 transitions. [2019-09-20 12:58:55,893 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 171 transitions. Word has length 75 [2019-09-20 12:58:55,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:55,894 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 171 transitions. [2019-09-20 12:58:55,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 12:58:55,894 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 171 transitions. [2019-09-20 12:58:55,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-20 12:58:55,895 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:55,896 INFO L407 BasicCegarLoop]: trace histogram [15, 14, 14, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:55,896 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:55,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:55,897 INFO L82 PathProgramCache]: Analyzing trace with hash -476331621, now seen corresponding path program 2 times [2019-09-20 12:58:55,897 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:55,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:55,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:55,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:58:55,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:55,914 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-20 12:58:55,917 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-20 12:58:55,918 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-20 12:58:55,952 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 12:58:55,990 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 12:58:55,991 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:58:55,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-20 12:58:56,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:58:56,202 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 28 proven. 20 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-20 12:58:56,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-20 12:58:56,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-09-20 12:58:56,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 12:58:56,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 12:58:56,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-20 12:58:56,216 INFO L87 Difference]: Start difference. First operand 131 states and 171 transitions. Second operand 9 states. [2019-09-20 12:58:56,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:56,552 INFO L93 Difference]: Finished difference Result 179 states and 240 transitions. [2019-09-20 12:58:56,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 12:58:56,553 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2019-09-20 12:58:56,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:56,556 INFO L225 Difference]: With dead ends: 179 [2019-09-20 12:58:56,556 INFO L226 Difference]: Without dead ends: 176 [2019-09-20 12:58:56,560 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-20 12:58:56,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-09-20 12:58:56,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 145. [2019-09-20 12:58:56,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-09-20 12:58:56,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 190 transitions. [2019-09-20 12:58:56,590 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 190 transitions. Word has length 91 [2019-09-20 12:58:56,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:56,592 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 190 transitions. [2019-09-20 12:58:56,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 12:58:56,592 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 190 transitions. [2019-09-20 12:58:56,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-20 12:58:56,594 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:56,595 INFO L407 BasicCegarLoop]: trace histogram [16, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:56,595 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:56,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:56,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1652186987, now seen corresponding path program 3 times [2019-09-20 12:58:56,595 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:56,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:56,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:56,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:58:56,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:56,609 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-20 12:58:56,609 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-20 12:58:56,609 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-20 12:58:56,630 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-20 12:58:56,656 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-20 12:58:56,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:58:56,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-20 12:58:56,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:58:56,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:58:56,830 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 94 proven. 34 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2019-09-20 12:58:56,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-20 12:58:56,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-20 12:58:56,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 12:58:56,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 12:58:56,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-20 12:58:56,844 INFO L87 Difference]: Start difference. First operand 145 states and 190 transitions. Second operand 10 states. [2019-09-20 12:58:57,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:57,114 INFO L93 Difference]: Finished difference Result 155 states and 202 transitions. [2019-09-20 12:58:57,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-20 12:58:57,115 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 98 [2019-09-20 12:58:57,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:57,116 INFO L225 Difference]: With dead ends: 155 [2019-09-20 12:58:57,116 INFO L226 Difference]: Without dead ends: 0 [2019-09-20 12:58:57,118 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2019-09-20 12:58:57,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-20 12:58:57,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-20 12:58:57,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-20 12:58:57,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-20 12:58:57,119 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 98 [2019-09-20 12:58:57,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:57,119 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-20 12:58:57,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 12:58:57,120 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-20 12:58:57,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-20 12:58:57,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-20 12:58:57,260 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 38 [2019-09-20 12:58:57,664 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2019-09-20 12:58:57,971 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-20 12:58:57,972 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-20 12:58:57,972 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-20 12:58:57,972 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-20 12:58:57,972 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-20 12:58:57,972 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-20 12:58:57,972 INFO L439 ceAbstractionStarter]: At program point L31(line 31) the Hoare annotation is: (and (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0)) (= (+ main_~x~0 (* (- 1) main_~b~0) (* (- 1) main_~r~0)) (* main_~y~0 (+ main_~q~0 (* (- 1) main_~a~0))))) [2019-09-20 12:58:57,973 INFO L439 ceAbstractionStarter]: At program point L31-1(line 31) the Hoare annotation is: (and (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0)) (= (+ main_~x~0 (* (- 1) main_~b~0) (* (- 1) main_~r~0)) (* main_~y~0 (+ main_~q~0 (* (- 1) main_~a~0))))) [2019-09-20 12:58:57,973 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 17 58) no Hoare annotation was computed. [2019-09-20 12:58:57,973 INFO L443 ceAbstractionStarter]: For program point L56(line 56) no Hoare annotation was computed. [2019-09-20 12:58:57,973 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 17 58) no Hoare annotation was computed. [2019-09-20 12:58:57,973 INFO L443 ceAbstractionStarter]: For program point L42(lines 39 51) no Hoare annotation was computed. [2019-09-20 12:58:57,973 INFO L439 ceAbstractionStarter]: At program point L40(line 40) the Hoare annotation is: (and (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0)) (= (+ main_~x~0 (* (- 1) main_~b~0) (* (- 1) main_~r~0)) (* main_~y~0 (+ main_~q~0 (* (- 1) main_~a~0)))) (<= 1 main_~r~0)) [2019-09-20 12:58:57,974 INFO L439 ceAbstractionStarter]: At program point L40-1(line 40) the Hoare annotation is: (and (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0)) (= (+ main_~x~0 (* (- 1) main_~b~0) (* (- 1) main_~r~0)) (* main_~y~0 (+ main_~q~0 (* (- 1) main_~a~0)))) (<= 1 main_~r~0)) [2019-09-20 12:58:57,974 INFO L443 ceAbstractionStarter]: For program point L32(lines 30 54) no Hoare annotation was computed. [2019-09-20 12:58:57,974 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 17 58) the Hoare annotation is: true [2019-09-20 12:58:57,974 INFO L439 ceAbstractionStarter]: At program point L30-2(lines 30 54) the Hoare annotation is: (and (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0)) (= (+ main_~x~0 (* (- 1) main_~b~0) (* (- 1) main_~r~0)) (* main_~y~0 (+ main_~q~0 (* (- 1) main_~a~0))))) [2019-09-20 12:58:57,974 INFO L439 ceAbstractionStarter]: At program point L30-3(lines 30 54) the Hoare annotation is: (let ((.cse0 (<= 1 main_~y~0)) (.cse1 (= main_~b~0 (* main_~a~0 main_~y~0)))) (or (and .cse0 (= main_~q~0 0) (= main_~x~0 main_~r~0)) (and .cse0 (<= (+ main_~r~0 1) main_~y~0) .cse1 (= (+ main_~x~0 (* (- 1) main_~b~0) (* (- 1) main_~r~0)) (* main_~y~0 (+ main_~q~0 (* (- 1) main_~a~0))))) (and (= main_~q~0 1) .cse0 (= (+ main_~y~0 main_~r~0) main_~x~0)) (and .cse0 (= (+ (* 2 main_~y~0) main_~r~0) main_~x~0) .cse1 (= main_~q~0 2)))) [2019-09-20 12:58:57,974 INFO L439 ceAbstractionStarter]: At program point L47(line 47) the Hoare annotation is: (let ((.cse0 (* main_~a~0 main_~y~0))) (and (<= (* 2 .cse0) main_~r~0) (<= 1 main_~y~0) (= main_~b~0 .cse0) (= (+ main_~x~0 (* (- 1) main_~b~0) (* (- 1) main_~r~0)) (* main_~y~0 (+ main_~q~0 (* (- 1) main_~a~0)))) (<= 1 main_~r~0))) [2019-09-20 12:58:57,975 INFO L443 ceAbstractionStarter]: For program point L47-1(line 47) no Hoare annotation was computed. [2019-09-20 12:58:57,975 INFO L439 ceAbstractionStarter]: At program point L41(line 41) the Hoare annotation is: (and (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0)) (= (+ main_~x~0 (* (- 1) main_~b~0) (* (- 1) main_~r~0)) (* main_~y~0 (+ main_~q~0 (* (- 1) main_~a~0)))) (<= 1 main_~r~0)) [2019-09-20 12:58:57,975 INFO L439 ceAbstractionStarter]: At program point L39-2(lines 39 51) the Hoare annotation is: (and (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0)) (= (+ main_~x~0 (* (- 1) main_~b~0) (* (- 1) main_~r~0)) (* main_~y~0 (+ main_~q~0 (* (- 1) main_~a~0)))) (<= 1 main_~r~0)) [2019-09-20 12:58:57,975 INFO L443 ceAbstractionStarter]: For program point L39-3(lines 39 51) no Hoare annotation was computed. [2019-09-20 12:58:57,975 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2019-09-20 12:58:57,975 INFO L443 ceAbstractionStarter]: For program point L11(lines 11 12) no Hoare annotation was computed. [2019-09-20 12:58:57,975 INFO L443 ceAbstractionStarter]: For program point L10(lines 10 13) no Hoare annotation was computed. [2019-09-20 12:58:57,976 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2019-09-20 12:58:57,976 INFO L443 ceAbstractionStarter]: For program point L10-2(lines 9 15) no Hoare annotation was computed. [2019-09-20 12:58:57,976 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2019-09-20 12:58:57,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 12:58:57 BoogieIcfgContainer [2019-09-20 12:58:57,991 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 12:58:57,993 INFO L168 Benchmark]: Toolchain (without parser) took 6400.82 ms. Allocated memory was 140.5 MB in the beginning and 300.9 MB in the end (delta: 160.4 MB). Free memory was 87.3 MB in the beginning and 137.7 MB in the end (delta: -50.4 MB). Peak memory consumption was 110.1 MB. Max. memory is 7.1 GB. [2019-09-20 12:58:57,994 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 140.5 MB. Free memory was 105.2 MB in the beginning and 105.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-20 12:58:57,994 INFO L168 Benchmark]: CACSL2BoogieTranslator took 238.28 ms. Allocated memory is still 140.5 MB. Free memory was 87.1 MB in the beginning and 77.3 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2019-09-20 12:58:57,995 INFO L168 Benchmark]: Boogie Preprocessor took 117.17 ms. Allocated memory was 140.5 MB in the beginning and 199.8 MB in the end (delta: 59.2 MB). Free memory was 77.3 MB in the beginning and 177.8 MB in the end (delta: -100.5 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. [2019-09-20 12:58:57,996 INFO L168 Benchmark]: RCFGBuilder took 292.00 ms. Allocated memory is still 199.8 MB. Free memory was 177.8 MB in the beginning and 164.6 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. [2019-09-20 12:58:57,997 INFO L168 Benchmark]: TraceAbstraction took 5739.83 ms. Allocated memory was 199.8 MB in the beginning and 300.9 MB in the end (delta: 101.2 MB). Free memory was 164.0 MB in the beginning and 137.7 MB in the end (delta: 26.3 MB). Peak memory consumption was 127.5 MB. Max. memory is 7.1 GB. [2019-09-20 12:58:58,001 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.44 ms. Allocated memory is still 140.5 MB. Free memory was 105.2 MB in the beginning and 105.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 238.28 ms. Allocated memory is still 140.5 MB. Free memory was 87.1 MB in the beginning and 77.3 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 117.17 ms. Allocated memory was 140.5 MB in the beginning and 199.8 MB in the end (delta: 59.2 MB). Free memory was 77.3 MB in the beginning and 177.8 MB in the end (delta: -100.5 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 292.00 ms. Allocated memory is still 199.8 MB. Free memory was 177.8 MB in the beginning and 164.6 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5739.83 ms. Allocated memory was 199.8 MB in the beginning and 300.9 MB in the end (delta: 101.2 MB). Free memory was 164.0 MB in the beginning and 137.7 MB in the end (delta: 26.3 MB). Peak memory consumption was 127.5 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: 30]: Loop Invariant Derived loop invariant: (1 <= y && b == a * y) && x + -1 * b + -1 * r == y * (q + -1 * a) - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: ((1 <= y && b == a * y) && x + -1 * b + -1 * r == y * (q + -1 * a)) && 1 <= r - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 29 locations, 1 error locations. SAFE Result, 5.6s OverallTime, 13 OverallIterations, 16 TraceHistogramMax, 2.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 460 SDtfs, 212 SDslu, 1255 SDs, 0 SdLazy, 1130 SolverSat, 148 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 612 GetRequests, 530 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 95 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 104 PreInvPairs, 179 NumberOfFragments, 299 HoareAnnotationTreeSize, 104 FomulaSimplifications, 6344 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 14 FomulaSimplificationsInter, 635 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 610 NumberOfCodeBlocks, 558 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 597 ConstructedInterpolants, 0 QuantifiedInterpolants, 149438 SizeOfPredicates, 41 NumberOfNonLiveVariables, 1244 ConjunctsInSsa, 186 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 1689/1763 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...