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_label18.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 19:28:20,911 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 19:28:20,913 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 19:28:20,930 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 19:28:20,931 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 19:28:20,932 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 19:28:20,933 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 19:28:20,935 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 19:28:20,936 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 19:28:20,937 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 19:28:20,938 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 19:28:20,939 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 19:28:20,940 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 19:28:20,941 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 19:28:20,942 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 19:28:20,943 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 19:28:20,944 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 19:28:20,945 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 19:28:20,946 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 19:28:20,948 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 19:28:20,950 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 19:28:20,951 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 19:28:20,952 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 19:28:20,953 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 19:28:20,955 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 19:28:20,955 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 19:28:20,955 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 19:28:20,956 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 19:28:20,957 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 19:28:20,957 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 19:28:20,958 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 19:28:20,959 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 19:28:20,959 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 19:28:20,960 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 19:28:20,961 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 19:28:20,961 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 19:28:20,962 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 19:28:20,962 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 19:28:20,962 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 19:28:20,963 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 19:28:20,964 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 19:28:20,965 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:28:20,988 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 19:28:20,988 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 19:28:20,989 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 19:28:20,989 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 19:28:20,990 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 19:28:20,990 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 19:28:20,990 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 19:28:20,991 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 19:28:20,992 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 19:28:20,992 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 19:28:20,992 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 19:28:20,992 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 19:28:20,992 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 19:28:20,993 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 19:28:20,993 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 19:28:20,993 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 19:28:20,994 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 19:28:20,995 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 19:28:20,995 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 19:28:20,995 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 19:28:20,995 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 19:28:20,995 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 19:28:20,996 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 19:28:20,996 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 19:28:20,996 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 19:28:20,996 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 19:28:20,996 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 19:28:20,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 19:28:20,997 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 19:28:21,041 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 19:28:21,054 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 19:28:21,057 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 19:28:21,059 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 19:28:21,059 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 19:28:21,060 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label18.c [2019-09-07 19:28:21,120 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33cd3c7f3/01069ae99f0340799dbca7536db6c5e7/FLAG9b950d440 [2019-09-07 19:28:21,920 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 19:28:21,922 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label18.c [2019-09-07 19:28:21,973 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33cd3c7f3/01069ae99f0340799dbca7536db6c5e7/FLAG9b950d440 [2019-09-07 19:28:22,396 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33cd3c7f3/01069ae99f0340799dbca7536db6c5e7 [2019-09-07 19:28:22,411 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 19:28:22,413 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 19:28:22,414 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 19:28:22,414 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 19:28:22,417 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 19:28:22,418 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:28:22" (1/1) ... [2019-09-07 19:28:22,421 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58815698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:28:22, skipping insertion in model container [2019-09-07 19:28:22,421 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:28:22" (1/1) ... [2019-09-07 19:28:22,429 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 19:28:22,586 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 19:28:24,463 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 19:28:24,476 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 19:28:25,253 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 19:28:25,285 INFO L192 MainTranslator]: Completed translation [2019-09-07 19:28:25,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:28:25 WrapperNode [2019-09-07 19:28:25,286 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 19:28:25,287 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 19:28:25,287 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 19:28:25,287 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 19:28:25,301 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:28:25" (1/1) ... [2019-09-07 19:28:25,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:28:25" (1/1) ... [2019-09-07 19:28:25,382 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:28:25" (1/1) ... [2019-09-07 19:28:25,383 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:28:25" (1/1) ... [2019-09-07 19:28:25,509 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:28:25" (1/1) ... [2019-09-07 19:28:25,538 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:28:25" (1/1) ... [2019-09-07 19:28:25,566 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:28:25" (1/1) ... [2019-09-07 19:28:25,596 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 19:28:25,597 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 19:28:25,597 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 19:28:25,597 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 19:28:25,599 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:28:25" (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:28:25,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 19:28:25,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 19:28:25,666 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 19:28:25,666 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 19:28:25,666 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2019-09-07 19:28:25,666 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2019-09-07 19:28:25,666 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 19:28:25,667 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 19:28:25,667 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 19:28:25,667 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2019-09-07 19:28:25,667 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2019-09-07 19:28:25,667 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 19:28:25,668 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 19:28:25,668 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 19:28:25,669 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 19:28:25,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 19:28:25,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 19:28:32,472 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 19:28:32,473 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 19:28:32,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:28:32 BoogieIcfgContainer [2019-09-07 19:28:32,475 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 19:28:32,476 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 19:28:32,477 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 19:28:32,480 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 19:28:32,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 07:28:22" (1/3) ... [2019-09-07 19:28:32,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d28ff95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:28:32, skipping insertion in model container [2019-09-07 19:28:32,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:28:25" (2/3) ... [2019-09-07 19:28:32,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d28ff95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:28:32, skipping insertion in model container [2019-09-07 19:28:32,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:28:32" (3/3) ... [2019-09-07 19:28:32,494 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem13_label18.c [2019-09-07 19:28:32,508 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 19:28:32,520 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 19:28:32,540 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 19:28:32,600 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 19:28:32,601 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 19:28:32,601 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 19:28:32,602 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 19:28:32,602 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 19:28:32,602 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 19:28:32,603 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 19:28:32,603 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 19:28:32,603 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 19:28:32,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states. [2019-09-07 19:28:32,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-07 19:28:32,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:28:32,671 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:28:32,673 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:28:32,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:28:32,680 INFO L82 PathProgramCache]: Analyzing trace with hash 597964976, now seen corresponding path program 1 times [2019-09-07 19:28:32,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:28:32,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:28:32,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:28:32,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:28:32,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:28:32,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:28:33,145 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:28:33,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:28:33,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 19:28:33,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 19:28:33,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 19:28:33,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:28:33,171 INFO L87 Difference]: Start difference. First operand 1119 states. Second operand 3 states. [2019-09-07 19:28:39,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:28:39,780 INFO L93 Difference]: Finished difference Result 3094 states and 5704 transitions. [2019-09-07 19:28:39,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 19:28:39,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-07 19:28:39,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:28:39,840 INFO L225 Difference]: With dead ends: 3094 [2019-09-07 19:28:39,841 INFO L226 Difference]: Without dead ends: 1913 [2019-09-07 19:28:39,859 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:28:39,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1913 states. [2019-09-07 19:28:40,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1913 to 1912. [2019-09-07 19:28:40,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1912 states. [2019-09-07 19:28:40,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1912 states to 1912 states and 3141 transitions. [2019-09-07 19:28:40,083 INFO L78 Accepts]: Start accepts. Automaton has 1912 states and 3141 transitions. Word has length 69 [2019-09-07 19:28:40,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:28:40,084 INFO L475 AbstractCegarLoop]: Abstraction has 1912 states and 3141 transitions. [2019-09-07 19:28:40,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 19:28:40,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 3141 transitions. [2019-09-07 19:28:40,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-07 19:28:40,098 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:28:40,098 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:28:40,099 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:28:40,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:28:40,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1633383061, now seen corresponding path program 1 times [2019-09-07 19:28:40,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:28:40,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:28:40,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:28:40,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:28:40,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:28:40,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:28:40,330 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:28:40,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:28:40,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 19:28:40,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 19:28:40,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 19:28:40,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 19:28:40,334 INFO L87 Difference]: Start difference. First operand 1912 states and 3141 transitions. Second operand 5 states. [2019-09-07 19:28:50,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:28:50,595 INFO L93 Difference]: Finished difference Result 5587 states and 9298 transitions. [2019-09-07 19:28:50,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 19:28:50,597 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-07 19:28:50,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:28:50,625 INFO L225 Difference]: With dead ends: 5587 [2019-09-07 19:28:50,625 INFO L226 Difference]: Without dead ends: 3681 [2019-09-07 19:28:50,633 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:28:50,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3681 states. [2019-09-07 19:28:50,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3681 to 3601. [2019-09-07 19:28:50,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3601 states. [2019-09-07 19:28:50,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3601 states to 3601 states and 5413 transitions. [2019-09-07 19:28:50,784 INFO L78 Accepts]: Start accepts. Automaton has 3601 states and 5413 transitions. Word has length 144 [2019-09-07 19:28:50,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:28:50,786 INFO L475 AbstractCegarLoop]: Abstraction has 3601 states and 5413 transitions. [2019-09-07 19:28:50,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 19:28:50,787 INFO L276 IsEmpty]: Start isEmpty. Operand 3601 states and 5413 transitions. [2019-09-07 19:28:50,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-07 19:28:50,796 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:28:50,796 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:28:50,797 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:28:50,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:28:50,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1407711183, now seen corresponding path program 1 times [2019-09-07 19:28:50,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:28:50,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:28:50,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:28:50,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:28:50,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:28:50,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:28:50,960 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:28:50,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:28:50,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 19:28:50,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 19:28:50,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 19:28:50,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 19:28:50,967 INFO L87 Difference]: Start difference. First operand 3601 states and 5413 transitions. Second operand 5 states. [2019-09-07 19:29:04,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:29:04,135 INFO L93 Difference]: Finished difference Result 10901 states and 16894 transitions. [2019-09-07 19:29:04,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 19:29:04,136 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 158 [2019-09-07 19:29:04,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:29:04,185 INFO L225 Difference]: With dead ends: 10901 [2019-09-07 19:29:04,188 INFO L226 Difference]: Without dead ends: 7306 [2019-09-07 19:29:04,203 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:29:04,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7306 states. [2019-09-07 19:29:04,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7306 to 7121. [2019-09-07 19:29:04,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7121 states. [2019-09-07 19:29:04,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7121 states to 7121 states and 10495 transitions. [2019-09-07 19:29:04,453 INFO L78 Accepts]: Start accepts. Automaton has 7121 states and 10495 transitions. Word has length 158 [2019-09-07 19:29:04,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:29:04,453 INFO L475 AbstractCegarLoop]: Abstraction has 7121 states and 10495 transitions. [2019-09-07 19:29:04,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 19:29:04,454 INFO L276 IsEmpty]: Start isEmpty. Operand 7121 states and 10495 transitions. [2019-09-07 19:29:04,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-07 19:29:04,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:29:04,457 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:29:04,457 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:29:04,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:29:04,458 INFO L82 PathProgramCache]: Analyzing trace with hash 90792917, now seen corresponding path program 1 times [2019-09-07 19:29:04,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:29:04,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:29:04,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:29:04,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:29:04,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:29:04,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:29:04,651 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:29:04,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:29:04,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:29:04,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:29:04,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:29:04,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:29:04,654 INFO L87 Difference]: Start difference. First operand 7121 states and 10495 transitions. Second operand 6 states. [2019-09-07 19:29:12,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:29:12,227 INFO L93 Difference]: Finished difference Result 21450 states and 33769 transitions. [2019-09-07 19:29:12,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:29:12,228 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2019-09-07 19:29:12,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:29:12,319 INFO L225 Difference]: With dead ends: 21450 [2019-09-07 19:29:12,320 INFO L226 Difference]: Without dead ends: 14335 [2019-09-07 19:29:12,345 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:29:12,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14335 states. [2019-09-07 19:29:12,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14335 to 14126. [2019-09-07 19:29:12,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14126 states. [2019-09-07 19:29:12,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14126 states to 14126 states and 21301 transitions. [2019-09-07 19:29:12,757 INFO L78 Accepts]: Start accepts. Automaton has 14126 states and 21301 transitions. Word has length 176 [2019-09-07 19:29:12,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:29:12,758 INFO L475 AbstractCegarLoop]: Abstraction has 14126 states and 21301 transitions. [2019-09-07 19:29:12,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:29:12,758 INFO L276 IsEmpty]: Start isEmpty. Operand 14126 states and 21301 transitions. [2019-09-07 19:29:12,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-07 19:29:12,762 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:29:12,762 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:29:12,763 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:29:12,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:29:12,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1086523758, now seen corresponding path program 1 times [2019-09-07 19:29:12,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:29:12,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:29:12,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:29:12,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:29:12,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:29:12,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:29:12,996 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:29:12,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:29:12,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:29:12,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:29:12,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:29:12,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:29:12,998 INFO L87 Difference]: Start difference. First operand 14126 states and 21301 transitions. Second operand 6 states. [2019-09-07 19:29:20,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:29:20,736 INFO L93 Difference]: Finished difference Result 42171 states and 69935 transitions. [2019-09-07 19:29:20,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:29:20,737 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 187 [2019-09-07 19:29:20,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:29:20,908 INFO L225 Difference]: With dead ends: 42171 [2019-09-07 19:29:20,908 INFO L226 Difference]: Without dead ends: 28051 [2019-09-07 19:29:20,977 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:29:21,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28051 states. [2019-09-07 19:29:22,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28051 to 27931. [2019-09-07 19:29:22,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27931 states. [2019-09-07 19:29:22,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27931 states to 27931 states and 41898 transitions. [2019-09-07 19:29:22,125 INFO L78 Accepts]: Start accepts. Automaton has 27931 states and 41898 transitions. Word has length 187 [2019-09-07 19:29:22,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:29:22,125 INFO L475 AbstractCegarLoop]: Abstraction has 27931 states and 41898 transitions. [2019-09-07 19:29:22,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:29:22,126 INFO L276 IsEmpty]: Start isEmpty. Operand 27931 states and 41898 transitions. [2019-09-07 19:29:22,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-09-07 19:29:22,130 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:29:22,131 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:29:22,131 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:29:22,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:29:22,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1790948799, now seen corresponding path program 1 times [2019-09-07 19:29:22,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:29:22,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:29:22,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:29:22,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:29:22,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:29:22,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:29:22,360 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:29:22,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:29:22,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:29:22,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:29:22,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:29:22,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:29:22,362 INFO L87 Difference]: Start difference. First operand 27931 states and 41898 transitions. Second operand 6 states. [2019-09-07 19:29:30,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:29:30,020 INFO L93 Difference]: Finished difference Result 64050 states and 97298 transitions. [2019-09-07 19:29:30,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:29:30,028 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 215 [2019-09-07 19:29:30,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:29:30,182 INFO L225 Difference]: With dead ends: 64050 [2019-09-07 19:29:30,182 INFO L226 Difference]: Without dead ends: 36125 [2019-09-07 19:29:30,254 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:29:30,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36125 states. [2019-09-07 19:29:31,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36125 to 34426. [2019-09-07 19:29:31,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34426 states. [2019-09-07 19:29:31,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34426 states to 34426 states and 48593 transitions. [2019-09-07 19:29:31,371 INFO L78 Accepts]: Start accepts. Automaton has 34426 states and 48593 transitions. Word has length 215 [2019-09-07 19:29:31,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:29:31,372 INFO L475 AbstractCegarLoop]: Abstraction has 34426 states and 48593 transitions. [2019-09-07 19:29:31,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:29:31,372 INFO L276 IsEmpty]: Start isEmpty. Operand 34426 states and 48593 transitions. [2019-09-07 19:29:31,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-09-07 19:29:31,380 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:29:31,380 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:29:31,380 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:29:31,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:29:31,381 INFO L82 PathProgramCache]: Analyzing trace with hash -98283098, now seen corresponding path program 1 times [2019-09-07 19:29:31,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:29:31,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:29:31,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:29:31,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:29:31,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:29:31,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:29:31,662 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 197 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:29:31,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:29:31,663 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:29:31,688 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:29:31,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:29:31,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 19:29:31,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:29:31,938 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-09-07 19:29:31,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:29:31,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-07 19:29:31,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 19:29:31,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 19:29:31,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 19:29:31,946 INFO L87 Difference]: Start difference. First operand 34426 states and 48593 transitions. Second operand 7 states. [2019-09-07 19:29:49,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:29:49,257 INFO L93 Difference]: Finished difference Result 107910 states and 157326 transitions. [2019-09-07 19:29:49,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 19:29:49,259 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 264 [2019-09-07 19:29:49,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:29:49,628 INFO L225 Difference]: With dead ends: 107910 [2019-09-07 19:29:49,628 INFO L226 Difference]: Without dead ends: 73490 [2019-09-07 19:29:49,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 274 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:29:49,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73490 states. [2019-09-07 19:29:51,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73490 to 65388. [2019-09-07 19:29:51,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65388 states. [2019-09-07 19:29:54,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65388 states to 65388 states and 85895 transitions. [2019-09-07 19:29:54,142 INFO L78 Accepts]: Start accepts. Automaton has 65388 states and 85895 transitions. Word has length 264 [2019-09-07 19:29:54,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:29:54,142 INFO L475 AbstractCegarLoop]: Abstraction has 65388 states and 85895 transitions. [2019-09-07 19:29:54,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 19:29:54,143 INFO L276 IsEmpty]: Start isEmpty. Operand 65388 states and 85895 transitions. [2019-09-07 19:29:54,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-09-07 19:29:54,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:29:54,150 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-07 19:29:54,150 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:29:54,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:29:54,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1978805844, now seen corresponding path program 1 times [2019-09-07 19:29:54,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:29:54,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:29:54,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:29:54,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:29:54,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:29:54,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:29:54,357 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-09-07 19:29:54,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:29:54,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 19:29:54,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 19:29:54,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 19:29:54,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:29:54,360 INFO L87 Difference]: Start difference. First operand 65388 states and 85895 transitions. Second operand 4 states. [2019-09-07 19:30:04,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:30:04,173 INFO L93 Difference]: Finished difference Result 166581 states and 228407 transitions. [2019-09-07 19:30:04,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 19:30:04,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 269 [2019-09-07 19:30:04,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:30:04,668 INFO L225 Difference]: With dead ends: 166581 [2019-09-07 19:30:04,668 INFO L226 Difference]: Without dead ends: 101203 [2019-09-07 19:30:04,823 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:30:04,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101203 states. [2019-09-07 19:30:07,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101203 to 93109. [2019-09-07 19:30:07,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93109 states. [2019-09-07 19:30:07,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93109 states to 93109 states and 125776 transitions. [2019-09-07 19:30:07,508 INFO L78 Accepts]: Start accepts. Automaton has 93109 states and 125776 transitions. Word has length 269 [2019-09-07 19:30:07,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:30:07,509 INFO L475 AbstractCegarLoop]: Abstraction has 93109 states and 125776 transitions. [2019-09-07 19:30:07,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 19:30:07,509 INFO L276 IsEmpty]: Start isEmpty. Operand 93109 states and 125776 transitions. [2019-09-07 19:30:07,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2019-09-07 19:30:07,548 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:30:07,548 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:30:07,549 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:30:07,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:30:07,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1142950920, now seen corresponding path program 1 times [2019-09-07 19:30:07,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:30:07,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:30:07,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:30:07,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:30:07,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:30:07,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:30:07,848 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 266 proven. 78 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-09-07 19:30:07,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:30:07,849 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:30:07,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:30:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:30:07,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:30:08,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:30:08,110 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 395 proven. 2 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-09-07 19:30:08,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:30:08,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:30:08,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:30:08,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:30:08,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:30:08,117 INFO L87 Difference]: Start difference. First operand 93109 states and 125776 transitions. Second operand 9 states. [2019-09-07 19:30:29,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:30:29,247 INFO L93 Difference]: Finished difference Result 278118 states and 447609 transitions. [2019-09-07 19:30:29,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 19:30:29,247 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 386 [2019-09-07 19:30:29,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:30:30,289 INFO L225 Difference]: With dead ends: 278118 [2019-09-07 19:30:30,290 INFO L226 Difference]: Without dead ends: 181663 [2019-09-07 19:30:30,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 393 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:30:30,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181663 states. [2019-09-07 19:30:34,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181663 to 175485. [2019-09-07 19:30:34,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175485 states. [2019-09-07 19:30:40,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175485 states to 175485 states and 272664 transitions. [2019-09-07 19:30:40,552 INFO L78 Accepts]: Start accepts. Automaton has 175485 states and 272664 transitions. Word has length 386 [2019-09-07 19:30:40,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:30:40,553 INFO L475 AbstractCegarLoop]: Abstraction has 175485 states and 272664 transitions. [2019-09-07 19:30:40,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:30:40,553 INFO L276 IsEmpty]: Start isEmpty. Operand 175485 states and 272664 transitions. [2019-09-07 19:30:40,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2019-09-07 19:30:40,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:30:40,612 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 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:30:40,612 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:30:40,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:30:40,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1347615768, now seen corresponding path program 1 times [2019-09-07 19:30:40,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:30:40,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:30:40,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:30:40,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:30:40,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:30:40,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:30:40,980 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 394 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-07 19:30:40,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:30:40,980 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:30:40,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:30:41,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:30:41,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:30:41,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:30:41,225 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 394 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-07 19:30:41,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:30:41,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:30:41,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:30:41,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:30:41,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:30:41,235 INFO L87 Difference]: Start difference. First operand 175485 states and 272664 transitions. Second operand 9 states. [2019-09-07 19:31:08,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:31:08,848 INFO L93 Difference]: Finished difference Result 421592 states and 853305 transitions. [2019-09-07 19:31:08,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 19:31:08,849 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 430 [2019-09-07 19:31:08,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:31:10,788 INFO L225 Difference]: With dead ends: 421592 [2019-09-07 19:31:10,789 INFO L226 Difference]: Without dead ends: 242720 [2019-09-07 19:31:11,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 443 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2019-09-07 19:31:11,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242720 states. [2019-09-07 19:31:23,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242720 to 237448. [2019-09-07 19:31:23,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237448 states. [2019-09-07 19:31:32,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237448 states to 237448 states and 433879 transitions. [2019-09-07 19:31:32,420 INFO L78 Accepts]: Start accepts. Automaton has 237448 states and 433879 transitions. Word has length 430 [2019-09-07 19:31:32,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:31:32,420 INFO L475 AbstractCegarLoop]: Abstraction has 237448 states and 433879 transitions. [2019-09-07 19:31:32,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:31:32,421 INFO L276 IsEmpty]: Start isEmpty. Operand 237448 states and 433879 transitions. [2019-09-07 19:31:32,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 728 [2019-09-07 19:31:32,931 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:31:32,931 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:31:32,932 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:31:32,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:31:32,932 INFO L82 PathProgramCache]: Analyzing trace with hash -583940077, now seen corresponding path program 1 times [2019-09-07 19:31:32,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:31:32,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:31:32,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:31:32,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:31:32,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:31:33,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:31:33,562 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 422 proven. 284 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-09-07 19:31:33,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:31:33,562 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:31:33,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:31:33,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:31:33,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 1067 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:31:33,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:31:38,876 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 668 proven. 2 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-09-07 19:31:38,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:31:38,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:31:38,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:31:38,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:31:38,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:31:38,883 INFO L87 Difference]: Start difference. First operand 237448 states and 433879 transitions. Second operand 9 states. [2019-09-07 19:31:54,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:31:54,705 INFO L93 Difference]: Finished difference Result 442608 states and 755443 transitions. [2019-09-07 19:31:54,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 19:31:54,706 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 727 [2019-09-07 19:31:54,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:31:55,387 INFO L225 Difference]: With dead ends: 442608 [2019-09-07 19:31:55,387 INFO L226 Difference]: Without dead ends: 204258 [2019-09-07 19:31:55,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 752 GetRequests, 736 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-07 19:31:56,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204258 states. [2019-09-07 19:31:59,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204258 to 201954. [2019-09-07 19:31:59,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201954 states. [2019-09-07 19:32:01,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201954 states to 201954 states and 258954 transitions. [2019-09-07 19:32:01,105 INFO L78 Accepts]: Start accepts. Automaton has 201954 states and 258954 transitions. Word has length 727 [2019-09-07 19:32:01,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:32:01,106 INFO L475 AbstractCegarLoop]: Abstraction has 201954 states and 258954 transitions. [2019-09-07 19:32:01,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:32:01,106 INFO L276 IsEmpty]: Start isEmpty. Operand 201954 states and 258954 transitions. [2019-09-07 19:32:01,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 952 [2019-09-07 19:32:01,317 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:32:01,318 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01,318 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:32:01,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:32:01,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1534062016, now seen corresponding path program 1 times [2019-09-07 19:32:01,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:32:01,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:32:01,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:32:01,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:32:01,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:32:01,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:32:03,981 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 450 proven. 133 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2019-09-07 19:32:03,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:32:03,982 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 19:32:04,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:32:04,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:32:04,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 1316 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 19:32:04,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:32:04,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:32:09,027 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 599 proven. 2 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2019-09-07 19:32:09,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:32:09,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-09-07 19:32:09,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 19:32:09,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 19:32:09,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-09-07 19:32:09,037 INFO L87 Difference]: Start difference. First operand 201954 states and 258954 transitions. Second operand 13 states. [2019-09-07 19:33:18,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:33:18,215 INFO L93 Difference]: Finished difference Result 615535 states and 836845 transitions. [2019-09-07 19:33:18,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-09-07 19:33:18,215 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 951 [2019-09-07 19:33:18,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:33:19,831 INFO L225 Difference]: With dead ends: 615535 [2019-09-07 19:33:19,831 INFO L226 Difference]: Without dead ends: 414390 [2019-09-07 19:33:20,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1116 GetRequests, 1023 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3246 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1204, Invalid=7726, Unknown=0, NotChecked=0, Total=8930 [2019-09-07 19:33:20,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414390 states. [2019-09-07 19:33:29,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414390 to 384288. [2019-09-07 19:33:29,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384288 states. [2019-09-07 19:33:38,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384288 states to 384288 states and 466280 transitions. [2019-09-07 19:33:38,453 INFO L78 Accepts]: Start accepts. Automaton has 384288 states and 466280 transitions. Word has length 951 [2019-09-07 19:33:38,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:33:38,454 INFO L475 AbstractCegarLoop]: Abstraction has 384288 states and 466280 transitions. [2019-09-07 19:33:38,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 19:33:38,454 INFO L276 IsEmpty]: Start isEmpty. Operand 384288 states and 466280 transitions. [2019-09-07 19:33:38,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 955 [2019-09-07 19:33:38,712 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:33:38,713 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:33:38,713 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:33:38,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:33:38,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1399016963, now seen corresponding path program 1 times [2019-09-07 19:33:38,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:33:38,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:33:38,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:33:38,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:33:38,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:33:38,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:33:40,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 851 trivial. 0 not checked. [2019-09-07 19:33:40,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:33:40,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 19:33:40,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 19:33:40,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 19:33:40,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:33:40,045 INFO L87 Difference]: Start difference. First operand 384288 states and 466280 transitions. Second operand 4 states. [2019-09-07 19:34:00,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:34:00,080 INFO L93 Difference]: Finished difference Result 848987 states and 1031431 transitions. [2019-09-07 19:34:00,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 19:34:00,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 954 [2019-09-07 19:34:00,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:34:01,409 INFO L225 Difference]: With dead ends: 848987 [2019-09-07 19:34:01,410 INFO L226 Difference]: Without dead ends: 466329 [2019-09-07 19:34:01,854 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:34:02,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466329 states. [2019-09-07 19:34:08,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466329 to 441891. [2019-09-07 19:34:08,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441891 states. [2019-09-07 19:34:09,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441891 states to 441891 states and 537865 transitions. [2019-09-07 19:34:09,932 INFO L78 Accepts]: Start accepts. Automaton has 441891 states and 537865 transitions. Word has length 954 [2019-09-07 19:34:09,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:34:09,933 INFO L475 AbstractCegarLoop]: Abstraction has 441891 states and 537865 transitions. [2019-09-07 19:34:09,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 19:34:09,933 INFO L276 IsEmpty]: Start isEmpty. Operand 441891 states and 537865 transitions. [2019-09-07 19:34:12,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1453 [2019-09-07 19:34:12,118 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:34:12,119 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,119 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:34:12,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:34:12,120 INFO L82 PathProgramCache]: Analyzing trace with hash -423900654, now seen corresponding path program 1 times [2019-09-07 19:34:12,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:34:12,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:34:12,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:34:12,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:34:12,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:34:12,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:34:20,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3456 backedges. 949 proven. 333 refuted. 0 times theorem prover too weak. 2174 trivial. 0 not checked. [2019-09-07 19:34:20,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:34:20,413 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:34:20,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:34:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:34:20,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 2054 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:34:20,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:34:21,932 INFO L134 CoverageAnalysis]: Checked inductivity of 3456 backedges. 2231 proven. 2 refuted. 0 times theorem prover too weak. 1223 trivial. 0 not checked. [2019-09-07 19:34:21,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:34:21,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:34:21,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:34:21,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:34:21,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:34:21,940 INFO L87 Difference]: Start difference. First operand 441891 states and 537865 transitions. Second operand 9 states. [2019-09-07 19:34:34,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:34:34,094 INFO L93 Difference]: Finished difference Result 844045 states and 1021363 transitions. [2019-09-07 19:34:34,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 19:34:34,095 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1452 [2019-09-07 19:34:34,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:34:36,165 INFO L225 Difference]: With dead ends: 844045 [2019-09-07 19:34:36,165 INFO L226 Difference]: Without dead ends: 403784 [2019-09-07 19:34:36,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1475 GetRequests, 1459 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2019-09-07 19:34:36,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403784 states. [2019-09-07 19:34:47,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403784 to 389871. [2019-09-07 19:34:47,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389871 states. [2019-09-07 19:34:49,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389871 states to 389871 states and 443952 transitions. [2019-09-07 19:34:49,484 INFO L78 Accepts]: Start accepts. Automaton has 389871 states and 443952 transitions. Word has length 1452 [2019-09-07 19:34:49,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:34:49,485 INFO L475 AbstractCegarLoop]: Abstraction has 389871 states and 443952 transitions. [2019-09-07 19:34:49,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:34:49,485 INFO L276 IsEmpty]: Start isEmpty. Operand 389871 states and 443952 transitions. [2019-09-07 19:34:49,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1212 [2019-09-07 19:34:49,781 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:34:49,782 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, 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, 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, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,782 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:34:49,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:34:49,782 INFO L82 PathProgramCache]: Analyzing trace with hash -810191564, now seen corresponding path program 1 times [2019-09-07 19:34:49,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:34:49,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:34:49,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:34:49,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:34:49,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:34:49,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:34:53,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1647 backedges. 645 proven. 207 refuted. 0 times theorem prover too weak. 795 trivial. 0 not checked. [2019-09-07 19:34:53,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:34:53,256 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:34:53,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:34:53,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:34:53,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 1674 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 19:34:53,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:34:59,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1647 backedges. 1194 proven. 2 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2019-09-07 19:34:59,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:34:59,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2019-09-07 19:34:59,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:34:59,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:34:59,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:34:59,094 INFO L87 Difference]: Start difference. First operand 389871 states and 443952 transitions. Second operand 6 states. [2019-09-07 19:35:13,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:35:13,928 INFO L93 Difference]: Finished difference Result 906307 states and 1027617 transitions. [2019-09-07 19:35:13,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 19:35:13,929 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1211 [2019-09-07 19:35:13,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:35:15,936 INFO L225 Difference]: With dead ends: 906307 [2019-09-07 19:35:15,936 INFO L226 Difference]: Without dead ends: 515616 [2019-09-07 19:35:16,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1222 GetRequests, 1215 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:35:16,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515616 states. [2019-09-07 19:35:29,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515616 to 479435. [2019-09-07 19:35:29,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479435 states. [2019-09-07 19:35:30,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479435 states to 479435 states and 524580 transitions. [2019-09-07 19:35:30,357 INFO L78 Accepts]: Start accepts. Automaton has 479435 states and 524580 transitions. Word has length 1211 [2019-09-07 19:35:30,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:35:30,358 INFO L475 AbstractCegarLoop]: Abstraction has 479435 states and 524580 transitions. [2019-09-07 19:35:30,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:35:30,358 INFO L276 IsEmpty]: Start isEmpty. Operand 479435 states and 524580 transitions. [2019-09-07 19:35:30,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1226 [2019-09-07 19:35:30,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:35:30,668 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, 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, 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, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,668 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:35:30,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:35:30,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1270797191, now seen corresponding path program 1 times [2019-09-07 19:35:30,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:35:30,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:35:30,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:35:30,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:35:30,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:35:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:35:37,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1645 backedges. 740 proven. 104 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2019-09-07 19:35:37,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:35:37,699 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:35:37,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:35:38,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:35:38,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 1687 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:35:38,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:35:38,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1645 backedges. 1129 proven. 2 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2019-09-07 19:35:38,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:35:38,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-07 19:35:38,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:35:38,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:35:38,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:35:38,786 INFO L87 Difference]: Start difference. First operand 479435 states and 524580 transitions. Second operand 6 states. [2019-09-07 19:35:51,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:35:51,439 INFO L93 Difference]: Finished difference Result 966768 states and 1060141 transitions. [2019-09-07 19:35:51,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 19:35:51,439 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1225 [2019-09-07 19:35:51,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:35:52,673 INFO L225 Difference]: With dead ends: 966768 [2019-09-07 19:35:52,673 INFO L226 Difference]: Without dead ends: 492201 [2019-09-07 19:35:52,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1239 GetRequests, 1230 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-09-07 19:35:53,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492201 states. [2019-09-07 19:36:02,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492201 to 485410. [2019-09-07 19:36:02,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485410 states. [2019-09-07 19:36:14,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485410 states to 485410 states and 522258 transitions. [2019-09-07 19:36:14,830 INFO L78 Accepts]: Start accepts. Automaton has 485410 states and 522258 transitions. Word has length 1225 [2019-09-07 19:36:14,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:36:14,831 INFO L475 AbstractCegarLoop]: Abstraction has 485410 states and 522258 transitions. [2019-09-07 19:36:14,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:36:14,831 INFO L276 IsEmpty]: Start isEmpty. Operand 485410 states and 522258 transitions. [2019-09-07 19:36:15,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1505 [2019-09-07 19:36:15,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:36:15,207 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:15,207 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:36:15,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:36:15,209 INFO L82 PathProgramCache]: Analyzing trace with hash -723588466, now seen corresponding path program 1 times [2019-09-07 19:36:15,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:36:15,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:36:15,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:36:15,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:36:15,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:36:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:36:17,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2310 backedges. 455 proven. 1069 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-09-07 19:36:17,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:36:17,537 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:36:17,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:36:17,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:36:17,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 1960 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 19:36:17,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:36:17,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:36:19,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2310 backedges. 1286 proven. 2 refuted. 0 times theorem prover too weak. 1022 trivial. 0 not checked. [2019-09-07 19:36:19,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:36:19,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-09-07 19:36:19,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 19:36:19,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 19:36:19,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-09-07 19:36:19,124 INFO L87 Difference]: Start difference. First operand 485410 states and 522258 transitions. Second operand 16 states. [2019-09-07 19:37:00,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:37:00,347 INFO L93 Difference]: Finished difference Result 909277 states and 977873 transitions. [2019-09-07 19:37:00,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-07 19:37:00,352 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 1504 [2019-09-07 19:37:00,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:37:01,469 INFO L225 Difference]: With dead ends: 909277 [2019-09-07 19:37:01,469 INFO L226 Difference]: Without dead ends: 535995 [2019-09-07 19:37:01,703 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1693 GetRequests, 1583 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4684 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1752, Invalid=10458, Unknown=0, NotChecked=0, Total=12210 [2019-09-07 19:37:02,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535995 states. [2019-09-07 19:37:09,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535995 to 509870. [2019-09-07 19:37:09,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509870 states. [2019-09-07 19:37:21,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509870 states to 509870 states and 545051 transitions. [2019-09-07 19:37:21,013 INFO L78 Accepts]: Start accepts. Automaton has 509870 states and 545051 transitions. Word has length 1504 [2019-09-07 19:37:21,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:37:21,014 INFO L475 AbstractCegarLoop]: Abstraction has 509870 states and 545051 transitions. [2019-09-07 19:37:21,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 19:37:21,014 INFO L276 IsEmpty]: Start isEmpty. Operand 509870 states and 545051 transitions. [2019-09-07 19:37:21,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1566 [2019-09-07 19:37:21,333 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:37:21,334 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:37:21,334 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:37:21,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:37:21,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1529806894, now seen corresponding path program 1 times [2019-09-07 19:37:21,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:37:21,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:37:21,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:37:21,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:37:21,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:37:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:37:23,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1712 backedges. 469 proven. 143 refuted. 0 times theorem prover too weak. 1100 trivial. 0 not checked. [2019-09-07 19:37:23,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:37:23,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 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:37:23,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:37:23,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:37:23,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 1996 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 19:37:23,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:37:23,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:37:24,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1712 backedges. 408 proven. 0 refuted. 0 times theorem prover too weak. 1304 trivial. 0 not checked. [2019-09-07 19:37:24,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:37:24,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 19:37:24,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:37:24,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:37:24,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:37:24,974 INFO L87 Difference]: Start difference. First operand 509870 states and 545051 transitions. Second operand 9 states. [2019-09-07 19:37:44,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:37:44,382 INFO L93 Difference]: Finished difference Result 1063524 states and 1137005 transitions. [2019-09-07 19:37:44,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-07 19:37:44,383 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1565 [2019-09-07 19:37:44,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:37:45,624 INFO L225 Difference]: With dead ends: 1063524 [2019-09-07 19:37:45,625 INFO L226 Difference]: Without dead ends: 539575 [2019-09-07 19:37:46,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1625 GetRequests, 1589 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=256, Invalid=1150, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 19:37:47,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539575 states. [2019-09-07 19:37:55,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539575 to 512910. [2019-09-07 19:37:55,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512910 states. [2019-09-07 19:38:08,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512910 states to 512910 states and 543508 transitions. [2019-09-07 19:38:08,727 INFO L78 Accepts]: Start accepts. Automaton has 512910 states and 543508 transitions. Word has length 1565 [2019-09-07 19:38:08,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:38:08,728 INFO L475 AbstractCegarLoop]: Abstraction has 512910 states and 543508 transitions. [2019-09-07 19:38:08,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:38:08,728 INFO L276 IsEmpty]: Start isEmpty. Operand 512910 states and 543508 transitions. [2019-09-07 19:38:09,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1964 [2019-09-07 19:38:09,055 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:38:09,056 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:38:09,056 INFO L418 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:38:09,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:38:09,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1443225772, now seen corresponding path program 1 times [2019-09-07 19:38:09,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:38:09,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:38:09,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:38:09,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:38:09,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:38:09,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:38:12,921 INFO L134 CoverageAnalysis]: Checked inductivity of 4090 backedges. 762 proven. 2180 refuted. 0 times theorem prover too weak. 1148 trivial. 0 not checked. [2019-09-07 19:38:12,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:38:12,922 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:38:12,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:38:13,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:38:13,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 2543 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 19:38:13,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:38:13,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:38:15,474 INFO L134 CoverageAnalysis]: Checked inductivity of 4090 backedges. 2777 proven. 2 refuted. 0 times theorem prover too weak. 1311 trivial. 0 not checked. [2019-09-07 19:38:15,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:38:15,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5] total 17 [2019-09-07 19:38:15,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 19:38:15,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 19:38:15,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-09-07 19:38:15,483 INFO L87 Difference]: Start difference. First operand 512910 states and 543508 transitions. Second operand 17 states. [2019-09-07 19:39:08,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:39:08,515 INFO L93 Difference]: Finished difference Result 1061147 states and 1126193 transitions. [2019-09-07 19:39:08,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2019-09-07 19:39:08,515 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 1963 [2019-09-07 19:39:08,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted.