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-c6af20d [2019-09-03 20:15:12,309 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:15:12,311 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:15:12,328 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:15:12,329 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:15:12,330 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:15:12,332 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:15:12,345 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:15:12,347 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:15:12,349 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:15:12,350 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:15:12,353 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:15:12,353 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:15:12,356 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:15:12,358 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:15:12,359 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:15:12,360 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:15:12,362 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:15:12,364 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:15:12,365 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:15:12,367 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:15:12,368 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:15:12,369 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:15:12,369 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:15:12,371 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:15:12,372 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:15:12,372 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:15:12,373 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:15:12,373 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:15:12,374 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:15:12,374 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:15:12,375 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:15:12,376 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:15:12,376 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:15:12,377 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:15:12,377 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:15:12,378 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:15:12,378 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:15:12,378 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:15:12,379 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:15:12,380 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:15:12,381 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-03 20:15:12,402 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:15:12,403 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:15:12,405 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 20:15:12,405 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 20:15:12,406 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 20:15:12,406 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:15:12,406 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:15:12,406 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 20:15:12,406 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:15:12,407 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:15:12,407 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:15:12,408 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:15:12,408 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:15:12,408 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:15:12,409 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:15:12,409 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 20:15:12,409 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:15:12,409 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:15:12,409 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:15:12,410 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 20:15:12,410 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 20:15:12,410 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:15:12,411 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:15:12,411 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:15:12,411 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 20:15:12,411 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 20:15:12,412 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:15:12,412 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:15:12,413 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 20:15:12,465 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:15:12,482 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:15:12,488 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:15:12,489 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:15:12,490 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:15:12,490 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-03 20:15:12,561 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c75fe3134/3029f8efd4d7446e80a417896d92e247/FLAG4bcb8669c [2019-09-03 20:15:13,021 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:15:13,022 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/cohendiv.c [2019-09-03 20:15:13,031 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c75fe3134/3029f8efd4d7446e80a417896d92e247/FLAG4bcb8669c [2019-09-03 20:15:13,391 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c75fe3134/3029f8efd4d7446e80a417896d92e247 [2019-09-03 20:15:13,401 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:15:13,403 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:15:13,404 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:15:13,404 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:15:13,407 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:15:13,408 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:15:13" (1/1) ... [2019-09-03 20:15:13,411 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22bbd3bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:15:13, skipping insertion in model container [2019-09-03 20:15:13,411 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:15:13" (1/1) ... [2019-09-03 20:15:13,418 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:15:13,438 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:15:13,616 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:15:13,622 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:15:13,647 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:15:13,662 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:15:13,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:15:13 WrapperNode [2019-09-03 20:15:13,662 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:15:13,663 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:15:13,663 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:15:13,663 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:15:13,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:15:13" (1/1) ... [2019-09-03 20:15:13,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:15:13" (1/1) ... [2019-09-03 20:15:13,771 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:15:13" (1/1) ... [2019-09-03 20:15:13,771 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:15:13" (1/1) ... [2019-09-03 20:15:13,778 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:15:13" (1/1) ... [2019-09-03 20:15:13,785 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:15:13" (1/1) ... [2019-09-03 20:15:13,786 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:15:13" (1/1) ... [2019-09-03 20:15:13,787 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:15:13,788 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:15:13,788 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:15:13,788 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:15:13,789 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:15:13" (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-03 20:15:13,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:15:13,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:15:13,840 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 20:15:13,840 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:15:13,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:15:13,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 20:15:13,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 20:15:13,841 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:15:13,841 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:15:13,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:15:13,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:15:14,022 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:15:14,023 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-03 20:15:14,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:15:14 BoogieIcfgContainer [2019-09-03 20:15:14,024 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:15:14,025 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:15:14,025 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:15:14,028 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:15:14,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:15:13" (1/3) ... [2019-09-03 20:15:14,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f76216 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:15:14, skipping insertion in model container [2019-09-03 20:15:14,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:15:13" (2/3) ... [2019-09-03 20:15:14,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f76216 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:15:14, skipping insertion in model container [2019-09-03 20:15:14,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:15:14" (3/3) ... [2019-09-03 20:15:14,032 INFO L109 eAbstractionObserver]: Analyzing ICFG cohendiv.c [2019-09-03 20:15:14,041 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:15:14,049 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 20:15:14,066 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 20:15:14,126 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 20:15:14,127 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:15:14,127 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 20:15:14,127 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:15:14,128 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:15:14,128 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:15:14,128 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:15:14,128 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:15:14,129 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:15:14,160 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-09-03 20:15:14,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 20:15:14,166 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:15:14,167 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:15:14,171 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:15:14,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:15:14,178 INFO L82 PathProgramCache]: Analyzing trace with hash -14138861, now seen corresponding path program 1 times [2019-09-03 20:15:14,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:15:14,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:15:14,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:14,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:15:14,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:14,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:15:14,295 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-03 20:15:14,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:15:14,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 20:15:14,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 20:15:14,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 20:15:14,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 20:15:14,317 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2019-09-03 20:15:14,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:15:14,346 INFO L93 Difference]: Finished difference Result 53 states and 84 transitions. [2019-09-03 20:15:14,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 20:15:14,348 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-03 20:15:14,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:15:14,358 INFO L225 Difference]: With dead ends: 53 [2019-09-03 20:15:14,359 INFO L226 Difference]: Without dead ends: 24 [2019-09-03 20:15:14,363 INFO L628 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-03 20:15:14,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-03 20:15:14,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-03 20:15:14,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-03 20:15:14,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2019-09-03 20:15:14,409 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 10 [2019-09-03 20:15:14,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:15:14,409 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2019-09-03 20:15:14,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 20:15:14,410 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2019-09-03 20:15:14,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 20:15:14,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:15:14,411 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:15:14,411 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:15:14,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:15:14,412 INFO L82 PathProgramCache]: Analyzing trace with hash -12649311, now seen corresponding path program 1 times [2019-09-03 20:15:14,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:15:14,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:15:14,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:14,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:15:14,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:14,426 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:15:14,427 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:15:14,427 INFO L223 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-03 20:15:14,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:15:14,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:15:14,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 20:15:14,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:15:14,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:15:14,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:15:14,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:15:14,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:15:14,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:15:14,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:15:14,539 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand 5 states. [2019-09-03 20:15:14,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:15:14,654 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2019-09-03 20:15:14,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:15:14,657 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-09-03 20:15:14,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:15:14,659 INFO L225 Difference]: With dead ends: 35 [2019-09-03 20:15:14,660 INFO L226 Difference]: Without dead ends: 33 [2019-09-03 20:15:14,661 INFO L628 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-03 20:15:14,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-03 20:15:14,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2019-09-03 20:15:14,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-03 20:15:14,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-09-03 20:15:14,686 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 10 [2019-09-03 20:15:14,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:15:14,686 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-09-03 20:15:14,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:15:14,687 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2019-09-03 20:15:14,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-03 20:15:14,687 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:15:14,688 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:15:14,688 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:15:14,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:15:14,688 INFO L82 PathProgramCache]: Analyzing trace with hash 71526866, now seen corresponding path program 1 times [2019-09-03 20:15:14,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:15:14,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:15:14,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:14,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:15:14,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:14,696 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:15:14,696 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:15:14,697 INFO L223 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:15:14,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:15:14,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:15:14,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 20:15:14,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:15:14,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:15:14,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:15:14,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:15:14,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:15:14,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:15:14,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:15:14,782 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2019-09-03 20:15:14,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:15:14,911 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2019-09-03 20:15:14,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:15:14,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-03 20:15:14,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:15:14,914 INFO L225 Difference]: With dead ends: 47 [2019-09-03 20:15:14,914 INFO L226 Difference]: Without dead ends: 44 [2019-09-03 20:15:14,915 INFO L628 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-03 20:15:14,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-03 20:15:14,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-09-03 20:15:14,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-03 20:15:14,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2019-09-03 20:15:14,936 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 15 [2019-09-03 20:15:14,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:15:14,937 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2019-09-03 20:15:14,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:15:14,938 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2019-09-03 20:15:14,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-03 20:15:14,939 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:15:14,939 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:15:14,939 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:15:14,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:15:14,940 INFO L82 PathProgramCache]: Analyzing trace with hash -365378422, now seen corresponding path program 1 times [2019-09-03 20:15:14,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:15:14,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:15:14,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:14,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:15:14,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:14,955 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:15:14,955 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:15:14,959 INFO L223 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-03 20:15:14,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:15:15,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:15:15,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 20:15:15,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:15:15,061 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-03 20:15:15,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:15:15,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 20:15:15,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:15:15,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:15:15,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:15:15,070 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand 6 states. [2019-09-03 20:15:15,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:15:15,234 INFO L93 Difference]: Finished difference Result 69 states and 93 transitions. [2019-09-03 20:15:15,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:15:15,235 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-09-03 20:15:15,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:15:15,236 INFO L225 Difference]: With dead ends: 69 [2019-09-03 20:15:15,237 INFO L226 Difference]: Without dead ends: 67 [2019-09-03 20:15:15,237 INFO L628 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-03 20:15:15,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-03 20:15:15,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2019-09-03 20:15:15,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-03 20:15:15,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 80 transitions. [2019-09-03 20:15:15,255 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 80 transitions. Word has length 22 [2019-09-03 20:15:15,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:15:15,255 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 80 transitions. [2019-09-03 20:15:15,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:15:15,255 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 80 transitions. [2019-09-03 20:15:15,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-03 20:15:15,256 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:15:15,257 INFO L399 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-03 20:15:15,257 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:15:15,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:15:15,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1963256918, now seen corresponding path program 1 times [2019-09-03 20:15:15,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:15:15,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:15:15,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:15,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:15:15,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:15,264 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:15:15,265 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:15:15,265 INFO L223 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-03 20:15:15,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:15:15,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:15:15,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 20:15:15,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:15:15,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:15:15,369 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-03 20:15:15,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:15:15,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 20:15:15,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:15:15,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:15:15,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:15:15,374 INFO L87 Difference]: Start difference. First operand 60 states and 80 transitions. Second operand 6 states. [2019-09-03 20:15:15,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:15:15,460 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2019-09-03 20:15:15,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:15:15,460 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-09-03 20:15:15,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:15:15,463 INFO L225 Difference]: With dead ends: 66 [2019-09-03 20:15:15,463 INFO L226 Difference]: Without dead ends: 64 [2019-09-03 20:15:15,464 INFO L628 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-03 20:15:15,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-03 20:15:15,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-09-03 20:15:15,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-03 20:15:15,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2019-09-03 20:15:15,477 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 32 [2019-09-03 20:15:15,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:15:15,478 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2019-09-03 20:15:15,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:15:15,478 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2019-09-03 20:15:15,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-03 20:15:15,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:15:15,479 INFO L399 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-03 20:15:15,480 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:15:15,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:15:15,480 INFO L82 PathProgramCache]: Analyzing trace with hash -363064690, now seen corresponding path program 1 times [2019-09-03 20:15:15,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:15:15,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:15:15,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:15,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:15:15,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:15,486 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:15:15,486 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:15:15,487 INFO L223 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) [2019-09-03 20:15:15,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:15:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:15:15,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 20:15:15,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:15:15,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:15:15,584 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-03 20:15:15,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:15:15,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-03 20:15:15,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:15:15,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:15:15,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:15:15,588 INFO L87 Difference]: Start difference. First operand 64 states and 83 transitions. Second operand 7 states. [2019-09-03 20:15:15,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:15:15,743 INFO L93 Difference]: Finished difference Result 77 states and 99 transitions. [2019-09-03 20:15:15,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:15:15,746 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2019-09-03 20:15:15,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:15:15,747 INFO L225 Difference]: With dead ends: 77 [2019-09-03 20:15:15,747 INFO L226 Difference]: Without dead ends: 75 [2019-09-03 20:15:15,753 INFO L628 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-03 20:15:15,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-03 20:15:15,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2019-09-03 20:15:15,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-03 20:15:15,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 90 transitions. [2019-09-03 20:15:15,774 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 90 transitions. Word has length 38 [2019-09-03 20:15:15,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:15:15,775 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 90 transitions. [2019-09-03 20:15:15,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:15:15,775 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 90 transitions. [2019-09-03 20:15:15,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-03 20:15:15,779 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:15:15,779 INFO L399 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-03 20:15:15,779 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:15:15,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:15:15,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1044881029, now seen corresponding path program 1 times [2019-09-03 20:15:15,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:15:15,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:15:15,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:15,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:15:15,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:15,797 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:15:15,798 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:15:15,798 INFO L223 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-03 20:15:15,818 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-03 20:15:15,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:15:15,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-03 20:15:15,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:15:15,921 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-03 20:15:15,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:15:15,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-09-03 20:15:15,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:15:15,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:15:15,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:15:15,926 INFO L87 Difference]: Start difference. First operand 70 states and 90 transitions. Second operand 7 states. [2019-09-03 20:15:16,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:15:16,086 INFO L93 Difference]: Finished difference Result 103 states and 134 transitions. [2019-09-03 20:15:16,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:15:16,087 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-09-03 20:15:16,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:15:16,092 INFO L225 Difference]: With dead ends: 103 [2019-09-03 20:15:16,092 INFO L226 Difference]: Without dead ends: 100 [2019-09-03 20:15:16,095 INFO L628 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-03 20:15:16,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-03 20:15:16,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2019-09-03 20:15:16,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-03 20:15:16,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 126 transitions. [2019-09-03 20:15:16,125 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 126 transitions. Word has length 45 [2019-09-03 20:15:16,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:15:16,126 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 126 transitions. [2019-09-03 20:15:16,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:15:16,126 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 126 transitions. [2019-09-03 20:15:16,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-03 20:15:16,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:15:16,129 INFO L399 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-03 20:15:16,129 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:15:16,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:15:16,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1334705699, now seen corresponding path program 1 times [2019-09-03 20:15:16,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:15:16,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:15:16,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:16,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:15:16,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:16,135 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:15:16,135 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:15:16,136 INFO L223 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-03 20:15:16,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:15:16,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:15:16,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 20:15:16,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:15:16,315 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-03 20:15:16,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:15:16,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-09-03 20:15:16,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:15:16,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:15:16,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:15:16,321 INFO L87 Difference]: Start difference. First operand 96 states and 126 transitions. Second operand 7 states. [2019-09-03 20:15:16,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:15:16,532 INFO L93 Difference]: Finished difference Result 135 states and 184 transitions. [2019-09-03 20:15:16,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:15:16,533 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-09-03 20:15:16,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:15:16,536 INFO L225 Difference]: With dead ends: 135 [2019-09-03 20:15:16,537 INFO L226 Difference]: Without dead ends: 133 [2019-09-03 20:15:16,537 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:15:16,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-09-03 20:15:16,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 121. [2019-09-03 20:15:16,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-09-03 20:15:16,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 163 transitions. [2019-09-03 20:15:16,579 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 163 transitions. Word has length 45 [2019-09-03 20:15:16,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:15:16,580 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 163 transitions. [2019-09-03 20:15:16,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:15:16,580 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 163 transitions. [2019-09-03 20:15:16,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-03 20:15:16,585 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:15:16,586 INFO L399 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-03 20:15:16,586 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:15:16,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:15:16,587 INFO L82 PathProgramCache]: Analyzing trace with hash 228915751, now seen corresponding path program 2 times [2019-09-03 20:15:16,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:15:16,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:15:16,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:16,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:15:16,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:16,598 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:15:16,598 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:15:16,598 INFO L223 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) [2019-09-03 20:15:16,612 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:15:16,635 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:15:16,635 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:15:16,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 20:15:16,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:15:16,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:15:16,703 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-03 20:15:16,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:15:16,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-09-03 20:15:16,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 20:15:16,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 20:15:16,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:15:16,709 INFO L87 Difference]: Start difference. First operand 121 states and 163 transitions. Second operand 9 states. [2019-09-03 20:15:16,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:15:16,872 INFO L93 Difference]: Finished difference Result 127 states and 168 transitions. [2019-09-03 20:15:16,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:15:16,873 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2019-09-03 20:15:16,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:15:16,876 INFO L225 Difference]: With dead ends: 127 [2019-09-03 20:15:16,876 INFO L226 Difference]: Without dead ends: 125 [2019-09-03 20:15:16,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:15:16,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-09-03 20:15:16,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-09-03 20:15:16,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-09-03 20:15:16,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 166 transitions. [2019-09-03 20:15:16,906 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 166 transitions. Word has length 61 [2019-09-03 20:15:16,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:15:16,908 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 166 transitions. [2019-09-03 20:15:16,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 20:15:16,908 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 166 transitions. [2019-09-03 20:15:16,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-03 20:15:16,915 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:15:16,915 INFO L399 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-03 20:15:16,915 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:15:16,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:15:16,916 INFO L82 PathProgramCache]: Analyzing trace with hash 578907074, now seen corresponding path program 1 times [2019-09-03 20:15:16,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:15:16,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:15:16,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:16,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:15:16,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:16,930 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:15:16,930 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:15:16,930 INFO L223 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) [2019-09-03 20:15:16,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:15:16,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:15:16,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 20:15:16,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:15:17,103 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-03 20:15:17,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:15:17,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-09-03 20:15:17,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 20:15:17,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 20:15:17,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:15:17,112 INFO L87 Difference]: Start difference. First operand 125 states and 166 transitions. Second operand 8 states. [2019-09-03 20:15:17,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:15:17,347 INFO L93 Difference]: Finished difference Result 166 states and 223 transitions. [2019-09-03 20:15:17,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:15:17,347 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2019-09-03 20:15:17,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:15:17,349 INFO L225 Difference]: With dead ends: 166 [2019-09-03 20:15:17,350 INFO L226 Difference]: Without dead ends: 163 [2019-09-03 20:15:17,350 INFO L628 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-03 20:15:17,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-09-03 20:15:17,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 132. [2019-09-03 20:15:17,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-09-03 20:15:17,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 173 transitions. [2019-09-03 20:15:17,370 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 173 transitions. Word has length 68 [2019-09-03 20:15:17,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:15:17,371 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 173 transitions. [2019-09-03 20:15:17,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 20:15:17,371 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 173 transitions. [2019-09-03 20:15:17,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-03 20:15:17,373 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:15:17,373 INFO L399 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-03 20:15:17,373 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:15:17,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:15:17,373 INFO L82 PathProgramCache]: Analyzing trace with hash -485536924, now seen corresponding path program 2 times [2019-09-03 20:15:17,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:15:17,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:15:17,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:17,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:15:17,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:17,379 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:15:17,380 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:15:17,380 INFO L223 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-03 20:15:17,410 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:15:17,432 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:15:17,432 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:15:17,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-03 20:15:17,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:15:17,505 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-03 20:15:17,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:15:17,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:15:17,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:15:17,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:15:17,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:15:17,510 INFO L87 Difference]: Start difference. First operand 132 states and 173 transitions. Second operand 5 states. [2019-09-03 20:15:17,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:15:17,603 INFO L93 Difference]: Finished difference Result 217 states and 287 transitions. [2019-09-03 20:15:17,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:15:17,604 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-09-03 20:15:17,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:15:17,606 INFO L225 Difference]: With dead ends: 217 [2019-09-03 20:15:17,606 INFO L226 Difference]: Without dead ends: 132 [2019-09-03 20:15:17,608 INFO L628 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-03 20:15:17,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-09-03 20:15:17,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2019-09-03 20:15:17,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-09-03 20:15:17,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 171 transitions. [2019-09-03 20:15:17,624 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 171 transitions. Word has length 75 [2019-09-03 20:15:17,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:15:17,624 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 171 transitions. [2019-09-03 20:15:17,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:15:17,625 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 171 transitions. [2019-09-03 20:15:17,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-03 20:15:17,627 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:15:17,627 INFO L399 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-03 20:15:17,627 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:15:17,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:15:17,628 INFO L82 PathProgramCache]: Analyzing trace with hash -476331621, now seen corresponding path program 2 times [2019-09-03 20:15:17,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:15:17,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:15:17,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:17,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:15:17,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:17,641 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:15:17,641 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:15:17,642 INFO L223 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) [2019-09-03 20:15:17,659 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:15:17,687 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:15:17,687 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:15:17,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-03 20:15:17,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:15:17,847 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-03 20:15:17,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:15:17,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-09-03 20:15:17,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 20:15:17,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 20:15:17,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:15:17,855 INFO L87 Difference]: Start difference. First operand 131 states and 171 transitions. Second operand 9 states. [2019-09-03 20:15:18,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:15:18,098 INFO L93 Difference]: Finished difference Result 179 states and 240 transitions. [2019-09-03 20:15:18,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:15:18,098 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2019-09-03 20:15:18,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:15:18,100 INFO L225 Difference]: With dead ends: 179 [2019-09-03 20:15:18,100 INFO L226 Difference]: Without dead ends: 176 [2019-09-03 20:15:18,101 INFO L628 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-03 20:15:18,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-09-03 20:15:18,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 145. [2019-09-03 20:15:18,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-09-03 20:15:18,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 190 transitions. [2019-09-03 20:15:18,119 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 190 transitions. Word has length 91 [2019-09-03 20:15:18,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:15:18,120 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 190 transitions. [2019-09-03 20:15:18,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 20:15:18,120 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 190 transitions. [2019-09-03 20:15:18,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-03 20:15:18,121 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:15:18,121 INFO L399 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-03 20:15:18,122 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:15:18,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:15:18,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1652186987, now seen corresponding path program 3 times [2019-09-03 20:15:18,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:15:18,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:15:18,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:18,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:15:18,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:18,128 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:15:18,128 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:15:18,128 INFO L223 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) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:15:18,142 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:15:18,165 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 20:15:18,165 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:15:18,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 20:15:18,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:15:18,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:15:18,318 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-03 20:15:18,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:15:18,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-03 20:15:18,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 20:15:18,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 20:15:18,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:15:18,324 INFO L87 Difference]: Start difference. First operand 145 states and 190 transitions. Second operand 10 states. [2019-09-03 20:15:18,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:15:18,633 INFO L93 Difference]: Finished difference Result 155 states and 202 transitions. [2019-09-03 20:15:18,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 20:15:18,633 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 98 [2019-09-03 20:15:18,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:15:18,634 INFO L225 Difference]: With dead ends: 155 [2019-09-03 20:15:18,634 INFO L226 Difference]: Without dead ends: 0 [2019-09-03 20:15:18,636 INFO L628 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-03 20:15:18,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-03 20:15:18,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-03 20:15:18,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-03 20:15:18,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-03 20:15:18,637 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 98 [2019-09-03 20:15:18,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:15:18,638 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-03 20:15:18,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 20:15:18,638 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-03 20:15:18,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-03 20:15:18,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-03 20:15:19,191 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-03 20:15:19,191 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-03 20:15:19,191 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-03 20:15:19,191 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-03 20:15:19,192 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-03 20:15:19,192 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-03 20:15:19,192 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-03 20:15:19,192 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-03 20:15:19,192 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 17 58) no Hoare annotation was computed. [2019-09-03 20:15:19,192 INFO L443 ceAbstractionStarter]: For program point L56(line 56) no Hoare annotation was computed. [2019-09-03 20:15:19,193 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 17 58) no Hoare annotation was computed. [2019-09-03 20:15:19,193 INFO L443 ceAbstractionStarter]: For program point L42(lines 39 51) no Hoare annotation was computed. [2019-09-03 20:15:19,193 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-03 20:15:19,193 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-03 20:15:19,193 INFO L443 ceAbstractionStarter]: For program point L32(lines 30 54) no Hoare annotation was computed. [2019-09-03 20:15:19,193 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 17 58) the Hoare annotation is: true [2019-09-03 20:15:19,194 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-03 20:15:19,194 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-03 20:15:19,194 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-03 20:15:19,194 INFO L443 ceAbstractionStarter]: For program point L47-1(line 47) no Hoare annotation was computed. [2019-09-03 20:15:19,194 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-03 20:15:19,195 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-03 20:15:19,195 INFO L443 ceAbstractionStarter]: For program point L39-3(lines 39 51) no Hoare annotation was computed. [2019-09-03 20:15:19,195 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2019-09-03 20:15:19,195 INFO L443 ceAbstractionStarter]: For program point L11(lines 11 12) no Hoare annotation was computed. [2019-09-03 20:15:19,195 INFO L443 ceAbstractionStarter]: For program point L10(lines 10 13) no Hoare annotation was computed. [2019-09-03 20:15:19,195 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2019-09-03 20:15:19,195 INFO L443 ceAbstractionStarter]: For program point L10-2(lines 9 15) no Hoare annotation was computed. [2019-09-03 20:15:19,196 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2019-09-03 20:15:19,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 08:15:19 BoogieIcfgContainer [2019-09-03 20:15:19,212 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 20:15:19,215 INFO L168 Benchmark]: Toolchain (without parser) took 5811.19 ms. Allocated memory was 140.0 MB in the beginning and 310.9 MB in the end (delta: 170.9 MB). Free memory was 87.6 MB in the beginning and 187.1 MB in the end (delta: -99.4 MB). Peak memory consumption was 71.5 MB. Max. memory is 7.1 GB. [2019-09-03 20:15:19,216 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 140.0 MB. Free memory was 106.0 MB in the beginning and 105.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-03 20:15:19,217 INFO L168 Benchmark]: CACSL2BoogieTranslator took 259.28 ms. Allocated memory is still 140.0 MB. Free memory was 87.4 MB in the beginning and 77.9 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2019-09-03 20:15:19,218 INFO L168 Benchmark]: Boogie Preprocessor took 124.53 ms. Allocated memory was 140.0 MB in the beginning and 199.2 MB in the end (delta: 59.2 MB). Free memory was 77.9 MB in the beginning and 177.2 MB in the end (delta: -99.3 MB). Peak memory consumption was 11.7 MB. Max. memory is 7.1 GB. [2019-09-03 20:15:19,218 INFO L168 Benchmark]: RCFGBuilder took 236.18 ms. Allocated memory is still 199.2 MB. Free memory was 177.2 MB in the beginning and 164.6 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. [2019-09-03 20:15:19,219 INFO L168 Benchmark]: TraceAbstraction took 5187.15 ms. Allocated memory was 199.2 MB in the beginning and 310.9 MB in the end (delta: 111.7 MB). Free memory was 164.6 MB in the beginning and 187.1 MB in the end (delta: -22.5 MB). Peak memory consumption was 89.2 MB. Max. memory is 7.1 GB. [2019-09-03 20:15:19,223 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.40 ms. Allocated memory is still 140.0 MB. Free memory was 106.0 MB in the beginning and 105.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 259.28 ms. Allocated memory is still 140.0 MB. Free memory was 87.4 MB in the beginning and 77.9 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 124.53 ms. Allocated memory was 140.0 MB in the beginning and 199.2 MB in the end (delta: 59.2 MB). Free memory was 77.9 MB in the beginning and 177.2 MB in the end (delta: -99.3 MB). Peak memory consumption was 11.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 236.18 ms. Allocated memory is still 199.2 MB. Free memory was 177.2 MB in the beginning and 164.6 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5187.15 ms. Allocated memory was 199.2 MB in the beginning and 310.9 MB in the end (delta: 111.7 MB). Free memory was 164.6 MB in the beginning and 187.1 MB in the end (delta: -22.5 MB). Peak memory consumption was 89.2 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.0s OverallTime, 13 OverallIterations, 16 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 460 SDtfs, 212 SDslu, 1255 SDs, 0 SdLazy, 1130 SolverSat, 148 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s 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.3s 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...