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/Problem13_label14.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 19:25:52,971 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 19:25:52,974 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 19:25:52,987 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 19:25:52,988 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 19:25:52,989 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 19:25:52,990 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 19:25:52,992 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 19:25:52,994 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 19:25:52,995 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 19:25:52,996 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 19:25:52,997 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 19:25:52,997 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 19:25:52,998 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 19:25:52,999 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 19:25:53,000 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 19:25:53,001 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 19:25:53,002 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 19:25:53,004 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 19:25:53,006 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 19:25:53,008 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 19:25:53,009 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 19:25:53,010 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 19:25:53,011 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 19:25:53,013 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 19:25:53,014 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 19:25:53,014 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 19:25:53,015 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 19:25:53,015 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 19:25:53,017 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 19:25:53,017 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 19:25:53,018 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 19:25:53,018 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 19:25:53,019 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 19:25:53,020 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 19:25:53,020 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 19:25:53,021 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 19:25:53,021 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 19:25:53,022 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 19:25:53,023 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 19:25:53,023 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 19:25:53,024 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 19:25:53,039 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 19:25:53,040 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 19:25:53,041 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 19:25:53,041 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 19:25:53,042 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 19:25:53,042 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 19:25:53,042 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 19:25:53,042 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 19:25:53,042 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 19:25:53,043 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 19:25:53,043 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 19:25:53,043 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 19:25:53,043 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 19:25:53,044 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 19:25:53,044 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 19:25:53,044 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 19:25:53,044 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 19:25:53,044 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 19:25:53,045 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 19:25:53,045 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 19:25:53,045 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 19:25:53,045 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 19:25:53,045 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 19:25:53,046 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 19:25:53,046 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 19:25:53,046 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 19:25:53,046 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 19:25:53,046 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 19:25:53,047 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 19:25:53,076 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 19:25:53,094 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 19:25:53,102 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 19:25:53,104 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 19:25:53,105 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 19:25:53,106 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label14.c [2019-09-07 19:25:53,183 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5f029f5c/a55ac62e318a440cb297b220b1527d6f/FLAGe9119a196 [2019-09-07 19:25:54,001 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 19:25:54,003 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label14.c [2019-09-07 19:25:54,050 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5f029f5c/a55ac62e318a440cb297b220b1527d6f/FLAGe9119a196 [2019-09-07 19:25:54,508 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5f029f5c/a55ac62e318a440cb297b220b1527d6f [2019-09-07 19:25:54,520 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 19:25:54,522 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 19:25:54,523 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 19:25:54,524 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 19:25:54,528 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 19:25:54,529 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:25:54" (1/1) ... [2019-09-07 19:25:54,532 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b4b40c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:25:54, skipping insertion in model container [2019-09-07 19:25:54,532 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:25:54" (1/1) ... [2019-09-07 19:25:54,541 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 19:25:54,706 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 19:25:56,257 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 19:25:56,263 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 19:25:57,100 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 19:25:57,134 INFO L192 MainTranslator]: Completed translation [2019-09-07 19:25:57,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:25:57 WrapperNode [2019-09-07 19:25:57,135 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 19:25:57,136 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 19:25:57,136 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 19:25:57,136 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 19:25:57,153 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:25:57" (1/1) ... [2019-09-07 19:25:57,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:25:57" (1/1) ... [2019-09-07 19:25:57,220 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:25:57" (1/1) ... [2019-09-07 19:25:57,221 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:25:57" (1/1) ... [2019-09-07 19:25:57,384 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:25:57" (1/1) ... [2019-09-07 19:25:57,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:25:57" (1/1) ... [2019-09-07 19:25:57,480 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:25:57" (1/1) ... [2019-09-07 19:25:57,547 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 19:25:57,548 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 19:25:57,548 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 19:25:57,548 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 19:25:57,549 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:25:57" (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 19:25:57,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 19:25:57,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 19:25:57,617 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 19:25:57,617 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 19:25:57,619 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2019-09-07 19:25:57,619 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2019-09-07 19:25:57,619 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 19:25:57,619 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 19:25:57,619 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 19:25:57,619 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2019-09-07 19:25:57,620 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2019-09-07 19:25:57,620 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 19:25:57,621 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 19:25:57,622 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 19:25:57,623 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 19:25:57,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 19:25:57,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 19:26:04,498 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 19:26:04,499 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 19:26:04,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:26:04 BoogieIcfgContainer [2019-09-07 19:26:04,503 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 19:26:04,504 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 19:26:04,505 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 19:26:04,507 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 19:26:04,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 07:25:54" (1/3) ... [2019-09-07 19:26:04,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ab47f92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:26:04, skipping insertion in model container [2019-09-07 19:26:04,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:25:57" (2/3) ... [2019-09-07 19:26:04,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ab47f92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:26:04, skipping insertion in model container [2019-09-07 19:26:04,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:26:04" (3/3) ... [2019-09-07 19:26:04,511 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem13_label14.c [2019-09-07 19:26:04,520 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 19:26:04,527 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 19:26:04,543 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 19:26:04,583 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 19:26:04,584 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 19:26:04,584 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 19:26:04,585 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 19:26:04,585 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 19:26:04,585 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 19:26:04,585 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 19:26:04,585 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 19:26:04,585 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 19:26:04,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states. [2019-09-07 19:26:04,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-07 19:26:04,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:26:04,633 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] [2019-09-07 19:26:04,635 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:26:04,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:26:04,641 INFO L82 PathProgramCache]: Analyzing trace with hash -892246856, now seen corresponding path program 1 times [2019-09-07 19:26:04,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:26:04,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:26:04,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:26:04,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:26:04,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:26:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:26:04,925 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 19:26:04,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:26:04,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 19:26:04,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 19:26:04,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 19:26:04,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:26:04,950 INFO L87 Difference]: Start difference. First operand 1119 states. Second operand 3 states. [2019-09-07 19:26:10,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:26:10,648 INFO L93 Difference]: Finished difference Result 3094 states and 5704 transitions. [2019-09-07 19:26:10,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 19:26:10,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-09-07 19:26:10,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:26:10,696 INFO L225 Difference]: With dead ends: 3094 [2019-09-07 19:26:10,697 INFO L226 Difference]: Without dead ends: 1913 [2019-09-07 19:26:10,712 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 19:26:10,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1913 states. [2019-09-07 19:26:10,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1913 to 1912. [2019-09-07 19:26:10,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1912 states. [2019-09-07 19:26:10,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1912 states to 1912 states and 3141 transitions. [2019-09-07 19:26:10,885 INFO L78 Accepts]: Start accepts. Automaton has 1912 states and 3141 transitions. Word has length 47 [2019-09-07 19:26:10,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:26:10,887 INFO L475 AbstractCegarLoop]: Abstraction has 1912 states and 3141 transitions. [2019-09-07 19:26:10,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 19:26:10,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 3141 transitions. [2019-09-07 19:26:10,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-07 19:26:10,903 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:26:10,904 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:26:10,904 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:26:10,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:26:10,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1989559037, now seen corresponding path program 1 times [2019-09-07 19:26:10,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:26:10,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:26:10,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:26:10,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:26:10,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:26:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:26:11,211 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:26:11,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:26:11,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 19:26:11,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 19:26:11,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 19:26:11,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 19:26:11,214 INFO L87 Difference]: Start difference. First operand 1912 states and 3141 transitions. Second operand 5 states. [2019-09-07 19:26:20,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:26:20,989 INFO L93 Difference]: Finished difference Result 5587 states and 9298 transitions. [2019-09-07 19:26:20,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 19:26:20,991 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2019-09-07 19:26:20,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:26:21,016 INFO L225 Difference]: With dead ends: 5587 [2019-09-07 19:26:21,016 INFO L226 Difference]: Without dead ends: 3681 [2019-09-07 19:26:21,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 19:26:21,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3681 states. [2019-09-07 19:26:21,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3681 to 3601. [2019-09-07 19:26:21,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3601 states. [2019-09-07 19:26:21,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3601 states to 3601 states and 5413 transitions. [2019-09-07 19:26:21,162 INFO L78 Accepts]: Start accepts. Automaton has 3601 states and 5413 transitions. Word has length 122 [2019-09-07 19:26:21,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:26:21,164 INFO L475 AbstractCegarLoop]: Abstraction has 3601 states and 5413 transitions. [2019-09-07 19:26:21,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 19:26:21,165 INFO L276 IsEmpty]: Start isEmpty. Operand 3601 states and 5413 transitions. [2019-09-07 19:26:21,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-07 19:26:21,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:26:21,169 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:26:21,170 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:26:21,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:26:21,171 INFO L82 PathProgramCache]: Analyzing trace with hash -2091131495, now seen corresponding path program 1 times [2019-09-07 19:26:21,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:26:21,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:26:21,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:26:21,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:26:21,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:26:21,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:26:21,402 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:26:21,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:26:21,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 19:26:21,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 19:26:21,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 19:26:21,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 19:26:21,405 INFO L87 Difference]: Start difference. First operand 3601 states and 5413 transitions. Second operand 5 states. [2019-09-07 19:26:31,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:26:31,596 INFO L93 Difference]: Finished difference Result 10901 states and 16894 transitions. [2019-09-07 19:26:31,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 19:26:31,600 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 136 [2019-09-07 19:26:31,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:26:31,640 INFO L225 Difference]: With dead ends: 10901 [2019-09-07 19:26:31,643 INFO L226 Difference]: Without dead ends: 7306 [2019-09-07 19:26:31,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 19:26:31,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7306 states. [2019-09-07 19:26:31,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7306 to 7121. [2019-09-07 19:26:31,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7121 states. [2019-09-07 19:26:31,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7121 states to 7121 states and 10495 transitions. [2019-09-07 19:26:31,890 INFO L78 Accepts]: Start accepts. Automaton has 7121 states and 10495 transitions. Word has length 136 [2019-09-07 19:26:31,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:26:31,892 INFO L475 AbstractCegarLoop]: Abstraction has 7121 states and 10495 transitions. [2019-09-07 19:26:31,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 19:26:31,892 INFO L276 IsEmpty]: Start isEmpty. Operand 7121 states and 10495 transitions. [2019-09-07 19:26:31,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-07 19:26:31,896 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:26:31,896 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:26:31,897 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:26:31,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:26:31,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1868178493, now seen corresponding path program 1 times [2019-09-07 19:26:31,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:26:31,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:26:31,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:26:31,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:26:31,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:26:31,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:26:32,140 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:26:32,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:26:32,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:26:32,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:26:32,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:26:32,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:26:32,142 INFO L87 Difference]: Start difference. First operand 7121 states and 10495 transitions. Second operand 6 states. [2019-09-07 19:26:39,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:26:39,653 INFO L93 Difference]: Finished difference Result 21450 states and 33769 transitions. [2019-09-07 19:26:39,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:26:39,653 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 154 [2019-09-07 19:26:39,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:26:39,745 INFO L225 Difference]: With dead ends: 21450 [2019-09-07 19:26:39,746 INFO L226 Difference]: Without dead ends: 14335 [2019-09-07 19:26:39,776 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 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 19:26:39,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14335 states. [2019-09-07 19:26:40,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14335 to 14126. [2019-09-07 19:26:40,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14126 states. [2019-09-07 19:26:40,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14126 states to 14126 states and 21301 transitions. [2019-09-07 19:26:40,236 INFO L78 Accepts]: Start accepts. Automaton has 14126 states and 21301 transitions. Word has length 154 [2019-09-07 19:26:40,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:26:40,236 INFO L475 AbstractCegarLoop]: Abstraction has 14126 states and 21301 transitions. [2019-09-07 19:26:40,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:26:40,236 INFO L276 IsEmpty]: Start isEmpty. Operand 14126 states and 21301 transitions. [2019-09-07 19:26:40,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-07 19:26:40,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:26:40,242 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:26:40,242 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:26:40,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:26:40,242 INFO L82 PathProgramCache]: Analyzing trace with hash -339990150, now seen corresponding path program 1 times [2019-09-07 19:26:40,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:26:40,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:26:40,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:26:40,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:26:40,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:26:40,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:26:40,403 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:26:40,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:26:40,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:26:40,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:26:40,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:26:40,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:26:40,405 INFO L87 Difference]: Start difference. First operand 14126 states and 21301 transitions. Second operand 6 states. [2019-09-07 19:26:48,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:26:48,548 INFO L93 Difference]: Finished difference Result 42171 states and 69935 transitions. [2019-09-07 19:26:48,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:26:48,549 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 165 [2019-09-07 19:26:48,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:26:48,693 INFO L225 Difference]: With dead ends: 42171 [2019-09-07 19:26:48,694 INFO L226 Difference]: Without dead ends: 28051 [2019-09-07 19:26:48,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 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 19:26:48,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28051 states. [2019-09-07 19:26:49,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28051 to 27931. [2019-09-07 19:26:49,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27931 states. [2019-09-07 19:26:49,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27931 states to 27931 states and 41898 transitions. [2019-09-07 19:26:49,614 INFO L78 Accepts]: Start accepts. Automaton has 27931 states and 41898 transitions. Word has length 165 [2019-09-07 19:26:49,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:26:49,614 INFO L475 AbstractCegarLoop]: Abstraction has 27931 states and 41898 transitions. [2019-09-07 19:26:49,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:26:49,614 INFO L276 IsEmpty]: Start isEmpty. Operand 27931 states and 41898 transitions. [2019-09-07 19:26:49,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-07 19:26:49,619 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:26:49,620 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:26:49,620 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:26:49,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:26:49,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1447847319, now seen corresponding path program 1 times [2019-09-07 19:26:49,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:26:49,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:26:49,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:26:49,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:26:49,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:26:49,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:26:49,833 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:26:49,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:26:49,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:26:49,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:26:49,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:26:49,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:26:49,835 INFO L87 Difference]: Start difference. First operand 27931 states and 41898 transitions. Second operand 6 states. [2019-09-07 19:26:57,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:26:57,593 INFO L93 Difference]: Finished difference Result 64050 states and 97298 transitions. [2019-09-07 19:26:57,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:26:57,597 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 193 [2019-09-07 19:26:57,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:26:57,729 INFO L225 Difference]: With dead ends: 64050 [2019-09-07 19:26:57,729 INFO L226 Difference]: Without dead ends: 36125 [2019-09-07 19:26:57,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 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 19:26:57,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36125 states. [2019-09-07 19:26:58,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36125 to 34426. [2019-09-07 19:26:58,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34426 states. [2019-09-07 19:26:58,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34426 states to 34426 states and 48593 transitions. [2019-09-07 19:26:58,656 INFO L78 Accepts]: Start accepts. Automaton has 34426 states and 48593 transitions. Word has length 193 [2019-09-07 19:26:58,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:26:58,657 INFO L475 AbstractCegarLoop]: Abstraction has 34426 states and 48593 transitions. [2019-09-07 19:26:58,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:26:58,657 INFO L276 IsEmpty]: Start isEmpty. Operand 34426 states and 48593 transitions. [2019-09-07 19:26:58,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-07 19:26:58,663 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:26:58,663 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:26:58,664 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:26:58,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:26:58,664 INFO L82 PathProgramCache]: Analyzing trace with hash -340816018, now seen corresponding path program 1 times [2019-09-07 19:26:58,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:26:58,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:26:58,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:26:58,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:26:58,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:26:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:26:58,878 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 153 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:26:58,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:26:58,879 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) [2019-09-07 19:26:58,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:26:58,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:26:58,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 19:26:59,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:26:59,110 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-09-07 19:26:59,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:26:59,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-07 19:26:59,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 19:26:59,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 19:26:59,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 19:26:59,125 INFO L87 Difference]: Start difference. First operand 34426 states and 48593 transitions. Second operand 7 states. [2019-09-07 19:27:16,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:27:16,974 INFO L93 Difference]: Finished difference Result 107910 states and 157326 transitions. [2019-09-07 19:27:16,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 19:27:16,976 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 242 [2019-09-07 19:27:16,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:27:17,431 INFO L225 Difference]: With dead ends: 107910 [2019-09-07 19:27:17,431 INFO L226 Difference]: Without dead ends: 73490 [2019-09-07 19:27:17,573 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-09-07 19:27:17,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73490 states. [2019-09-07 19:27:18,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73490 to 65388. [2019-09-07 19:27:18,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65388 states. [2019-09-07 19:27:19,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65388 states to 65388 states and 85895 transitions. [2019-09-07 19:27:19,090 INFO L78 Accepts]: Start accepts. Automaton has 65388 states and 85895 transitions. Word has length 242 [2019-09-07 19:27:19,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:27:19,090 INFO L475 AbstractCegarLoop]: Abstraction has 65388 states and 85895 transitions. [2019-09-07 19:27:19,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 19:27:19,091 INFO L276 IsEmpty]: Start isEmpty. Operand 65388 states and 85895 transitions. [2019-09-07 19:27:19,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-07 19:27:19,097 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:27:19,097 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:27:19,097 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:27:19,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:27:19,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1992058548, now seen corresponding path program 1 times [2019-09-07 19:27:19,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:27:19,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:27:19,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:27:19,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:27:19,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:27:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:27:19,345 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-09-07 19:27:19,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:27:19,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 19:27:19,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 19:27:19,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 19:27:19,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:27:19,347 INFO L87 Difference]: Start difference. First operand 65388 states and 85895 transitions. Second operand 4 states. [2019-09-07 19:27:29,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:27:29,232 INFO L93 Difference]: Finished difference Result 179735 states and 242973 transitions. [2019-09-07 19:27:29,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 19:27:29,233 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 247 [2019-09-07 19:27:29,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:27:29,706 INFO L225 Difference]: With dead ends: 179735 [2019-09-07 19:27:29,707 INFO L226 Difference]: Without dead ends: 114357 [2019-09-07 19:27:29,848 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 19:27:29,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114357 states. [2019-09-07 19:27:34,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114357 to 106214. [2019-09-07 19:27:34,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106214 states. [2019-09-07 19:27:35,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106214 states to 106214 states and 139238 transitions. [2019-09-07 19:27:35,151 INFO L78 Accepts]: Start accepts. Automaton has 106214 states and 139238 transitions. Word has length 247 [2019-09-07 19:27:35,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:27:35,152 INFO L475 AbstractCegarLoop]: Abstraction has 106214 states and 139238 transitions. [2019-09-07 19:27:35,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 19:27:35,152 INFO L276 IsEmpty]: Start isEmpty. Operand 106214 states and 139238 transitions. [2019-09-07 19:27:35,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-07 19:27:35,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:27:35,180 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:27:35,181 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:27:35,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:27:35,182 INFO L82 PathProgramCache]: Analyzing trace with hash 735027369, now seen corresponding path program 1 times [2019-09-07 19:27:35,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:27:35,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:27:35,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:27:35,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:27:35,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:27:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:27:35,635 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 200 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-09-07 19:27:35,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:27:35,636 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:27:35,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:27:35,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:27:35,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:27:35,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:27:35,957 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 313 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-07 19:27:35,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:27:35,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:27:35,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:27:35,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:27:35,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:27:35,972 INFO L87 Difference]: Start difference. First operand 106214 states and 139238 transitions. Second operand 9 states. [2019-09-07 19:27:56,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:27:56,446 INFO L93 Difference]: Finished difference Result 259055 states and 380892 transitions. [2019-09-07 19:27:56,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 19:27:56,447 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 327 [2019-09-07 19:27:56,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:27:57,485 INFO L225 Difference]: With dead ends: 259055 [2019-09-07 19:27:57,485 INFO L226 Difference]: Without dead ends: 151136 [2019-09-07 19:27:57,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-07 19:27:57,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151136 states. [2019-09-07 19:28:01,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151136 to 149149. [2019-09-07 19:28:01,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149149 states. [2019-09-07 19:28:01,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149149 states to 149149 states and 216875 transitions. [2019-09-07 19:28:01,782 INFO L78 Accepts]: Start accepts. Automaton has 149149 states and 216875 transitions. Word has length 327 [2019-09-07 19:28:01,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:28:01,783 INFO L475 AbstractCegarLoop]: Abstraction has 149149 states and 216875 transitions. [2019-09-07 19:28:01,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:28:01,783 INFO L276 IsEmpty]: Start isEmpty. Operand 149149 states and 216875 transitions. [2019-09-07 19:28:01,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-09-07 19:28:01,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:28:01,800 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:28:01,800 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:28:01,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:28:01,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1764189265, now seen corresponding path program 1 times [2019-09-07 19:28:01,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:28:01,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:28:01,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:28:01,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:28:01,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:28:01,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:28:02,099 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 281 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-07 19:28:02,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:28:02,100 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:28:02,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:28:02,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:28:02,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:28:02,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:28:05,303 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 281 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-07 19:28:05,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:28:05,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:28:05,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:28:05,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:28:05,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:28:05,322 INFO L87 Difference]: Start difference. First operand 149149 states and 216875 transitions. Second operand 9 states. [2019-09-07 19:28:26,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:28:26,004 INFO L93 Difference]: Finished difference Result 338546 states and 485813 transitions. [2019-09-07 19:28:26,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-07 19:28:26,005 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 338 [2019-09-07 19:28:26,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:28:26,665 INFO L225 Difference]: With dead ends: 338546 [2019-09-07 19:28:26,666 INFO L226 Difference]: Without dead ends: 187788 [2019-09-07 19:28:26,904 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=283, Invalid=1049, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 19:28:27,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187788 states. [2019-09-07 19:28:29,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187788 to 169459. [2019-09-07 19:28:29,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169459 states. [2019-09-07 19:28:30,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169459 states to 169459 states and 198505 transitions. [2019-09-07 19:28:30,122 INFO L78 Accepts]: Start accepts. Automaton has 169459 states and 198505 transitions. Word has length 338 [2019-09-07 19:28:30,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:28:30,123 INFO L475 AbstractCegarLoop]: Abstraction has 169459 states and 198505 transitions. [2019-09-07 19:28:30,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:28:30,123 INFO L276 IsEmpty]: Start isEmpty. Operand 169459 states and 198505 transitions. [2019-09-07 19:28:30,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-09-07 19:28:30,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:28:30,141 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:28:30,142 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:28:30,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:28:30,142 INFO L82 PathProgramCache]: Analyzing trace with hash 538422194, now seen corresponding path program 1 times [2019-09-07 19:28:30,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:28:30,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:28:30,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:28:30,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:28:30,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:28:30,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:28:30,367 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-09-07 19:28:30,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:28:30,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 19:28:30,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 19:28:30,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 19:28:30,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:28:30,369 INFO L87 Difference]: Start difference. First operand 169459 states and 198505 transitions. Second operand 4 states. [2019-09-07 19:28:41,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:28:41,038 INFO L93 Difference]: Finished difference Result 397913 states and 473360 transitions. [2019-09-07 19:28:41,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 19:28:41,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 352 [2019-09-07 19:28:41,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:28:41,800 INFO L225 Difference]: With dead ends: 397913 [2019-09-07 19:28:41,801 INFO L226 Difference]: Without dead ends: 228450 [2019-09-07 19:28:42,022 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 19:28:42,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228450 states. [2019-09-07 19:28:48,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228450 to 217988. [2019-09-07 19:28:48,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217988 states. [2019-09-07 19:28:48,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217988 states to 217988 states and 256989 transitions. [2019-09-07 19:28:48,963 INFO L78 Accepts]: Start accepts. Automaton has 217988 states and 256989 transitions. Word has length 352 [2019-09-07 19:28:48,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:28:48,964 INFO L475 AbstractCegarLoop]: Abstraction has 217988 states and 256989 transitions. [2019-09-07 19:28:48,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 19:28:48,964 INFO L276 IsEmpty]: Start isEmpty. Operand 217988 states and 256989 transitions. [2019-09-07 19:28:48,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2019-09-07 19:28:48,984 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:28:48,985 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:28:48,985 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:28:48,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:28:48,986 INFO L82 PathProgramCache]: Analyzing trace with hash -223639408, now seen corresponding path program 1 times [2019-09-07 19:28:48,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:28:48,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:28:48,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:28:48,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:28:48,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:28:49,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:28:49,957 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 328 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-07 19:28:49,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:28:49,958 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:28:49,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:28:50,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:28:50,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:28:50,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:28:50,220 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 328 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-07 19:28:50,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:28:50,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:28:50,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:28:50,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:28:50,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:28:50,226 INFO L87 Difference]: Start difference. First operand 217988 states and 256989 transitions. Second operand 9 states. [2019-09-07 19:29:13,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:29:13,445 INFO L93 Difference]: Finished difference Result 478132 states and 609233 transitions. [2019-09-07 19:29:13,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 19:29:13,446 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 408 [2019-09-07 19:29:13,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:29:14,472 INFO L225 Difference]: With dead ends: 478132 [2019-09-07 19:29:14,472 INFO L226 Difference]: Without dead ends: 256028 [2019-09-07 19:29:15,548 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2019-09-07 19:29:15,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256028 states. [2019-09-07 19:29:19,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256028 to 253557. [2019-09-07 19:29:19,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253557 states. [2019-09-07 19:29:19,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253557 states to 253557 states and 315558 transitions. [2019-09-07 19:29:19,796 INFO L78 Accepts]: Start accepts. Automaton has 253557 states and 315558 transitions. Word has length 408 [2019-09-07 19:29:19,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:29:19,797 INFO L475 AbstractCegarLoop]: Abstraction has 253557 states and 315558 transitions. [2019-09-07 19:29:19,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:29:19,798 INFO L276 IsEmpty]: Start isEmpty. Operand 253557 states and 315558 transitions. [2019-09-07 19:29:19,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2019-09-07 19:29:19,824 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:29:19,824 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, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-09-07 19:29:19,825 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:29:19,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:29:19,825 INFO L82 PathProgramCache]: Analyzing trace with hash 87768143, now seen corresponding path program 1 times [2019-09-07 19:29:19,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:29:19,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:29:19,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:29:19,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:29:19,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:29:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:29:24,074 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2019-09-07 19:29:24,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:29:24,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 19:29:24,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 19:29:24,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 19:29:24,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:29:24,082 INFO L87 Difference]: Start difference. First operand 253557 states and 315558 transitions. Second operand 4 states. [2019-09-07 19:29:30,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:29:30,382 INFO L93 Difference]: Finished difference Result 502133 states and 624813 transitions. [2019-09-07 19:29:30,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 19:29:30,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 452 [2019-09-07 19:29:30,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:29:31,083 INFO L225 Difference]: With dead ends: 502133 [2019-09-07 19:29:31,083 INFO L226 Difference]: Without dead ends: 250210 [2019-09-07 19:29:31,434 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:29:31,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250210 states. [2019-09-07 19:29:39,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250210 to 250206. [2019-09-07 19:29:39,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250206 states. [2019-09-07 19:29:40,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250206 states to 250206 states and 310306 transitions. [2019-09-07 19:29:40,557 INFO L78 Accepts]: Start accepts. Automaton has 250206 states and 310306 transitions. Word has length 452 [2019-09-07 19:29:40,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:29:40,558 INFO L475 AbstractCegarLoop]: Abstraction has 250206 states and 310306 transitions. [2019-09-07 19:29:40,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 19:29:40,558 INFO L276 IsEmpty]: Start isEmpty. Operand 250206 states and 310306 transitions. [2019-09-07 19:29:40,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2019-09-07 19:29:40,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:29:40,597 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-09-07 19:29:40,597 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:29:40,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:29:40,597 INFO L82 PathProgramCache]: Analyzing trace with hash -119204107, now seen corresponding path program 1 times [2019-09-07 19:29:40,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:29:40,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:29:40,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:29:40,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:29:40,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:29:40,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:29:40,941 INFO L134 CoverageAnalysis]: Checked inductivity of 752 backedges. 259 proven. 207 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-09-07 19:29:40,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:29:40,941 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 19:29:41,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:29:41,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:29:41,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:29:41,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:29:42,068 INFO L134 CoverageAnalysis]: Checked inductivity of 752 backedges. 564 proven. 2 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 19:29:42,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:29:42,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:29:42,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:29:42,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:29:42,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:29:42,076 INFO L87 Difference]: Start difference. First operand 250206 states and 310306 transitions. Second operand 9 states. [2019-09-07 19:30:05,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:30:05,092 INFO L93 Difference]: Finished difference Result 513010 states and 665646 transitions. [2019-09-07 19:30:05,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 19:30:05,092 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 501 [2019-09-07 19:30:05,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:30:06,921 INFO L225 Difference]: With dead ends: 513010 [2019-09-07 19:30:06,921 INFO L226 Difference]: Without dead ends: 262687 [2019-09-07 19:30:07,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 532 GetRequests, 512 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2019-09-07 19:30:07,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262687 states. [2019-09-07 19:30:12,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262687 to 259591. [2019-09-07 19:30:12,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259591 states. [2019-09-07 19:30:12,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259591 states to 259591 states and 317259 transitions. [2019-09-07 19:30:12,858 INFO L78 Accepts]: Start accepts. Automaton has 259591 states and 317259 transitions. Word has length 501 [2019-09-07 19:30:12,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:30:12,858 INFO L475 AbstractCegarLoop]: Abstraction has 259591 states and 317259 transitions. [2019-09-07 19:30:12,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:30:12,858 INFO L276 IsEmpty]: Start isEmpty. Operand 259591 states and 317259 transitions. [2019-09-07 19:30:12,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2019-09-07 19:30:12,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:30:12,891 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 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 19:30:12,892 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:30:12,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:30:12,892 INFO L82 PathProgramCache]: Analyzing trace with hash 2062729019, now seen corresponding path program 1 times [2019-09-07 19:30:12,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:30:12,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:30:12,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:30:12,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:30:12,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:30:12,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:30:13,344 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 264 proven. 142 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-09-07 19:30:13,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:30:13,345 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 19:30:13,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:30:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:30:13,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 779 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 19:30:13,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:30:17,947 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 19:30:17,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:30:17,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2019-09-07 19:30:17,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 19:30:17,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 19:30:17,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-07 19:30:17,957 INFO L87 Difference]: Start difference. First operand 259591 states and 317259 transitions. Second operand 8 states. [2019-09-07 19:30:39,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:30:39,899 INFO L93 Difference]: Finished difference Result 609626 states and 775694 transitions. [2019-09-07 19:30:39,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 19:30:39,900 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 511 [2019-09-07 19:30:39,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:30:41,706 INFO L225 Difference]: With dead ends: 609626 [2019-09-07 19:30:41,707 INFO L226 Difference]: Without dead ends: 337673 [2019-09-07 19:30:42,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 518 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-09-07 19:30:42,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337673 states. [2019-09-07 19:30:52,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337673 to 311671. [2019-09-07 19:30:52,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311671 states. [2019-09-07 19:30:53,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311671 states to 311671 states and 364577 transitions. [2019-09-07 19:30:53,333 INFO L78 Accepts]: Start accepts. Automaton has 311671 states and 364577 transitions. Word has length 511 [2019-09-07 19:30:53,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:30:53,333 INFO L475 AbstractCegarLoop]: Abstraction has 311671 states and 364577 transitions. [2019-09-07 19:30:53,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 19:30:53,334 INFO L276 IsEmpty]: Start isEmpty. Operand 311671 states and 364577 transitions. [2019-09-07 19:30:53,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2019-09-07 19:30:53,375 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:30:53,375 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:30:53,376 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:30:53,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:30:53,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1619597365, now seen corresponding path program 1 times [2019-09-07 19:30:53,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:30:53,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:30:53,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:30:53,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:30:53,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:30:53,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:30:54,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 585 proven. 2 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2019-09-07 19:30:54,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:30:54,824 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:30:54,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:30:55,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:30:55,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 936 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:30:55,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:30:55,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 585 proven. 2 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2019-09-07 19:30:55,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:30:55,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:30:55,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:30:55,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:30:55,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:30:55,201 INFO L87 Difference]: Start difference. First operand 311671 states and 364577 transitions. Second operand 9 states. [2019-09-07 19:31:16,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:31:16,225 INFO L93 Difference]: Finished difference Result 588100 states and 678635 transitions. [2019-09-07 19:31:16,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-07 19:31:16,225 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 577 [2019-09-07 19:31:16,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:31:16,882 INFO L225 Difference]: With dead ends: 588100 [2019-09-07 19:31:16,883 INFO L226 Difference]: Without dead ends: 282872 [2019-09-07 19:31:17,233 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 665 GetRequests, 616 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=509, Invalid=2041, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 19:31:17,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282872 states. [2019-09-07 19:31:21,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282872 to 270626. [2019-09-07 19:31:21,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270626 states. [2019-09-07 19:31:21,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270626 states to 270626 states and 290708 transitions. [2019-09-07 19:31:21,911 INFO L78 Accepts]: Start accepts. Automaton has 270626 states and 290708 transitions. Word has length 577 [2019-09-07 19:31:21,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:31:21,912 INFO L475 AbstractCegarLoop]: Abstraction has 270626 states and 290708 transitions. [2019-09-07 19:31:21,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:31:21,912 INFO L276 IsEmpty]: Start isEmpty. Operand 270626 states and 290708 transitions. [2019-09-07 19:31:21,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 770 [2019-09-07 19:31:21,971 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:31:21,971 INFO L399 BasicCegarLoop]: trace histogram [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, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:31:21,972 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:31:21,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:31:21,972 INFO L82 PathProgramCache]: Analyzing trace with hash 848140624, now seen corresponding path program 1 times [2019-09-07 19:31:21,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:31:21,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:31:21,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:31:21,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:31:21,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:31:26,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:31:26,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1484 backedges. 407 proven. 209 refuted. 0 times theorem prover too weak. 868 trivial. 0 not checked. [2019-09-07 19:31:26,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:31:26,488 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 19:31:26,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:31:26,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:31:26,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 1178 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 19:31:26,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:31:26,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:31:27,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1484 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 1034 trivial. 0 not checked. [2019-09-07 19:31:27,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:31:27,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 19:31:27,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:31:27,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:31:27,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:31:27,172 INFO L87 Difference]: Start difference. First operand 270626 states and 290708 transitions. Second operand 9 states. [2019-09-07 19:31:48,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:31:48,274 INFO L93 Difference]: Finished difference Result 597333 states and 657818 transitions. [2019-09-07 19:31:48,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 19:31:48,275 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 769 [2019-09-07 19:31:48,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:31:49,097 INFO L225 Difference]: With dead ends: 597333 [2019-09-07 19:31:49,097 INFO L226 Difference]: Without dead ends: 329954 [2019-09-07 19:31:49,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 820 GetRequests, 789 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=221, Invalid=835, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 19:31:49,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329954 states. [2019-09-07 19:31:54,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329954 to 298074. [2019-09-07 19:31:54,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298074 states. [2019-09-07 19:31:54,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298074 states to 298074 states and 319103 transitions. [2019-09-07 19:31:54,910 INFO L78 Accepts]: Start accepts. Automaton has 298074 states and 319103 transitions. Word has length 769 [2019-09-07 19:31:54,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:31:54,911 INFO L475 AbstractCegarLoop]: Abstraction has 298074 states and 319103 transitions. [2019-09-07 19:31:54,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:31:54,911 INFO L276 IsEmpty]: Start isEmpty. Operand 298074 states and 319103 transitions. [2019-09-07 19:31:56,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 958 [2019-09-07 19:31:56,277 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:31:56,278 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:31:56,278 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:31:56,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:31:56,279 INFO L82 PathProgramCache]: Analyzing trace with hash 608798820, now seen corresponding path program 1 times [2019-09-07 19:31:56,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:31:56,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:31:56,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:31:56,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:31:56,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:31:56,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:31:58,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 940 trivial. 0 not checked. [2019-09-07 19:31:58,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:31:58,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 19:31:58,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 19:31:58,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 19:31:58,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:31:58,217 INFO L87 Difference]: Start difference. First operand 298074 states and 319103 transitions. Second operand 4 states. [2019-09-07 19:32:13,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:32:13,383 INFO L93 Difference]: Finished difference Result 725351 states and 777558 transitions. [2019-09-07 19:32:13,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 19:32:13,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 957 [2019-09-07 19:32:13,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:32:14,694 INFO L225 Difference]: With dead ends: 725351 [2019-09-07 19:32:14,694 INFO L226 Difference]: Without dead ends: 429696 [2019-09-07 19:32:15,017 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 19:32:15,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429696 states. [2019-09-07 19:32:20,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429696 to 374079. [2019-09-07 19:32:20,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374079 states. [2019-09-07 19:32:21,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374079 states to 374079 states and 400230 transitions. [2019-09-07 19:32:21,516 INFO L78 Accepts]: Start accepts. Automaton has 374079 states and 400230 transitions. Word has length 957 [2019-09-07 19:32:21,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:32:21,517 INFO L475 AbstractCegarLoop]: Abstraction has 374079 states and 400230 transitions. [2019-09-07 19:32:21,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 19:32:21,518 INFO L276 IsEmpty]: Start isEmpty. Operand 374079 states and 400230 transitions. [2019-09-07 19:32:21,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1173 [2019-09-07 19:32:21,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:32:21,730 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:32:21,730 INFO L418 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:32:21,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:32:21,731 INFO L82 PathProgramCache]: Analyzing trace with hash -2123216538, now seen corresponding path program 1 times [2019-09-07 19:32:21,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:32:21,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:32:21,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:32:21,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:32:21,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:32:21,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:32:27,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 211 proven. 367 refuted. 0 times theorem prover too weak. 449 trivial. 0 not checked. [2019-09-07 19:32:27,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:32:27,199 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 19:32:27,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:32:27,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:32:27,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 1566 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 19:32:27,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:32:28,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 492 proven. 2 refuted. 0 times theorem prover too weak. 533 trivial. 0 not checked. [2019-09-07 19:32:28,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:32:28,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2019-09-07 19:32:28,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 19:32:28,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 19:32:28,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-09-07 19:32:28,627 INFO L87 Difference]: Start difference. First operand 374079 states and 400230 transitions. Second operand 12 states. [2019-09-07 19:32:55,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:32:55,213 INFO L93 Difference]: Finished difference Result 858451 states and 919802 transitions. [2019-09-07 19:32:55,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 19:32:55,214 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 1172 [2019-09-07 19:32:55,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:32:56,225 INFO L225 Difference]: With dead ends: 858451 [2019-09-07 19:32:56,225 INFO L226 Difference]: Without dead ends: 490040 [2019-09-07 19:32:56,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1222 GetRequests, 1189 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=310, Invalid=880, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 19:32:56,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490040 states. [2019-09-07 19:33:04,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490040 to 472815. [2019-09-07 19:33:04,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472815 states. [2019-09-07 19:33:14,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472815 states to 472815 states and 505148 transitions. [2019-09-07 19:33:14,897 INFO L78 Accepts]: Start accepts. Automaton has 472815 states and 505148 transitions. Word has length 1172 [2019-09-07 19:33:14,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:33:14,897 INFO L475 AbstractCegarLoop]: Abstraction has 472815 states and 505148 transitions. [2019-09-07 19:33:14,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 19:33:14,898 INFO L276 IsEmpty]: Start isEmpty. Operand 472815 states and 505148 transitions. [2019-09-07 19:33:15,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1307 [2019-09-07 19:33:15,157 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:33:15,158 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:33:15,158 INFO L418 AbstractCegarLoop]: === Iteration 20 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:33:15,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:33:15,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1984958682, now seen corresponding path program 1 times [2019-09-07 19:33:15,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:33:15,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:33:15,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:33:15,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:33:15,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:33:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:33:17,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 555 proven. 357 refuted. 0 times theorem prover too weak. 609 trivial. 0 not checked. [2019-09-07 19:33:17,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:33:17,726 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) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:33:17,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:33:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:33:18,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 1743 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 19:33:18,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:33:18,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:33:18,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 747 proven. 2 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2019-09-07 19:33:18,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:33:18,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2019-09-07 19:33:18,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 19:33:18,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 19:33:18,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-07 19:33:18,960 INFO L87 Difference]: Start difference. First operand 472815 states and 505148 transitions. Second operand 12 states. [2019-09-07 19:34:04,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:34:04,287 INFO L93 Difference]: Finished difference Result 960215 states and 1026124 transitions. [2019-09-07 19:34:04,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-09-07 19:34:04,288 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 1306 [2019-09-07 19:34:04,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:34:05,493 INFO L225 Difference]: With dead ends: 960215 [2019-09-07 19:34:05,493 INFO L226 Difference]: Without dead ends: 503498 [2019-09-07 19:34:06,776 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1458 GetRequests, 1372 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2764 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1118, Invalid=6538, Unknown=0, NotChecked=0, Total=7656 [2019-09-07 19:34:07,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503498 states. [2019-09-07 19:34:25,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503498 to 485639. [2019-09-07 19:34:25,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485639 states. [2019-09-07 19:34:25,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485639 states to 485639 states and 517800 transitions. [2019-09-07 19:34:25,688 INFO L78 Accepts]: Start accepts. Automaton has 485639 states and 517800 transitions. Word has length 1306 [2019-09-07 19:34:25,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:34:25,689 INFO L475 AbstractCegarLoop]: Abstraction has 485639 states and 517800 transitions. [2019-09-07 19:34:25,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 19:34:25,689 INFO L276 IsEmpty]: Start isEmpty. Operand 485639 states and 517800 transitions. [2019-09-07 19:34:25,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1407 [2019-09-07 19:34:25,947 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:34:25,948 INFO L399 BasicCegarLoop]: trace histogram [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, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:34:25,948 INFO L418 AbstractCegarLoop]: === Iteration 21 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:34:25,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:34:25,948 INFO L82 PathProgramCache]: Analyzing trace with hash -367211663, now seen corresponding path program 1 times [2019-09-07 19:34:25,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:34:25,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:34:25,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:34:25,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:34:25,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:34:26,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:34:28,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2033 backedges. 323 proven. 889 refuted. 0 times theorem prover too weak. 821 trivial. 0 not checked. [2019-09-07 19:34:28,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:34:28,919 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:34:28,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:34:29,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:34:29,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 1887 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 19:34:29,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:34:29,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:34:30,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2033 backedges. 1062 proven. 2 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2019-09-07 19:34:30,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:34:30,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-09-07 19:34:30,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 19:34:30,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 19:34:30,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-09-07 19:34:30,442 INFO L87 Difference]: Start difference. First operand 485639 states and 517800 transitions. Second operand 16 states. [2019-09-07 19:35:12,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:35:12,625 INFO L93 Difference]: Finished difference Result 893755 states and 953005 transitions. [2019-09-07 19:35:12,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-09-07 19:35:12,625 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 1406 [2019-09-07 19:35:12,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:35:13,817 INFO L225 Difference]: With dead ends: 893755 [2019-09-07 19:35:13,817 INFO L226 Difference]: Without dead ends: 532339 [2019-09-07 19:35:14,050 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1593 GetRequests, 1484 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4557 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1732, Invalid=10258, Unknown=0, NotChecked=0, Total=11990 [2019-09-07 19:35:14,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532339 states. [2019-09-07 19:35:22,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532339 to 504573. [2019-09-07 19:35:22,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504573 states. [2019-09-07 19:35:25,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504573 states to 504573 states and 534521 transitions. [2019-09-07 19:35:25,361 INFO L78 Accepts]: Start accepts. Automaton has 504573 states and 534521 transitions. Word has length 1406 [2019-09-07 19:35:25,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:35:25,362 INFO L475 AbstractCegarLoop]: Abstraction has 504573 states and 534521 transitions. [2019-09-07 19:35:25,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 19:35:25,362 INFO L276 IsEmpty]: Start isEmpty. Operand 504573 states and 534521 transitions. [2019-09-07 19:35:25,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1461 [2019-09-07 19:35:25,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:35:25,557 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:35:25,558 INFO L418 AbstractCegarLoop]: === Iteration 22 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:35:25,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:35:25,558 INFO L82 PathProgramCache]: Analyzing trace with hash 384089525, now seen corresponding path program 1 times [2019-09-07 19:35:25,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:35:25,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:35:25,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:35:25,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:35:25,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:35:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:35:35,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1577 backedges. 554 proven. 917 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-09-07 19:35:35,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:35:35,795 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 19:35:35,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:35:36,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:35:36,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 1880 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 19:35:36,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:35:36,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:35:36,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:35:38,315 WARN L188 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 31 DAG size of output: 17 [2019-09-07 19:35:39,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1577 backedges. 179 proven. 23 refuted. 0 times theorem prover too weak. 1375 trivial. 0 not checked. [2019-09-07 19:35:39,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:35:39,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2019-09-07 19:35:39,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 19:35:39,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 19:35:39,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-09-07 19:35:39,937 INFO L87 Difference]: Start difference. First operand 504573 states and 534521 transitions. Second operand 15 states. [2019-09-07 19:36:13,901 WARN L188 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 28 DAG size of output: 24