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/lcm2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 16:13:38,137 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 16:13:38,139 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 16:13:38,151 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 16:13:38,151 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 16:13:38,152 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 16:13:38,153 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 16:13:38,155 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 16:13:38,157 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 16:13:38,157 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 16:13:38,158 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 16:13:38,159 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 16:13:38,160 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 16:13:38,161 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 16:13:38,161 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 16:13:38,163 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 16:13:38,163 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 16:13:38,164 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 16:13:38,166 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 16:13:38,168 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 16:13:38,169 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 16:13:38,170 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 16:13:38,172 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 16:13:38,172 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 16:13:38,175 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 16:13:38,175 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 16:13:38,175 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 16:13:38,176 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 16:13:38,176 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 16:13:38,177 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 16:13:38,178 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 16:13:38,178 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 16:13:38,179 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 16:13:38,180 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 16:13:38,181 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 16:13:38,181 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 16:13:38,182 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 16:13:38,182 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 16:13:38,182 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 16:13:38,183 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 16:13:38,184 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 16:13:38,184 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-16 16:13:38,199 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 16:13:38,199 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 16:13:38,200 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-16 16:13:38,201 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-16 16:13:38,201 INFO L138 SettingsManager]: * Use SBE=true [2019-09-16 16:13:38,201 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 16:13:38,201 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 16:13:38,201 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-16 16:13:38,202 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 16:13:38,202 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 16:13:38,204 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 16:13:38,204 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 16:13:38,205 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 16:13:38,205 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 16:13:38,205 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 16:13:38,205 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-16 16:13:38,205 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 16:13:38,206 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 16:13:38,206 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 16:13:38,206 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-16 16:13:38,206 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-16 16:13:38,206 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 16:13:38,207 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 16:13:38,207 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 16:13:38,207 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-16 16:13:38,208 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-16 16:13:38,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 16:13:38,209 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-16 16:13:38,209 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 16:13:38,242 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 16:13:38,254 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 16:13:38,257 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 16:13:38,258 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 16:13:38,259 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 16:13:38,259 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/lcm2.c [2019-09-16 16:13:38,330 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/391f12e8c/bcacfab041b84fe9afc51bd4a0bc54a6/FLAG3f9fb0a1f [2019-09-16 16:13:38,730 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 16:13:38,730 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/lcm2.c [2019-09-16 16:13:38,737 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/391f12e8c/bcacfab041b84fe9afc51bd4a0bc54a6/FLAG3f9fb0a1f [2019-09-16 16:13:39,112 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/391f12e8c/bcacfab041b84fe9afc51bd4a0bc54a6 [2019-09-16 16:13:39,125 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 16:13:39,127 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 16:13:39,130 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 16:13:39,130 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 16:13:39,134 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 16:13:39,135 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:13:39" (1/1) ... [2019-09-16 16:13:39,137 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7354cb84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:13:39, skipping insertion in model container [2019-09-16 16:13:39,137 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:13:39" (1/1) ... [2019-09-16 16:13:39,145 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 16:13:39,161 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 16:13:39,380 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:13:39,385 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 16:13:39,411 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:13:39,425 INFO L192 MainTranslator]: Completed translation [2019-09-16 16:13:39,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:13:39 WrapperNode [2019-09-16 16:13:39,425 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 16:13:39,426 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 16:13:39,426 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 16:13:39,426 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 16:13:39,534 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:13:39" (1/1) ... [2019-09-16 16:13:39,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:13:39" (1/1) ... [2019-09-16 16:13:39,539 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:13:39" (1/1) ... [2019-09-16 16:13:39,539 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:13:39" (1/1) ... [2019-09-16 16:13:39,543 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:13:39" (1/1) ... [2019-09-16 16:13:39,548 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:13:39" (1/1) ... [2019-09-16 16:13:39,549 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:13:39" (1/1) ... [2019-09-16 16:13:39,550 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 16:13:39,551 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 16:13:39,551 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 16:13:39,551 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 16:13:39,552 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:13:39" (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-16 16:13:39,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 16:13:39,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 16:13:39,601 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-16 16:13:39,601 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 16:13:39,601 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 16:13:39,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 16:13:39,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-16 16:13:39,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-16 16:13:39,602 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 16:13:39,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 16:13:39,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 16:13:39,785 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 16:13:39,785 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-16 16:13:39,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:13:39 BoogieIcfgContainer [2019-09-16 16:13:39,788 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 16:13:39,790 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 16:13:39,790 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 16:13:39,793 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 16:13:39,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 04:13:39" (1/3) ... [2019-09-16 16:13:39,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12819aa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:13:39, skipping insertion in model container [2019-09-16 16:13:39,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:13:39" (2/3) ... [2019-09-16 16:13:39,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12819aa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:13:39, skipping insertion in model container [2019-09-16 16:13:39,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:13:39" (3/3) ... [2019-09-16 16:13:39,796 INFO L109 eAbstractionObserver]: Analyzing ICFG lcm2.c [2019-09-16 16:13:39,806 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 16:13:39,813 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 16:13:39,829 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 16:13:39,857 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-16 16:13:39,857 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 16:13:39,858 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-16 16:13:39,858 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 16:13:39,858 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 16:13:39,858 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 16:13:39,858 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 16:13:39,858 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 16:13:39,859 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 16:13:39,872 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-09-16 16:13:39,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-16 16:13:39,877 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:13:39,878 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:13:39,880 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:13:39,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:13:39,885 INFO L82 PathProgramCache]: Analyzing trace with hash -858950785, now seen corresponding path program 1 times [2019-09-16 16:13:39,887 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:13:39,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:13:39,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:39,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:13:39,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:39,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:13:39,999 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-16 16:13:40,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:13:40,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-16 16:13:40,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-16 16:13:40,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-16 16:13:40,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-16 16:13:40,023 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-09-16 16:13:40,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:13:40,044 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2019-09-16 16:13:40,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-16 16:13:40,045 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-16 16:13:40,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:13:40,052 INFO L225 Difference]: With dead ends: 37 [2019-09-16 16:13:40,052 INFO L226 Difference]: Without dead ends: 16 [2019-09-16 16:13:40,056 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-16 16:13:40,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-16 16:13:40,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-16 16:13:40,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-16 16:13:40,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-09-16 16:13:40,098 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 10 [2019-09-16 16:13:40,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:13:40,099 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-09-16 16:13:40,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-16 16:13:40,099 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2019-09-16 16:13:40,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-16 16:13:40,100 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:13:40,100 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:13:40,100 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:13:40,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:13:40,101 INFO L82 PathProgramCache]: Analyzing trace with hash -871939661, now seen corresponding path program 1 times [2019-09-16 16:13:40,101 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:13:40,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:13:40,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:40,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:13:40,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:40,115 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-16 16:13:40,115 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-16 16:13:40,115 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-16 16:13:40,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-16 16:13:40,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:13:40,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-16 16:13:40,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:13:40,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:13:40,321 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-16 16:13:40,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:13:40,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:13:40,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:13:40,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:13:40,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:13:40,328 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 5 states. [2019-09-16 16:13:40,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:13:40,440 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2019-09-16 16:13:40,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:13:40,441 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-09-16 16:13:40,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:13:40,443 INFO L225 Difference]: With dead ends: 27 [2019-09-16 16:13:40,443 INFO L226 Difference]: Without dead ends: 24 [2019-09-16 16:13:40,444 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:13:40,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-16 16:13:40,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-09-16 16:13:40,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-16 16:13:40,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-09-16 16:13:40,453 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 10 [2019-09-16 16:13:40,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:13:40,454 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-09-16 16:13:40,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:13:40,454 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-09-16 16:13:40,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-16 16:13:40,455 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:13:40,455 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:13:40,456 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:13:40,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:13:40,456 INFO L82 PathProgramCache]: Analyzing trace with hash 427538464, now seen corresponding path program 1 times [2019-09-16 16:13:40,457 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:13:40,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:13:40,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:40,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:13:40,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:40,466 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-16 16:13:40,466 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-16 16:13:40,467 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-16 16:13:40,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:13:40,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:13:40,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-16 16:13:40,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:13:40,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:13:40,611 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:13:40,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-16 16:13:40,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-09-16 16:13:40,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 16:13:40,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 16:13:40,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:13:40,618 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 6 states. [2019-09-16 16:13:40,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:13:40,724 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-09-16 16:13:40,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:13:40,725 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-09-16 16:13:40,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:13:40,726 INFO L225 Difference]: With dead ends: 35 [2019-09-16 16:13:40,726 INFO L226 Difference]: Without dead ends: 32 [2019-09-16 16:13:40,727 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 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-16 16:13:40,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-16 16:13:40,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-09-16 16:13:40,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-16 16:13:40,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-09-16 16:13:40,735 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 18 [2019-09-16 16:13:40,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:13:40,736 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-09-16 16:13:40,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 16:13:40,736 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-09-16 16:13:40,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-16 16:13:40,737 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:13:40,737 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:13:40,737 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:13:40,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:13:40,738 INFO L82 PathProgramCache]: Analyzing trace with hash 484796766, now seen corresponding path program 1 times [2019-09-16 16:13:40,738 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:13:40,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:13:40,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:40,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:13:40,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:40,746 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-16 16:13:40,746 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-16 16:13:40,746 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-16 16:13:40,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:13:40,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-16 16:13:40,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-16 16:13:40,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:13:40,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:13:40,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:13:40,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-16 16:13:40,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-09-16 16:13:40,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 16:13:40,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 16:13:40,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:13:40,884 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 6 states. [2019-09-16 16:13:40,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:13:40,976 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2019-09-16 16:13:40,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:13:40,978 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-09-16 16:13:40,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:13:40,979 INFO L225 Difference]: With dead ends: 42 [2019-09-16 16:13:40,979 INFO L226 Difference]: Without dead ends: 39 [2019-09-16 16:13:40,980 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 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-16 16:13:40,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-16 16:13:40,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2019-09-16 16:13:40,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-16 16:13:40,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-09-16 16:13:40,988 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 18 [2019-09-16 16:13:40,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:13:40,989 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-09-16 16:13:40,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 16:13:40,989 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-09-16 16:13:40,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-16 16:13:40,990 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:13:40,990 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:13:40,991 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:13:40,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:13:40,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1597862285, now seen corresponding path program 2 times [2019-09-16 16:13:40,991 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:13:40,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:13:40,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:40,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:13:40,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:41,000 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-16 16:13:41,000 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-16 16:13:41,000 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-16 16:13:41,039 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-16 16:13:41,062 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-16 16:13:41,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:13:41,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-16 16:13:41,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:13:41,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:13:41,176 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-16 16:13:41,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-16 16:13:41,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-09-16 16:13:41,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-16 16:13:41,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-16 16:13:41,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:13:41,181 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 7 states. [2019-09-16 16:13:41,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:13:41,312 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2019-09-16 16:13:41,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-16 16:13:41,312 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-09-16 16:13:41,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:13:41,314 INFO L225 Difference]: With dead ends: 50 [2019-09-16 16:13:41,314 INFO L226 Difference]: Without dead ends: 47 [2019-09-16 16:13:41,315 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 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-16 16:13:41,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-16 16:13:41,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 39. [2019-09-16 16:13:41,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-16 16:13:41,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-09-16 16:13:41,323 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 26 [2019-09-16 16:13:41,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:13:41,323 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-09-16 16:13:41,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-16 16:13:41,323 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-09-16 16:13:41,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-16 16:13:41,324 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:13:41,325 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:13:41,325 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:13:41,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:13:41,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1655120587, now seen corresponding path program 1 times [2019-09-16 16:13:41,325 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:13:41,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:13:41,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:41,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:13:41,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:41,333 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-16 16:13:41,333 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-16 16:13:41,333 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-16 16:13:41,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:13:41,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:13:41,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-16 16:13:41,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:13:41,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:13:41,477 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-16 16:13:41,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-16 16:13:41,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-09-16 16:13:41,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-16 16:13:41,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-16 16:13:41,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:13:41,482 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 7 states. [2019-09-16 16:13:41,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:13:41,594 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2019-09-16 16:13:41,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-16 16:13:41,595 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-09-16 16:13:41,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:13:41,596 INFO L225 Difference]: With dead ends: 50 [2019-09-16 16:13:41,596 INFO L226 Difference]: Without dead ends: 47 [2019-09-16 16:13:41,597 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 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-16 16:13:41,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-16 16:13:41,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 39. [2019-09-16 16:13:41,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-16 16:13:41,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-09-16 16:13:41,604 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 26 [2019-09-16 16:13:41,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:13:41,605 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-09-16 16:13:41,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-16 16:13:41,605 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-09-16 16:13:41,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-16 16:13:41,606 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:13:41,606 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:13:41,606 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:13:41,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:13:41,607 INFO L82 PathProgramCache]: Analyzing trace with hash 586745035, now seen corresponding path program 2 times [2019-09-16 16:13:41,607 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:13:41,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:13:41,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:41,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:13:41,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:41,614 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-16 16:13:41,614 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-16 16:13:41,614 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-16 16:13:41,641 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-16 16:13:41,661 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-16 16:13:41,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:13:41,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-16 16:13:41,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:13:41,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:13:41,745 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-16 16:13:41,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-16 16:13:41,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-09-16 16:13:41,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-16 16:13:41,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-16 16:13:41,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:13:41,750 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 7 states. [2019-09-16 16:13:41,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:13:41,872 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2019-09-16 16:13:41,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-16 16:13:41,872 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-09-16 16:13:41,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:13:41,873 INFO L225 Difference]: With dead ends: 58 [2019-09-16 16:13:41,873 INFO L226 Difference]: Without dead ends: 55 [2019-09-16 16:13:41,874 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 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-16 16:13:41,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-16 16:13:41,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2019-09-16 16:13:41,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-16 16:13:41,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2019-09-16 16:13:41,883 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 26 [2019-09-16 16:13:41,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:13:41,883 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2019-09-16 16:13:41,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-16 16:13:41,883 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2019-09-16 16:13:41,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-16 16:13:41,884 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:13:41,885 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:13:41,885 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:13:41,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:13:41,885 INFO L82 PathProgramCache]: Analyzing trace with hash 644003337, now seen corresponding path program 2 times [2019-09-16 16:13:41,885 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:13:41,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:13:41,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:41,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:13:41,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:41,892 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-16 16:13:41,892 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-16 16:13:41,892 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-16 16:13:41,916 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-16 16:13:41,936 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-16 16:13:41,936 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:13:41,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-16 16:13:41,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:13:41,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:13:42,025 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-16 16:13:42,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-16 16:13:42,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-09-16 16:13:42,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-16 16:13:42,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-16 16:13:42,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:13:42,030 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 7 states. [2019-09-16 16:13:42,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:13:42,164 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2019-09-16 16:13:42,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-16 16:13:42,165 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-09-16 16:13:42,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:13:42,166 INFO L225 Difference]: With dead ends: 58 [2019-09-16 16:13:42,166 INFO L226 Difference]: Without dead ends: 55 [2019-09-16 16:13:42,167 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 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-16 16:13:42,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-16 16:13:42,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2019-09-16 16:13:42,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-16 16:13:42,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-09-16 16:13:42,181 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 26 [2019-09-16 16:13:42,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:13:42,181 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-09-16 16:13:42,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-16 16:13:42,181 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-09-16 16:13:42,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-16 16:13:42,184 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:13:42,184 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:13:42,184 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:13:42,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:13:42,185 INFO L82 PathProgramCache]: Analyzing trace with hash -380015110, now seen corresponding path program 3 times [2019-09-16 16:13:42,185 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:13:42,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:13:42,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:42,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:13:42,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:42,197 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-16 16:13:42,197 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-16 16:13:42,198 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-16 16:13:42,212 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-16 16:13:42,226 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-16 16:13:42,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:13:42,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-16 16:13:42,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:13:42,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:13:42,317 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-16 16:13:42,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-16 16:13:42,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-09-16 16:13:42,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-16 16:13:42,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-16 16:13:42,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-16 16:13:42,323 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 8 states. [2019-09-16 16:13:42,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:13:42,405 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2019-09-16 16:13:42,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-16 16:13:42,406 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-09-16 16:13:42,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:13:42,408 INFO L225 Difference]: With dead ends: 65 [2019-09-16 16:13:42,408 INFO L226 Difference]: Without dead ends: 62 [2019-09-16 16:13:42,408 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 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-16 16:13:42,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-16 16:13:42,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2019-09-16 16:13:42,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-16 16:13:42,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2019-09-16 16:13:42,425 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 34 [2019-09-16 16:13:42,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:13:42,425 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2019-09-16 16:13:42,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-16 16:13:42,425 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2019-09-16 16:13:42,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-16 16:13:42,429 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:13:42,429 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:13:42,429 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:13:42,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:13:42,430 INFO L82 PathProgramCache]: Analyzing trace with hash -322756808, now seen corresponding path program 3 times [2019-09-16 16:13:42,430 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:13:42,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:13:42,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:42,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:13:42,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:42,444 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-16 16:13:42,446 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-16 16:13:42,446 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-16 16:13:42,471 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-16 16:13:42,488 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-16 16:13:42,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:13:42,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-16 16:13:42,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:13:42,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:13:42,591 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-16 16:13:42,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-16 16:13:42,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-09-16 16:13:42,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-16 16:13:42,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-16 16:13:42,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-16 16:13:42,597 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 9 states. [2019-09-16 16:13:42,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:13:42,711 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2019-09-16 16:13:42,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-16 16:13:42,712 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-09-16 16:13:42,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:13:42,713 INFO L225 Difference]: With dead ends: 73 [2019-09-16 16:13:42,713 INFO L226 Difference]: Without dead ends: 70 [2019-09-16 16:13:42,714 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-09-16 16:13:42,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-16 16:13:42,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 47. [2019-09-16 16:13:42,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-16 16:13:42,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2019-09-16 16:13:42,722 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 34 [2019-09-16 16:13:42,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:13:42,723 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2019-09-16 16:13:42,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-16 16:13:42,723 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2019-09-16 16:13:42,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-16 16:13:42,724 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:13:42,724 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:13:42,724 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:13:42,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:13:42,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1391132360, now seen corresponding path program 4 times [2019-09-16 16:13:42,725 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:13:42,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:13:42,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:42,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:13:42,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:42,731 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-16 16:13:42,731 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-16 16:13:42,731 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-16 16:13:42,757 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-16 16:13:42,769 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-16 16:13:42,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:13:42,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-16 16:13:42,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:13:46,925 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 23 [2019-09-16 16:13:55,004 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2019-09-16 16:14:07,197 WARN L191 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 33 [2019-09-16 16:14:07,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:07,263 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 8 refuted. 8 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-16 16:14:07,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-16 16:14:07,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-09-16 16:14:07,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-16 16:14:07,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-16 16:14:07,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=76, Unknown=10, NotChecked=0, Total=110 [2019-09-16 16:14:07,272 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 11 states. [2019-09-16 16:14:58,745 WARN L191 SmtUtils]: Spent 8.03 s on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2019-09-16 16:15:27,184 WARN L191 SmtUtils]: Spent 8.05 s on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2019-09-16 16:15:46,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:15:46,963 INFO L93 Difference]: Finished difference Result 78 states and 92 transitions. [2019-09-16 16:15:46,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-16 16:15:46,963 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2019-09-16 16:15:46,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:15:46,965 INFO L225 Difference]: With dead ends: 78 [2019-09-16 16:15:46,966 INFO L226 Difference]: Without dead ends: 73 [2019-09-16 16:15:46,967 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 60.5s TimeCoverageRelationStatistics Valid=47, Invalid=143, Unknown=20, NotChecked=0, Total=210 [2019-09-16 16:15:46,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-09-16 16:15:46,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2019-09-16 16:15:46,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-16 16:15:46,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2019-09-16 16:15:46,983 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 34 [2019-09-16 16:15:46,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:15:46,983 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2019-09-16 16:15:46,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-16 16:15:46,984 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2019-09-16 16:15:46,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-16 16:15:46,986 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:15:46,986 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:15:46,986 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:15:46,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:15:46,986 INFO L82 PathProgramCache]: Analyzing trace with hash -161160392, now seen corresponding path program 5 times [2019-09-16 16:15:46,987 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:15:46,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:15:46,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:15:46,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:15:46,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:15:46,992 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-16 16:15:46,993 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-16 16:15:46,993 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-16 16:15:47,016 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-16 16:15:47,035 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-09-16 16:15:47,035 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:15:47,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-16 16:15:47,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:15:47,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:47,149 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-16 16:15:47,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-16 16:15:47,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-09-16 16:15:47,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-16 16:15:47,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-16 16:15:47,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-16 16:15:47,154 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand 8 states. [2019-09-16 16:15:47,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:15:47,313 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2019-09-16 16:15:47,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-16 16:15:47,314 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-09-16 16:15:47,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:15:47,318 INFO L225 Difference]: With dead ends: 85 [2019-09-16 16:15:47,319 INFO L226 Difference]: Without dead ends: 83 [2019-09-16 16:15:47,321 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 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-16 16:15:47,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-09-16 16:15:47,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-09-16 16:15:47,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-16 16:15:47,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2019-09-16 16:15:47,356 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 34 [2019-09-16 16:15:47,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:15:47,356 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2019-09-16 16:15:47,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-16 16:15:47,356 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2019-09-16 16:15:47,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-16 16:15:47,357 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:15:47,357 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:15:47,358 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:15:47,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:15:47,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1172277642, now seen corresponding path program 6 times [2019-09-16 16:15:47,362 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:15:47,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:15:47,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:15:47,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:15:47,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:15:47,371 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-16 16:15:47,371 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-16 16:15:47,371 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-16 16:15:47,397 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-16 16:15:47,417 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-09-16 16:15:47,417 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:15:47,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-16 16:15:47,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:15:47,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:47,609 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-16 16:15:47,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-16 16:15:47,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-09-16 16:15:47,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-16 16:15:47,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-16 16:15:47,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-16 16:15:47,614 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand 9 states. [2019-09-16 16:15:47,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:15:47,817 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2019-09-16 16:15:47,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-16 16:15:47,817 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-09-16 16:15:47,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:15:47,819 INFO L225 Difference]: With dead ends: 99 [2019-09-16 16:15:47,819 INFO L226 Difference]: Without dead ends: 96 [2019-09-16 16:15:47,820 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-09-16 16:15:47,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-16 16:15:47,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 69. [2019-09-16 16:15:47,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-16 16:15:47,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2019-09-16 16:15:47,849 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 34 [2019-09-16 16:15:47,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:15:47,850 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2019-09-16 16:15:47,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-16 16:15:47,850 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2019-09-16 16:15:47,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-16 16:15:47,853 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:15:47,853 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:15:47,854 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:15:47,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:15:47,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1276632411, now seen corresponding path program 7 times [2019-09-16 16:15:47,854 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:15:47,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:15:47,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:15:47,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:15:47,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:15:47,870 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-16 16:15:47,870 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-16 16:15:47,870 INFO L224 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) [2019-09-16 16:15:47,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-16 16:15:47,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:15:47,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-16 16:15:47,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:15:48,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:48,061 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-16 16:15:48,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-16 16:15:48,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-09-16 16:15:48,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-16 16:15:48,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-16 16:15:48,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-16 16:15:48,070 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand 9 states. [2019-09-16 16:15:48,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:15:48,280 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2019-09-16 16:15:48,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-16 16:15:48,280 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2019-09-16 16:15:48,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:15:48,282 INFO L225 Difference]: With dead ends: 103 [2019-09-16 16:15:48,283 INFO L226 Difference]: Without dead ends: 101 [2019-09-16 16:15:48,283 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-16 16:15:48,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-09-16 16:15:48,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 85. [2019-09-16 16:15:48,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-16 16:15:48,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2019-09-16 16:15:48,298 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 42 [2019-09-16 16:15:48,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:15:48,298 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2019-09-16 16:15:48,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-16 16:15:48,298 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2019-09-16 16:15:48,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-16 16:15:48,299 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:15:48,299 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:15:48,299 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:15:48,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:15:48,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1472854875, now seen corresponding path program 8 times [2019-09-16 16:15:48,300 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:15:48,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:15:48,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:15:48,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:15:48,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:15:48,306 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-16 16:15:48,306 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-16 16:15:48,306 INFO L224 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-16 16:15:48,329 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-16 16:15:48,348 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-16 16:15:48,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:15:48,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-16 16:15:48,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:15:48,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:48,516 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-16 16:15:48,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-16 16:15:48,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-09-16 16:15:48,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-16 16:15:48,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-16 16:15:48,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-16 16:15:48,521 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 9 states. [2019-09-16 16:15:48,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:15:48,722 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2019-09-16 16:15:48,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-16 16:15:48,722 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2019-09-16 16:15:48,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:15:48,724 INFO L225 Difference]: With dead ends: 111 [2019-09-16 16:15:48,724 INFO L226 Difference]: Without dead ends: 109 [2019-09-16 16:15:48,725 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-16 16:15:48,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-09-16 16:15:48,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 85. [2019-09-16 16:15:48,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-16 16:15:48,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2019-09-16 16:15:48,746 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 42 [2019-09-16 16:15:48,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:15:48,748 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2019-09-16 16:15:48,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-16 16:15:48,748 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2019-09-16 16:15:48,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-16 16:15:48,749 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:15:48,749 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:15:48,749 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:15:48,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:15:48,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1254000157, now seen corresponding path program 9 times [2019-09-16 16:15:48,750 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:15:48,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:15:48,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:15:48,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:15:48,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:15:48,761 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-16 16:15:48,761 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-16 16:15:48,761 INFO L224 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-16 16:15:48,781 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-16 16:15:48,791 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-16 16:15:48,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:15:48,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-16 16:15:48,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:15:48,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:48,881 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-16 16:15:48,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-16 16:15:48,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-09-16 16:15:48,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-16 16:15:48,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-16 16:15:48,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-16 16:15:48,890 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 8 states. [2019-09-16 16:15:48,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:15:48,948 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2019-09-16 16:15:48,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:15:48,949 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2019-09-16 16:15:48,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:15:48,950 INFO L225 Difference]: With dead ends: 85 [2019-09-16 16:15:48,950 INFO L226 Difference]: Without dead ends: 0 [2019-09-16 16:15:48,951 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-16 16:15:48,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-16 16:15:48,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-16 16:15:48,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-16 16:15:48,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-16 16:15:48,952 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2019-09-16 16:15:48,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:15:48,952 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-16 16:15:48,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-16 16:15:48,952 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-16 16:15:48,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-16 16:15:48,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-16 16:15:49,149 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 113 [2019-09-16 16:17:08,311 WARN L191 SmtUtils]: Spent 1.32 m on a formula simplification. DAG size of input: 112 DAG size of output: 28 [2019-09-16 16:18:55,312 WARN L191 SmtUtils]: Spent 1.78 m on a formula simplification. DAG size of input: 76 DAG size of output: 32 [2019-09-16 16:20:12,657 WARN L191 SmtUtils]: Spent 1.29 m on a formula simplification. DAG size of input: 112 DAG size of output: 28 [2019-09-16 16:20:12,659 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-16 16:20:12,659 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-16 16:20:12,659 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-16 16:20:12,660 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-16 16:20:12,660 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-16 16:20:12,660 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-16 16:20:12,660 INFO L439 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (let ((.cse0 (<= 1 main_~a~0)) (.cse1 (= (+ (* main_~x~0 main_~u~0) (* main_~y~0 main_~v~0)) (* main_~b~0 (* 2 main_~a~0))))) (or (and .cse0 .cse1 (exists ((main_~x~0 Int)) (= (+ (* main_~y~0 (+ main_~v~0 (* (- 1) main_~u~0))) (* main_~x~0 main_~u~0)) (* main_~b~0 (* 2 main_~a~0))))) (and (and (= main_~a~0 main_~v~0) (= main_~a~0 main_~x~0)) .cse0 .cse1))) [2019-09-16 16:20:12,661 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 26 39) no Hoare annotation was computed. [2019-09-16 16:20:12,661 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 13 46) no Hoare annotation was computed. [2019-09-16 16:20:12,661 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 13 46) no Hoare annotation was computed. [2019-09-16 16:20:12,661 INFO L443 ceAbstractionStarter]: For program point L32(lines 32 38) no Hoare annotation was computed. [2019-09-16 16:20:12,661 INFO L439 ceAbstractionStarter]: At program point L32-2(lines 26 39) the Hoare annotation is: (let ((.cse0 (<= 1 main_~a~0)) (.cse1 (= (+ (* main_~x~0 main_~u~0) (* main_~y~0 main_~v~0)) (* main_~b~0 (* 2 main_~a~0))))) (or (and .cse0 .cse1 (exists ((main_~x~0 Int)) (= (+ (* main_~y~0 (+ main_~v~0 (* (- 1) main_~u~0))) (* main_~x~0 main_~u~0)) (* main_~b~0 (* 2 main_~a~0))))) (and (and (= main_~a~0 main_~v~0) (= main_~a~0 main_~x~0)) .cse0 .cse1))) [2019-09-16 16:20:12,661 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 13 46) the Hoare annotation is: true [2019-09-16 16:20:12,661 INFO L439 ceAbstractionStarter]: At program point L26-2(lines 26 39) the Hoare annotation is: (let ((.cse1 (<= 1 main_~a~0)) (.cse0 (= (+ (* main_~x~0 main_~u~0) (* main_~y~0 main_~v~0)) (* main_~b~0 (* 2 main_~a~0))))) (or (and (exists ((v_prenex_1 Int)) (= (+ (* main_~u~0 v_prenex_1) (* main_~y~0 (+ main_~v~0 (* (- 1) main_~u~0)))) (* main_~b~0 (* 2 main_~a~0)))) .cse0) (and .cse1 (= main_~b~0 main_~y~0) (= main_~b~0 main_~u~0) .cse0) (and .cse1 (= main_~a~0 main_~v~0) .cse0 (= main_~a~0 main_~x~0)))) [2019-09-16 16:20:12,661 INFO L443 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2019-09-16 16:20:12,662 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2019-09-16 16:20:12,662 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 5 11) the Hoare annotation is: true [2019-09-16 16:20:12,662 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 5 11) no Hoare annotation was computed. [2019-09-16 16:20:12,662 INFO L443 ceAbstractionStarter]: For program point L7(lines 7 8) no Hoare annotation was computed. [2019-09-16 16:20:12,662 INFO L443 ceAbstractionStarter]: For program point L6(lines 6 9) no Hoare annotation was computed. [2019-09-16 16:20:12,662 INFO L443 ceAbstractionStarter]: For program point L6-2(lines 5 11) no Hoare annotation was computed. [2019-09-16 16:20:12,669 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~x~0,QUANTIFIED] [2019-09-16 16:20:12,677 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~x~0,QUANTIFIED] [2019-09-16 16:20:12,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 04:20:12 BoogieIcfgContainer [2019-09-16 16:20:12,681 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 16:20:12,683 INFO L168 Benchmark]: Toolchain (without parser) took 393556.46 ms. Allocated memory was 139.5 MB in the beginning and 297.3 MB in the end (delta: 157.8 MB). Free memory was 87.4 MB in the beginning and 77.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 167.8 MB. Max. memory is 7.1 GB. [2019-09-16 16:20:12,684 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 139.5 MB. Free memory was 105.6 MB in the beginning and 105.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 16:20:12,685 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.79 ms. Allocated memory is still 139.5 MB. Free memory was 87.1 MB in the beginning and 77.5 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2019-09-16 16:20:12,686 INFO L168 Benchmark]: Boogie Preprocessor took 124.20 ms. Allocated memory was 139.5 MB in the beginning and 200.3 MB in the end (delta: 60.8 MB). Free memory was 77.5 MB in the beginning and 177.8 MB in the end (delta: -100.3 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. [2019-09-16 16:20:12,687 INFO L168 Benchmark]: RCFGBuilder took 237.54 ms. Allocated memory is still 200.3 MB. Free memory was 177.8 MB in the beginning and 166.0 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 7.1 GB. [2019-09-16 16:20:12,691 INFO L168 Benchmark]: TraceAbstraction took 392891.55 ms. Allocated memory was 200.3 MB in the beginning and 297.3 MB in the end (delta: 97.0 MB). Free memory was 165.4 MB in the beginning and 77.3 MB in the end (delta: 88.0 MB). Peak memory consumption was 185.0 MB. Max. memory is 7.1 GB. [2019-09-16 16:20:12,696 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.20 ms. Allocated memory is still 139.5 MB. Free memory was 105.6 MB in the beginning and 105.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 295.79 ms. Allocated memory is still 139.5 MB. Free memory was 87.1 MB in the beginning and 77.5 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 124.20 ms. Allocated memory was 139.5 MB in the beginning and 200.3 MB in the end (delta: 60.8 MB). Free memory was 77.5 MB in the beginning and 177.8 MB in the end (delta: -100.3 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 237.54 ms. Allocated memory is still 200.3 MB. Free memory was 177.8 MB in the beginning and 166.0 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 392891.55 ms. Allocated memory was 200.3 MB in the beginning and 297.3 MB in the end (delta: 97.0 MB). Free memory was 165.4 MB in the beginning and 77.3 MB in the end (delta: 88.0 MB). Peak memory consumption was 185.0 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_~x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~x~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: 26]: Loop Invariant [2019-09-16 16:20:12,705 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~x~0,QUANTIFIED] [2019-09-16 16:20:12,706 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~x~0,QUANTIFIED] Derived loop invariant: ((1 <= a && x * u + y * v == b * (2 * a)) && (\exists main_~x~0 : int :: y * (v + -1 * u) + main_~x~0 * u == b * (2 * a))) || (((a == v && a == x) && 1 <= a) && x * u + y * v == b * (2 * a)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. SAFE Result, 392.8s OverallTime, 16 OverallIterations, 5 TraceHistogramMax, 101.6s AutomataDifference, 0.0s DeadEndRemovalTime, 263.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 245 SDtfs, 146 SDslu, 982 SDs, 0 SdLazy, 1291 SolverSat, 62 SolverUnsat, 36 SolverUnknown, 0 SolverNotchecked, 64.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 457 GetRequests, 348 SyntacticMatches, 2 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 61.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 153 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 33 PreInvPairs, 68 NumberOfFragments, 204 HoareAnnotationTreeSize, 33 FomulaSimplifications, 8992 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 8 FomulaSimplificationsInter, 2297 FormulaSimplificationTreeSizeReductionInter, 263.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 26.1s InterpolantComputationTime, 456 NumberOfCodeBlocks, 391 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 440 ConstructedInterpolants, 12 QuantifiedInterpolants, 119986 SizeOfPredicates, 38 NumberOfNonLiveVariables, 1016 ConjunctsInSsa, 360 ConjunctsInUnsatCore, 16 InterpolantComputations, 2 PerfectInterpolantSequences, 294/444 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...