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/Problem17_label02.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 21:22:25,947 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 21:22:25,951 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 21:22:25,966 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 21:22:25,967 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 21:22:25,968 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 21:22:25,970 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 21:22:25,982 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 21:22:25,984 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 21:22:25,985 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 21:22:25,987 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 21:22:25,989 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 21:22:25,989 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 21:22:25,993 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 21:22:25,994 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 21:22:25,995 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 21:22:25,996 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 21:22:25,997 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 21:22:26,001 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 21:22:26,006 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 21:22:26,009 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 21:22:26,010 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 21:22:26,011 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 21:22:26,013 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 21:22:26,015 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 21:22:26,015 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 21:22:26,016 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 21:22:26,018 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 21:22:26,019 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 21:22:26,020 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 21:22:26,020 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 21:22:26,022 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 21:22:26,022 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 21:22:26,023 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 21:22:26,027 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 21:22:26,027 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 21:22:26,028 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 21:22:26,028 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 21:22:26,028 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 21:22:26,029 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 21:22:26,030 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 21:22:26,031 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 21:22:26,061 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 21:22:26,062 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 21:22:26,066 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 21:22:26,066 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 21:22:26,066 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 21:22:26,066 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 21:22:26,067 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 21:22:26,067 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 21:22:26,067 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 21:22:26,067 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 21:22:26,068 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 21:22:26,069 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 21:22:26,069 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 21:22:26,069 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 21:22:26,069 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 21:22:26,070 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 21:22:26,070 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 21:22:26,070 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 21:22:26,070 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 21:22:26,070 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 21:22:26,071 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 21:22:26,071 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 21:22:26,072 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 21:22:26,072 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 21:22:26,072 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 21:22:26,072 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 21:22:26,073 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 21:22:26,073 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 21:22:26,073 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 21:22:26,126 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 21:22:26,138 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 21:22:26,142 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 21:22:26,143 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 21:22:26,144 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 21:22:26,144 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label02.c [2019-09-07 21:22:26,206 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd98f0713/1598dc4930c3456396efe890f895e171/FLAGf7f129df3 [2019-09-07 21:22:26,964 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 21:22:26,965 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label02.c [2019-09-07 21:22:26,990 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd98f0713/1598dc4930c3456396efe890f895e171/FLAGf7f129df3 [2019-09-07 21:22:27,024 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd98f0713/1598dc4930c3456396efe890f895e171 [2019-09-07 21:22:27,036 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 21:22:27,038 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 21:22:27,039 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 21:22:27,039 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 21:22:27,043 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 21:22:27,043 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 09:22:27" (1/1) ... [2019-09-07 21:22:27,047 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fa66722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:22:27, skipping insertion in model container [2019-09-07 21:22:27,047 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 09:22:27" (1/1) ... [2019-09-07 21:22:27,055 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 21:22:27,169 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 21:22:28,395 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 21:22:28,404 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 21:22:28,765 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 21:22:28,793 INFO L192 MainTranslator]: Completed translation [2019-09-07 21:22:28,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:22:28 WrapperNode [2019-09-07 21:22:28,795 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 21:22:28,796 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 21:22:28,796 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 21:22:28,796 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 21:22:28,816 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:22:28" (1/1) ... [2019-09-07 21:22:28,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:22:28" (1/1) ... [2019-09-07 21:22:28,889 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:22:28" (1/1) ... [2019-09-07 21:22:28,891 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:22:28" (1/1) ... [2019-09-07 21:22:28,989 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:22:28" (1/1) ... [2019-09-07 21:22:29,026 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:22:28" (1/1) ... [2019-09-07 21:22:29,063 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:22:28" (1/1) ... [2019-09-07 21:22:29,206 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 21:22:29,207 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 21:22:29,207 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 21:22:29,207 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 21:22:29,208 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:22:28" (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 21:22:29,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 21:22:29,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 21:22:29,273 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 21:22:29,274 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 21:22:29,274 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 21:22:29,274 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 21:22:29,274 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 21:22:29,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 21:22:29,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 21:22:29,275 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 21:22:29,275 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 21:22:29,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 21:22:29,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 21:22:33,723 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 21:22:33,724 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 21:22:33,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 09:22:33 BoogieIcfgContainer [2019-09-07 21:22:33,726 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 21:22:33,727 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 21:22:33,727 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 21:22:33,732 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 21:22:33,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 09:22:27" (1/3) ... [2019-09-07 21:22:33,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77700f1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 09:22:33, skipping insertion in model container [2019-09-07 21:22:33,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:22:28" (2/3) ... [2019-09-07 21:22:33,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77700f1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 09:22:33, skipping insertion in model container [2019-09-07 21:22:33,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 09:22:33" (3/3) ... [2019-09-07 21:22:33,736 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem17_label02.c [2019-09-07 21:22:33,750 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 21:22:33,760 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 21:22:33,784 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 21:22:33,826 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 21:22:33,827 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 21:22:33,827 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 21:22:33,827 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 21:22:33,827 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 21:22:33,828 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 21:22:33,828 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 21:22:33,828 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 21:22:33,828 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 21:22:33,862 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states. [2019-09-07 21:22:33,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-07 21:22:33,874 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:22:33,875 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, 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 21:22:33,877 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:22:33,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:22:33,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1212543623, now seen corresponding path program 1 times [2019-09-07 21:22:33,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:22:33,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:22:33,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:22:33,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:22:33,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:22:34,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:22:34,316 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 21:22:34,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:22:34,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 21:22:34,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 21:22:34,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 21:22:34,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 21:22:34,343 INFO L87 Difference]: Start difference. First operand 603 states. Second operand 4 states. [2019-09-07 21:22:40,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:22:40,581 INFO L93 Difference]: Finished difference Result 2158 states and 4003 transitions. [2019-09-07 21:22:40,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 21:22:40,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-09-07 21:22:40,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:22:40,628 INFO L225 Difference]: With dead ends: 2158 [2019-09-07 21:22:40,628 INFO L226 Difference]: Without dead ends: 1474 [2019-09-07 21:22:40,641 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 21:22:40,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2019-09-07 21:22:40,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1447. [2019-09-07 21:22:40,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1447 states. [2019-09-07 21:22:40,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 2481 transitions. [2019-09-07 21:22:40,763 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 2481 transitions. Word has length 59 [2019-09-07 21:22:40,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:22:40,764 INFO L475 AbstractCegarLoop]: Abstraction has 1447 states and 2481 transitions. [2019-09-07 21:22:40,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 21:22:40,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 2481 transitions. [2019-09-07 21:22:40,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-07 21:22:40,772 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:22:40,772 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, 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] [2019-09-07 21:22:40,772 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:22:40,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:22:40,773 INFO L82 PathProgramCache]: Analyzing trace with hash -965050935, now seen corresponding path program 1 times [2019-09-07 21:22:40,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:22:40,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:22:40,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:22:40,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:22:40,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:22:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:22:41,004 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:22:41,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:22:41,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 21:22:41,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 21:22:41,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 21:22:41,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-07 21:22:41,014 INFO L87 Difference]: Start difference. First operand 1447 states and 2481 transitions. Second operand 6 states. [2019-09-07 21:22:49,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:22:49,062 INFO L93 Difference]: Finished difference Result 5602 states and 9930 transitions. [2019-09-07 21:22:49,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 21:22:49,063 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 137 [2019-09-07 21:22:49,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:22:49,098 INFO L225 Difference]: With dead ends: 5602 [2019-09-07 21:22:49,098 INFO L226 Difference]: Without dead ends: 4161 [2019-09-07 21:22:49,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-07 21:22:49,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4161 states. [2019-09-07 21:22:49,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4161 to 4140. [2019-09-07 21:22:49,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4140 states. [2019-09-07 21:22:49,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4140 states to 4140 states and 6054 transitions. [2019-09-07 21:22:49,249 INFO L78 Accepts]: Start accepts. Automaton has 4140 states and 6054 transitions. Word has length 137 [2019-09-07 21:22:49,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:22:49,250 INFO L475 AbstractCegarLoop]: Abstraction has 4140 states and 6054 transitions. [2019-09-07 21:22:49,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 21:22:49,250 INFO L276 IsEmpty]: Start isEmpty. Operand 4140 states and 6054 transitions. [2019-09-07 21:22:49,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-07 21:22:49,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:22:49,253 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, 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] [2019-09-07 21:22:49,253 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:22:49,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:22:49,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1129279681, now seen corresponding path program 1 times [2019-09-07 21:22:49,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:22:49,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:22:49,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:22:49,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:22:49,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:22:49,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:22:49,398 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:22:49,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:22:49,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 21:22:49,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 21:22:49,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 21:22:49,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 21:22:49,400 INFO L87 Difference]: Start difference. First operand 4140 states and 6054 transitions. Second operand 6 states. [2019-09-07 21:22:53,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:22:53,439 INFO L93 Difference]: Finished difference Result 12482 states and 19729 transitions. [2019-09-07 21:22:53,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 21:22:53,440 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 138 [2019-09-07 21:22:53,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:22:53,507 INFO L225 Difference]: With dead ends: 12482 [2019-09-07 21:22:53,507 INFO L226 Difference]: Without dead ends: 8348 [2019-09-07 21:22:53,528 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 21:22:53,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8348 states. [2019-09-07 21:22:53,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8348 to 8275. [2019-09-07 21:22:53,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8275 states. [2019-09-07 21:22:53,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8275 states to 8275 states and 12053 transitions. [2019-09-07 21:22:53,876 INFO L78 Accepts]: Start accepts. Automaton has 8275 states and 12053 transitions. Word has length 138 [2019-09-07 21:22:53,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:22:53,877 INFO L475 AbstractCegarLoop]: Abstraction has 8275 states and 12053 transitions. [2019-09-07 21:22:53,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 21:22:53,877 INFO L276 IsEmpty]: Start isEmpty. Operand 8275 states and 12053 transitions. [2019-09-07 21:22:53,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-07 21:22:53,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:22:53,881 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:22:53,881 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:22:53,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:22:53,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1816941935, now seen corresponding path program 1 times [2019-09-07 21:22:53,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:22:53,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:22:53,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:22:53,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:22:53,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:22:53,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:22:54,099 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 105 proven. 5 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-09-07 21:22:54,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:22:54,099 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 21:22:54,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:22:54,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:22:54,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:22:54,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:22:54,328 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 176 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 21:22:54,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:22:54,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 21:22:54,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 21:22:54,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 21:22:54,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:22:54,343 INFO L87 Difference]: Start difference. First operand 8275 states and 12053 transitions. Second operand 9 states. [2019-09-07 21:23:00,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:23:00,909 INFO L93 Difference]: Finished difference Result 20630 states and 30028 transitions. [2019-09-07 21:23:00,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 21:23:00,910 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 211 [2019-09-07 21:23:00,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:23:00,985 INFO L225 Difference]: With dead ends: 20630 [2019-09-07 21:23:00,986 INFO L226 Difference]: Without dead ends: 11495 [2019-09-07 21:23:01,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2019-09-07 21:23:01,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11495 states. [2019-09-07 21:23:01,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11495 to 10132. [2019-09-07 21:23:01,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10132 states. [2019-09-07 21:23:01,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10132 states to 10132 states and 12886 transitions. [2019-09-07 21:23:01,372 INFO L78 Accepts]: Start accepts. Automaton has 10132 states and 12886 transitions. Word has length 211 [2019-09-07 21:23:01,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:23:01,374 INFO L475 AbstractCegarLoop]: Abstraction has 10132 states and 12886 transitions. [2019-09-07 21:23:01,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 21:23:01,374 INFO L276 IsEmpty]: Start isEmpty. Operand 10132 states and 12886 transitions. [2019-09-07 21:23:01,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-09-07 21:23:01,378 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:23:01,379 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:23:01,379 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:23:01,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:23:01,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1301818271, now seen corresponding path program 1 times [2019-09-07 21:23:01,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:23:01,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:23:01,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:23:01,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:23:01,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:23:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:23:01,693 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 117 proven. 59 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-07 21:23:01,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:23:01,694 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 21:23:01,711 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 21:23:01,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:23:01,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:23:01,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:23:01,859 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 21:23:01,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 21:23:01,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2019-09-07 21:23:01,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 21:23:01,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 21:23:01,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-07 21:23:01,873 INFO L87 Difference]: Start difference. First operand 10132 states and 12886 transitions. Second operand 8 states. [2019-09-07 21:23:07,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:23:07,753 INFO L93 Difference]: Finished difference Result 20333 states and 26261 transitions. [2019-09-07 21:23:07,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 21:23:07,753 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 224 [2019-09-07 21:23:07,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:23:07,799 INFO L225 Difference]: With dead ends: 20333 [2019-09-07 21:23:07,799 INFO L226 Difference]: Without dead ends: 10207 [2019-09-07 21:23:07,831 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-09-07 21:23:07,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10207 states. [2019-09-07 21:23:08,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10207 to 10132. [2019-09-07 21:23:08,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10132 states. [2019-09-07 21:23:08,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10132 states to 10132 states and 12722 transitions. [2019-09-07 21:23:08,095 INFO L78 Accepts]: Start accepts. Automaton has 10132 states and 12722 transitions. Word has length 224 [2019-09-07 21:23:08,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:23:08,096 INFO L475 AbstractCegarLoop]: Abstraction has 10132 states and 12722 transitions. [2019-09-07 21:23:08,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 21:23:08,096 INFO L276 IsEmpty]: Start isEmpty. Operand 10132 states and 12722 transitions. [2019-09-07 21:23:08,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-07 21:23:08,102 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:23:08,103 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, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:23:08,103 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:23:08,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:23:08,104 INFO L82 PathProgramCache]: Analyzing trace with hash 81227819, now seen corresponding path program 1 times [2019-09-07 21:23:08,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:23:08,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:23:08,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:23:08,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:23:08,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:23:08,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:23:08,493 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 309 proven. 2 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-07 21:23:08,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:23:08,494 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 21:23:08,515 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 21:23:08,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:23:08,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 21:23:08,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:23:08,708 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 309 proven. 2 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-07 21:23:08,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:23:08,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-09-07 21:23:08,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 21:23:08,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 21:23:08,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 21:23:08,718 INFO L87 Difference]: Start difference. First operand 10132 states and 12722 transitions. Second operand 7 states. [2019-09-07 21:23:15,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:23:15,175 INFO L93 Difference]: Finished difference Result 26433 states and 34512 transitions. [2019-09-07 21:23:15,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 21:23:15,176 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 300 [2019-09-07 21:23:15,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:23:15,246 INFO L225 Difference]: With dead ends: 26433 [2019-09-07 21:23:15,246 INFO L226 Difference]: Without dead ends: 16307 [2019-09-07 21:23:15,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-09-07 21:23:15,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16307 states. [2019-09-07 21:23:15,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16307 to 14869. [2019-09-07 21:23:15,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14869 states. [2019-09-07 21:23:15,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14869 states to 14869 states and 18674 transitions. [2019-09-07 21:23:15,643 INFO L78 Accepts]: Start accepts. Automaton has 14869 states and 18674 transitions. Word has length 300 [2019-09-07 21:23:15,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:23:15,653 INFO L475 AbstractCegarLoop]: Abstraction has 14869 states and 18674 transitions. [2019-09-07 21:23:15,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 21:23:15,656 INFO L276 IsEmpty]: Start isEmpty. Operand 14869 states and 18674 transitions. [2019-09-07 21:23:15,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2019-09-07 21:23:15,673 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:23:15,674 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, 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, 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] [2019-09-07 21:23:15,674 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:23:15,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:23:15,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1628607878, now seen corresponding path program 1 times [2019-09-07 21:23:15,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:23:15,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:23:15,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:23:15,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:23:15,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:23:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:23:16,132 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 164 proven. 146 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-09-07 21:23:16,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:23:16,133 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) [2019-09-07 21:23:16,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:23:16,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:23:16,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 21:23:16,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:23:16,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:23:16,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:23:16,573 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 259 proven. 2 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2019-09-07 21:23:16,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:23:16,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2019-09-07 21:23:16,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 21:23:16,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 21:23:16,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-07 21:23:16,581 INFO L87 Difference]: Start difference. First operand 14869 states and 18674 transitions. Second operand 10 states. [2019-09-07 21:23:36,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:23:36,499 INFO L93 Difference]: Finished difference Result 44881 states and 64001 transitions. [2019-09-07 21:23:36,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 21:23:36,500 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 346 [2019-09-07 21:23:36,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:23:36,613 INFO L225 Difference]: With dead ends: 44881 [2019-09-07 21:23:36,614 INFO L226 Difference]: Without dead ends: 29500 [2019-09-07 21:23:36,671 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 357 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2019-09-07 21:23:36,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29500 states. [2019-09-07 21:23:38,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29500 to 27379. [2019-09-07 21:23:38,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27379 states. [2019-09-07 21:23:38,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27379 states to 27379 states and 35255 transitions. [2019-09-07 21:23:38,347 INFO L78 Accepts]: Start accepts. Automaton has 27379 states and 35255 transitions. Word has length 346 [2019-09-07 21:23:38,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:23:38,348 INFO L475 AbstractCegarLoop]: Abstraction has 27379 states and 35255 transitions. [2019-09-07 21:23:38,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 21:23:38,349 INFO L276 IsEmpty]: Start isEmpty. Operand 27379 states and 35255 transitions. [2019-09-07 21:23:38,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2019-09-07 21:23:38,371 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:23:38,371 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, 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, 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] [2019-09-07 21:23:38,372 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:23:38,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:23:38,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1914787772, now seen corresponding path program 1 times [2019-09-07 21:23:38,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:23:38,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:23:38,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:23:38,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:23:38,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:23:38,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:23:38,785 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2019-09-07 21:23:38,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:23:38,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 21:23:38,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 21:23:38,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 21:23:38,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 21:23:38,786 INFO L87 Difference]: Start difference. First operand 27379 states and 35255 transitions. Second operand 4 states. [2019-09-07 21:23:44,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:23:44,028 INFO L93 Difference]: Finished difference Result 70077 states and 94006 transitions. [2019-09-07 21:23:44,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 21:23:44,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 383 [2019-09-07 21:23:44,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:23:44,181 INFO L225 Difference]: With dead ends: 70077 [2019-09-07 21:23:44,181 INFO L226 Difference]: Without dead ends: 42271 [2019-09-07 21:23:44,227 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 21:23:44,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42271 states. [2019-09-07 21:23:44,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42271 to 38784. [2019-09-07 21:23:44,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38784 states. [2019-09-07 21:23:45,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38784 states to 38784 states and 52406 transitions. [2019-09-07 21:23:45,098 INFO L78 Accepts]: Start accepts. Automaton has 38784 states and 52406 transitions. Word has length 383 [2019-09-07 21:23:45,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:23:45,099 INFO L475 AbstractCegarLoop]: Abstraction has 38784 states and 52406 transitions. [2019-09-07 21:23:45,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 21:23:45,099 INFO L276 IsEmpty]: Start isEmpty. Operand 38784 states and 52406 transitions. [2019-09-07 21:23:45,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-09-07 21:23:45,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:23:45,116 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:23:45,116 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:23:45,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:23:45,117 INFO L82 PathProgramCache]: Analyzing trace with hash 360063713, now seen corresponding path program 1 times [2019-09-07 21:23:45,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:23:45,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:23:45,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:23:45,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:23:45,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:23:45,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:23:46,563 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 163 proven. 228 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 21:23:46,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:23:46,563 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:23:46,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:23:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:23:46,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-07 21:23:46,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:23:46,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:23:46,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 21:23:46,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 21:23:46,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:23:46,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:23:46,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:23:46,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:23:46,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:23:46,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:23:46,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 21:23:46,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:23:46,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:23:46,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:23:47,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 21:23:47,549 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 287 proven. 55 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-09-07 21:23:47,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:23:47,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 22 [2019-09-07 21:23:47,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-07 21:23:47,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-07 21:23:47,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2019-09-07 21:23:47,554 INFO L87 Difference]: Start difference. First operand 38784 states and 52406 transitions. Second operand 22 states. [2019-09-07 21:23:50,487 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2019-09-07 21:23:52,564 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-07 21:23:52,743 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2019-09-07 21:23:54,905 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 31 [2019-09-07 21:23:56,748 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2019-09-07 21:23:57,572 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-09-07 21:23:59,791 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-09-07 21:24:01,327 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2019-09-07 21:24:02,160 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 47 [2019-09-07 21:24:03,674 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 45 [2019-09-07 21:24:04,408 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 39 [2019-09-07 21:24:08,278 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2019-09-07 21:24:10,138 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-07 21:24:11,579 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-09-07 21:24:12,818 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-09-07 21:24:14,705 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2019-09-07 21:24:17,538 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2019-09-07 21:24:18,253 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-07 21:24:23,479 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-07 21:24:25,798 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2019-09-07 21:24:27,480 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-09-07 21:24:37,023 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 51 [2019-09-07 21:24:40,125 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 51 [2019-09-07 21:24:46,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:24:46,243 INFO L93 Difference]: Finished difference Result 134873 states and 214206 transitions. [2019-09-07 21:24:46,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2019-09-07 21:24:46,243 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 396 [2019-09-07 21:24:46,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:24:46,891 INFO L225 Difference]: With dead ends: 134873 [2019-09-07 21:24:46,892 INFO L226 Difference]: Without dead ends: 90475 [2019-09-07 21:24:46,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 716 GetRequests, 497 SyntacticMatches, 17 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18529 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=5441, Invalid=35971, Unknown=0, NotChecked=0, Total=41412 [2019-09-07 21:24:47,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90475 states. [2019-09-07 21:24:50,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90475 to 86269. [2019-09-07 21:24:50,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86269 states. [2019-09-07 21:24:50,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86269 states to 86269 states and 121587 transitions. [2019-09-07 21:24:50,414 INFO L78 Accepts]: Start accepts. Automaton has 86269 states and 121587 transitions. Word has length 396 [2019-09-07 21:24:50,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:24:50,415 INFO L475 AbstractCegarLoop]: Abstraction has 86269 states and 121587 transitions. [2019-09-07 21:24:50,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-07 21:24:50,416 INFO L276 IsEmpty]: Start isEmpty. Operand 86269 states and 121587 transitions. [2019-09-07 21:24:50,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2019-09-07 21:24:50,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:24:50,456 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:24:50,456 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:24:50,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:24:50,457 INFO L82 PathProgramCache]: Analyzing trace with hash 212850974, now seen corresponding path program 1 times [2019-09-07 21:24:50,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:24:50,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:24:50,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:24:50,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:24:50,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:24:50,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:24:51,093 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 298 proven. 51 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-07 21:24:51,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:24:51,094 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 21:24:51,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:24:51,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:24:51,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:24:51,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:24:51,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:24:51,463 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 347 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-07 21:24:51,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:24:51,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-09-07 21:24:51,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 21:24:51,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 21:24:51,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-07 21:24:51,470 INFO L87 Difference]: Start difference. First operand 86269 states and 121587 transitions. Second operand 10 states. [2019-09-07 21:25:13,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:25:13,794 INFO L93 Difference]: Finished difference Result 233705 states and 321510 transitions. [2019-09-07 21:25:13,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-07 21:25:13,794 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 432 [2019-09-07 21:25:13,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:25:14,283 INFO L225 Difference]: With dead ends: 233705 [2019-09-07 21:25:14,283 INFO L226 Difference]: Without dead ends: 132039 [2019-09-07 21:25:14,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 480 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1241 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=673, Invalid=2749, Unknown=0, NotChecked=0, Total=3422 [2019-09-07 21:25:14,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132039 states. [2019-09-07 21:25:16,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132039 to 104199. [2019-09-07 21:25:16,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104199 states. [2019-09-07 21:25:16,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104199 states to 104199 states and 124421 transitions. [2019-09-07 21:25:16,760 INFO L78 Accepts]: Start accepts. Automaton has 104199 states and 124421 transitions. Word has length 432 [2019-09-07 21:25:16,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:25:16,761 INFO L475 AbstractCegarLoop]: Abstraction has 104199 states and 124421 transitions. [2019-09-07 21:25:16,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 21:25:16,761 INFO L276 IsEmpty]: Start isEmpty. Operand 104199 states and 124421 transitions. [2019-09-07 21:25:16,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2019-09-07 21:25:16,791 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:25:16,792 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:25:16,792 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:25:16,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:25:16,793 INFO L82 PathProgramCache]: Analyzing trace with hash -394756883, now seen corresponding path program 1 times [2019-09-07 21:25:16,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:25:16,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:25:16,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:25:16,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:25:16,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:25:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:25:17,355 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 277 proven. 55 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-09-07 21:25:17,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:25:17,357 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) [2019-09-07 21:25:17,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:25:17,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:25:17,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 786 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 21:25:17,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:25:17,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:17,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 21:25:17,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:17,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:17,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:17,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:17,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 21:25:17,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:17,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:17,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:17,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:19,905 WARN L188 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2019-09-07 21:25:19,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:21,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:21,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:23,375 WARN L188 SmtUtils]: Spent 1.55 s on a formula simplification that was a NOOP. DAG size: 27 [2019-09-07 21:25:23,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:25:23,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:25:24,208 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 6 proven. 381 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-07 21:25:24,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:25:24,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12] total 17 [2019-09-07 21:25:24,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 21:25:24,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 21:25:24,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=222, Unknown=1, NotChecked=0, Total=272 [2019-09-07 21:25:24,214 INFO L87 Difference]: Start difference. First operand 104199 states and 124421 transitions. Second operand 17 states. [2019-09-07 21:25:27,208 WARN L188 SmtUtils]: Spent 1.22 s on a formula simplification that was a NOOP. DAG size: 25 [2019-09-07 21:25:28,396 WARN L188 SmtUtils]: Spent 1.14 s on a formula simplification that was a NOOP. DAG size: 24 [2019-09-07 21:25:32,693 WARN L188 SmtUtils]: Spent 1.36 s on a formula simplification that was a NOOP. DAG size: 23 [2019-09-07 21:27:26,458 WARN L188 SmtUtils]: Spent 3.56 s on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2019-09-07 21:29:17,927 WARN L188 SmtUtils]: Spent 2.61 s on a formula simplification. DAG size of input: 29 DAG size of output: 26 [2019-09-07 21:30:20,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:30:20,299 INFO L93 Difference]: Finished difference Result 237595 states and 288243 transitions. [2019-09-07 21:30:20,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-07 21:30:20,300 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 533 [2019-09-07 21:30:20,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:30:20,793 INFO L225 Difference]: With dead ends: 237595 [2019-09-07 21:30:20,794 INFO L226 Difference]: Without dead ends: 158988 [2019-09-07 21:30:20,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 613 GetRequests, 554 SyntacticMatches, 7 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1014 ImplicationChecksByTransitivity, 29.0s TimeCoverageRelationStatistics Valid=493, Invalid=2360, Unknown=9, NotChecked=0, Total=2862 [2019-09-07 21:30:21,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158988 states. [2019-09-07 21:30:23,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158988 to 148935. [2019-09-07 21:30:23,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148935 states. [2019-09-07 21:30:26,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148935 states to 148935 states and 176155 transitions. [2019-09-07 21:30:26,541 INFO L78 Accepts]: Start accepts. Automaton has 148935 states and 176155 transitions. Word has length 533 [2019-09-07 21:30:26,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:30:26,542 INFO L475 AbstractCegarLoop]: Abstraction has 148935 states and 176155 transitions. [2019-09-07 21:30:26,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 21:30:26,542 INFO L276 IsEmpty]: Start isEmpty. Operand 148935 states and 176155 transitions. [2019-09-07 21:30:26,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 620 [2019-09-07 21:30:26,601 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:30:26,602 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:30:26,602 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:30:26,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:30:26,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1711833255, now seen corresponding path program 1 times [2019-09-07 21:30:26,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:30:26,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:30:26,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:30:26,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:30:26,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:30:26,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:30:26,962 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 222 proven. 2 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked. [2019-09-07 21:30:26,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:30:26,962 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) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:30:26,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:30:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:30:27,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-07 21:30:27,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:30:27,250 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2019-09-07 21:30:27,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 21:30:27,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2019-09-07 21:30:27,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 21:30:27,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 21:30:27,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 21:30:27,255 INFO L87 Difference]: Start difference. First operand 148935 states and 176155 transitions. Second operand 3 states. [2019-09-07 21:30:32,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:30:32,105 INFO L93 Difference]: Finished difference Result 317677 states and 378367 transitions. [2019-09-07 21:30:32,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 21:30:32,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 619 [2019-09-07 21:30:32,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:30:32,432 INFO L225 Difference]: With dead ends: 317677 [2019-09-07 21:30:32,433 INFO L226 Difference]: Without dead ends: 163330 [2019-09-07 21:30:32,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 620 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 21:30:32,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163330 states. [2019-09-07 21:30:34,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163330 to 162008. [2019-09-07 21:30:34,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162008 states. [2019-09-07 21:30:34,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162008 states to 162008 states and 188384 transitions. [2019-09-07 21:30:34,461 INFO L78 Accepts]: Start accepts. Automaton has 162008 states and 188384 transitions. Word has length 619 [2019-09-07 21:30:34,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:30:34,462 INFO L475 AbstractCegarLoop]: Abstraction has 162008 states and 188384 transitions. [2019-09-07 21:30:34,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 21:30:34,462 INFO L276 IsEmpty]: Start isEmpty. Operand 162008 states and 188384 transitions. [2019-09-07 21:30:34,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2019-09-07 21:30:34,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:30:34,513 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, 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, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:30:34,513 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:30:34,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:30:34,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1895505746, now seen corresponding path program 1 times [2019-09-07 21:30:34,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:30:34,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:30:34,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:30:34,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:30:34,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:30:34,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:30:37,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1218 backedges. 638 proven. 51 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2019-09-07 21:30:37,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:30:37,724 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) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:30:37,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:30:37,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:30:37,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 1000 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:30:37,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:30:38,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1218 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-09-07 21:30:38,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 21:30:38,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2019-09-07 21:30:38,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 21:30:38,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 21:30:38,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 21:30:38,244 INFO L87 Difference]: Start difference. First operand 162008 states and 188384 transitions. Second operand 4 states. [2019-09-07 21:30:42,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:30:42,790 INFO L93 Difference]: Finished difference Result 313644 states and 365597 transitions. [2019-09-07 21:30:42,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 21:30:42,791 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 687 [2019-09-07 21:30:42,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:30:43,128 INFO L225 Difference]: With dead ends: 313644 [2019-09-07 21:30:43,128 INFO L226 Difference]: Without dead ends: 151200 [2019-09-07 21:30:43,260 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 695 GetRequests, 690 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-07 21:30:43,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151200 states. [2019-09-07 21:30:44,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151200 to 145529. [2019-09-07 21:30:44,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145529 states. [2019-09-07 21:30:44,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145529 states to 145529 states and 167482 transitions. [2019-09-07 21:30:44,879 INFO L78 Accepts]: Start accepts. Automaton has 145529 states and 167482 transitions. Word has length 687 [2019-09-07 21:30:44,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:30:44,880 INFO L475 AbstractCegarLoop]: Abstraction has 145529 states and 167482 transitions. [2019-09-07 21:30:44,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 21:30:44,880 INFO L276 IsEmpty]: Start isEmpty. Operand 145529 states and 167482 transitions. [2019-09-07 21:30:44,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2019-09-07 21:30:44,909 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:30:44,909 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, 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, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:30:44,910 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:30:44,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:30:44,910 INFO L82 PathProgramCache]: Analyzing trace with hash 323735507, now seen corresponding path program 1 times [2019-09-07 21:30:44,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:30:44,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:30:44,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:30:44,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:30:44,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:30:45,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:30:46,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1219 backedges. 450 proven. 202 refuted. 0 times theorem prover too weak. 567 trivial. 0 not checked. [2019-09-07 21:30:46,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:30:46,032 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 21:30:46,057 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 21:30:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:30:46,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 1018 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 21:30:46,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:30:46,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1219 backedges. 692 proven. 2 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2019-09-07 21:30:46,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:30:46,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-09-07 21:30:46,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 21:30:46,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 21:30:46,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-07 21:30:46,618 INFO L87 Difference]: Start difference. First operand 145529 states and 167482 transitions. Second operand 8 states. [2019-09-07 21:31:01,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:31:01,012 INFO L93 Difference]: Finished difference Result 318998 states and 370019 transitions. [2019-09-07 21:31:01,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-07 21:31:01,012 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 702 [2019-09-07 21:31:01,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:31:01,394 INFO L225 Difference]: With dead ends: 318998 [2019-09-07 21:31:01,394 INFO L226 Difference]: Without dead ends: 166352 [2019-09-07 21:31:01,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 778 GetRequests, 735 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=368, Invalid=1612, Unknown=0, NotChecked=0, Total=1980 [2019-09-07 21:31:01,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166352 states. [2019-09-07 21:31:03,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166352 to 156773. [2019-09-07 21:31:03,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156773 states. [2019-09-07 21:31:03,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156773 states to 156773 states and 178173 transitions. [2019-09-07 21:31:03,861 INFO L78 Accepts]: Start accepts. Automaton has 156773 states and 178173 transitions. Word has length 702 [2019-09-07 21:31:03,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:31:03,862 INFO L475 AbstractCegarLoop]: Abstraction has 156773 states and 178173 transitions. [2019-09-07 21:31:03,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 21:31:03,862 INFO L276 IsEmpty]: Start isEmpty. Operand 156773 states and 178173 transitions. [2019-09-07 21:31:03,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 806 [2019-09-07 21:31:03,918 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:31:03,919 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, 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, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:31:03,919 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:31:03,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:31:03,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1633514984, now seen corresponding path program 1 times [2019-09-07 21:31:03,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:31:03,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:31:03,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:31:03,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:31:03,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:31:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:31:04,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 657 proven. 55 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2019-09-07 21:31:04,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:31:04,902 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) [2019-09-07 21:31:04,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:31:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:31:05,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 1137 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 21:31:05,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:31:05,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:31:05,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:31:07,065 WARN L188 SmtUtils]: Spent 1.89 s on a formula simplification that was a NOOP. DAG size: 27 [2019-09-07 21:31:07,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:31:07,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:31:09,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 657 proven. 55 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2019-09-07 21:31:09,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:31:09,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-09-07 21:31:09,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 21:31:09,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 21:31:09,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:31:09,686 INFO L87 Difference]: Start difference. First operand 156773 states and 178173 transitions. Second operand 9 states. [2019-09-07 21:31:17,920 WARN L188 SmtUtils]: Spent 2.74 s on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2019-09-07 21:31:23,748 WARN L188 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 29 DAG size of output: 26 [2019-09-07 21:31:25,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:31:25,912 INFO L93 Difference]: Finished difference Result 322008 states and 365881 transitions. [2019-09-07 21:31:25,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 21:31:25,913 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 805 [2019-09-07 21:31:25,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:31:26,356 INFO L225 Difference]: With dead ends: 322008 [2019-09-07 21:31:26,356 INFO L226 Difference]: Without dead ends: 164798 [2019-09-07 21:31:26,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 836 GetRequests, 812 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-09-07 21:31:26,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164798 states. [2019-09-07 21:31:28,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164798 to 160838. [2019-09-07 21:31:28,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160838 states. [2019-09-07 21:31:28,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160838 states to 160838 states and 179535 transitions. [2019-09-07 21:31:28,213 INFO L78 Accepts]: Start accepts. Automaton has 160838 states and 179535 transitions. Word has length 805 [2019-09-07 21:31:28,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:31:28,214 INFO L475 AbstractCegarLoop]: Abstraction has 160838 states and 179535 transitions. [2019-09-07 21:31:28,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 21:31:28,214 INFO L276 IsEmpty]: Start isEmpty. Operand 160838 states and 179535 transitions. [2019-09-07 21:31:28,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 983 [2019-09-07 21:31:28,708 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:31:28,709 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 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, 3, 3, 3, 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 21:31:28,709 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:31:28,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:31:28,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1888400112, now seen corresponding path program 1 times [2019-09-07 21:31:28,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:31:28,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:31:28,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:31:28,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:31:28,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:31:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:31:29,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2656 backedges. 970 proven. 147 refuted. 0 times theorem prover too weak. 1539 trivial. 0 not checked. [2019-09-07 21:31:29,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:31:29,522 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 21:31:29,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:31:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:31:29,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 1371 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 21:31:29,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:31:29,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:31:29,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:31:30,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2656 backedges. 1626 proven. 2 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2019-09-07 21:31:30,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:31:30,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-09-07 21:31:30,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 21:31:30,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 21:31:30,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:31:30,425 INFO L87 Difference]: Start difference. First operand 160838 states and 179535 transitions. Second operand 9 states. [2019-09-07 21:31:42,124 WARN L188 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 24 DAG size of output: 18 [2019-09-07 21:31:48,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:31:48,283 INFO L93 Difference]: Finished difference Result 369203 states and 418225 transitions. [2019-09-07 21:31:48,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-07 21:31:48,284 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 982 [2019-09-07 21:31:48,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:31:48,748 INFO L225 Difference]: With dead ends: 369203 [2019-09-07 21:31:48,748 INFO L226 Difference]: Without dead ends: 206610 [2019-09-07 21:31:48,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1044 GetRequests, 1009 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=308, Invalid=1024, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 21:31:49,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206610 states. [2019-09-07 21:31:51,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206610 to 194228. [2019-09-07 21:31:51,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194228 states. [2019-09-07 21:31:51,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194228 states to 194228 states and 215802 transitions. [2019-09-07 21:31:51,623 INFO L78 Accepts]: Start accepts. Automaton has 194228 states and 215802 transitions. Word has length 982 [2019-09-07 21:31:51,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:31:51,624 INFO L475 AbstractCegarLoop]: Abstraction has 194228 states and 215802 transitions. [2019-09-07 21:31:51,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 21:31:51,624 INFO L276 IsEmpty]: Start isEmpty. Operand 194228 states and 215802 transitions. [2019-09-07 21:31:51,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1043 [2019-09-07 21:31:51,770 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:31:51,771 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:31:51,771 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:31:51,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:31:51,772 INFO L82 PathProgramCache]: Analyzing trace with hash 225291869, now seen corresponding path program 1 times [2019-09-07 21:31:51,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:31:51,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:31:51,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:31:51,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:31:51,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:31:51,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:31:53,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2375 backedges. 638 proven. 230 refuted. 0 times theorem prover too weak. 1507 trivial. 0 not checked. [2019-09-07 21:31:53,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:31:53,395 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 21:31:53,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:31:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:31:53,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 1454 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 21:31:53,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:31:53,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:31:53,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:31:56,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2375 backedges. 1691 proven. 6 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2019-09-07 21:31:56,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:31:56,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2019-09-07 21:31:56,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 21:31:56,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 21:31:56,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-09-07 21:31:56,442 INFO L87 Difference]: Start difference. First operand 194228 states and 215802 transitions. Second operand 12 states. [2019-09-07 21:32:15,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:32:15,664 INFO L93 Difference]: Finished difference Result 477162 states and 534632 transitions. [2019-09-07 21:32:15,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-07 21:32:15,664 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 1042 [2019-09-07 21:32:15,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:32:16,255 INFO L225 Difference]: With dead ends: 477162 [2019-09-07 21:32:16,255 INFO L226 Difference]: Without dead ends: 282937 [2019-09-07 21:32:16,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1140 GetRequests, 1082 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1162 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=571, Invalid=2969, Unknown=0, NotChecked=0, Total=3540 [2019-09-07 21:32:16,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282937 states. [2019-09-07 21:32:19,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282937 to 260643. [2019-09-07 21:32:19,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260643 states. [2019-09-07 21:32:20,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260643 states to 260643 states and 286276 transitions. [2019-09-07 21:32:20,084 INFO L78 Accepts]: Start accepts. Automaton has 260643 states and 286276 transitions. Word has length 1042 [2019-09-07 21:32:20,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:32:20,085 INFO L475 AbstractCegarLoop]: Abstraction has 260643 states and 286276 transitions. [2019-09-07 21:32:20,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 21:32:20,085 INFO L276 IsEmpty]: Start isEmpty. Operand 260643 states and 286276 transitions. [2019-09-07 21:32:20,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1114 [2019-09-07 21:32:20,243 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:32:20,243 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:32:20,244 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:32:20,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:32:20,244 INFO L82 PathProgramCache]: Analyzing trace with hash -121478419, now seen corresponding path program 1 times [2019-09-07 21:32:20,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:32:20,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:32:20,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:32:20,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:32:20,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:32:20,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:32:24,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1602 backedges. 914 proven. 119 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-09-07 21:32:24,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:32:24,592 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 21:32:24,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:32:24,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:32:24,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 1465 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 21:32:24,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:32:24,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:32:25,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1602 backedges. 1109 proven. 2 refuted. 0 times theorem prover too weak. 491 trivial. 0 not checked. [2019-09-07 21:32:25,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:32:25,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2019-09-07 21:32:25,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 21:32:25,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 21:32:25,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-09-07 21:32:25,724 INFO L87 Difference]: Start difference. First operand 260643 states and 286276 transitions. Second operand 12 states. [2019-09-07 21:32:55,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:32:55,526 INFO L93 Difference]: Finished difference Result 550685 states and 604230 transitions. [2019-09-07 21:32:55,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2019-09-07 21:32:55,527 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 1113 [2019-09-07 21:32:55,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:32:56,132 INFO L225 Difference]: With dead ends: 550685 [2019-09-07 21:32:56,133 INFO L226 Difference]: Without dead ends: 291340 [2019-09-07 21:32:56,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1349 GetRequests, 1220 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7109 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2213, Invalid=14817, Unknown=0, NotChecked=0, Total=17030 [2019-09-07 21:32:56,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291340 states. [2019-09-07 21:32:59,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291340 to 269080. [2019-09-07 21:32:59,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269080 states. [2019-09-07 21:33:00,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269080 states to 269080 states and 295345 transitions. [2019-09-07 21:33:00,032 INFO L78 Accepts]: Start accepts. Automaton has 269080 states and 295345 transitions. Word has length 1113 [2019-09-07 21:33:00,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:33:00,032 INFO L475 AbstractCegarLoop]: Abstraction has 269080 states and 295345 transitions. [2019-09-07 21:33:00,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 21:33:00,032 INFO L276 IsEmpty]: Start isEmpty. Operand 269080 states and 295345 transitions. [2019-09-07 21:33:00,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1167 [2019-09-07 21:33:00,187 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:33:00,188 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:33:00,188 INFO L418 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:33:00,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:33:00,189 INFO L82 PathProgramCache]: Analyzing trace with hash 2054098240, now seen corresponding path program 1 times [2019-09-07 21:33:00,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:33:00,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:33:00,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:33:00,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:33:00,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:33:00,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:33:05,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2737 backedges. 987 proven. 147 refuted. 0 times theorem prover too weak. 1603 trivial. 0 not checked. [2019-09-07 21:33:05,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:33:05,741 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) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:33:05,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:33:06,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:33:06,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 1576 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 21:33:06,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:33:06,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:33:06,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:33:06,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:33:06,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:33:07,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2737 backedges. 1994 proven. 6 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2019-09-07 21:33:07,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:33:07,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-09-07 21:33:07,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 21:33:07,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 21:33:07,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=128, Unknown=1, NotChecked=0, Total=156 [2019-09-07 21:33:07,311 INFO L87 Difference]: Start difference. First operand 269080 states and 295345 transitions. Second operand 13 states. [2019-09-07 21:33:08,277 WARN L188 SmtUtils]: Spent 931.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 27 [2019-09-07 21:33:13,624 WARN L188 SmtUtils]: Spent 460.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-09-07 21:33:15,099 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2019-09-07 21:33:16,360 WARN L188 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 26 [2019-09-07 21:33:16,659 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 25 [2019-09-07 21:33:17,184 WARN L188 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2019-09-07 21:33:17,998 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2019-09-07 21:33:19,094 WARN L188 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2019-09-07 21:33:20,095 WARN L188 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2019-09-07 21:33:21,436 WARN L188 SmtUtils]: Spent 392.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-09-07 21:33:22,806 WARN L188 SmtUtils]: Spent 466.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-09-07 21:33:23,354 WARN L188 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2019-09-07 21:33:23,880 WARN L188 SmtUtils]: Spent 450.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-09-07 21:33:28,484 WARN L188 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2019-09-07 21:33:29,639 WARN L188 SmtUtils]: Spent 855.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2019-09-07 21:33:31,028 WARN L188 SmtUtils]: Spent 892.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2019-09-07 21:33:32,428 WARN L188 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2019-09-07 21:33:36,063 WARN L188 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2019-09-07 21:33:37,381 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2019-09-07 21:33:38,390 WARN L188 SmtUtils]: Spent 964.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2019-09-07 21:33:48,026 WARN L188 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2019-09-07 21:33:50,865 WARN L188 SmtUtils]: Spent 955.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2019-09-07 21:34:16,345 WARN L188 SmtUtils]: Spent 735.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-09-07 21:34:18,697 WARN L188 SmtUtils]: Spent 377.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-09-07 21:34:24,985 WARN L188 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2019-09-07 21:34:28,280 WARN L188 SmtUtils]: Spent 827.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2019-09-07 21:34:32,697 WARN L188 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2019-09-07 21:34:50,646 WARN L188 SmtUtils]: Spent 971.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2019-09-07 21:35:14,459 WARN L188 SmtUtils]: Spent 967.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 31 [2019-09-07 21:35:25,489 WARN L188 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 20 [2019-09-07 21:35:26,364 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 26