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/egcd2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 20:16:49,973 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:16:49,975 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:16:49,987 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:16:49,987 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:16:49,988 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:16:49,989 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:16:49,991 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:16:49,993 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:16:49,994 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:16:49,994 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:16:49,996 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:16:49,996 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:16:49,997 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:16:49,998 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:16:49,999 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:16:50,000 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:16:50,001 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:16:50,002 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:16:50,004 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:16:50,006 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:16:50,007 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:16:50,008 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:16:50,009 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:16:50,011 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:16:50,011 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:16:50,011 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:16:50,012 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:16:50,012 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:16:50,013 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:16:50,014 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:16:50,014 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:16:50,015 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:16:50,016 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:16:50,017 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:16:50,017 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:16:50,018 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:16:50,018 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:16:50,018 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:16:50,019 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:16:50,020 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:16:50,021 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:16:50,043 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:16:50,043 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:16:50,047 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 20:16:50,047 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 20:16:50,047 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 20:16:50,048 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:16:50,048 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:16:50,048 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 20:16:50,048 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:16:50,048 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:16:50,049 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:16:50,049 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:16:50,049 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:16:50,050 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:16:50,051 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:16:50,051 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 20:16:50,051 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:16:50,051 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:16:50,051 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:16:50,052 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 20:16:50,052 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 20:16:50,052 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:16:50,053 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:16:50,053 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:16:50,054 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 20:16:50,054 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 20:16:50,054 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:16:50,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:16:50,054 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 20:16:50,095 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:16:50,109 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:16:50,114 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:16:50,116 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:16:50,116 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:16:50,117 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/egcd2.c [2019-09-03 20:16:50,194 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7331a1d01/796fd4649444478bb0db084eab0f8c81/FLAG8d1c60dbd [2019-09-03 20:16:50,659 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:16:50,661 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/egcd2.c [2019-09-03 20:16:50,671 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7331a1d01/796fd4649444478bb0db084eab0f8c81/FLAG8d1c60dbd [2019-09-03 20:16:51,036 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7331a1d01/796fd4649444478bb0db084eab0f8c81 [2019-09-03 20:16:51,046 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:16:51,048 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:16:51,049 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:16:51,050 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:16:51,053 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:16:51,054 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:16:51" (1/1) ... [2019-09-03 20:16:51,057 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a823ade and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:16:51, skipping insertion in model container [2019-09-03 20:16:51,057 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:16:51" (1/1) ... [2019-09-03 20:16:51,065 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:16:51,085 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:16:51,308 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:16:51,322 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:16:51,370 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:16:51,507 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:16:51,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:16:51 WrapperNode [2019-09-03 20:16:51,508 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:16:51,509 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:16:51,509 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:16:51,509 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:16:51,522 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:16:51" (1/1) ... [2019-09-03 20:16:51,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:16:51" (1/1) ... [2019-09-03 20:16:51,529 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:16:51" (1/1) ... [2019-09-03 20:16:51,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:16:51" (1/1) ... [2019-09-03 20:16:51,534 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:16:51" (1/1) ... [2019-09-03 20:16:51,542 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:16:51" (1/1) ... [2019-09-03 20:16:51,543 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:16:51" (1/1) ... [2019-09-03 20:16:51,548 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:16:51,549 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:16:51,549 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:16:51,549 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:16:51,555 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:16:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:16:51,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:16:51,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:16:51,618 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 20:16:51,618 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:16:51,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:16:51,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 20:16:51,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 20:16:51,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:16:51,619 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:16:51,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:16:51,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:16:51,821 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:16:51,821 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-03 20:16:51,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:16:51 BoogieIcfgContainer [2019-09-03 20:16:51,823 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:16:51,824 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:16:51,824 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:16:51,827 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:16:51,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:16:51" (1/3) ... [2019-09-03 20:16:51,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e49fe95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:16:51, skipping insertion in model container [2019-09-03 20:16:51,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:16:51" (2/3) ... [2019-09-03 20:16:51,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e49fe95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:16:51, skipping insertion in model container [2019-09-03 20:16:51,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:16:51" (3/3) ... [2019-09-03 20:16:51,830 INFO L109 eAbstractionObserver]: Analyzing ICFG egcd2.c [2019-09-03 20:16:51,839 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:16:51,846 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 20:16:51,863 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 20:16:51,892 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 20:16:51,893 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:16:51,893 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 20:16:51,893 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:16:51,894 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:16:51,894 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:16:51,894 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:16:51,894 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:16:51,894 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:16:51,910 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-09-03 20:16:51,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 20:16:51,915 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:16:51,916 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:16:51,917 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:16:51,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:16:51,922 INFO L82 PathProgramCache]: Analyzing trace with hash -558324168, now seen corresponding path program 1 times [2019-09-03 20:16:51,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:16:51,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:16:51,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:51,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:16:51,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:52,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:16:52,037 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:16:52,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:16:52,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 20:16:52,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 20:16:52,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 20:16:52,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 20:16:52,056 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2019-09-03 20:16:52,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:16:52,078 INFO L93 Difference]: Finished difference Result 49 states and 77 transitions. [2019-09-03 20:16:52,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 20:16:52,079 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-03 20:16:52,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:16:52,090 INFO L225 Difference]: With dead ends: 49 [2019-09-03 20:16:52,090 INFO L226 Difference]: Without dead ends: 22 [2019-09-03 20:16:52,096 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:16:52,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-03 20:16:52,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-03 20:16:52,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-03 20:16:52,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2019-09-03 20:16:52,146 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 10 [2019-09-03 20:16:52,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:16:52,146 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-09-03 20:16:52,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 20:16:52,147 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2019-09-03 20:16:52,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-03 20:16:52,148 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:16:52,148 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:16:52,151 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:16:52,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:16:52,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1008536757, now seen corresponding path program 1 times [2019-09-03 20:16:52,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:16:52,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:16:52,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:52,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:16:52,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:52,172 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:16:52,172 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:16:52,172 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:16:52,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:16:52,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:16:52,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-03 20:16:52,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:16:52,250 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:16:52,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:16:52,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:16:52,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:16:52,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:16:52,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:16:52,258 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand 3 states. [2019-09-03 20:16:52,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:16:52,339 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2019-09-03 20:16:52,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:16:52,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-09-03 20:16:52,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:16:52,342 INFO L225 Difference]: With dead ends: 39 [2019-09-03 20:16:52,342 INFO L226 Difference]: Without dead ends: 31 [2019-09-03 20:16:52,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:16:52,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-03 20:16:52,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2019-09-03 20:16:52,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-03 20:16:52,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2019-09-03 20:16:52,356 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 11 [2019-09-03 20:16:52,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:16:52,357 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-09-03 20:16:52,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:16:52,357 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2019-09-03 20:16:52,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 20:16:52,358 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:16:52,358 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:16:52,358 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:16:52,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:16:52,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1182801044, now seen corresponding path program 1 times [2019-09-03 20:16:52,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:16:52,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:16:52,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:52,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:16:52,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:52,373 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:16:52,373 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:16:52,376 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:16:52,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:16:52,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:16:52,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 20:16:52,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:16:52,469 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:16:52,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:16:52,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:16:52,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:16:52,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:16:52,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:16:52,475 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand 5 states. [2019-09-03 20:16:52,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:16:52,582 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2019-09-03 20:16:52,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:16:52,583 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-09-03 20:16:52,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:16:52,584 INFO L225 Difference]: With dead ends: 37 [2019-09-03 20:16:52,584 INFO L226 Difference]: Without dead ends: 35 [2019-09-03 20:16:52,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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:16:52,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-03 20:16:52,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2019-09-03 20:16:52,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-03 20:16:52,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-09-03 20:16:52,596 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 12 [2019-09-03 20:16:52,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:16:52,596 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-09-03 20:16:52,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:16:52,597 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2019-09-03 20:16:52,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 20:16:52,597 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:16:52,598 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:16:52,598 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:16:52,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:16:52,598 INFO L82 PathProgramCache]: Analyzing trace with hash -2031293851, now seen corresponding path program 1 times [2019-09-03 20:16:52,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:16:52,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:16:52,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:52,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:16:52,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:52,607 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:16:52,608 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:16:52,608 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:16:52,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:16:52,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:16:52,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 20:16:52,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:16:52,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:16:52,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:16:52,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:16:52,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:16:52,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:16:52,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:16:52,684 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 5 states. [2019-09-03 20:16:52,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:16:52,782 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2019-09-03 20:16:52,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:16:52,787 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-03 20:16:52,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:16:52,792 INFO L225 Difference]: With dead ends: 45 [2019-09-03 20:16:52,792 INFO L226 Difference]: Without dead ends: 43 [2019-09-03 20:16:52,793 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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:16:52,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-03 20:16:52,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-09-03 20:16:52,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-03 20:16:52,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2019-09-03 20:16:52,816 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 17 [2019-09-03 20:16:52,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:16:52,819 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2019-09-03 20:16:52,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:16:52,819 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2019-09-03 20:16:52,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-03 20:16:52,820 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:16:52,820 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:16:52,821 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:16:52,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:16:52,821 INFO L82 PathProgramCache]: Analyzing trace with hash -71864628, now seen corresponding path program 1 times [2019-09-03 20:16:52,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:16:52,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:16:52,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:52,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:16:52,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:52,840 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:16:52,840 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:16:52,840 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) [2019-09-03 20:16:52,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:16:52,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:16:52,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 20:16:52,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:16:52,909 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:16:52,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:16:52,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:16:52,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:16:52,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:16:52,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:16:52,915 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand 5 states. [2019-09-03 20:16:53,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:16:53,192 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2019-09-03 20:16:53,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:16:53,192 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-09-03 20:16:53,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:16:53,195 INFO L225 Difference]: With dead ends: 49 [2019-09-03 20:16:53,195 INFO L226 Difference]: Without dead ends: 47 [2019-09-03 20:16:53,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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:16:53,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-03 20:16:53,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-09-03 20:16:53,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-03 20:16:53,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2019-09-03 20:16:53,207 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 22 [2019-09-03 20:16:53,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:16:53,207 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2019-09-03 20:16:53,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:16:53,208 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2019-09-03 20:16:53,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-03 20:16:53,209 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:16:53,209 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:16:53,210 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:16:53,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:16:53,210 INFO L82 PathProgramCache]: Analyzing trace with hash 954332139, now seen corresponding path program 1 times [2019-09-03 20:16:53,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:16:53,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:16:53,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:53,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:16:53,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:53,218 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:16:53,219 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:16:53,219 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:16:53,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:16:53,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:16:53,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 20:16:53,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:16:53,339 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 20:16:53,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:16:53,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-09-03 20:16:53,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:16:53,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:16:53,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:16:53,346 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand 6 states. [2019-09-03 20:16:53,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:16:53,508 INFO L93 Difference]: Finished difference Result 74 states and 101 transitions. [2019-09-03 20:16:53,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:16:53,508 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-09-03 20:16:53,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:16:53,510 INFO L225 Difference]: With dead ends: 74 [2019-09-03 20:16:53,510 INFO L226 Difference]: Without dead ends: 72 [2019-09-03 20:16:53,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:16:53,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-03 20:16:53,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 62. [2019-09-03 20:16:53,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-03 20:16:53,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 81 transitions. [2019-09-03 20:16:53,526 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 81 transitions. Word has length 34 [2019-09-03 20:16:53,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:16:53,527 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 81 transitions. [2019-09-03 20:16:53,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:16:53,527 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 81 transitions. [2019-09-03 20:16:53,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-03 20:16:53,528 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:16:53,528 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 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:16:53,529 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:16:53,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:16:53,529 INFO L82 PathProgramCache]: Analyzing trace with hash 286726549, now seen corresponding path program 1 times [2019-09-03 20:16:53,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:16:53,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:16:53,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:53,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:16:53,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:53,542 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:16:53,542 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:16:53,542 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) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:16:53,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:16:53,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:16:53,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 20:16:53,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:16:53,623 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 20:16:53,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:16:53,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-09-03 20:16:53,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:16:53,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:16:53,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:16:53,627 INFO L87 Difference]: Start difference. First operand 62 states and 81 transitions. Second operand 5 states. [2019-09-03 20:16:53,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:16:53,735 INFO L93 Difference]: Finished difference Result 107 states and 151 transitions. [2019-09-03 20:16:53,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:16:53,736 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-09-03 20:16:53,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:16:53,738 INFO L225 Difference]: With dead ends: 107 [2019-09-03 20:16:53,738 INFO L226 Difference]: Without dead ends: 99 [2019-09-03 20:16:53,738 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:16:53,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-03 20:16:53,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2019-09-03 20:16:53,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-03 20:16:53,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 124 transitions. [2019-09-03 20:16:53,775 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 124 transitions. Word has length 36 [2019-09-03 20:16:53,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:16:53,776 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 124 transitions. [2019-09-03 20:16:53,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:16:53,776 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 124 transitions. [2019-09-03 20:16:53,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-03 20:16:53,779 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:16:53,779 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:16:53,780 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:16:53,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:16:53,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1803964113, now seen corresponding path program 1 times [2019-09-03 20:16:53,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:16:53,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:16:53,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:53,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:16:53,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:53,791 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:16:53,794 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:16:53,794 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) [2019-09-03 20:16:53,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:16:53,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:16:53,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-03 20:16:53,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:16:53,910 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 20:16:53,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:16:53,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-09-03 20:16:53,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:16:53,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:16:53,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:16:53,916 INFO L87 Difference]: Start difference. First operand 88 states and 124 transitions. Second operand 6 states. [2019-09-03 20:16:54,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:16:54,061 INFO L93 Difference]: Finished difference Result 133 states and 192 transitions. [2019-09-03 20:16:54,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:16:54,062 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-09-03 20:16:54,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:16:54,064 INFO L225 Difference]: With dead ends: 133 [2019-09-03 20:16:54,064 INFO L226 Difference]: Without dead ends: 130 [2019-09-03 20:16:54,065 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:16:54,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-09-03 20:16:54,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2019-09-03 20:16:54,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-09-03 20:16:54,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 185 transitions. [2019-09-03 20:16:54,090 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 185 transitions. Word has length 42 [2019-09-03 20:16:54,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:16:54,091 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 185 transitions. [2019-09-03 20:16:54,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:16:54,091 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 185 transitions. [2019-09-03 20:16:54,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-03 20:16:54,092 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:16:54,093 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:16:54,093 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:16:54,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:16:54,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1108781502, now seen corresponding path program 2 times [2019-09-03 20:16:54,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:16:54,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:16:54,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:54,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:16:54,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:54,100 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:16:54,100 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:16:54,101 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) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:16:54,119 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:16:54,143 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:16:54,143 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:16:54,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-03 20:16:54,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:16:54,228 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:16:54,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:16:54,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-09-03 20:16:54,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:16:54,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:16:54,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:16:54,236 INFO L87 Difference]: Start difference. First operand 127 states and 185 transitions. Second operand 7 states. [2019-09-03 20:16:54,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:16:54,425 INFO L93 Difference]: Finished difference Result 139 states and 195 transitions. [2019-09-03 20:16:54,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:16:54,426 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-09-03 20:16:54,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:16:54,429 INFO L225 Difference]: With dead ends: 139 [2019-09-03 20:16:54,429 INFO L226 Difference]: Without dead ends: 137 [2019-09-03 20:16:54,429 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:16:54,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-09-03 20:16:54,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2019-09-03 20:16:54,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-09-03 20:16:54,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 191 transitions. [2019-09-03 20:16:54,452 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 191 transitions. Word has length 47 [2019-09-03 20:16:54,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:16:54,453 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 191 transitions. [2019-09-03 20:16:54,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:16:54,453 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 191 transitions. [2019-09-03 20:16:54,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-03 20:16:54,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:16:54,456 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:16:54,456 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:16:54,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:16:54,456 INFO L82 PathProgramCache]: Analyzing trace with hash 183700266, now seen corresponding path program 2 times [2019-09-03 20:16:54,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:16:54,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:16:54,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:54,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:16:54,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:54,463 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:16:54,463 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:16:54,463 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) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:16:54,489 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:16:54,516 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:16:54,517 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:16:54,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-03 20:16:54,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:16:54,577 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:16:54,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:16:54,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-09-03 20:16:54,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:16:54,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:16:54,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:16:54,581 INFO L87 Difference]: Start difference. First operand 135 states and 191 transitions. Second operand 7 states. [2019-09-03 20:16:54,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:16:54,793 INFO L93 Difference]: Finished difference Result 198 states and 298 transitions. [2019-09-03 20:16:54,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:16:54,793 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-09-03 20:16:54,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:16:54,800 INFO L225 Difference]: With dead ends: 198 [2019-09-03 20:16:54,800 INFO L226 Difference]: Without dead ends: 196 [2019-09-03 20:16:54,801 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:16:54,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-09-03 20:16:54,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 169. [2019-09-03 20:16:54,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-09-03 20:16:54,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 249 transitions. [2019-09-03 20:16:54,857 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 249 transitions. Word has length 56 [2019-09-03 20:16:54,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:16:54,858 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 249 transitions. [2019-09-03 20:16:54,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:16:54,858 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 249 transitions. [2019-09-03 20:16:54,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-03 20:16:54,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:16:54,863 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:16:54,864 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:16:54,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:16:54,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1556128492, now seen corresponding path program 1 times [2019-09-03 20:16:54,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:16:54,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:16:54,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:54,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:16:54,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:54,873 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:16:54,873 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:16:54,873 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:16:54,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:16:54,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:16:54,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-03 20:16:54,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:16:55,041 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:16:55,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:16:55,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-09-03 20:16:55,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 20:16:55,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 20:16:55,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:16:55,052 INFO L87 Difference]: Start difference. First operand 169 states and 249 transitions. Second operand 9 states. [2019-09-03 20:16:55,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:16:55,391 INFO L93 Difference]: Finished difference Result 205 states and 300 transitions. [2019-09-03 20:16:55,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:16:55,391 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-09-03 20:16:55,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:16:55,404 INFO L225 Difference]: With dead ends: 205 [2019-09-03 20:16:55,404 INFO L226 Difference]: Without dead ends: 202 [2019-09-03 20:16:55,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-09-03 20:16:55,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-09-03 20:16:55,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2019-09-03 20:16:55,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-03 20:16:55,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 294 transitions. [2019-09-03 20:16:55,443 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 294 transitions. Word has length 58 [2019-09-03 20:16:55,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:16:55,443 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 294 transitions. [2019-09-03 20:16:55,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 20:16:55,445 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 294 transitions. [2019-09-03 20:16:55,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-03 20:16:55,450 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:16:55,451 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 9, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:16:55,451 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:16:55,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:16:55,451 INFO L82 PathProgramCache]: Analyzing trace with hash 674447781, now seen corresponding path program 3 times [2019-09-03 20:16:55,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:16:55,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:16:55,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:55,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:16:55,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:55,466 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:16:55,466 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:16:55,466 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:16:55,480 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:16:55,502 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 20:16:55,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:16:55,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 20:16:55,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:16:55,543 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:16:55,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:16:55,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:16:55,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:16:55,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:16:55,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:16:55,548 INFO L87 Difference]: Start difference. First operand 200 states and 294 transitions. Second operand 5 states. [2019-09-03 20:16:55,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:16:55,653 INFO L93 Difference]: Finished difference Result 252 states and 366 transitions. [2019-09-03 20:16:55,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:16:55,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-09-03 20:16:55,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:16:55,660 INFO L225 Difference]: With dead ends: 252 [2019-09-03 20:16:55,660 INFO L226 Difference]: Without dead ends: 177 [2019-09-03 20:16:55,668 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:16:55,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-09-03 20:16:55,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 141. [2019-09-03 20:16:55,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-09-03 20:16:55,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 195 transitions. [2019-09-03 20:16:55,689 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 195 transitions. Word has length 67 [2019-09-03 20:16:55,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:16:55,689 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 195 transitions. [2019-09-03 20:16:55,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:16:55,690 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 195 transitions. [2019-09-03 20:16:55,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-03 20:16:55,691 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:16:55,692 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:16:55,692 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:16:55,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:16:55,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1094555945, now seen corresponding path program 3 times [2019-09-03 20:16:55,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:16:55,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:16:55,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:55,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:16:55,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:55,708 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:16:55,708 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:16:55,708 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) [2019-09-03 20:16:55,729 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:16:55,750 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 20:16:55,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:16:55,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 20:16:55,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:16:55,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:16:55,823 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 61 proven. 10 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2019-09-03 20:16:55,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:16:55,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-09-03 20:16:55,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 20:16:55,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 20:16:55,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:16:55,828 INFO L87 Difference]: Start difference. First operand 141 states and 195 transitions. Second operand 8 states. [2019-09-03 20:16:56,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:16:56,042 INFO L93 Difference]: Finished difference Result 151 states and 203 transitions. [2019-09-03 20:16:56,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:16:56,042 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2019-09-03 20:16:56,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:16:56,044 INFO L225 Difference]: With dead ends: 151 [2019-09-03 20:16:56,044 INFO L226 Difference]: Without dead ends: 149 [2019-09-03 20:16:56,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:16:56,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-09-03 20:16:56,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 143. [2019-09-03 20:16:56,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-09-03 20:16:56,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 195 transitions. [2019-09-03 20:16:56,061 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 195 transitions. Word has length 78 [2019-09-03 20:16:56,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:16:56,062 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 195 transitions. [2019-09-03 20:16:56,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 20:16:56,062 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 195 transitions. [2019-09-03 20:16:56,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-03 20:16:56,063 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:16:56,063 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:16:56,063 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:16:56,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:16:56,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1897817939, now seen corresponding path program 2 times [2019-09-03 20:16:56,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:16:56,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:16:56,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:56,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:16:56,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:56,069 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:16:56,069 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:16:56,069 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:16:56,091 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:16:56,127 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:16:56,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:16:56,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-03 20:16:56,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:16:56,442 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 24 proven. 20 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:16:56,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:16:56,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-03 20:16:56,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 20:16:56,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 20:16:56,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:16:56,455 INFO L87 Difference]: Start difference. First operand 143 states and 195 transitions. Second operand 10 states. [2019-09-03 20:16:56,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:16:56,892 INFO L93 Difference]: Finished difference Result 185 states and 256 transitions. [2019-09-03 20:16:56,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 20:16:56,893 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 80 [2019-09-03 20:16:56,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:16:56,895 INFO L225 Difference]: With dead ends: 185 [2019-09-03 20:16:56,895 INFO L226 Difference]: Without dead ends: 182 [2019-09-03 20:16:56,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-09-03 20:16:56,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-03 20:16:56,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 153. [2019-09-03 20:16:56,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-09-03 20:16:56,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 209 transitions. [2019-09-03 20:16:56,912 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 209 transitions. Word has length 80 [2019-09-03 20:16:56,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:16:56,913 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 209 transitions. [2019-09-03 20:16:56,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 20:16:56,913 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 209 transitions. [2019-09-03 20:16:56,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-03 20:16:56,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:16:56,914 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:16:56,915 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:16:56,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:16:56,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1613054346, now seen corresponding path program 3 times [2019-09-03 20:16:56,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:16:56,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:16:56,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:56,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:16:56,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:56,921 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:16:56,921 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:16:56,921 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:16:56,948 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:16:56,974 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 20:16:56,974 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:16:56,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-03 20:16:56,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:16:57,024 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 40 proven. 9 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:16:57,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:16:57,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-09-03 20:16:57,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:16:57,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:16:57,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:16:57,030 INFO L87 Difference]: Start difference. First operand 153 states and 209 transitions. Second operand 7 states. [2019-09-03 20:16:57,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:16:57,337 INFO L93 Difference]: Finished difference Result 185 states and 257 transitions. [2019-09-03 20:16:57,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 20:16:57,338 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-09-03 20:16:57,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:16:57,340 INFO L225 Difference]: With dead ends: 185 [2019-09-03 20:16:57,340 INFO L226 Difference]: Without dead ends: 177 [2019-09-03 20:16:57,340 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2019-09-03 20:16:57,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-09-03 20:16:57,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 156. [2019-09-03 20:16:57,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-09-03 20:16:57,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 212 transitions. [2019-09-03 20:16:57,358 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 212 transitions. Word has length 83 [2019-09-03 20:16:57,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:16:57,359 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 212 transitions. [2019-09-03 20:16:57,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:16:57,359 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 212 transitions. [2019-09-03 20:16:57,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-03 20:16:57,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:16:57,360 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 13, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:16:57,361 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:16:57,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:16:57,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1805300380, now seen corresponding path program 1 times [2019-09-03 20:16:57,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:16:57,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:16:57,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:57,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:16:57,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:57,368 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:16:57,368 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:16:57,368 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-03 20:16:57,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:16:57,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:16:57,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 20:16:57,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:16:57,569 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 26 proven. 28 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2019-09-03 20:16:57,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:16:57,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-09-03 20:16:57,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 20:16:57,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 20:16:57,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:16:57,584 INFO L87 Difference]: Start difference. First operand 156 states and 212 transitions. Second operand 8 states. [2019-09-03 20:16:57,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:16:57,913 INFO L93 Difference]: Finished difference Result 219 states and 305 transitions. [2019-09-03 20:16:57,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:16:57,914 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 89 [2019-09-03 20:16:57,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:16:57,916 INFO L225 Difference]: With dead ends: 219 [2019-09-03 20:16:57,916 INFO L226 Difference]: Without dead ends: 216 [2019-09-03 20:16:57,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:16:57,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-09-03 20:16:57,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 213. [2019-09-03 20:16:57,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-09-03 20:16:57,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 298 transitions. [2019-09-03 20:16:57,945 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 298 transitions. Word has length 89 [2019-09-03 20:16:57,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:16:57,945 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 298 transitions. [2019-09-03 20:16:57,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 20:16:57,945 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 298 transitions. [2019-09-03 20:16:57,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-03 20:16:57,947 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:16:57,947 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 14, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:16:57,947 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:16:57,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:16:57,948 INFO L82 PathProgramCache]: Analyzing trace with hash -2024795347, now seen corresponding path program 2 times [2019-09-03 20:16:57,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:16:57,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:16:57,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:57,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:16:57,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:57,958 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:16:57,959 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:16:57,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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-03 20:16:57,980 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:16:58,018 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:16:58,018 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:16:58,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-03 20:16:58,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:16:58,186 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 28 proven. 37 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:16:58,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:16:58,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-03 20:16:58,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 20:16:58,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 20:16:58,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:16:58,190 INFO L87 Difference]: Start difference. First operand 213 states and 298 transitions. Second operand 10 states. [2019-09-03 20:16:58,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:16:58,627 INFO L93 Difference]: Finished difference Result 253 states and 349 transitions. [2019-09-03 20:16:58,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 20:16:58,627 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-09-03 20:16:58,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:16:58,630 INFO L225 Difference]: With dead ends: 253 [2019-09-03 20:16:58,630 INFO L226 Difference]: Without dead ends: 251 [2019-09-03 20:16:58,631 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-09-03 20:16:58,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-09-03 20:16:58,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 195. [2019-09-03 20:16:58,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-03 20:16:58,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 262 transitions. [2019-09-03 20:16:58,658 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 262 transitions. Word has length 94 [2019-09-03 20:16:58,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:16:58,658 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 262 transitions. [2019-09-03 20:16:58,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 20:16:58,659 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 262 transitions. [2019-09-03 20:16:58,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-03 20:16:58,660 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:16:58,660 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 16, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:16:58,660 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:16:58,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:16:58,661 INFO L82 PathProgramCache]: Analyzing trace with hash 804169810, now seen corresponding path program 4 times [2019-09-03 20:16:58,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:16:58,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:16:58,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:58,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:16:58,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:58,672 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:16:58,672 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:16:58,672 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-03 20:16:58,686 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:16:58,716 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:16:58,716 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:16:58,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-03 20:16:58,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:16:58,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:16:59,034 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 31 proven. 156 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2019-09-03 20:16:59,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:16:59,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-09-03 20:16:59,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 20:16:59,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 20:16:59,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-09-03 20:16:59,040 INFO L87 Difference]: Start difference. First operand 195 states and 262 transitions. Second operand 14 states. [2019-09-03 20:16:59,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:16:59,957 INFO L93 Difference]: Finished difference Result 267 states and 383 transitions. [2019-09-03 20:16:59,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 20:16:59,958 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 102 [2019-09-03 20:16:59,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:16:59,961 INFO L225 Difference]: With dead ends: 267 [2019-09-03 20:16:59,961 INFO L226 Difference]: Without dead ends: 264 [2019-09-03 20:16:59,962 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2019-09-03 20:16:59,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-09-03 20:17:00,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 260. [2019-09-03 20:17:00,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-03 20:17:00,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 375 transitions. [2019-09-03 20:17:00,030 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 375 transitions. Word has length 102 [2019-09-03 20:17:00,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:17:00,031 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 375 transitions. [2019-09-03 20:17:00,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 20:17:00,031 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 375 transitions. [2019-09-03 20:17:00,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-03 20:17:00,037 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:17:00,037 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 16, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:17:00,037 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:17:00,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:17:00,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1563777377, now seen corresponding path program 3 times [2019-09-03 20:17:00,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:17:00,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:17:00,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:17:00,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:17:00,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:17:00,052 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:17:00,053 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:17:00,053 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:17:00,076 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:17:00,119 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 20:17:00,119 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:17:00,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 20:17:00,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:17:00,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:17:00,230 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 81 proven. 32 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2019-09-03 20:17:00,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:17:00,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-03 20:17:00,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 20:17:00,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 20:17:00,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:17:00,236 INFO L87 Difference]: Start difference. First operand 260 states and 375 transitions. Second operand 10 states. [2019-09-03 20:17:00,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:17:00,590 INFO L93 Difference]: Finished difference Result 273 states and 386 transitions. [2019-09-03 20:17:00,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 20:17:00,591 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 103 [2019-09-03 20:17:00,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:17:00,593 INFO L225 Difference]: With dead ends: 273 [2019-09-03 20:17:00,593 INFO L226 Difference]: Without dead ends: 271 [2019-09-03 20:17:00,594 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-03 20:17:00,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-09-03 20:17:00,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 268. [2019-09-03 20:17:00,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-03 20:17:00,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 381 transitions. [2019-09-03 20:17:00,643 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 381 transitions. Word has length 103 [2019-09-03 20:17:00,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:17:00,646 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 381 transitions. [2019-09-03 20:17:00,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 20:17:00,646 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 381 transitions. [2019-09-03 20:17:00,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-03 20:17:00,651 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:17:00,651 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 17, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:17:00,651 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:17:00,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:17:00,651 INFO L82 PathProgramCache]: Analyzing trace with hash 822393669, now seen corresponding path program 4 times [2019-09-03 20:17:00,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:17:00,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:17:00,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:17:00,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:17:00,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:17:00,662 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:17:00,662 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:17:00,662 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-03 20:17:00,686 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:17:00,720 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:17:00,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:17:00,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 20:17:00,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:17:00,809 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 70 proven. 105 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2019-09-03 20:17:00,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:17:00,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-03 20:17:00,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 20:17:00,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 20:17:00,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:17:00,815 INFO L87 Difference]: Start difference. First operand 268 states and 381 transitions. Second operand 10 states. [2019-09-03 20:17:01,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:17:01,124 INFO L93 Difference]: Finished difference Result 289 states and 398 transitions. [2019-09-03 20:17:01,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 20:17:01,124 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 111 [2019-09-03 20:17:01,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:17:01,126 INFO L225 Difference]: With dead ends: 289 [2019-09-03 20:17:01,127 INFO L226 Difference]: Without dead ends: 285 [2019-09-03 20:17:01,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2019-09-03 20:17:01,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-09-03 20:17:01,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 193. [2019-09-03 20:17:01,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-09-03 20:17:01,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 250 transitions. [2019-09-03 20:17:01,161 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 250 transitions. Word has length 111 [2019-09-03 20:17:01,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:17:01,161 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 250 transitions. [2019-09-03 20:17:01,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 20:17:01,162 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 250 transitions. [2019-09-03 20:17:01,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-03 20:17:01,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:17:01,163 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 20, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:17:01,164 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:17:01,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:17:01,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1081511953, now seen corresponding path program 5 times [2019-09-03 20:17:01,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:17:01,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:17:01,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:17:01,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:17:01,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:17:01,170 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:17:01,171 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:17:01,171 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-03 20:17:01,183 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:17:01,238 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-09-03 20:17:01,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:17:01,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-03 20:17:01,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:17:01,507 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 40 proven. 62 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 20:17:01,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:17:01,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-09-03 20:17:01,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 20:17:01,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 20:17:01,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:17:01,521 INFO L87 Difference]: Start difference. First operand 193 states and 250 transitions. Second operand 12 states. [2019-09-03 20:17:02,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:17:02,214 INFO L93 Difference]: Finished difference Result 253 states and 337 transitions. [2019-09-03 20:17:02,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 20:17:02,215 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 124 [2019-09-03 20:17:02,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:17:02,217 INFO L225 Difference]: With dead ends: 253 [2019-09-03 20:17:02,217 INFO L226 Difference]: Without dead ends: 250 [2019-09-03 20:17:02,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2019-09-03 20:17:02,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-09-03 20:17:02,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 203. [2019-09-03 20:17:02,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-03 20:17:02,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 264 transitions. [2019-09-03 20:17:02,250 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 264 transitions. Word has length 124 [2019-09-03 20:17:02,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:17:02,251 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 264 transitions. [2019-09-03 20:17:02,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 20:17:02,251 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 264 transitions. [2019-09-03 20:17:02,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-03 20:17:02,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:17:02,253 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 20, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:17:02,253 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:17:02,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:17:02,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1556105536, now seen corresponding path program 5 times [2019-09-03 20:17:02,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:17:02,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:17:02,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:17:02,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:17:02,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:17:02,258 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:17:02,259 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:17:02,259 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:17:02,274 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:17:02,342 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-09-03 20:17:02,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:17:02,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 20:17:02,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:17:02,408 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 80 proven. 24 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2019-09-03 20:17:02,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:17:02,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-09-03 20:17:02,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 20:17:02,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 20:17:02,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:17:02,413 INFO L87 Difference]: Start difference. First operand 203 states and 264 transitions. Second operand 8 states. [2019-09-03 20:17:02,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:17:02,711 INFO L93 Difference]: Finished difference Result 220 states and 278 transitions. [2019-09-03 20:17:02,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:17:02,712 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 125 [2019-09-03 20:17:02,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:17:02,714 INFO L225 Difference]: With dead ends: 220 [2019-09-03 20:17:02,714 INFO L226 Difference]: Without dead ends: 218 [2019-09-03 20:17:02,715 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:17:02,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-09-03 20:17:02,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 215. [2019-09-03 20:17:02,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-09-03 20:17:02,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 273 transitions. [2019-09-03 20:17:02,746 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 273 transitions. Word has length 125 [2019-09-03 20:17:02,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:17:02,746 INFO L475 AbstractCegarLoop]: Abstraction has 215 states and 273 transitions. [2019-09-03 20:17:02,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 20:17:02,746 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 273 transitions. [2019-09-03 20:17:02,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-03 20:17:02,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:17:02,748 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 24, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:17:02,749 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:17:02,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:17:02,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1040748176, now seen corresponding path program 6 times [2019-09-03 20:17:02,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:17:02,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:17:02,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:17:02,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:17:02,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:17:02,754 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:17:02,754 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:17:02,755 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:17:02,768 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:17:02,802 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-03 20:17:02,802 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:17:02,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 20:17:02,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:17:02,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:17:02,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1244 backedges. 107 proven. 32 refuted. 0 times theorem prover too weak. 1105 trivial. 0 not checked. [2019-09-03 20:17:02,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:17:02,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-03 20:17:02,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 20:17:02,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 20:17:02,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:17:02,970 INFO L87 Difference]: Start difference. First operand 215 states and 273 transitions. Second operand 10 states. [2019-09-03 20:17:03,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:17:03,284 INFO L93 Difference]: Finished difference Result 272 states and 355 transitions. [2019-09-03 20:17:03,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 20:17:03,284 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 146 [2019-09-03 20:17:03,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:17:03,286 INFO L225 Difference]: With dead ends: 272 [2019-09-03 20:17:03,286 INFO L226 Difference]: Without dead ends: 269 [2019-09-03 20:17:03,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-09-03 20:17:03,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-09-03 20:17:03,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 175. [2019-09-03 20:17:03,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-03 20:17:03,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 217 transitions. [2019-09-03 20:17:03,318 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 217 transitions. Word has length 146 [2019-09-03 20:17:03,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:17:03,321 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 217 transitions. [2019-09-03 20:17:03,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 20:17:03,321 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 217 transitions. [2019-09-03 20:17:03,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-03 20:17:03,323 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:17:03,323 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 24, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:17:03,324 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:17:03,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:17:03,324 INFO L82 PathProgramCache]: Analyzing trace with hash -218640321, now seen corresponding path program 6 times [2019-09-03 20:17:03,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:17:03,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:17:03,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:17:03,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:17:03,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:17:03,332 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:17:03,332 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:17:03,332 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-03 20:17:03,351 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:17:03,404 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-03 20:17:03,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:17:03,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 20:17:03,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:17:03,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 139 proven. 10 refuted. 0 times theorem prover too weak. 1107 trivial. 0 not checked. [2019-09-03 20:17:03,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:17:03,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-09-03 20:17:03,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:17:03,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:17:03,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:17:03,465 INFO L87 Difference]: Start difference. First operand 175 states and 217 transitions. Second operand 7 states. [2019-09-03 20:17:03,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:17:03,577 INFO L93 Difference]: Finished difference Result 181 states and 222 transitions. [2019-09-03 20:17:03,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:17:03,577 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 147 [2019-09-03 20:17:03,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:17:03,579 INFO L225 Difference]: With dead ends: 181 [2019-09-03 20:17:03,579 INFO L226 Difference]: Without dead ends: 179 [2019-09-03 20:17:03,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 140 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:17:03,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-09-03 20:17:03,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2019-09-03 20:17:03,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-09-03 20:17:03,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 220 transitions. [2019-09-03 20:17:03,611 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 220 transitions. Word has length 147 [2019-09-03 20:17:03,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:17:03,611 INFO L475 AbstractCegarLoop]: Abstraction has 179 states and 220 transitions. [2019-09-03 20:17:03,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:17:03,611 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 220 transitions. [2019-09-03 20:17:03,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-03 20:17:03,613 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:17:03,613 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 24, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:17:03,614 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:17:03,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:17:03,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1300397831, now seen corresponding path program 7 times [2019-09-03 20:17:03,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:17:03,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:17:03,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:17:03,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:17:03,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:17:03,624 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:17:03,624 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:17:03,624 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-03 20:17:03,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:17:03,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:17:03,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 67 conjunts are in the unsatisfiable core [2019-09-03 20:17:03,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:17:04,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1249 backedges. 48 proven. 97 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2019-09-03 20:17:04,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:17:04,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-09-03 20:17:04,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 20:17:04,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 20:17:04,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-03 20:17:04,025 INFO L87 Difference]: Start difference. First operand 179 states and 220 transitions. Second operand 14 states. [2019-09-03 20:17:04,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:17:04,954 INFO L93 Difference]: Finished difference Result 240 states and 308 transitions. [2019-09-03 20:17:04,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 20:17:04,955 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 149 [2019-09-03 20:17:04,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:17:04,957 INFO L225 Difference]: With dead ends: 240 [2019-09-03 20:17:04,957 INFO L226 Difference]: Without dead ends: 237 [2019-09-03 20:17:04,958 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2019-09-03 20:17:04,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-09-03 20:17:04,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 189. [2019-09-03 20:17:04,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-03 20:17:04,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 234 transitions. [2019-09-03 20:17:04,992 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 234 transitions. Word has length 149 [2019-09-03 20:17:04,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:17:04,993 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 234 transitions. [2019-09-03 20:17:04,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 20:17:04,993 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 234 transitions. [2019-09-03 20:17:04,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-03 20:17:04,995 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:17:04,995 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 28, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:17:04,996 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:17:04,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:17:04,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1997061882, now seen corresponding path program 8 times [2019-09-03 20:17:04,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:17:04,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:17:04,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:17:04,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:17:04,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:17:05,004 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:17:05,004 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:17:05,004 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-03 20:17:05,027 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:17:05,119 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:17:05,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:17:05,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-03 20:17:05,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:17:05,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1701 backedges. 56 proven. 133 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2019-09-03 20:17:05,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:17:05,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-09-03 20:17:05,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 20:17:05,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 20:17:05,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-09-03 20:17:05,647 INFO L87 Difference]: Start difference. First operand 189 states and 234 transitions. Second operand 15 states. [2019-09-03 20:17:06,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:17:06,777 INFO L93 Difference]: Finished difference Result 251 states and 323 transitions. [2019-09-03 20:17:06,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 20:17:06,777 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 171 [2019-09-03 20:17:06,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:17:06,779 INFO L225 Difference]: With dead ends: 251 [2019-09-03 20:17:06,779 INFO L226 Difference]: Without dead ends: 248 [2019-09-03 20:17:06,779 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2019-09-03 20:17:06,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-09-03 20:17:06,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 199. [2019-09-03 20:17:06,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-03 20:17:06,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 248 transitions. [2019-09-03 20:17:06,818 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 248 transitions. Word has length 171 [2019-09-03 20:17:06,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:17:06,818 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 248 transitions. [2019-09-03 20:17:06,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 20:17:06,818 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 248 transitions. [2019-09-03 20:17:06,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-03 20:17:06,821 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:17:06,821 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 28, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:17:06,821 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:17:06,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:17:06,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1873117848, now seen corresponding path program 9 times [2019-09-03 20:17:06,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:17:06,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:17:06,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:17:06,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:17:06,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:17:06,832 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:17:06,832 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:17:06,832 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-03 20:17:06,847 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:17:06,913 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 20:17:06,914 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:17:06,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-03 20:17:06,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:17:09,266 WARN L188 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 26 [2019-09-03 20:17:11,300 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 25 [2019-09-03 20:17:11,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:17:11,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1701 backedges. 201 proven. 100 refuted. 0 times theorem prover too weak. 1400 trivial. 0 not checked. [2019-09-03 20:17:11,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:17:11,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-09-03 20:17:11,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 20:17:11,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 20:17:11,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-09-03 20:17:11,457 INFO L87 Difference]: Start difference. First operand 199 states and 248 transitions. Second operand 14 states. [2019-09-03 20:17:14,136 WARN L188 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 28 [2019-09-03 20:17:14,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:17:14,163 INFO L93 Difference]: Finished difference Result 324 states and 420 transitions. [2019-09-03 20:17:14,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 20:17:14,163 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 171 [2019-09-03 20:17:14,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:17:14,165 INFO L225 Difference]: With dead ends: 324 [2019-09-03 20:17:14,165 INFO L226 Difference]: Without dead ends: 321 [2019-09-03 20:17:14,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2019-09-03 20:17:14,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-09-03 20:17:14,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 318. [2019-09-03 20:17:14,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-09-03 20:17:14,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 413 transitions. [2019-09-03 20:17:14,233 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 413 transitions. Word has length 171 [2019-09-03 20:17:14,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:17:14,233 INFO L475 AbstractCegarLoop]: Abstraction has 318 states and 413 transitions. [2019-09-03 20:17:14,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 20:17:14,233 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 413 transitions. [2019-09-03 20:17:14,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-03 20:17:14,236 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:17:14,237 INFO L399 BasicCegarLoop]: trace histogram [33, 32, 32, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:17:14,237 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:17:14,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:17:14,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1096608197, now seen corresponding path program 10 times [2019-09-03 20:17:14,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:17:14,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:17:14,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:17:14,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:17:14,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:17:14,243 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:17:14,243 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:17:14,243 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:17:14,270 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:17:14,330 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:17:14,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:17:14,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 79 conjunts are in the unsatisfiable core [2019-09-03 20:17:14,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:17:14,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:17:14,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2223 backedges. 66 proven. 432 refuted. 0 times theorem prover too weak. 1725 trivial. 0 not checked. [2019-09-03 20:17:14,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:17:14,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-09-03 20:17:14,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 20:17:14,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 20:17:14,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2019-09-03 20:17:14,855 INFO L87 Difference]: Start difference. First operand 318 states and 413 transitions. Second operand 18 states. [2019-09-03 20:17:16,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:17:16,245 INFO L93 Difference]: Finished difference Result 475 states and 647 transitions. [2019-09-03 20:17:16,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 20:17:16,246 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 193 [2019-09-03 20:17:16,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:17:16,249 INFO L225 Difference]: With dead ends: 475 [2019-09-03 20:17:16,249 INFO L226 Difference]: Without dead ends: 472 [2019-09-03 20:17:16,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 175 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=712, Unknown=0, NotChecked=0, Total=812 [2019-09-03 20:17:16,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-09-03 20:17:16,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 440. [2019-09-03 20:17:16,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-09-03 20:17:16,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 609 transitions. [2019-09-03 20:17:16,364 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 609 transitions. Word has length 193 [2019-09-03 20:17:16,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:17:16,365 INFO L475 AbstractCegarLoop]: Abstraction has 440 states and 609 transitions. [2019-09-03 20:17:16,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 20:17:16,365 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 609 transitions. [2019-09-03 20:17:16,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-09-03 20:17:16,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:17:16,369 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 36, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:17:16,369 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:17:16,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:17:16,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1469442372, now seen corresponding path program 11 times [2019-09-03 20:17:16,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:17:16,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:17:16,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:17:16,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:17:16,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:17:16,375 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:17:16,376 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:17:16,376 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-03 20:17:16,389 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:17:16,505 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2019-09-03 20:17:16,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:17:16,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 83 conjunts are in the unsatisfiable core [2019-09-03 20:17:16,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:17:17,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2815 backedges. 97 proven. 402 refuted. 0 times theorem prover too weak. 2316 trivial. 0 not checked. [2019-09-03 20:17:17,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:17:17,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-09-03 20:17:17,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 20:17:17,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 20:17:17,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2019-09-03 20:17:17,316 INFO L87 Difference]: Start difference. First operand 440 states and 609 transitions. Second operand 21 states. [2019-09-03 20:17:18,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:17:18,761 INFO L93 Difference]: Finished difference Result 518 states and 730 transitions. [2019-09-03 20:17:18,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 20:17:18,762 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 215 [2019-09-03 20:17:18,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:17:18,765 INFO L225 Difference]: With dead ends: 518 [2019-09-03 20:17:18,765 INFO L226 Difference]: Without dead ends: 515 [2019-09-03 20:17:18,767 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2019-09-03 20:17:18,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2019-09-03 20:17:18,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 446. [2019-09-03 20:17:18,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-09-03 20:17:18,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 620 transitions. [2019-09-03 20:17:18,885 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 620 transitions. Word has length 215 [2019-09-03 20:17:18,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:17:18,886 INFO L475 AbstractCegarLoop]: Abstraction has 446 states and 620 transitions. [2019-09-03 20:17:18,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 20:17:18,886 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 620 transitions. [2019-09-03 20:17:18,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-03 20:17:18,889 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:17:18,889 INFO L399 BasicCegarLoop]: trace histogram [41, 40, 40, 10, 10, 10, 10, 10, 10, 10, 10, 10, 8, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:17:18,889 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:17:18,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:17:18,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1441747069, now seen corresponding path program 12 times [2019-09-03 20:17:18,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:17:18,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:17:18,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:17:18,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:17:18,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:17:18,899 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:17:18,899 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:17:18,899 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-03 20:17:18,916 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:17:19,091 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-03 20:17:19,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:17:19,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 76 conjunts are in the unsatisfiable core [2019-09-03 20:17:19,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:17:19,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:17:19,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3477 backedges. 227 proven. 337 refuted. 0 times theorem prover too weak. 2913 trivial. 0 not checked. [2019-09-03 20:17:19,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:17:19,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-09-03 20:17:19,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 20:17:19,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 20:17:19,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-09-03 20:17:19,404 INFO L87 Difference]: Start difference. First operand 446 states and 620 transitions. Second operand 14 states. [2019-09-03 20:17:19,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:17:19,996 INFO L93 Difference]: Finished difference Result 529 states and 745 transitions. [2019-09-03 20:17:19,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 20:17:19,997 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 237 [2019-09-03 20:17:19,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:17:20,000 INFO L225 Difference]: With dead ends: 529 [2019-09-03 20:17:20,001 INFO L226 Difference]: Without dead ends: 526 [2019-09-03 20:17:20,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 223 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2019-09-03 20:17:20,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2019-09-03 20:17:20,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 440. [2019-09-03 20:17:20,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-09-03 20:17:20,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 609 transitions. [2019-09-03 20:17:20,130 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 609 transitions. Word has length 237 [2019-09-03 20:17:20,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:17:20,130 INFO L475 AbstractCegarLoop]: Abstraction has 440 states and 609 transitions. [2019-09-03 20:17:20,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 20:17:20,130 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 609 transitions. [2019-09-03 20:17:20,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-03 20:17:20,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:17:20,133 INFO L399 BasicCegarLoop]: trace histogram [45, 44, 44, 11, 11, 11, 11, 11, 11, 11, 11, 11, 9, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:17:20,134 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:17:20,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:17:20,134 INFO L82 PathProgramCache]: Analyzing trace with hash -49942842, now seen corresponding path program 13 times [2019-09-03 20:17:20,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:17:20,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:17:20,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:17:20,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:17:20,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:17:20,142 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:17:20,142 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:17:20,142 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-03 20:17:20,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:17:20,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:17:20,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 87 conjunts are in the unsatisfiable core [2019-09-03 20:17:20,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:17:20,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:17:20,934 INFO L134 CoverageAnalysis]: Checked inductivity of 4209 backedges. 88 proven. 337 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2019-09-03 20:17:20,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:17:20,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-09-03 20:17:20,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 20:17:20,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 20:17:20,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-09-03 20:17:20,938 INFO L87 Difference]: Start difference. First operand 440 states and 609 transitions. Second operand 19 states. [2019-09-03 20:17:23,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:17:23,160 INFO L93 Difference]: Finished difference Result 606 states and 848 transitions. [2019-09-03 20:17:23,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 20:17:23,161 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 259 [2019-09-03 20:17:23,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:17:23,166 INFO L225 Difference]: With dead ends: 606 [2019-09-03 20:17:23,167 INFO L226 Difference]: Without dead ends: 603 [2019-09-03 20:17:23,167 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=87, Invalid=905, Unknown=0, NotChecked=0, Total=992 [2019-09-03 20:17:23,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-09-03 20:17:23,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 592. [2019-09-03 20:17:23,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-09-03 20:17:23,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 833 transitions. [2019-09-03 20:17:23,337 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 833 transitions. Word has length 259 [2019-09-03 20:17:23,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:17:23,338 INFO L475 AbstractCegarLoop]: Abstraction has 592 states and 833 transitions. [2019-09-03 20:17:23,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 20:17:23,338 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 833 transitions. [2019-09-03 20:17:23,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-03 20:17:23,342 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:17:23,342 INFO L399 BasicCegarLoop]: trace histogram [45, 44, 44, 11, 11, 11, 11, 11, 11, 11, 11, 11, 8, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:17:23,342 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:17:23,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:17:23,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1905159983, now seen corresponding path program 14 times [2019-09-03 20:17:23,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:17:23,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:17:23,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:17:23,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:17:23,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:17:23,350 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:17:23,350 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:17:23,350 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-03 20:17:23,365 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:17:23,454 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:17:23,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:17:23,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 101 conjunts are in the unsatisfiable core [2019-09-03 20:17:23,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:17:23,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:17:24,095 INFO L134 CoverageAnalysis]: Checked inductivity of 4217 backedges. 88 proven. 345 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2019-09-03 20:17:24,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:17:24,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-09-03 20:17:24,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 20:17:24,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 20:17:24,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-09-03 20:17:24,099 INFO L87 Difference]: Start difference. First operand 592 states and 833 transitions. Second operand 20 states. [2019-09-03 20:17:26,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:17:26,130 INFO L93 Difference]: Finished difference Result 755 states and 1070 transitions. [2019-09-03 20:17:26,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 20:17:26,130 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 262 [2019-09-03 20:17:26,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:17:26,135 INFO L225 Difference]: With dead ends: 755 [2019-09-03 20:17:26,135 INFO L226 Difference]: Without dead ends: 752 [2019-09-03 20:17:26,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=89, Invalid=967, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 20:17:26,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2019-09-03 20:17:26,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 592. [2019-09-03 20:17:26,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-09-03 20:17:26,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 833 transitions. [2019-09-03 20:17:26,274 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 833 transitions. Word has length 262 [2019-09-03 20:17:26,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:17:26,275 INFO L475 AbstractCegarLoop]: Abstraction has 592 states and 833 transitions. [2019-09-03 20:17:26,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 20:17:26,275 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 833 transitions. [2019-09-03 20:17:26,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-09-03 20:17:26,279 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:17:26,280 INFO L399 BasicCegarLoop]: trace histogram [49, 48, 48, 12, 12, 12, 12, 12, 12, 12, 12, 12, 10, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:17:26,280 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:17:26,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:17:26,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1085196165, now seen corresponding path program 15 times [2019-09-03 20:17:26,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:17:26,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:17:26,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:17:26,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:17:26,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:17:26,287 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:17:26,287 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:17:26,287 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-03 20:17:26,302 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:17:26,351 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 20:17:26,351 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:17:26,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-03 20:17:26,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:17:26,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:17:26,732 INFO L134 CoverageAnalysis]: Checked inductivity of 5011 backedges. 361 proven. 212 refuted. 0 times theorem prover too weak. 4438 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:17:26,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:17:26,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-09-03 20:17:26,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 20:17:26,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 20:17:26,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:17:26,738 INFO L87 Difference]: Start difference. First operand 592 states and 833 transitions. Second operand 12 states. [2019-09-03 20:17:56,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:17:56,536 INFO L93 Difference]: Finished difference Result 912 states and 1297 transitions. [2019-09-03 20:17:56,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 20:17:56,537 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 281 [2019-09-03 20:17:56,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:17:56,542 INFO L225 Difference]: With dead ends: 912 [2019-09-03 20:17:56,542 INFO L226 Difference]: Without dead ends: 909 [2019-09-03 20:17:56,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-09-03 20:17:56,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-09-03 20:17:56,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 820. [2019-09-03 20:17:56,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 820 states. [2019-09-03 20:17:56,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1161 transitions. [2019-09-03 20:17:56,789 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1161 transitions. Word has length 281 [2019-09-03 20:17:56,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:17:56,789 INFO L475 AbstractCegarLoop]: Abstraction has 820 states and 1161 transitions. [2019-09-03 20:17:56,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 20:17:56,790 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1161 transitions. [2019-09-03 20:17:56,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-09-03 20:17:56,794 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:17:56,794 INFO L399 BasicCegarLoop]: trace histogram [49, 48, 48, 12, 12, 12, 12, 12, 12, 12, 12, 12, 9, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:17:56,795 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:17:56,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:17:56,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1513038638, now seen corresponding path program 16 times [2019-09-03 20:17:56,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:17:56,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:17:56,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:17:56,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:17:56,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:17:56,800 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:17:56,800 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:17:56,800 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-03 20:17:56,813 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:17:56,883 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:17:56,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:17:56,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 119 conjunts are in the unsatisfiable core [2019-09-03 20:17:56,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:17:57,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:17:57,556 INFO L134 CoverageAnalysis]: Checked inductivity of 5019 backedges. 160 proven. 978 refuted. 0 times theorem prover too weak. 3881 trivial. 0 not checked. [2019-09-03 20:17:57,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:17:57,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-09-03 20:17:57,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 20:17:57,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 20:17:57,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-09-03 20:17:57,560 INFO L87 Difference]: Start difference. First operand 820 states and 1161 transitions. Second operand 22 states. [2019-09-03 20:17:59,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:17:59,208 INFO L93 Difference]: Finished difference Result 1008 states and 1439 transitions. [2019-09-03 20:17:59,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 20:17:59,209 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 284 [2019-09-03 20:17:59,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:17:59,213 INFO L225 Difference]: With dead ends: 1008 [2019-09-03 20:17:59,213 INFO L226 Difference]: Without dead ends: 1005 [2019-09-03 20:17:59,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 261 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=116, Invalid=940, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 20:17:59,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2019-09-03 20:17:59,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 984. [2019-09-03 20:17:59,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-09-03 20:17:59,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1414 transitions. [2019-09-03 20:17:59,436 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1414 transitions. Word has length 284 [2019-09-03 20:17:59,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:17:59,437 INFO L475 AbstractCegarLoop]: Abstraction has 984 states and 1414 transitions. [2019-09-03 20:17:59,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 20:17:59,437 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1414 transitions. [2019-09-03 20:17:59,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-03 20:17:59,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:17:59,442 INFO L399 BasicCegarLoop]: trace histogram [53, 52, 52, 13, 13, 13, 13, 13, 13, 13, 13, 13, 10, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:17:59,443 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:17:59,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:17:59,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1604370963, now seen corresponding path program 17 times [2019-09-03 20:17:59,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:17:59,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:17:59,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:17:59,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:17:59,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:17:59,449 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:17:59,449 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:17:59,449 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-03 20:17:59,468 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:18:01,095 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2019-09-03 20:18:01,095 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:18:01,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 101 conjunts are in the unsatisfiable core [2019-09-03 20:18:01,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:18:01,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:18:01,997 INFO L134 CoverageAnalysis]: Checked inductivity of 5891 backedges. 204 proven. 683 refuted. 0 times theorem prover too weak. 5004 trivial. 0 not checked. [2019-09-03 20:18:02,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:18:02,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-09-03 20:18:02,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 20:18:02,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 20:18:02,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-09-03 20:18:02,003 INFO L87 Difference]: Start difference. First operand 984 states and 1414 transitions. Second operand 26 states. [2019-09-03 20:18:06,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:18:06,543 INFO L93 Difference]: Finished difference Result 1082 states and 1564 transitions. [2019-09-03 20:18:06,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 20:18:06,549 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 306 [2019-09-03 20:18:06,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:18:06,553 INFO L225 Difference]: With dead ends: 1082 [2019-09-03 20:18:06,553 INFO L226 Difference]: Without dead ends: 1079 [2019-09-03 20:18:06,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=93, Invalid=837, Unknown=0, NotChecked=0, Total=930 [2019-09-03 20:18:06,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2019-09-03 20:18:06,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 994. [2019-09-03 20:18:06,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 994 states. [2019-09-03 20:18:06,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1428 transitions. [2019-09-03 20:18:06,801 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1428 transitions. Word has length 306 [2019-09-03 20:18:06,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:18:06,801 INFO L475 AbstractCegarLoop]: Abstraction has 994 states and 1428 transitions. [2019-09-03 20:18:06,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 20:18:06,801 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1428 transitions. [2019-09-03 20:18:06,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-03 20:18:06,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:18:06,807 INFO L399 BasicCegarLoop]: trace histogram [57, 56, 56, 14, 14, 14, 14, 14, 14, 14, 14, 14, 11, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:18:06,807 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:18:06,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:18:06,807 INFO L82 PathProgramCache]: Analyzing trace with hash -2027868308, now seen corresponding path program 18 times [2019-09-03 20:18:06,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:18:06,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:18:06,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:18:06,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:18:06,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:18:06,813 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:18:06,813 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:18:06,814 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-03 20:18:06,826 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:18:09,412 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-03 20:18:09,412 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:18:09,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-03 20:18:09,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:18:23,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:18:24,102 INFO L134 CoverageAnalysis]: Checked inductivity of 6833 backedges. 632 proven. 263 refuted. 0 times theorem prover too weak. 5938 trivial. 0 not checked. [2019-09-03 20:18:24,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:18:24,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-09-03 20:18:24,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 20:18:24,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 20:18:24,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=117, Unknown=7, NotChecked=0, Total=156 [2019-09-03 20:18:24,106 INFO L87 Difference]: Start difference. First operand 994 states and 1428 transitions. Second operand 13 states. [2019-09-03 20:19:19,118 WARN L188 SmtUtils]: Spent 8.14 s on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-03 20:19:19,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:19:19,159 INFO L93 Difference]: Finished difference Result 994 states and 1428 transitions. [2019-09-03 20:19:19,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:19:19,159 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 328 [2019-09-03 20:19:19,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:19:19,160 INFO L225 Difference]: With dead ends: 994 [2019-09-03 20:19:19,160 INFO L226 Difference]: Without dead ends: 0 [2019-09-03 20:19:19,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 37.0s TimeCoverageRelationStatistics Valid=69, Invalid=223, Unknown=14, NotChecked=0, Total=306 [2019-09-03 20:19:19,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-03 20:19:19,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-03 20:19:19,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-03 20:19:19,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-03 20:19:19,166 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 328 [2019-09-03 20:19:19,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:19:19,166 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-03 20:19:19,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 20:19:19,166 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-03 20:19:19,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-03 20:19:19,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-03 20:19:21,097 WARN L188 SmtUtils]: Spent 1.92 s on a formula simplification. DAG size of input: 703 DAG size of output: 596 [2019-09-03 20:19:23,179 WARN L188 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 671 DAG size of output: 568 [2019-09-03 20:19:24,289 WARN L188 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 703 DAG size of output: 596 [2019-09-03 20:19:25,349 WARN L188 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 667 DAG size of output: 557 [2019-09-03 20:19:26,347 WARN L188 SmtUtils]: Spent 934.00 ms on a formula simplification. DAG size of input: 654 DAG size of output: 549 [2019-09-03 20:20:01,392 WARN L188 SmtUtils]: Spent 34.93 s on a formula simplification. DAG size of input: 585 DAG size of output: 38 [2019-09-03 20:20:20,152 WARN L188 SmtUtils]: Spent 18.76 s on a formula simplification. DAG size of input: 556 DAG size of output: 38 [2019-09-03 20:20:56,956 WARN L188 SmtUtils]: Spent 36.80 s on a formula simplification. DAG size of input: 585 DAG size of output: 38 [2019-09-03 20:21:09,003 WARN L188 SmtUtils]: Spent 12.05 s on a formula simplification. DAG size of input: 237 DAG size of output: 34 [2019-09-03 20:21:37,325 WARN L188 SmtUtils]: Spent 28.32 s on a formula simplification. DAG size of input: 543 DAG size of output: 38 [2019-09-03 20:25:42,726 WARN L188 SmtUtils]: Spent 4.09 m on a formula simplification. DAG size of input: 237 DAG size of output: 68 [2019-09-03 20:26:12,600 WARN L188 SmtUtils]: Spent 29.83 s on a formula simplification. DAG size of input: 536 DAG size of output: 38 [2019-09-03 20:26:12,617 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-03 20:26:12,617 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-03 20:26:12,617 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-03 20:26:12,618 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-03 20:26:12,618 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-03 20:26:12,618 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-03 20:26:12,618 INFO L439 ceAbstractionStarter]: At program point L35-2(lines 35 44) the Hoare annotation is: (let ((.cse3 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)))) (let ((.cse0 (= main_~b~0 (+ (* main_~y~0 main_~s~0) (* main_~q~0 main_~x~0)))) (.cse1 (<= 1 main_~x~0)) (.cse2 (= .cse3 (+ main_~c~0 (* main_~b~0 main_~k~0))))) (or (and (and (= main_~p~0 1) .cse0 (= main_~b~0 main_~y~0) (= main_~x~0 (+ (* main_~k~0 main_~y~0) main_~c~0))) .cse1 (= main_~q~0 0) (= main_~a~0 main_~x~0) .cse2) (and (and .cse0 (= main_~a~0 .cse3) (<= (+ main_~b~0 1) main_~a~0)) .cse1 .cse2)))) [2019-09-03 20:26:12,618 INFO L443 ceAbstractionStarter]: For program point L35-3(lines 35 44) no Hoare annotation was computed. [2019-09-03 20:26:12,618 INFO L443 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2019-09-03 20:26:12,618 INFO L439 ceAbstractionStarter]: At program point L29-2(lines 29 56) the Hoare annotation is: (let ((.cse3 (= main_~a~0 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0))))) (let ((.cse1 (and .cse3 (<= (+ main_~b~0 1) main_~a~0))) (.cse0 (<= 1 main_~x~0)) (.cse2 (exists ((v_main_~q~0_50 Int) (v_main_~p~0_44 Int) (main_~k~0 Int) (main_~temp~0 Int) (v_main_~s~0_51 Int)) (and (= (+ main_~temp~0 (- (* v_main_~s~0_51 main_~k~0))) main_~s~0) (= (+ main_~b~0 (* main_~k~0 (+ (* v_main_~s~0_51 main_~y~0) (* v_main_~q~0_50 main_~x~0)))) (+ (* main_~y~0 main_~temp~0) (* v_main_~p~0_44 main_~x~0))) (= (+ v_main_~p~0_44 (- (* v_main_~q~0_50 main_~k~0))) main_~q~0))))) (or (and .cse0 .cse1 .cse2) (and (or (and (= (+ (* 2 main_~q~0) main_~s~0) 1) (= 0 (+ main_~q~0 7)) .cse1) (and (= (+ main_~q~0 main_~s~0) 1) (= 0 (+ main_~s~0 7)) .cse1)) .cse0 .cse2) (and .cse3 (< main_~c~0 main_~b~0) (<= 1 main_~b~0) (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~k~0 0) .cse0 (= main_~q~0 0) (= main_~a~0 main_~x~0) .cse2)))) [2019-09-03 20:26:12,619 INFO L439 ceAbstractionStarter]: At program point L29-3(lines 29 56) the Hoare annotation is: (and (exists ((main_~p~0 Int) (main_~r~0 Int)) (= (let ((.cse0 (* (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)) (- 1)))) (+ (+ (+ (+ (* (+ (* 3 main_~p~0) main_~q~0) main_~x~0) (* (+ (* 3 main_~r~0) main_~s~0) main_~y~0)) .cse0) .cse0) .cse0)) main_~b~0)) (= main_~a~0 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0))) (exists ((main_~p~0 Int) (main_~r~0 Int)) (= (let ((.cse1 (* (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)) (- 1)))) (+ (+ (+ (+ (* (+ (* 3 main_~p~0) main_~q~0) main_~x~0) (* (+ (* 3 main_~r~0) main_~s~0) main_~y~0)) .cse1) .cse1) .cse1)) 0)) (<= (+ main_~b~0 1) main_~a~0)) [2019-09-03 20:26:12,619 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 13 62) no Hoare annotation was computed. [2019-09-03 20:26:12,619 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 13 62) no Hoare annotation was computed. [2019-09-03 20:26:12,619 INFO L439 ceAbstractionStarter]: At program point L38(line 38) the Hoare annotation is: (let ((.cse3 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)))) (let ((.cse0 (= main_~b~0 (+ (* main_~y~0 main_~s~0) (* main_~q~0 main_~x~0)))) (.cse1 (<= 1 main_~x~0)) (.cse2 (= .cse3 (+ main_~c~0 (* main_~b~0 main_~k~0))))) (or (and (and (= main_~p~0 1) .cse0 (= main_~b~0 main_~y~0) .cse1 (= main_~x~0 (+ (* main_~k~0 main_~y~0) main_~c~0))) (= main_~q~0 0) (= main_~a~0 main_~x~0) .cse2) (and (and .cse0 (= main_~a~0 .cse3) (<= (+ main_~b~0 1) main_~a~0)) .cse1 .cse2)))) [2019-09-03 20:26:12,619 INFO L439 ceAbstractionStarter]: At program point L36(line 36) the Hoare annotation is: (let ((.cse3 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)))) (let ((.cse0 (= main_~b~0 (+ (* main_~y~0 main_~s~0) (* main_~q~0 main_~x~0)))) (.cse1 (<= 1 main_~x~0)) (.cse2 (= .cse3 (+ main_~c~0 (* main_~b~0 main_~k~0))))) (or (and (and (= main_~p~0 1) .cse0 (= main_~b~0 main_~y~0) (= main_~x~0 (+ (* main_~k~0 main_~y~0) main_~c~0))) .cse1 (= main_~q~0 0) (= main_~a~0 main_~x~0) .cse2) (and (and .cse0 (= main_~a~0 .cse3) (<= (+ main_~b~0 1) main_~a~0)) .cse1 .cse2)))) [2019-09-03 20:26:12,619 INFO L439 ceAbstractionStarter]: At program point L36-1(line 36) the Hoare annotation is: (let ((.cse3 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)))) (let ((.cse0 (= main_~b~0 (+ (* main_~y~0 main_~s~0) (* main_~q~0 main_~x~0)))) (.cse1 (<= 1 main_~x~0)) (.cse2 (= .cse3 (+ main_~c~0 (* main_~b~0 main_~k~0))))) (or (and (and (= main_~p~0 1) .cse0 (= main_~b~0 main_~y~0) .cse1 (= main_~x~0 (+ (* main_~k~0 main_~y~0) main_~c~0))) (= main_~q~0 0) (= main_~a~0 main_~x~0) .cse2) (and (and .cse0 (= main_~a~0 .cse3) (<= (+ main_~b~0 1) main_~a~0)) .cse1 .cse2)))) [2019-09-03 20:26:12,619 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 31) no Hoare annotation was computed. [2019-09-03 20:26:12,619 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 13 62) the Hoare annotation is: true [2019-09-03 20:26:12,619 INFO L439 ceAbstractionStarter]: At program point L59(line 59) the Hoare annotation is: (let ((.cse0 (<= 1 main_~x~0)) (.cse1 (<= (+ main_~b~0 1) main_~a~0))) (or (and (= main_~a~0 main_~y~0) (= main_~r~0 1) .cse0 (= main_~p~0 0)) (and (= main_~r~0 0) (= main_~p~0 1) .cse0 (= main_~a~0 main_~x~0) .cse1) (and (= main_~a~0 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0))) (exists ((main_~p~0 Int) (main_~r~0 Int)) (= (let ((.cse2 (* (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)) (- 1)))) (+ (+ (+ (+ (* (+ (* 3 main_~p~0) main_~q~0) main_~x~0) (* (+ (* 3 main_~r~0) main_~s~0) main_~y~0)) .cse2) .cse2) .cse2)) 0)) .cse1))) [2019-09-03 20:26:12,620 INFO L443 ceAbstractionStarter]: For program point L39(lines 35 44) no Hoare annotation was computed. [2019-09-03 20:26:12,620 INFO L439 ceAbstractionStarter]: At program point L37(line 37) the Hoare annotation is: (let ((.cse3 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)))) (let ((.cse0 (= main_~b~0 (+ (* main_~y~0 main_~s~0) (* main_~q~0 main_~x~0)))) (.cse1 (<= 1 main_~x~0)) (.cse2 (= .cse3 (+ main_~c~0 (* main_~b~0 main_~k~0))))) (or (and (and (= main_~p~0 1) .cse0 (= main_~b~0 main_~y~0) .cse1 (= main_~x~0 (+ (* main_~k~0 main_~y~0) main_~c~0))) (= main_~q~0 0) (= main_~a~0 main_~x~0) .cse2) (and (and .cse0 (= main_~a~0 .cse3) (<= (+ main_~b~0 1) main_~a~0)) .cse1 .cse2)))) [2019-09-03 20:26:12,620 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 5 11) the Hoare annotation is: true [2019-09-03 20:26:12,620 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2019-09-03 20:26:12,620 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 5 11) no Hoare annotation was computed. [2019-09-03 20:26:12,620 INFO L443 ceAbstractionStarter]: For program point L7(lines 7 8) no Hoare annotation was computed. [2019-09-03 20:26:12,620 INFO L443 ceAbstractionStarter]: For program point L6(lines 6 9) no Hoare annotation was computed. [2019-09-03 20:26:12,620 INFO L443 ceAbstractionStarter]: For program point L6-2(lines 5 11) no Hoare annotation was computed. [2019-09-03 20:26:12,628 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] [2019-09-03 20:26:12,629 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] [2019-09-03 20:26:12,630 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-03 20:26:12,630 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-03 20:26:12,630 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] [2019-09-03 20:26:12,630 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] [2019-09-03 20:26:12,630 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] [2019-09-03 20:26:12,631 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] [2019-09-03 20:26:12,631 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] [2019-09-03 20:26:12,631 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] [2019-09-03 20:26:12,631 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-03 20:26:12,632 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] [2019-09-03 20:26:12,632 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] [2019-09-03 20:26:12,632 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-03 20:26:12,632 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-03 20:26:12,632 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] [2019-09-03 20:26:12,633 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] [2019-09-03 20:26:12,633 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] [2019-09-03 20:26:12,633 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] [2019-09-03 20:26:12,633 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] [2019-09-03 20:26:12,634 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] [2019-09-03 20:26:12,634 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-03 20:26:12,634 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] [2019-09-03 20:26:12,634 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] [2019-09-03 20:26:12,634 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-03 20:26:12,635 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-03 20:26:12,635 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] [2019-09-03 20:26:12,635 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] [2019-09-03 20:26:12,635 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] [2019-09-03 20:26:12,635 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] [2019-09-03 20:26:12,636 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] [2019-09-03 20:26:12,636 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] [2019-09-03 20:26:12,636 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-03 20:26:12,644 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] [2019-09-03 20:26:12,644 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] [2019-09-03 20:26:12,645 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-03 20:26:12,645 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-03 20:26:12,645 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] [2019-09-03 20:26:12,645 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] [2019-09-03 20:26:12,646 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] [2019-09-03 20:26:12,646 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] [2019-09-03 20:26:12,646 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] [2019-09-03 20:26:12,646 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] [2019-09-03 20:26:12,646 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-03 20:26:12,647 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] [2019-09-03 20:26:12,647 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] [2019-09-03 20:26:12,647 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-03 20:26:12,647 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-03 20:26:12,647 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] [2019-09-03 20:26:12,648 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] [2019-09-03 20:26:12,648 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] [2019-09-03 20:26:12,648 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] [2019-09-03 20:26:12,648 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] [2019-09-03 20:26:12,648 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] [2019-09-03 20:26:12,648 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-03 20:26:12,649 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] [2019-09-03 20:26:12,649 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] [2019-09-03 20:26:12,649 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-03 20:26:12,649 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-03 20:26:12,649 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] [2019-09-03 20:26:12,649 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] [2019-09-03 20:26:12,649 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] [2019-09-03 20:26:12,649 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] [2019-09-03 20:26:12,650 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] [2019-09-03 20:26:12,650 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] [2019-09-03 20:26:12,650 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-03 20:26:12,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 08:26:12 BoogieIcfgContainer [2019-09-03 20:26:12,654 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 20:26:12,656 INFO L168 Benchmark]: Toolchain (without parser) took 561607.78 ms. Allocated memory was 140.0 MB in the beginning and 665.8 MB in the end (delta: 525.9 MB). Free memory was 87.4 MB in the beginning and 237.4 MB in the end (delta: -150.0 MB). Peak memory consumption was 585.3 MB. Max. memory is 7.1 GB. [2019-09-03 20:26:12,656 INFO L168 Benchmark]: CDTParser took 0.42 ms. Allocated memory is still 140.0 MB. Free memory was 106.1 MB in the beginning and 105.9 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:26:12,657 INFO L168 Benchmark]: CACSL2BoogieTranslator took 458.70 ms. Allocated memory was 140.0 MB in the beginning and 200.8 MB in the end (delta: 60.8 MB). Free memory was 87.2 MB in the beginning and 179.0 MB in the end (delta: -91.8 MB). Peak memory consumption was 20.1 MB. Max. memory is 7.1 GB. [2019-09-03 20:26:12,657 INFO L168 Benchmark]: Boogie Preprocessor took 39.83 ms. Allocated memory is still 200.8 MB. Free memory was 178.4 MB in the beginning and 177.2 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 7.1 GB. [2019-09-03 20:26:12,658 INFO L168 Benchmark]: RCFGBuilder took 274.24 ms. Allocated memory is still 200.8 MB. Free memory was 177.2 MB in the beginning and 163.9 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. [2019-09-03 20:26:12,659 INFO L168 Benchmark]: TraceAbstraction took 560830.46 ms. Allocated memory was 200.8 MB in the beginning and 665.8 MB in the end (delta: 465.0 MB). Free memory was 163.3 MB in the beginning and 237.4 MB in the end (delta: -74.1 MB). Peak memory consumption was 600.4 MB. Max. memory is 7.1 GB. [2019-09-03 20:26:12,661 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.42 ms. Allocated memory is still 140.0 MB. Free memory was 106.1 MB in the beginning and 105.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 458.70 ms. Allocated memory was 140.0 MB in the beginning and 200.8 MB in the end (delta: 60.8 MB). Free memory was 87.2 MB in the beginning and 179.0 MB in the end (delta: -91.8 MB). Peak memory consumption was 20.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.83 ms. Allocated memory is still 200.8 MB. Free memory was 178.4 MB in the beginning and 177.2 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 274.24 ms. Allocated memory is still 200.8 MB. Free memory was 177.2 MB in the beginning and 163.9 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 560830.46 ms. Allocated memory was 200.8 MB in the beginning and 665.8 MB in the end (delta: 465.0 MB). Free memory was 163.3 MB in the beginning and 237.4 MB in the end (delta: -74.1 MB). Peak memory consumption was 600.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: 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: 29]: Loop Invariant [2019-09-03 20:26:12,671 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] [2019-09-03 20:26:12,671 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] [2019-09-03 20:26:12,672 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-03 20:26:12,672 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-03 20:26:12,672 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] [2019-09-03 20:26:12,672 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] [2019-09-03 20:26:12,672 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] [2019-09-03 20:26:12,672 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] [2019-09-03 20:26:12,673 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] [2019-09-03 20:26:12,673 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] [2019-09-03 20:26:12,673 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-03 20:26:12,673 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] [2019-09-03 20:26:12,673 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] [2019-09-03 20:26:12,674 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-03 20:26:12,674 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-03 20:26:12,674 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] [2019-09-03 20:26:12,674 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] [2019-09-03 20:26:12,674 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] [2019-09-03 20:26:12,674 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] [2019-09-03 20:26:12,675 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] [2019-09-03 20:26:12,675 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] [2019-09-03 20:26:12,675 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-03 20:26:12,675 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] [2019-09-03 20:26:12,675 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] [2019-09-03 20:26:12,675 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-03 20:26:12,676 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-03 20:26:12,676 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] [2019-09-03 20:26:12,676 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] [2019-09-03 20:26:12,676 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] [2019-09-03 20:26:12,676 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] [2019-09-03 20:26:12,676 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] [2019-09-03 20:26:12,677 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] [2019-09-03 20:26:12,677 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-03 20:26:12,678 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] [2019-09-03 20:26:12,678 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] [2019-09-03 20:26:12,678 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-03 20:26:12,678 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-03 20:26:12,678 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] [2019-09-03 20:26:12,679 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] [2019-09-03 20:26:12,679 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] [2019-09-03 20:26:12,679 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] [2019-09-03 20:26:12,679 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] [2019-09-03 20:26:12,679 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] [2019-09-03 20:26:12,679 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-03 20:26:12,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] [2019-09-03 20:26:12,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] [2019-09-03 20:26:12,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-03 20:26:12,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-03 20:26:12,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] [2019-09-03 20:26:12,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] [2019-09-03 20:26:12,681 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] [2019-09-03 20:26:12,681 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] [2019-09-03 20:26:12,681 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] [2019-09-03 20:26:12,681 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] [2019-09-03 20:26:12,681 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-03 20:26:12,682 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] [2019-09-03 20:26:12,682 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] [2019-09-03 20:26:12,682 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-03 20:26:12,682 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-03 20:26:12,682 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] [2019-09-03 20:26:12,682 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] [2019-09-03 20:26:12,683 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] [2019-09-03 20:26:12,683 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] [2019-09-03 20:26:12,683 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] [2019-09-03 20:26:12,683 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] [2019-09-03 20:26:12,683 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] Derived loop invariant: (((1 <= x && a == p * x + y * r && b + 1 <= a) && (\exists v_main_~q~0_50 : int, v_main_~p~0_44 : int, main_~k~0 : int, main_~temp~0 : int, v_main_~s~0_51 : int :: (main_~temp~0 + -(v_main_~s~0_51 * main_~k~0) == s && b + main_~k~0 * (v_main_~s~0_51 * y + v_main_~q~0_50 * x) == y * main_~temp~0 + v_main_~p~0_44 * x) && v_main_~p~0_44 + -(v_main_~q~0_50 * main_~k~0) == q)) || (((((2 * q + s == 1 && 0 == q + 7) && a == p * x + y * r && b + 1 <= a) || ((q + s == 1 && 0 == s + 7) && a == p * x + y * r && b + 1 <= a)) && 1 <= x) && (\exists v_main_~q~0_50 : int, v_main_~p~0_44 : int, main_~k~0 : int, main_~temp~0 : int, v_main_~s~0_51 : int :: (main_~temp~0 + -(v_main_~s~0_51 * main_~k~0) == s && b + main_~k~0 * (v_main_~s~0_51 * y + v_main_~q~0_50 * x) == y * main_~temp~0 + v_main_~p~0_44 * x) && v_main_~p~0_44 + -(v_main_~q~0_50 * main_~k~0) == q))) || (((((((((a == p * x + y * r && c < b) && 1 <= b) && r == 0) && b == y) && k == 0) && 1 <= x) && q == 0) && a == x) && (\exists v_main_~q~0_50 : int, v_main_~p~0_44 : int, main_~k~0 : int, main_~temp~0 : int, v_main_~s~0_51 : int :: (main_~temp~0 + -(v_main_~s~0_51 * main_~k~0) == s && b + main_~k~0 * (v_main_~s~0_51 * y + v_main_~q~0_50 * x) == y * main_~temp~0 + v_main_~p~0_44 * x) && v_main_~p~0_44 + -(v_main_~q~0_50 * main_~k~0) == q)) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (((((((p == 1 && b == y * s + q * x) && b == y) && x == k * y + c) && 1 <= x) && q == 0) && a == x) && p * x + y * r == c + b * k) || ((((b == y * s + q * x && a == p * x + y * r) && b + 1 <= a) && 1 <= x) && p * x + y * r == c + b * k) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. SAFE Result, 560.7s OverallTime, 36 OverallIterations, 57 TraceHistogramMax, 110.2s AutomataDifference, 0.0s DeadEndRemovalTime, 413.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 1438 SDtfs, 842 SDslu, 10277 SDs, 0 SdLazy, 15084 SolverSat, 1393 SolverUnsat, 31 SolverUnknown, 0 SolverNotchecked, 76.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4686 GetRequests, 4192 SyntacticMatches, 8 SemanticMatches, 486 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1084 ImplicationChecksByTransitivity, 52.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=994occurred in iteration=35, 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: 2.2s AutomataMinimizationTime, 36 MinimizatonAttempts, 1116 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 496 PreInvPairs, 1056 NumberOfFragments, 875 HoareAnnotationTreeSize, 496 FomulaSimplifications, 17526831 FormulaSimplificationTreeSizeReduction, 7.2s HoareSimplificationTime, 13 FomulaSimplificationsInter, 2501060 FormulaSimplificationTreeSizeReductionInter, 406.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 5.5s SatisfiabilityAnalysisTime, 27.5s InterpolantComputationTime, 4550 NumberOfCodeBlocks, 3594 NumberOfCodeBlocksAsserted, 147 NumberOfCheckSat, 4514 ConstructedInterpolants, 18 QuantifiedInterpolants, 6812938 SizeOfPredicates, 310 NumberOfNonLiveVariables, 8248 ConjunctsInSsa, 1550 ConjunctsInUnsatCore, 36 InterpolantComputations, 6 PerfectInterpolantSequences, 47844/52721 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...