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/eca-rers2012/Problem11_label25.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 18:18:37,832 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 18:18:37,834 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 18:18:37,845 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 18:18:37,846 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 18:18:37,847 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 18:18:37,848 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 18:18:37,850 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 18:18:37,852 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 18:18:37,853 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 18:18:37,853 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 18:18:37,855 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 18:18:37,855 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 18:18:37,856 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 18:18:37,857 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 18:18:37,858 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 18:18:37,858 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 18:18:37,859 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 18:18:37,861 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 18:18:37,863 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 18:18:37,864 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 18:18:37,865 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 18:18:37,866 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 18:18:37,867 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 18:18:37,869 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 18:18:37,870 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 18:18:37,870 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 18:18:37,871 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 18:18:37,871 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 18:18:37,872 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 18:18:37,872 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 18:18:37,873 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 18:18:37,873 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 18:18:37,874 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 18:18:37,875 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 18:18:37,875 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 18:18:37,876 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 18:18:37,876 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 18:18:37,877 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 18:18:37,877 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 18:18:37,878 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 18:18:37,879 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-07 18:18:37,893 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 18:18:37,893 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 18:18:37,894 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 18:18:37,895 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 18:18:37,895 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 18:18:37,896 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 18:18:37,897 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 18:18:37,897 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 18:18:37,897 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 18:18:37,897 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 18:18:37,897 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 18:18:37,898 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 18:18:37,898 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 18:18:37,898 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 18:18:37,899 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 18:18:37,899 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 18:18:37,899 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 18:18:37,900 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 18:18:37,900 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 18:18:37,900 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 18:18:37,900 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 18:18:37,900 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 18:18:37,901 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 18:18:37,901 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 18:18:37,901 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 18:18:37,901 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 18:18:37,902 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 18:18:37,902 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 18:18:37,902 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 18:18:37,952 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 18:18:37,966 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 18:18:37,970 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 18:18:37,971 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 18:18:37,971 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 18:18:37,972 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label25.c [2019-09-07 18:18:38,040 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2dd5b5c6/dca9bbaa91594223ad99b6ad58b9f771/FLAGcfd7bf17b [2019-09-07 18:18:38,612 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 18:18:38,613 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label25.c [2019-09-07 18:18:38,628 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2dd5b5c6/dca9bbaa91594223ad99b6ad58b9f771/FLAGcfd7bf17b [2019-09-07 18:18:38,859 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2dd5b5c6/dca9bbaa91594223ad99b6ad58b9f771 [2019-09-07 18:18:38,867 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 18:18:38,869 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 18:18:38,870 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 18:18:38,870 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 18:18:38,873 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 18:18:38,874 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 06:18:38" (1/1) ... [2019-09-07 18:18:38,877 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39e607a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:18:38, skipping insertion in model container [2019-09-07 18:18:38,877 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 06:18:38" (1/1) ... [2019-09-07 18:18:38,884 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 18:18:38,950 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 18:18:39,847 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 18:18:39,853 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 18:18:40,050 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 18:18:40,069 INFO L192 MainTranslator]: Completed translation [2019-09-07 18:18:40,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:18:40 WrapperNode [2019-09-07 18:18:40,070 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 18:18:40,071 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 18:18:40,071 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 18:18:40,071 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 18:18:40,085 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:18:40" (1/1) ... [2019-09-07 18:18:40,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:18:40" (1/1) ... [2019-09-07 18:18:40,111 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:18:40" (1/1) ... [2019-09-07 18:18:40,112 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:18:40" (1/1) ... [2019-09-07 18:18:40,176 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:18:40" (1/1) ... [2019-09-07 18:18:40,201 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:18:40" (1/1) ... [2019-09-07 18:18:40,209 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:18:40" (1/1) ... [2019-09-07 18:18:40,219 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 18:18:40,220 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 18:18:40,220 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 18:18:40,220 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 18:18:40,221 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:18:40" (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-07 18:18:40,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 18:18:40,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 18:18:40,284 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 18:18:40,285 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 18:18:40,285 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 18:18:40,285 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 18:18:40,285 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 18:18:40,286 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 18:18:40,286 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 18:18:40,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 18:18:40,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 18:18:42,003 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 18:18:42,003 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 18:18:42,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 06:18:42 BoogieIcfgContainer [2019-09-07 18:18:42,008 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 18:18:42,009 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 18:18:42,009 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 18:18:42,013 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 18:18:42,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 06:18:38" (1/3) ... [2019-09-07 18:18:42,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a95659 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 06:18:42, skipping insertion in model container [2019-09-07 18:18:42,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:18:40" (2/3) ... [2019-09-07 18:18:42,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a95659 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 06:18:42, skipping insertion in model container [2019-09-07 18:18:42,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 06:18:42" (3/3) ... [2019-09-07 18:18:42,026 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label25.c [2019-09-07 18:18:42,036 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 18:18:42,045 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 18:18:42,064 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 18:18:42,114 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 18:18:42,115 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 18:18:42,116 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 18:18:42,116 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 18:18:42,117 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 18:18:42,117 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 18:18:42,118 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 18:18:42,118 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 18:18:42,118 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 18:18:42,152 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states. [2019-09-07 18:18:42,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-07 18:18:42,159 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:18:42,160 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:18:42,162 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:18:42,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:18:42,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1539824594, now seen corresponding path program 1 times [2019-09-07 18:18:42,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:18:42,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:18:42,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:18:42,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:18:42,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:18:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:18:42,491 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-07 18:18:42,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:18:42,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 18:18:42,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 18:18:42,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 18:18:42,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 18:18:42,545 INFO L87 Difference]: Start difference. First operand 292 states. Second operand 4 states. [2019-09-07 18:18:44,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:18:44,623 INFO L93 Difference]: Finished difference Result 992 states and 1772 transitions. [2019-09-07 18:18:44,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 18:18:44,626 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-09-07 18:18:44,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:18:44,654 INFO L225 Difference]: With dead ends: 992 [2019-09-07 18:18:44,654 INFO L226 Difference]: Without dead ends: 618 [2019-09-07 18:18:44,668 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 18:18:44,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-09-07 18:18:44,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 419. [2019-09-07 18:18:44,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-09-07 18:18:44,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 604 transitions. [2019-09-07 18:18:44,751 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 604 transitions. Word has length 37 [2019-09-07 18:18:44,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:18:44,751 INFO L475 AbstractCegarLoop]: Abstraction has 419 states and 604 transitions. [2019-09-07 18:18:44,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 18:18:44,752 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 604 transitions. [2019-09-07 18:18:44,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-07 18:18:44,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:18:44,757 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:18:44,758 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:18:44,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:18:44,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1804759410, now seen corresponding path program 1 times [2019-09-07 18:18:44,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:18:44,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:18:44,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:18:44,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:18:44,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:18:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:18:45,011 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:18:45,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:18:45,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 18:18:45,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 18:18:45,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 18:18:45,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 18:18:45,018 INFO L87 Difference]: Start difference. First operand 419 states and 604 transitions. Second operand 6 states. [2019-09-07 18:18:46,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:18:46,489 INFO L93 Difference]: Finished difference Result 1236 states and 1811 transitions. [2019-09-07 18:18:46,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 18:18:46,490 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2019-09-07 18:18:46,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:18:46,498 INFO L225 Difference]: With dead ends: 1236 [2019-09-07 18:18:46,498 INFO L226 Difference]: Without dead ends: 823 [2019-09-07 18:18:46,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 18:18:46,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2019-09-07 18:18:46,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 808. [2019-09-07 18:18:46,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2019-09-07 18:18:46,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1155 transitions. [2019-09-07 18:18:46,548 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1155 transitions. Word has length 109 [2019-09-07 18:18:46,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:18:46,549 INFO L475 AbstractCegarLoop]: Abstraction has 808 states and 1155 transitions. [2019-09-07 18:18:46,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 18:18:46,549 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1155 transitions. [2019-09-07 18:18:46,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-07 18:18:46,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:18:46,553 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:18:46,554 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:18:46,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:18:46,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1442270559, now seen corresponding path program 1 times [2019-09-07 18:18:46,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:18:46,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:18:46,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:18:46,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:18:46,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:18:46,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:18:46,703 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:18:46,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:18:46,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 18:18:46,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 18:18:46,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 18:18:46,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 18:18:46,707 INFO L87 Difference]: Start difference. First operand 808 states and 1155 transitions. Second operand 4 states. [2019-09-07 18:18:48,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:18:48,448 INFO L93 Difference]: Finished difference Result 2389 states and 3450 transitions. [2019-09-07 18:18:48,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 18:18:48,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-09-07 18:18:48,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:18:48,457 INFO L225 Difference]: With dead ends: 2389 [2019-09-07 18:18:48,458 INFO L226 Difference]: Without dead ends: 1587 [2019-09-07 18:18:48,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 18:18:48,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1587 states. [2019-09-07 18:18:48,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1587 to 1382. [2019-09-07 18:18:48,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1382 states. [2019-09-07 18:18:48,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 1936 transitions. [2019-09-07 18:18:48,502 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 1936 transitions. Word has length 110 [2019-09-07 18:18:48,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:18:48,503 INFO L475 AbstractCegarLoop]: Abstraction has 1382 states and 1936 transitions. [2019-09-07 18:18:48,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 18:18:48,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 1936 transitions. [2019-09-07 18:18:48,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-07 18:18:48,506 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:18:48,507 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:18:48,507 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:18:48,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:18:48,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1880973050, now seen corresponding path program 1 times [2019-09-07 18:18:48,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:18:48,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:18:48,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:18:48,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:18:48,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:18:48,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:18:48,642 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:18:48,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:18:48,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 18:18:48,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 18:18:48,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 18:18:48,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 18:18:48,644 INFO L87 Difference]: Start difference. First operand 1382 states and 1936 transitions. Second operand 6 states. [2019-09-07 18:18:51,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:18:51,143 INFO L93 Difference]: Finished difference Result 5243 states and 8627 transitions. [2019-09-07 18:18:51,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 18:18:51,143 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2019-09-07 18:18:51,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:18:51,179 INFO L225 Difference]: With dead ends: 5243 [2019-09-07 18:18:51,180 INFO L226 Difference]: Without dead ends: 3867 [2019-09-07 18:18:51,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-09-07 18:18:51,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3867 states. [2019-09-07 18:18:51,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3867 to 3573. [2019-09-07 18:18:51,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3573 states. [2019-09-07 18:18:51,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3573 states to 3573 states and 4989 transitions. [2019-09-07 18:18:51,338 INFO L78 Accepts]: Start accepts. Automaton has 3573 states and 4989 transitions. Word has length 135 [2019-09-07 18:18:51,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:18:51,339 INFO L475 AbstractCegarLoop]: Abstraction has 3573 states and 4989 transitions. [2019-09-07 18:18:51,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 18:18:51,339 INFO L276 IsEmpty]: Start isEmpty. Operand 3573 states and 4989 transitions. [2019-09-07 18:18:51,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-07 18:18:51,345 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:18:51,345 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:18:51,345 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:18:51,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:18:51,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1909035527, now seen corresponding path program 1 times [2019-09-07 18:18:51,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:18:51,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:18:51,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:18:51,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:18:51,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:18:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:18:51,552 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 129 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:18:51,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:18:51,552 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:18:51,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:18:51,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:18:51,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 18:18:51,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:18:51,745 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-09-07 18:18:51,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 18:18:51,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-07 18:18:51,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 18:18:51,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 18:18:51,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-07 18:18:51,762 INFO L87 Difference]: Start difference. First operand 3573 states and 4989 transitions. Second operand 7 states. [2019-09-07 18:18:54,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:18:54,200 INFO L93 Difference]: Finished difference Result 8815 states and 14425 transitions. [2019-09-07 18:18:54,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 18:18:54,201 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 182 [2019-09-07 18:18:54,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:18:54,241 INFO L225 Difference]: With dead ends: 8815 [2019-09-07 18:18:54,242 INFO L226 Difference]: Without dead ends: 5248 [2019-09-07 18:18:54,266 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-09-07 18:18:54,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5248 states. [2019-09-07 18:18:54,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5248 to 4891. [2019-09-07 18:18:54,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4891 states. [2019-09-07 18:18:54,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4891 states to 4891 states and 6311 transitions. [2019-09-07 18:18:54,446 INFO L78 Accepts]: Start accepts. Automaton has 4891 states and 6311 transitions. Word has length 182 [2019-09-07 18:18:54,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:18:54,447 INFO L475 AbstractCegarLoop]: Abstraction has 4891 states and 6311 transitions. [2019-09-07 18:18:54,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 18:18:54,448 INFO L276 IsEmpty]: Start isEmpty. Operand 4891 states and 6311 transitions. [2019-09-07 18:18:54,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-07 18:18:54,453 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:18:54,454 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:18:54,454 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:18:54,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:18:54,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1281259981, now seen corresponding path program 1 times [2019-09-07 18:18:54,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:18:54,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:18:54,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:18:54,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:18:54,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:18:54,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:18:54,804 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 7 proven. 59 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-09-07 18:18:54,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:18:54,804 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 18:18:54,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:18:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:18:54,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 18:18:54,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:18:55,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:18:55,133 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-07 18:18:55,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 18:18:55,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2019-09-07 18:18:55,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 18:18:55,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 18:18:55,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-07 18:18:55,149 INFO L87 Difference]: Start difference. First operand 4891 states and 6311 transitions. Second operand 12 states. [2019-09-07 18:19:01,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:19:01,405 INFO L93 Difference]: Finished difference Result 15986 states and 21128 transitions. [2019-09-07 18:19:01,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-07 18:19:01,405 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 204 [2019-09-07 18:19:01,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:19:01,460 INFO L225 Difference]: With dead ends: 15986 [2019-09-07 18:19:01,461 INFO L226 Difference]: Without dead ends: 11101 [2019-09-07 18:19:01,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=437, Invalid=1543, Unknown=0, NotChecked=0, Total=1980 [2019-09-07 18:19:01,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11101 states. [2019-09-07 18:19:01,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11101 to 9929. [2019-09-07 18:19:01,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9929 states. [2019-09-07 18:19:01,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9929 states to 9929 states and 12918 transitions. [2019-09-07 18:19:01,875 INFO L78 Accepts]: Start accepts. Automaton has 9929 states and 12918 transitions. Word has length 204 [2019-09-07 18:19:01,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:19:01,876 INFO L475 AbstractCegarLoop]: Abstraction has 9929 states and 12918 transitions. [2019-09-07 18:19:01,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 18:19:01,877 INFO L276 IsEmpty]: Start isEmpty. Operand 9929 states and 12918 transitions. [2019-09-07 18:19:01,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-09-07 18:19:01,889 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:19:01,890 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:19:01,890 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:19:01,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:19:01,899 INFO L82 PathProgramCache]: Analyzing trace with hash 277664395, now seen corresponding path program 1 times [2019-09-07 18:19:01,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:19:01,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:19:01,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:19:01,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:19:01,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:19:01,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:19:02,213 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 125 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:19:02,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:19:02,214 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 18:19:02,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:19:02,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:19:02,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 18:19:02,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:19:02,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:19:02,636 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 152 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:19:02,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:19:02,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-09-07 18:19:02,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 18:19:02,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 18:19:02,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-07 18:19:02,657 INFO L87 Difference]: Start difference. First operand 9929 states and 12918 transitions. Second operand 13 states. [2019-09-07 18:19:12,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:19:12,558 INFO L93 Difference]: Finished difference Result 24683 states and 33791 transitions. [2019-09-07 18:19:12,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-07 18:19:12,558 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 278 [2019-09-07 18:19:12,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:19:12,622 INFO L225 Difference]: With dead ends: 24683 [2019-09-07 18:19:12,622 INFO L226 Difference]: Without dead ends: 14760 [2019-09-07 18:19:12,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3171 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1281, Invalid=7275, Unknown=0, NotChecked=0, Total=8556 [2019-09-07 18:19:12,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14760 states. [2019-09-07 18:19:13,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14760 to 13789. [2019-09-07 18:19:13,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13789 states. [2019-09-07 18:19:13,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13789 states to 13789 states and 17137 transitions. [2019-09-07 18:19:13,110 INFO L78 Accepts]: Start accepts. Automaton has 13789 states and 17137 transitions. Word has length 278 [2019-09-07 18:19:13,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:19:13,111 INFO L475 AbstractCegarLoop]: Abstraction has 13789 states and 17137 transitions. [2019-09-07 18:19:13,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 18:19:13,111 INFO L276 IsEmpty]: Start isEmpty. Operand 13789 states and 17137 transitions. [2019-09-07 18:19:13,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-09-07 18:19:13,131 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:19:13,132 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:19:13,132 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:19:13,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:19:13,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1163936277, now seen corresponding path program 1 times [2019-09-07 18:19:13,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:19:13,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:19:13,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:19:13,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:19:13,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:19:13,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:19:13,491 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 7 proven. 59 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-09-07 18:19:13,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:19:13,492 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:19:13,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:19:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:19:13,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 18:19:13,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:19:13,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:19:13,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:19:13,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:19:14,218 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 9 proven. 57 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-09-07 18:19:14,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:19:14,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-09-07 18:19:14,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 18:19:14,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 18:19:14,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-09-07 18:19:14,233 INFO L87 Difference]: Start difference. First operand 13789 states and 17137 transitions. Second operand 13 states. [2019-09-07 18:19:18,364 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 31 [2019-09-07 18:19:26,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:19:26,977 INFO L93 Difference]: Finished difference Result 42233 states and 55885 transitions. [2019-09-07 18:19:26,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-07 18:19:26,977 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 343 [2019-09-07 18:19:26,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:19:27,086 INFO L225 Difference]: With dead ends: 42233 [2019-09-07 18:19:27,086 INFO L226 Difference]: Without dead ends: 28450 [2019-09-07 18:19:27,122 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 341 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=235, Invalid=635, Unknown=0, NotChecked=0, Total=870 [2019-09-07 18:19:27,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28450 states. [2019-09-07 18:19:28,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28450 to 27242. [2019-09-07 18:19:28,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27242 states. [2019-09-07 18:19:28,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27242 states to 27242 states and 34528 transitions. [2019-09-07 18:19:28,484 INFO L78 Accepts]: Start accepts. Automaton has 27242 states and 34528 transitions. Word has length 343 [2019-09-07 18:19:28,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:19:28,485 INFO L475 AbstractCegarLoop]: Abstraction has 27242 states and 34528 transitions. [2019-09-07 18:19:28,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 18:19:28,485 INFO L276 IsEmpty]: Start isEmpty. Operand 27242 states and 34528 transitions. [2019-09-07 18:19:28,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-09-07 18:19:28,519 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:19:28,519 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:19:28,520 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:19:28,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:19:28,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1794790461, now seen corresponding path program 1 times [2019-09-07 18:19:28,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:19:28,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:19:28,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:19:28,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:19:28,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:19:28,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:19:28,892 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 252 proven. 29 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-09-07 18:19:28,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:19:28,893 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 18:19:28,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:19:29,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:19:29,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 18:19:29,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:19:29,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:19:29,540 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 354 proven. 2 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-07 18:19:29,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:19:29,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-09-07 18:19:29,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 18:19:29,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 18:19:29,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-07 18:19:29,550 INFO L87 Difference]: Start difference. First operand 27242 states and 34528 transitions. Second operand 13 states. [2019-09-07 18:19:39,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:19:39,991 INFO L93 Difference]: Finished difference Result 66449 states and 88754 transitions. [2019-09-07 18:19:39,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-07 18:19:39,992 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 371 [2019-09-07 18:19:39,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:19:40,121 INFO L225 Difference]: With dead ends: 66449 [2019-09-07 18:19:40,122 INFO L226 Difference]: Without dead ends: 39203 [2019-09-07 18:19:40,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 422 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2241 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1083, Invalid=5237, Unknown=0, NotChecked=0, Total=6320 [2019-09-07 18:19:40,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39203 states. [2019-09-07 18:19:40,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39203 to 37956. [2019-09-07 18:19:40,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37956 states. [2019-09-07 18:19:40,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37956 states to 37956 states and 47931 transitions. [2019-09-07 18:19:40,988 INFO L78 Accepts]: Start accepts. Automaton has 37956 states and 47931 transitions. Word has length 371 [2019-09-07 18:19:40,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:19:40,989 INFO L475 AbstractCegarLoop]: Abstraction has 37956 states and 47931 transitions. [2019-09-07 18:19:40,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 18:19:40,989 INFO L276 IsEmpty]: Start isEmpty. Operand 37956 states and 47931 transitions. [2019-09-07 18:19:41,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2019-09-07 18:19:41,037 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:19:41,037 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:19:41,038 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:19:41,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:19:41,038 INFO L82 PathProgramCache]: Analyzing trace with hash -2022294691, now seen corresponding path program 1 times [2019-09-07 18:19:41,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:19:41,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:19:41,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:19:41,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:19:41,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:19:41,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:19:41,946 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 180 proven. 88 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-09-07 18:19:41,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:19:41,946 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:19:41,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:19:42,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:19:42,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 667 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 18:19:42,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:19:42,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 18:19:42,528 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 349 proven. 2 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-07 18:19:42,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:19:42,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 18 [2019-09-07 18:19:42,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 18:19:42,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 18:19:42,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2019-09-07 18:19:42,533 INFO L87 Difference]: Start difference. First operand 37956 states and 47931 transitions. Second operand 18 states. [2019-09-07 18:19:47,552 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2019-09-07 18:19:47,755 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2019-09-07 18:19:48,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:19:48,484 INFO L93 Difference]: Finished difference Result 74828 states and 95470 transitions. [2019-09-07 18:19:48,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-07 18:19:48,484 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 416 [2019-09-07 18:19:48,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:19:48,576 INFO L225 Difference]: With dead ends: 74828 [2019-09-07 18:19:48,576 INFO L226 Difference]: Without dead ends: 37256 [2019-09-07 18:19:48,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 436 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=500, Invalid=1480, Unknown=0, NotChecked=0, Total=1980 [2019-09-07 18:19:48,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37256 states. [2019-09-07 18:19:49,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37256 to 37144. [2019-09-07 18:19:49,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37144 states. [2019-09-07 18:19:49,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37144 states to 37144 states and 45771 transitions. [2019-09-07 18:19:49,274 INFO L78 Accepts]: Start accepts. Automaton has 37144 states and 45771 transitions. Word has length 416 [2019-09-07 18:19:49,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:19:49,274 INFO L475 AbstractCegarLoop]: Abstraction has 37144 states and 45771 transitions. [2019-09-07 18:19:49,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 18:19:49,276 INFO L276 IsEmpty]: Start isEmpty. Operand 37144 states and 45771 transitions. [2019-09-07 18:19:49,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2019-09-07 18:19:49,351 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:19:49,352 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:19:49,352 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:19:49,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:19:49,353 INFO L82 PathProgramCache]: Analyzing trace with hash 2105134033, now seen corresponding path program 1 times [2019-09-07 18:19:49,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:19:49,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:19:49,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:19:49,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:19:49,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:19:49,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:19:50,748 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 417 proven. 2 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-09-07 18:19:50,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:19:50,748 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:19:50,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:19:50,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:19:50,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 18:19:50,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:19:50,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:19:50,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:19:54,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:19:54,916 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 92 proven. 327 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-09-07 18:19:54,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:19:54,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 19 [2019-09-07 18:19:54,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 18:19:54,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 18:19:54,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=286, Unknown=2, NotChecked=0, Total=342 [2019-09-07 18:19:54,925 INFO L87 Difference]: Start difference. First operand 37144 states and 45771 transitions. Second operand 19 states. [2019-09-07 18:19:58,362 WARN L188 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-09-07 18:19:59,783 WARN L188 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-09-07 18:20:01,261 WARN L188 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-09-07 18:20:12,251 WARN L188 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-09-07 18:20:24,897 WARN L188 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 61 DAG size of output: 32 [2019-09-07 18:20:53,451 WARN L188 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-09-07 18:20:59,669 WARN L188 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-07 18:21:04,731 WARN L188 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-07 18:21:06,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:21:06,807 INFO L93 Difference]: Finished difference Result 78942 states and 99832 transitions. [2019-09-07 18:21:06,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-07 18:21:06,808 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 538 [2019-09-07 18:21:06,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:21:06,933 INFO L225 Difference]: With dead ends: 78942 [2019-09-07 18:21:06,934 INFO L226 Difference]: Without dead ends: 42182 [2019-09-07 18:21:06,990 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 638 GetRequests, 566 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1648 ImplicationChecksByTransitivity, 32.2s TimeCoverageRelationStatistics Valid=1006, Invalid=4238, Unknown=12, NotChecked=0, Total=5256 [2019-09-07 18:21:07,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42182 states. [2019-09-07 18:21:07,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42182 to 41727. [2019-09-07 18:21:07,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41727 states. [2019-09-07 18:21:07,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41727 states to 41727 states and 51338 transitions. [2019-09-07 18:21:07,792 INFO L78 Accepts]: Start accepts. Automaton has 41727 states and 51338 transitions. Word has length 538 [2019-09-07 18:21:07,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:21:07,793 INFO L475 AbstractCegarLoop]: Abstraction has 41727 states and 51338 transitions. [2019-09-07 18:21:07,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 18:21:07,794 INFO L276 IsEmpty]: Start isEmpty. Operand 41727 states and 51338 transitions. [2019-09-07 18:21:07,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 553 [2019-09-07 18:21:07,850 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:21:07,851 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:21:07,851 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:21:07,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:21:07,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1909401230, now seen corresponding path program 1 times [2019-09-07 18:21:07,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:21:07,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:21:07,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:21:07,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:21:07,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:21:07,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:21:08,993 INFO L134 CoverageAnalysis]: Checked inductivity of 763 backedges. 329 proven. 100 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2019-09-07 18:21:08,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:21:08,994 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 18:21:09,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:21:09,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:21:09,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 18:21:09,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:21:09,328 INFO L134 CoverageAnalysis]: Checked inductivity of 763 backedges. 626 proven. 2 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-09-07 18:21:09,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:21:09,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 18:21:09,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 18:21:09,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 18:21:09,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 18:21:09,336 INFO L87 Difference]: Start difference. First operand 41727 states and 51338 transitions. Second operand 9 states. [2019-09-07 18:21:12,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:21:12,438 INFO L93 Difference]: Finished difference Result 86879 states and 114126 transitions. [2019-09-07 18:21:12,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 18:21:12,439 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 552 [2019-09-07 18:21:12,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:21:12,618 INFO L225 Difference]: With dead ends: 86879 [2019-09-07 18:21:12,618 INFO L226 Difference]: Without dead ends: 45346 [2019-09-07 18:21:12,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 569 GetRequests, 556 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-09-07 18:21:12,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45346 states. [2019-09-07 18:21:13,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45346 to 42715. [2019-09-07 18:21:13,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42715 states. [2019-09-07 18:21:13,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42715 states to 42715 states and 56331 transitions. [2019-09-07 18:21:13,969 INFO L78 Accepts]: Start accepts. Automaton has 42715 states and 56331 transitions. Word has length 552 [2019-09-07 18:21:13,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:21:13,970 INFO L475 AbstractCegarLoop]: Abstraction has 42715 states and 56331 transitions. [2019-09-07 18:21:13,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 18:21:13,971 INFO L276 IsEmpty]: Start isEmpty. Operand 42715 states and 56331 transitions. [2019-09-07 18:21:14,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2019-09-07 18:21:14,048 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:21:14,049 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:21:14,049 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:21:14,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:21:14,050 INFO L82 PathProgramCache]: Analyzing trace with hash -710820415, now seen corresponding path program 1 times [2019-09-07 18:21:14,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:21:14,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:21:14,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:21:14,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:21:14,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:21:14,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:21:15,611 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 214 proven. 339 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-09-07 18:21:15,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:21:15,611 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 18:21:15,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:21:15,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:21:15,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 851 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 18:21:15,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:21:15,928 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 643 proven. 2 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-09-07 18:21:15,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:21:15,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2019-09-07 18:21:15,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 18:21:15,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 18:21:15,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-07 18:21:15,936 INFO L87 Difference]: Start difference. First operand 42715 states and 56331 transitions. Second operand 10 states. [2019-09-07 18:21:18,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:21:18,897 INFO L93 Difference]: Finished difference Result 93834 states and 123997 transitions. [2019-09-07 18:21:18,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 18:21:18,898 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 555 [2019-09-07 18:21:18,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:21:19,030 INFO L225 Difference]: With dead ends: 93834 [2019-09-07 18:21:19,030 INFO L226 Difference]: Without dead ends: 53831 [2019-09-07 18:21:19,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 578 GetRequests, 563 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-09-07 18:21:19,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53831 states. [2019-09-07 18:21:20,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53831 to 52457. [2019-09-07 18:21:20,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52457 states. [2019-09-07 18:21:20,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52457 states to 52457 states and 68201 transitions. [2019-09-07 18:21:20,332 INFO L78 Accepts]: Start accepts. Automaton has 52457 states and 68201 transitions. Word has length 555 [2019-09-07 18:21:20,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:21:20,333 INFO L475 AbstractCegarLoop]: Abstraction has 52457 states and 68201 transitions. [2019-09-07 18:21:20,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 18:21:20,333 INFO L276 IsEmpty]: Start isEmpty. Operand 52457 states and 68201 transitions. [2019-09-07 18:21:20,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2019-09-07 18:21:20,403 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:21:20,404 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:21:20,404 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:21:20,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:21:20,404 INFO L82 PathProgramCache]: Analyzing trace with hash 977983600, now seen corresponding path program 1 times [2019-09-07 18:21:20,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:21:20,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:21:20,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:21:20,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:21:20,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:21:20,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:21:20,915 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 329 proven. 100 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2019-09-07 18:21:20,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:21:20,916 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 18:21:20,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:21:21,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:21:21,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 855 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 18:21:21,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:21:22,452 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 637 proven. 2 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-07 18:21:22,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:21:22,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 18:21:22,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 18:21:22,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 18:21:22,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 18:21:22,457 INFO L87 Difference]: Start difference. First operand 52457 states and 68201 transitions. Second operand 9 states. [2019-09-07 18:21:24,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:21:24,903 INFO L93 Difference]: Finished difference Result 105070 states and 134208 transitions. [2019-09-07 18:21:24,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 18:21:24,903 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 561 [2019-09-07 18:21:24,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:21:24,999 INFO L225 Difference]: With dead ends: 105070 [2019-09-07 18:21:25,000 INFO L226 Difference]: Without dead ends: 52809 [2019-09-07 18:21:25,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 580 GetRequests, 566 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-09-07 18:21:25,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52809 states. [2019-09-07 18:21:25,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52809 to 45558. [2019-09-07 18:21:25,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45558 states. [2019-09-07 18:21:25,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45558 states to 45558 states and 53207 transitions. [2019-09-07 18:21:25,717 INFO L78 Accepts]: Start accepts. Automaton has 45558 states and 53207 transitions. Word has length 561 [2019-09-07 18:21:25,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:21:25,718 INFO L475 AbstractCegarLoop]: Abstraction has 45558 states and 53207 transitions. [2019-09-07 18:21:25,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 18:21:25,718 INFO L276 IsEmpty]: Start isEmpty. Operand 45558 states and 53207 transitions. [2019-09-07 18:21:25,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2019-09-07 18:21:25,764 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:21:25,765 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:21:25,765 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:21:25,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:21:25,766 INFO L82 PathProgramCache]: Analyzing trace with hash -473439407, now seen corresponding path program 1 times [2019-09-07 18:21:25,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:21:25,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:21:25,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:21:25,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:21:25,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:21:25,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:21:26,140 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-09-07 18:21:26,303 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 446 proven. 29 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2019-09-07 18:21:26,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:21:26,303 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:21:26,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:21:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:21:26,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 854 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 18:21:26,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:21:26,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:21:26,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:21:26,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:21:27,208 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 499 proven. 93 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2019-09-07 18:21:27,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:21:27,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-09-07 18:21:27,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 18:21:27,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 18:21:27,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-09-07 18:21:27,225 INFO L87 Difference]: Start difference. First operand 45558 states and 53207 transitions. Second operand 14 states. [2019-09-07 18:21:28,634 WARN L188 SmtUtils]: Spent 861.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 25 [2019-09-07 18:21:29,900 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2019-09-07 18:21:32,035 WARN L188 SmtUtils]: Spent 915.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2019-09-07 18:21:33,596 WARN L188 SmtUtils]: Spent 879.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 31 [2019-09-07 18:21:36,434 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 24 [2019-09-07 18:21:37,946 WARN L188 SmtUtils]: Spent 825.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2019-09-07 18:21:38,902 WARN L188 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2019-09-07 18:21:39,998 WARN L188 SmtUtils]: Spent 914.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2019-09-07 18:21:40,902 WARN L188 SmtUtils]: Spent 871.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2019-09-07 18:21:43,757 WARN L188 SmtUtils]: Spent 969.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2019-09-07 18:21:44,279 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 36 [2019-09-07 18:21:45,464 WARN L188 SmtUtils]: Spent 883.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-09-07 18:21:47,291 WARN L188 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2019-09-07 18:21:48,995 WARN L188 SmtUtils]: Spent 913.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2019-09-07 18:22:05,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:22:05,564 INFO L93 Difference]: Finished difference Result 112589 states and 131826 transitions. [2019-09-07 18:22:05,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-07 18:22:05,565 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 563 [2019-09-07 18:22:05,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:22:05,673 INFO L225 Difference]: With dead ends: 112589 [2019-09-07 18:22:05,673 INFO L226 Difference]: Without dead ends: 67227 [2019-09-07 18:22:05,722 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 710 GetRequests, 622 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2865 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=1093, Invalid=6736, Unknown=3, NotChecked=0, Total=7832 [2019-09-07 18:22:05,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67227 states. [2019-09-07 18:22:06,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67227 to 64332. [2019-09-07 18:22:06,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64332 states. [2019-09-07 18:22:06,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64332 states to 64332 states and 74437 transitions. [2019-09-07 18:22:06,423 INFO L78 Accepts]: Start accepts. Automaton has 64332 states and 74437 transitions. Word has length 563 [2019-09-07 18:22:06,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:22:06,423 INFO L475 AbstractCegarLoop]: Abstraction has 64332 states and 74437 transitions. [2019-09-07 18:22:06,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 18:22:06,423 INFO L276 IsEmpty]: Start isEmpty. Operand 64332 states and 74437 transitions. [2019-09-07 18:22:06,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 612 [2019-09-07 18:22:06,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:22:06,476 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:22:06,476 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:22:06,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:22:06,477 INFO L82 PathProgramCache]: Analyzing trace with hash -755381329, now seen corresponding path program 1 times [2019-09-07 18:22:06,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:22:06,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:22:06,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:22:06,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:22:06,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:22:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:22:07,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1049 backedges. 313 proven. 144 refuted. 0 times theorem prover too weak. 592 trivial. 0 not checked. [2019-09-07 18:22:07,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:22:07,185 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:22:07,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:22:07,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:22:07,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 949 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 18:22:07,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:22:07,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:22:07,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1049 backedges. 893 proven. 6 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-09-07 18:22:07,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:22:07,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-09-07 18:22:07,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 18:22:07,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 18:22:07,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-09-07 18:22:07,686 INFO L87 Difference]: Start difference. First operand 64332 states and 74437 transitions. Second operand 13 states. [2019-09-07 18:22:13,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:22:13,888 INFO L93 Difference]: Finished difference Result 142565 states and 165634 transitions. [2019-09-07 18:22:13,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 18:22:13,888 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 611 [2019-09-07 18:22:13,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:22:14,024 INFO L225 Difference]: With dead ends: 142565 [2019-09-07 18:22:14,024 INFO L226 Difference]: Without dead ends: 82077 [2019-09-07 18:22:15,497 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 654 GetRequests, 623 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=248, Invalid=808, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 18:22:15,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82077 states. [2019-09-07 18:22:16,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82077 to 81916. [2019-09-07 18:22:16,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81916 states. [2019-09-07 18:22:16,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81916 states to 81916 states and 94896 transitions. [2019-09-07 18:22:16,332 INFO L78 Accepts]: Start accepts. Automaton has 81916 states and 94896 transitions. Word has length 611 [2019-09-07 18:22:16,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:22:16,332 INFO L475 AbstractCegarLoop]: Abstraction has 81916 states and 94896 transitions. [2019-09-07 18:22:16,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 18:22:16,333 INFO L276 IsEmpty]: Start isEmpty. Operand 81916 states and 94896 transitions. [2019-09-07 18:22:16,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2019-09-07 18:22:16,392 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:22:16,392 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:22:16,393 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:22:16,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:22:16,393 INFO L82 PathProgramCache]: Analyzing trace with hash 278316588, now seen corresponding path program 1 times [2019-09-07 18:22:16,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:22:16,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:22:16,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:22:16,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:22:16,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:22:16,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:22:17,710 INFO L134 CoverageAnalysis]: Checked inductivity of 848 backedges. 357 proven. 173 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2019-09-07 18:22:17,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:22:17,710 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:22:17,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:22:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:22:17,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 917 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 18:22:17,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:22:18,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 18:22:18,908 INFO L134 CoverageAnalysis]: Checked inductivity of 848 backedges. 719 proven. 2 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-09-07 18:22:18,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:22:18,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 16 [2019-09-07 18:22:18,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 18:22:18,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 18:22:18,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2019-09-07 18:22:18,913 INFO L87 Difference]: Start difference. First operand 81916 states and 94896 transitions. Second operand 16 states. [2019-09-07 18:22:19,882 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-07 18:22:20,784 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-07 18:22:20,918 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-09-07 18:22:21,658 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-07 18:22:22,586 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-07 18:22:23,143 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-07 18:22:23,338 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-09-07 18:22:27,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:22:27,452 INFO L93 Difference]: Finished difference Result 164460 states and 192374 transitions. [2019-09-07 18:22:27,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-07 18:22:27,452 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 618 [2019-09-07 18:22:27,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:22:27,594 INFO L225 Difference]: With dead ends: 164460 [2019-09-07 18:22:27,595 INFO L226 Difference]: Without dead ends: 82740 [2019-09-07 18:22:27,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 693 GetRequests, 644 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=667, Invalid=1883, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 18:22:27,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82740 states. [2019-09-07 18:22:28,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82740 to 78778. [2019-09-07 18:22:28,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78778 states. [2019-09-07 18:22:28,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78778 states to 78778 states and 89653 transitions. [2019-09-07 18:22:28,534 INFO L78 Accepts]: Start accepts. Automaton has 78778 states and 89653 transitions. Word has length 618 [2019-09-07 18:22:28,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:22:28,534 INFO L475 AbstractCegarLoop]: Abstraction has 78778 states and 89653 transitions. [2019-09-07 18:22:28,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 18:22:28,534 INFO L276 IsEmpty]: Start isEmpty. Operand 78778 states and 89653 transitions. [2019-09-07 18:22:28,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 628 [2019-09-07 18:22:28,574 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:22:28,575 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:22:28,575 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:22:28,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:22:28,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1123853533, now seen corresponding path program 1 times [2019-09-07 18:22:28,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:22:28,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:22:28,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:22:28,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:22:28,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:22:28,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:22:29,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 359 proven. 421 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-09-07 18:22:29,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:22:29,702 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:22:29,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:22:29,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:22:29,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 965 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 18:22:29,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:22:30,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 925 proven. 6 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-09-07 18:22:30,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:22:30,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8] total 21 [2019-09-07 18:22:30,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 18:22:30,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 18:22:30,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2019-09-07 18:22:30,415 INFO L87 Difference]: Start difference. First operand 78778 states and 89653 transitions. Second operand 21 states. [2019-09-07 18:22:39,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:22:39,673 INFO L93 Difference]: Finished difference Result 160287 states and 187570 transitions. [2019-09-07 18:22:39,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-07 18:22:39,673 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 627 [2019-09-07 18:22:39,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:22:39,881 INFO L225 Difference]: With dead ends: 160287 [2019-09-07 18:22:39,882 INFO L226 Difference]: Without dead ends: 102539 [2019-09-07 18:22:39,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 664 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1201 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=773, Invalid=3387, Unknown=0, NotChecked=0, Total=4160 [2019-09-07 18:22:40,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102539 states. [2019-09-07 18:22:42,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102539 to 77214. [2019-09-07 18:22:42,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77214 states. [2019-09-07 18:22:42,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77214 states to 77214 states and 87673 transitions. [2019-09-07 18:22:42,771 INFO L78 Accepts]: Start accepts. Automaton has 77214 states and 87673 transitions. Word has length 627 [2019-09-07 18:22:42,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:22:42,771 INFO L475 AbstractCegarLoop]: Abstraction has 77214 states and 87673 transitions. [2019-09-07 18:22:42,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 18:22:42,772 INFO L276 IsEmpty]: Start isEmpty. Operand 77214 states and 87673 transitions. [2019-09-07 18:22:42,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 634 [2019-09-07 18:22:42,812 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:22:42,812 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:22:42,813 INFO L418 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:22:42,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:22:42,813 INFO L82 PathProgramCache]: Analyzing trace with hash -885180516, now seen corresponding path program 1 times [2019-09-07 18:22:42,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:22:42,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:22:42,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:22:42,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:22:42,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:22:42,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:22:43,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 428 proven. 88 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2019-09-07 18:22:43,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:22:43,270 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 18:22:43,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:22:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:22:43,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 973 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 18:22:43,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:22:43,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 806 proven. 2 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (16)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 18:22:43,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:22:43,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-09-07 18:22:43,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 18:22:43,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 18:22:43,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 18:22:43,694 INFO L87 Difference]: Start difference. First operand 77214 states and 87673 transitions. Second operand 7 states. [2019-09-07 18:22:46,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:22:46,643 INFO L93 Difference]: Finished difference Result 156100 states and 178503 transitions. [2019-09-07 18:22:46,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 18:22:46,643 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 633 [2019-09-07 18:22:46,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:22:46,774 INFO L225 Difference]: With dead ends: 156100 [2019-09-07 18:22:46,774 INFO L226 Difference]: Without dead ends: 83940 [2019-09-07 18:22:46,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 650 GetRequests, 639 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-09-07 18:22:46,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83940 states. [2019-09-07 18:22:47,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83940 to 80600. [2019-09-07 18:22:47,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80600 states. [2019-09-07 18:22:47,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80600 states to 80600 states and 90967 transitions. [2019-09-07 18:22:47,732 INFO L78 Accepts]: Start accepts. Automaton has 80600 states and 90967 transitions. Word has length 633 [2019-09-07 18:22:47,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:22:47,733 INFO L475 AbstractCegarLoop]: Abstraction has 80600 states and 90967 transitions. [2019-09-07 18:22:47,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 18:22:47,733 INFO L276 IsEmpty]: Start isEmpty. Operand 80600 states and 90967 transitions. [2019-09-07 18:22:47,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 635 [2019-09-07 18:22:47,779 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:22:47,779 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:22:47,780 INFO L418 AbstractCegarLoop]: === Iteration 20 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:22:47,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:22:47,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1727174918, now seen corresponding path program 1 times [2019-09-07 18:22:47,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:22:47,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:22:47,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:22:47,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:22:47,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:22:47,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:22:48,575 INFO L134 CoverageAnalysis]: Checked inductivity of 881 backedges. 15 proven. 129 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2019-09-07 18:22:48,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:22:48,576 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 18:22:48,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:22:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:22:48,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 925 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 18:22:48,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:22:48,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:22:48,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:22:50,825 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 25 [2019-09-07 18:22:50,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:22:51,455 INFO L134 CoverageAnalysis]: Checked inductivity of 881 backedges. 520 proven. 6 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2019-09-07 18:22:51,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:22:51,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2019-09-07 18:22:51,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 18:22:51,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 18:22:51,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-09-07 18:22:51,463 INFO L87 Difference]: Start difference. First operand 80600 states and 90967 transitions. Second operand 14 states. [2019-09-07 18:23:25,185 WARN L188 SmtUtils]: Spent 3.46 s on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2019-09-07 18:23:36,367 WARN L188 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2019-09-07 18:23:56,843 WARN L188 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2019-09-07 18:24:05,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:24:05,446 INFO L93 Difference]: Finished difference Result 191471 states and 218470 transitions. [2019-09-07 18:24:05,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-09-07 18:24:05,447 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 634 [2019-09-07 18:24:05,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:24:05,642 INFO L225 Difference]: With dead ends: 191471 [2019-09-07 18:24:05,642 INFO L226 Difference]: Without dead ends: 111067 [2019-09-07 18:24:05,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 751 GetRequests, 637 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5059 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=2353, Invalid=10757, Unknown=0, NotChecked=0, Total=13110 [2019-09-07 18:24:05,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111067 states. [2019-09-07 18:24:06,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111067 to 98044. [2019-09-07 18:24:06,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98044 states. [2019-09-07 18:24:06,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98044 states to 98044 states and 110169 transitions. [2019-09-07 18:24:06,826 INFO L78 Accepts]: Start accepts. Automaton has 98044 states and 110169 transitions. Word has length 634 [2019-09-07 18:24:06,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:24:06,826 INFO L475 AbstractCegarLoop]: Abstraction has 98044 states and 110169 transitions. [2019-09-07 18:24:06,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 18:24:06,827 INFO L276 IsEmpty]: Start isEmpty. Operand 98044 states and 110169 transitions. [2019-09-07 18:24:06,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 695 [2019-09-07 18:24:06,883 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:24:06,883 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:24:06,883 INFO L418 AbstractCegarLoop]: === Iteration 21 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:24:06,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:24:06,884 INFO L82 PathProgramCache]: Analyzing trace with hash 968803582, now seen corresponding path program 1 times [2019-09-07 18:24:06,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:24:06,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:24:06,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:24:06,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:24:06,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:24:06,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:24:07,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1028 backedges. 7 proven. 150 refuted. 0 times theorem prover too weak. 871 trivial. 0 not checked. [2019-09-07 18:24:07,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:24:07,849 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:24:07,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:24:08,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:24:08,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 991 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 18:24:08,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:24:08,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:24:08,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:24:12,762 WARN L188 SmtUtils]: Spent 4.62 s on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2019-09-07 18:24:12,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:24:12,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:24:12,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:24:12,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:24:12,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:24:12,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:24:12,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:24:12,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:24:12,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:24:14,926 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_~a23~0_491 Int)) (let ((.cse0 (div (* (- 2) v_~a23~0_491) 10))) (and (<= (* 2 v_~a23~0_491) 0) (<= v_~a23~0_491 |c_old(~a23~0)|) (= (mod .cse0 5) 0) (<= (div .cse0 5) (+ c_~a23~0 379592))))) (exists ((v_~a23~0_491 Int)) (let ((.cse1 (div (* (- 2) v_~a23~0_491) 10))) (and (<= (* 2 v_~a23~0_491) 0) (< .cse1 0) (<= v_~a23~0_491 |c_old(~a23~0)|) (<= (div .cse1 5) (+ c_~a23~0 379591)) (not (= (mod .cse1 5) 0))))) (exists ((v_~a23~0_491 Int)) (let ((.cse2 (+ (div (* (- 2) v_~a23~0_491) 10) 1))) (and (< .cse2 0) (< 0 (* 2 v_~a23~0_491)) (<= (div .cse2 5) (+ c_~a23~0 379591)) (not (= 0 (mod (* 8 v_~a23~0_491) 10))) (<= v_~a23~0_491 |c_old(~a23~0)|) (not (= 0 (mod .cse2 5)))))) (exists ((v_~a23~0_491 Int)) (let ((.cse3 (div (* (- 2) v_~a23~0_491) 10))) (and (<= v_~a23~0_491 |c_old(~a23~0)|) (<= 0 .cse3) (= 0 (mod (* 8 v_~a23~0_491) 10)) (<= (div .cse3 5) (+ c_~a23~0 379592))))) (exists ((v_~a23~0_491 Int)) (let ((.cse4 (div (* (- 2) v_~a23~0_491) 10))) (and (<= v_~a23~0_491 |c_old(~a23~0)|) (= (mod .cse4 5) 0) (= 0 (mod (* 8 v_~a23~0_491) 10)) (<= (div .cse4 5) (+ c_~a23~0 379592))))) (exists ((v_~a23~0_491 Int)) (let ((.cse5 (div (* (- 2) v_~a23~0_491) 10))) (and (<= (* 2 v_~a23~0_491) 0) (<= v_~a23~0_491 |c_old(~a23~0)|) (<= 0 .cse5) (<= (div .cse5 5) (+ c_~a23~0 379592))))) (exists ((v_~a23~0_491 Int)) (let ((.cse6 (+ (div (* (- 2) v_~a23~0_491) 10) 1))) (and (< 0 (* 2 v_~a23~0_491)) (not (= 0 (mod (* 8 v_~a23~0_491) 10))) (<= v_~a23~0_491 |c_old(~a23~0)|) (<= 0 .cse6) (<= (div .cse6 5) (+ c_~a23~0 379592))))) (exists ((v_~a23~0_491 Int)) (let ((.cse7 (+ (div (* (- 2) v_~a23~0_491) 10) 1))) (and (< 0 (* 2 v_~a23~0_491)) (not (= 0 (mod (* 8 v_~a23~0_491) 10))) (<= v_~a23~0_491 |c_old(~a23~0)|) (= 0 (mod .cse7 5)) (<= (div .cse7 5) (+ c_~a23~0 379592))))) (exists ((v_~a23~0_491 Int)) (let ((.cse8 (div (* (- 2) v_~a23~0_491) 10))) (and (< .cse8 0) (<= v_~a23~0_491 |c_old(~a23~0)|) (<= (div .cse8 5) (+ c_~a23~0 379591)) (not (= (mod .cse8 5) 0)) (= 0 (mod (* 8 v_~a23~0_491) 10)))))) is different from true [2019-09-07 18:24:17,321 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_~a23~0_491 Int)) (let ((.cse0 (div (* (- 2) v_~a23~0_491) 10))) (and (<= (* 2 v_~a23~0_491) 0) (<= v_~a23~0_491 |c_old(~a23~0)|) (= (mod .cse0 5) 0) (<= (div .cse0 5) (+ c_~a23~0 379592))))) (exists ((v_prenex_12 Int)) (let ((.cse1 (+ (div (* (- 2) v_prenex_12) 10) 1))) (and (not (= 0 (mod .cse1 5))) (< .cse1 0) (<= (div .cse1 5) (+ c_~a23~0 379591)) (< 0 (* 2 v_prenex_12)) (not (= 0 (mod (* 8 v_prenex_12) 10))) (<= v_prenex_12 |c_old(~a23~0)|)))) (exists ((v_prenex_11 Int)) (let ((.cse2 (div (* (- 2) v_prenex_11) 10))) (and (<= (div .cse2 5) (+ c_~a23~0 379591)) (not (= (mod .cse2 5) 0)) (<= v_prenex_11 |c_old(~a23~0)|) (<= (* 2 v_prenex_11) 0) (< .cse2 0)))) (exists ((v_prenex_14 Int)) (let ((.cse3 (div (* (- 2) v_prenex_14) 10))) (and (= (mod .cse3 5) 0) (<= v_prenex_14 |c_old(~a23~0)|) (= 0 (mod (* 8 v_prenex_14) 10)) (<= (div .cse3 5) (+ c_~a23~0 379592))))) (exists ((v_prenex_16 Int)) (let ((.cse4 (+ (div (* (- 2) v_prenex_16) 10) 1))) (and (<= (div .cse4 5) (+ c_~a23~0 379592)) (<= 0 .cse4) (< 0 (* 2 v_prenex_16)) (<= v_prenex_16 |c_old(~a23~0)|) (not (= 0 (mod (* 8 v_prenex_16) 10)))))) (exists ((v_prenex_17 Int)) (let ((.cse5 (+ (div (* (- 2) v_prenex_17) 10) 1))) (and (= 0 (mod .cse5 5)) (<= (div .cse5 5) (+ c_~a23~0 379592)) (<= v_prenex_17 |c_old(~a23~0)|) (< 0 (* 2 v_prenex_17)) (not (= 0 (mod (* 8 v_prenex_17) 10)))))) (exists ((v_prenex_13 Int)) (let ((.cse6 (div (* (- 2) v_prenex_13) 10))) (and (<= (div .cse6 5) (+ c_~a23~0 379592)) (= 0 (mod (* 8 v_prenex_13) 10)) (<= v_prenex_13 |c_old(~a23~0)|) (<= 0 .cse6)))) (exists ((v_prenex_15 Int)) (let ((.cse7 (div (* (- 2) v_prenex_15) 10))) (and (<= v_prenex_15 |c_old(~a23~0)|) (<= (* 2 v_prenex_15) 0) (<= (div .cse7 5) (+ c_~a23~0 379592)) (<= 0 .cse7)))) (exists ((v_prenex_18 Int)) (let ((.cse8 (div (* (- 2) v_prenex_18) 10))) (and (<= (div .cse8 5) (+ c_~a23~0 379591)) (< .cse8 0) (<= v_prenex_18 |c_old(~a23~0)|) (not (= (mod .cse8 5) 0)) (= 0 (mod (* 8 v_prenex_18) 10)))))) is different from true [2019-09-07 18:24:17,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 9 terms [2019-09-07 18:24:58,227 WARN L188 SmtUtils]: Spent 20.38 s on a formula simplification. DAG size of input: 143 DAG size of output: 89 [2019-09-07 18:24:58,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:24:58,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:25:00,390 WARN L188 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2019-09-07 18:25:00,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:25:00,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 18:25:00,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 18:25:00,835 WARN L188 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-09-07 18:25:00,964 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2019-09-07 18:25:01,144 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2019-09-07 18:25:25,670 WARN L188 SmtUtils]: Spent 20.33 s on a formula simplification that was a NOOP. DAG size: 126 [2019-09-07 18:25:41,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 10 terms [2019-09-07 18:27:54,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1028 backedges. 7 proven. 602 refuted. 0 times theorem prover too weak. 413 trivial. 6 not checked. [2019-09-07 18:27:54,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:27:54,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 23 [2019-09-07 18:27:54,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 18:27:54,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 18:27:54,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=345, Unknown=13, NotChecked=78, Total=506 [2019-09-07 18:27:54,854 INFO L87 Difference]: Start difference. First operand 98044 states and 110169 transitions. Second operand 23 states. [2019-09-07 18:28:36,342 WARN L188 SmtUtils]: Spent 31.67 s on a formula simplification. DAG size of input: 100 DAG size of output: 89 [2019-09-07 18:29:21,443 WARN L188 SmtUtils]: Spent 38.76 s on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2019-09-07 18:30:21,863 WARN L188 SmtUtils]: Spent 22.51 s on a formula simplification that was a NOOP. DAG size: 94 [2019-09-07 18:30:40,671 WARN L188 SmtUtils]: Spent 12.53 s on a formula simplification that was a NOOP. DAG size: 92 [2019-09-07 18:31:23,640 WARN L188 SmtUtils]: Spent 30.44 s on a formula simplification. DAG size of input: 115 DAG size of output: 83