java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem17_label20.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 21:37:13,596 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 21:37:13,598 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 21:37:13,610 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 21:37:13,611 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 21:37:13,612 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 21:37:13,613 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 21:37:13,615 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 21:37:13,617 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 21:37:13,618 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 21:37:13,619 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 21:37:13,620 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 21:37:13,621 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 21:37:13,621 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 21:37:13,622 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 21:37:13,624 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 21:37:13,625 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 21:37:13,625 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 21:37:13,627 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 21:37:13,629 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 21:37:13,631 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 21:37:13,632 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 21:37:13,633 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 21:37:13,633 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 21:37:13,636 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 21:37:13,636 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 21:37:13,636 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 21:37:13,637 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 21:37:13,638 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 21:37:13,639 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 21:37:13,639 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 21:37:13,640 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 21:37:13,640 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 21:37:13,641 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 21:37:13,643 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 21:37:13,643 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 21:37:13,644 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 21:37:13,644 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 21:37:13,644 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 21:37:13,645 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 21:37:13,646 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 21:37:13,647 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 21:37:13,661 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 21:37:13,661 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 21:37:13,662 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 21:37:13,662 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 21:37:13,663 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 21:37:13,663 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 21:37:13,663 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 21:37:13,663 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 21:37:13,664 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 21:37:13,664 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 21:37:13,664 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 21:37:13,664 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 21:37:13,664 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 21:37:13,664 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 21:37:13,665 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 21:37:13,665 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 21:37:13,665 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 21:37:13,665 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 21:37:13,665 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 21:37:13,666 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 21:37:13,666 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 21:37:13,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 21:37:13,666 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 21:37:13,667 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 21:37:13,667 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 21:37:13,667 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 21:37:13,667 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 21:37:13,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 21:37:13,668 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 21:37:13,697 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 21:37:13,711 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 21:37:13,715 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 21:37:13,717 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 21:37:13,718 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 21:37:13,718 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label20.c [2019-09-07 21:37:13,782 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7519c968/1d9a686c75d74e999adb7fdde2cf9353/FLAG718adf668 [2019-09-07 21:37:14,535 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 21:37:14,536 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label20.c [2019-09-07 21:37:14,561 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7519c968/1d9a686c75d74e999adb7fdde2cf9353/FLAG718adf668 [2019-09-07 21:37:14,684 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7519c968/1d9a686c75d74e999adb7fdde2cf9353 [2019-09-07 21:37:14,697 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 21:37:14,699 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 21:37:14,702 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 21:37:14,703 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 21:37:14,706 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 21:37:14,708 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 09:37:14" (1/1) ... [2019-09-07 21:37:14,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a070ca5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:37:14, skipping insertion in model container [2019-09-07 21:37:14,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 09:37:14" (1/1) ... [2019-09-07 21:37:14,719 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 21:37:14,833 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 21:37:16,143 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 21:37:16,162 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 21:37:16,646 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 21:37:16,676 INFO L192 MainTranslator]: Completed translation [2019-09-07 21:37:16,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:37:16 WrapperNode [2019-09-07 21:37:16,677 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 21:37:16,678 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 21:37:16,678 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 21:37:16,678 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 21:37:16,697 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:37:16" (1/1) ... [2019-09-07 21:37:16,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:37:16" (1/1) ... [2019-09-07 21:37:16,754 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:37:16" (1/1) ... [2019-09-07 21:37:16,756 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:37:16" (1/1) ... [2019-09-07 21:37:16,873 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:37:16" (1/1) ... [2019-09-07 21:37:16,906 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:37:16" (1/1) ... [2019-09-07 21:37:16,923 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:37:16" (1/1) ... [2019-09-07 21:37:16,941 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 21:37:16,942 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 21:37:16,942 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 21:37:16,942 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 21:37:16,944 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:37:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 21:37:17,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 21:37:17,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 21:37:17,009 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 21:37:17,009 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 21:37:17,009 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 21:37:17,009 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 21:37:17,009 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 21:37:17,010 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 21:37:17,010 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 21:37:17,010 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 21:37:17,010 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 21:37:17,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 21:37:17,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 21:37:21,244 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 21:37:21,245 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 21:37:21,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 09:37:21 BoogieIcfgContainer [2019-09-07 21:37:21,247 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 21:37:21,249 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 21:37:21,249 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 21:37:21,253 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 21:37:21,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 09:37:14" (1/3) ... [2019-09-07 21:37:21,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dbb0af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 09:37:21, skipping insertion in model container [2019-09-07 21:37:21,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:37:16" (2/3) ... [2019-09-07 21:37:21,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dbb0af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 09:37:21, skipping insertion in model container [2019-09-07 21:37:21,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 09:37:21" (3/3) ... [2019-09-07 21:37:21,266 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem17_label20.c [2019-09-07 21:37:21,277 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 21:37:21,288 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 21:37:21,308 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 21:37:21,367 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 21:37:21,368 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 21:37:21,368 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 21:37:21,368 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 21:37:21,368 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 21:37:21,369 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 21:37:21,369 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 21:37:21,369 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 21:37:21,369 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 21:37:21,410 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states. [2019-09-07 21:37:21,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-07 21:37:21,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:37:21,419 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] [2019-09-07 21:37:21,421 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:37:21,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:37:21,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1354524993, now seen corresponding path program 1 times [2019-09-07 21:37:21,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:37:21,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:37:21,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:37:21,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:37:21,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:37:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:37:21,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:37:21,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:37:21,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 21:37:21,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 21:37:21,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 21:37:21,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 21:37:21,852 INFO L87 Difference]: Start difference. First operand 603 states. Second operand 4 states. [2019-09-07 21:37:28,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:37:28,715 INFO L93 Difference]: Finished difference Result 2133 states and 3962 transitions. [2019-09-07 21:37:28,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 21:37:28,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-09-07 21:37:28,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:37:28,760 INFO L225 Difference]: With dead ends: 2133 [2019-09-07 21:37:28,761 INFO L226 Difference]: Without dead ends: 1451 [2019-09-07 21:37:28,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 21:37:28,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2019-09-07 21:37:28,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1437. [2019-09-07 21:37:28,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1437 states. [2019-09-07 21:37:28,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 2166 transitions. [2019-09-07 21:37:28,973 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 2166 transitions. Word has length 32 [2019-09-07 21:37:28,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:37:28,974 INFO L475 AbstractCegarLoop]: Abstraction has 1437 states and 2166 transitions. [2019-09-07 21:37:28,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 21:37:28,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 2166 transitions. [2019-09-07 21:37:28,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-07 21:37:28,979 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:37:28,979 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:37:28,980 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:37:28,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:37:28,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1522428140, now seen corresponding path program 1 times [2019-09-07 21:37:28,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:37:28,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:37:28,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:37:28,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:37:28,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:37:29,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:37:29,142 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:37:29,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:37:29,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 21:37:29,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 21:37:29,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 21:37:29,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 21:37:29,150 INFO L87 Difference]: Start difference. First operand 1437 states and 2166 transitions. Second operand 5 states. [2019-09-07 21:37:33,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:37:33,881 INFO L93 Difference]: Finished difference Result 4255 states and 6536 transitions. [2019-09-07 21:37:33,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 21:37:33,882 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-07 21:37:33,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:37:33,909 INFO L225 Difference]: With dead ends: 4255 [2019-09-07 21:37:33,909 INFO L226 Difference]: Without dead ends: 2824 [2019-09-07 21:37:33,915 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 21:37:33,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2824 states. [2019-09-07 21:37:33,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2824 to 2794. [2019-09-07 21:37:33,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2794 states. [2019-09-07 21:37:33,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2794 states to 2794 states and 3921 transitions. [2019-09-07 21:37:33,996 INFO L78 Accepts]: Start accepts. Automaton has 2794 states and 3921 transitions. Word has length 103 [2019-09-07 21:37:33,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:37:33,997 INFO L475 AbstractCegarLoop]: Abstraction has 2794 states and 3921 transitions. [2019-09-07 21:37:33,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 21:37:33,997 INFO L276 IsEmpty]: Start isEmpty. Operand 2794 states and 3921 transitions. [2019-09-07 21:37:33,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-07 21:37:33,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:37:34,000 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:37:34,000 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:37:34,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:37:34,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1448831800, now seen corresponding path program 1 times [2019-09-07 21:37:34,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:37:34,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:37:34,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:37:34,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:37:34,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:37:34,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:37:34,126 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:37:34,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:37:34,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 21:37:34,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 21:37:34,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 21:37:34,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 21:37:34,129 INFO L87 Difference]: Start difference. First operand 2794 states and 3921 transitions. Second operand 3 states. [2019-09-07 21:37:38,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:37:38,441 INFO L93 Difference]: Finished difference Result 6471 states and 9371 transitions. [2019-09-07 21:37:38,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 21:37:38,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-07 21:37:38,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:37:38,463 INFO L225 Difference]: With dead ends: 6471 [2019-09-07 21:37:38,463 INFO L226 Difference]: Without dead ends: 3683 [2019-09-07 21:37:38,471 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 21:37:38,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3683 states. [2019-09-07 21:37:38,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3683 to 3681. [2019-09-07 21:37:38,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3681 states. [2019-09-07 21:37:38,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3681 states to 3681 states and 5053 transitions. [2019-09-07 21:37:38,569 INFO L78 Accepts]: Start accepts. Automaton has 3681 states and 5053 transitions. Word has length 106 [2019-09-07 21:37:38,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:37:38,570 INFO L475 AbstractCegarLoop]: Abstraction has 3681 states and 5053 transitions. [2019-09-07 21:37:38,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 21:37:38,570 INFO L276 IsEmpty]: Start isEmpty. Operand 3681 states and 5053 transitions. [2019-09-07 21:37:38,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-07 21:37:38,581 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:37:38,582 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:37:38,582 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:37:38,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:37:38,582 INFO L82 PathProgramCache]: Analyzing trace with hash -179939417, now seen corresponding path program 1 times [2019-09-07 21:37:38,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:37:38,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:37:38,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:37:38,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:37:38,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:37:38,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:37:38,946 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:37:38,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:37:38,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 21:37:38,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 21:37:38,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 21:37:38,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 21:37:38,952 INFO L87 Difference]: Start difference. First operand 3681 states and 5053 transitions. Second operand 6 states. [2019-09-07 21:37:43,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:37:43,235 INFO L93 Difference]: Finished difference Result 9202 states and 12685 transitions. [2019-09-07 21:37:43,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 21:37:43,236 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 186 [2019-09-07 21:37:43,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:37:43,266 INFO L225 Difference]: With dead ends: 9202 [2019-09-07 21:37:43,266 INFO L226 Difference]: Without dead ends: 5527 [2019-09-07 21:37:43,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:37:43,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5527 states. [2019-09-07 21:37:43,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5527 to 5054. [2019-09-07 21:37:43,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5054 states. [2019-09-07 21:37:43,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5054 states to 5054 states and 6165 transitions. [2019-09-07 21:37:43,419 INFO L78 Accepts]: Start accepts. Automaton has 5054 states and 6165 transitions. Word has length 186 [2019-09-07 21:37:43,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:37:43,421 INFO L475 AbstractCegarLoop]: Abstraction has 5054 states and 6165 transitions. [2019-09-07 21:37:43,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 21:37:43,421 INFO L276 IsEmpty]: Start isEmpty. Operand 5054 states and 6165 transitions. [2019-09-07 21:37:43,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-07 21:37:43,426 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:37:43,427 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 21:37:43,427 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:37:43,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:37:43,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1944797959, now seen corresponding path program 1 times [2019-09-07 21:37:43,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:37:43,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:37:43,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:37:43,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:37:43,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:37:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:37:43,568 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-09-07 21:37:43,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:37:43,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 21:37:43,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 21:37:43,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 21:37:43,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 21:37:43,570 INFO L87 Difference]: Start difference. First operand 5054 states and 6165 transitions. Second operand 4 states. [2019-09-07 21:37:51,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:37:51,064 INFO L93 Difference]: Finished difference Result 18469 states and 23083 transitions. [2019-09-07 21:37:51,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 21:37:51,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2019-09-07 21:37:51,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:37:51,134 INFO L225 Difference]: With dead ends: 18469 [2019-09-07 21:37:51,134 INFO L226 Difference]: Without dead ends: 13421 [2019-09-07 21:37:51,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 21:37:51,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13421 states. [2019-09-07 21:37:51,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13421 to 11678. [2019-09-07 21:37:51,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11678 states. [2019-09-07 21:37:51,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11678 states to 11678 states and 13961 transitions. [2019-09-07 21:37:51,425 INFO L78 Accepts]: Start accepts. Automaton has 11678 states and 13961 transitions. Word has length 194 [2019-09-07 21:37:51,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:37:51,426 INFO L475 AbstractCegarLoop]: Abstraction has 11678 states and 13961 transitions. [2019-09-07 21:37:51,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 21:37:51,426 INFO L276 IsEmpty]: Start isEmpty. Operand 11678 states and 13961 transitions. [2019-09-07 21:37:51,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-07 21:37:51,433 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:37:51,434 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 21:37:51,434 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:37:51,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:37:51,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1960120748, now seen corresponding path program 1 times [2019-09-07 21:37:51,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:37:51,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:37:51,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:37:51,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:37:51,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:37:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:37:51,772 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 102 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:37:51,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:37:51,773 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:37:51,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:37:51,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:37:51,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 21:37:51,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:37:52,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:37:52,102 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-07 21:37:52,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 21:37:52,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2019-09-07 21:37:52,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 21:37:52,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 21:37:52,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-07 21:37:52,117 INFO L87 Difference]: Start difference. First operand 11678 states and 13961 transitions. Second operand 10 states. [2019-09-07 21:38:13,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:38:13,663 INFO L93 Difference]: Finished difference Result 53377 states and 66102 transitions. [2019-09-07 21:38:13,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-07 21:38:13,665 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 217 [2019-09-07 21:38:13,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:38:13,892 INFO L225 Difference]: With dead ends: 53377 [2019-09-07 21:38:13,892 INFO L226 Difference]: Without dead ends: 41270 [2019-09-07 21:38:13,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=421, Invalid=1835, Unknown=0, NotChecked=0, Total=2256 [2019-09-07 21:38:13,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41270 states. [2019-09-07 21:38:14,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41270 to 35951. [2019-09-07 21:38:14,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35951 states. [2019-09-07 21:38:14,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35951 states to 35951 states and 43951 transitions. [2019-09-07 21:38:14,867 INFO L78 Accepts]: Start accepts. Automaton has 35951 states and 43951 transitions. Word has length 217 [2019-09-07 21:38:14,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:38:14,870 INFO L475 AbstractCegarLoop]: Abstraction has 35951 states and 43951 transitions. [2019-09-07 21:38:14,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 21:38:14,870 INFO L276 IsEmpty]: Start isEmpty. Operand 35951 states and 43951 transitions. [2019-09-07 21:38:14,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-09-07 21:38:14,877 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:38:14,880 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 21:38:14,881 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:38:14,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:38:14,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1079860778, now seen corresponding path program 1 times [2019-09-07 21:38:14,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:38:14,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:38:14,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:38:14,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:38:14,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:38:14,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:38:15,259 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 99 proven. 32 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-07 21:38:15,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:38:15,260 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 21:38:15,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:38:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:38:16,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:38:16,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:38:16,341 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-07 21:38:16,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 21:38:16,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2019-09-07 21:38:16,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 21:38:16,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 21:38:16,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-07 21:38:16,357 INFO L87 Difference]: Start difference. First operand 35951 states and 43951 transitions. Second operand 8 states. [2019-09-07 21:38:22,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:38:22,692 INFO L93 Difference]: Finished difference Result 72100 states and 89718 transitions. [2019-09-07 21:38:22,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 21:38:22,693 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 271 [2019-09-07 21:38:22,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:38:22,826 INFO L225 Difference]: With dead ends: 72100 [2019-09-07 21:38:22,826 INFO L226 Difference]: Without dead ends: 36155 [2019-09-07 21:38:22,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-09-07 21:38:22,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36155 states. [2019-09-07 21:38:23,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36155 to 35075. [2019-09-07 21:38:23,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35075 states. [2019-09-07 21:38:23,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35075 states to 35075 states and 42581 transitions. [2019-09-07 21:38:23,637 INFO L78 Accepts]: Start accepts. Automaton has 35075 states and 42581 transitions. Word has length 271 [2019-09-07 21:38:23,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:38:23,638 INFO L475 AbstractCegarLoop]: Abstraction has 35075 states and 42581 transitions. [2019-09-07 21:38:23,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 21:38:23,638 INFO L276 IsEmpty]: Start isEmpty. Operand 35075 states and 42581 transitions. [2019-09-07 21:38:23,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2019-09-07 21:38:23,656 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:38:23,656 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:38:23,656 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:38:23,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:38:23,657 INFO L82 PathProgramCache]: Analyzing trace with hash 580789775, now seen corresponding path program 1 times [2019-09-07 21:38:23,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:38:23,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:38:23,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:38:23,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:38:23,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:38:23,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:38:24,175 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 83 proven. 146 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-09-07 21:38:24,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:38:24,176 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 21:38:24,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:38:24,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:38:24,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 21:38:24,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:38:24,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:38:24,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:38:24,592 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 87 proven. 6 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2019-09-07 21:38:24,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:38:24,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 12 [2019-09-07 21:38:24,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 21:38:24,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 21:38:24,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-09-07 21:38:24,598 INFO L87 Difference]: Start difference. First operand 35075 states and 42581 transitions. Second operand 12 states. [2019-09-07 21:38:56,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:38:56,156 INFO L93 Difference]: Finished difference Result 96775 states and 124627 transitions. [2019-09-07 21:38:56,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 21:38:56,157 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 385 [2019-09-07 21:38:56,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:38:56,377 INFO L225 Difference]: With dead ends: 96775 [2019-09-07 21:38:56,377 INFO L226 Difference]: Without dead ends: 61706 [2019-09-07 21:38:56,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 400 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=233, Invalid=759, Unknown=0, NotChecked=0, Total=992 [2019-09-07 21:38:56,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61706 states. [2019-09-07 21:38:57,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61706 to 56871. [2019-09-07 21:38:57,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56871 states. [2019-09-07 21:38:57,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56871 states to 56871 states and 68707 transitions. [2019-09-07 21:38:57,781 INFO L78 Accepts]: Start accepts. Automaton has 56871 states and 68707 transitions. Word has length 385 [2019-09-07 21:38:57,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:38:57,782 INFO L475 AbstractCegarLoop]: Abstraction has 56871 states and 68707 transitions. [2019-09-07 21:38:57,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 21:38:57,782 INFO L276 IsEmpty]: Start isEmpty. Operand 56871 states and 68707 transitions. [2019-09-07 21:38:57,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-09-07 21:38:57,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:38:57,798 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:38:57,799 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:38:57,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:38:57,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1145223012, now seen corresponding path program 1 times [2019-09-07 21:38:57,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:38:57,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:38:57,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:38:57,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:38:57,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:38:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:38:58,054 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-09-07 21:38:58,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:38:58,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 21:38:58,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 21:38:58,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 21:38:58,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 21:38:58,056 INFO L87 Difference]: Start difference. First operand 56871 states and 68707 transitions. Second operand 4 states. [2019-09-07 21:39:04,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:39:04,447 INFO L93 Difference]: Finished difference Result 141799 states and 173404 transitions. [2019-09-07 21:39:04,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 21:39:04,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 391 [2019-09-07 21:39:04,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:39:04,693 INFO L225 Difference]: With dead ends: 141799 [2019-09-07 21:39:04,694 INFO L226 Difference]: Without dead ends: 85367 [2019-09-07 21:39:04,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 21:39:04,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85367 states. [2019-09-07 21:39:06,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85367 to 81461. [2019-09-07 21:39:06,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81461 states. [2019-09-07 21:39:06,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81461 states to 81461 states and 96386 transitions. [2019-09-07 21:39:06,267 INFO L78 Accepts]: Start accepts. Automaton has 81461 states and 96386 transitions. Word has length 391 [2019-09-07 21:39:06,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:39:06,268 INFO L475 AbstractCegarLoop]: Abstraction has 81461 states and 96386 transitions. [2019-09-07 21:39:06,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 21:39:06,273 INFO L276 IsEmpty]: Start isEmpty. Operand 81461 states and 96386 transitions. [2019-09-07 21:39:06,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2019-09-07 21:39:06,353 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:39:06,354 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:39:06,354 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:39:06,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:39:06,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1109330997, now seen corresponding path program 1 times [2019-09-07 21:39:06,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:39:06,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:39:06,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:39:06,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:39:06,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:39:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:39:08,388 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 82 proven. 246 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 21:39:08,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:39:08,388 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 21:39:08,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:39:08,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:39:08,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 779 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:39:08,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:39:08,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:39:09,025 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 304 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 21:39:09,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:39:09,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2019-09-07 21:39:09,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 21:39:09,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 21:39:09,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-09-07 21:39:09,040 INFO L87 Difference]: Start difference. First operand 81461 states and 96386 transitions. Second operand 15 states. [2019-09-07 21:39:12,483 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-07 21:39:14,467 WARN L188 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-07 21:39:14,850 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-09-07 21:39:15,189 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-07 21:39:15,764 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-09-07 21:39:20,870 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-07 21:39:26,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:39:26,424 INFO L93 Difference]: Finished difference Result 178329 states and 211225 transitions. [2019-09-07 21:39:26,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-07 21:39:26,424 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 526 [2019-09-07 21:39:26,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:39:26,683 INFO L225 Difference]: With dead ends: 178329 [2019-09-07 21:39:26,684 INFO L226 Difference]: Without dead ends: 91487 [2019-09-07 21:39:26,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 641 GetRequests, 573 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1443 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=847, Invalid=3845, Unknown=0, NotChecked=0, Total=4692 [2019-09-07 21:39:26,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91487 states. [2019-09-07 21:39:27,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91487 to 85785. [2019-09-07 21:39:27,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85785 states. [2019-09-07 21:39:28,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85785 states to 85785 states and 97381 transitions. [2019-09-07 21:39:28,022 INFO L78 Accepts]: Start accepts. Automaton has 85785 states and 97381 transitions. Word has length 526 [2019-09-07 21:39:28,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:39:28,023 INFO L475 AbstractCegarLoop]: Abstraction has 85785 states and 97381 transitions. [2019-09-07 21:39:28,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 21:39:28,023 INFO L276 IsEmpty]: Start isEmpty. Operand 85785 states and 97381 transitions. [2019-09-07 21:39:28,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2019-09-07 21:39:28,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:39:28,074 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:39:28,074 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:39:28,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:39:28,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1306048479, now seen corresponding path program 1 times [2019-09-07 21:39:28,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:39:28,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:39:28,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:39:28,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:39:28,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:39:30,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:39:30,845 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 352 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:39:30,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:39:30,846 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 21:39:30,868 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 21:39:31,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:39:31,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 21:39:31,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:39:31,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:39:31,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:39:31,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:39:31,506 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 330 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-07 21:39:31,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:39:31,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-09-07 21:39:31,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 21:39:31,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 21:39:31,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-09-07 21:39:31,511 INFO L87 Difference]: Start difference. First operand 85785 states and 97381 transitions. Second operand 16 states. [2019-09-07 21:46:16,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:46:16,209 INFO L93 Difference]: Finished difference Result 222360 states and 268762 transitions. [2019-09-07 21:46:16,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2019-09-07 21:46:16,210 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 539 [2019-09-07 21:46:16,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:46:16,771 INFO L225 Difference]: With dead ends: 222360 [2019-09-07 21:46:16,771 INFO L226 Difference]: Without dead ends: 137014 [2019-09-07 21:46:17,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 566 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11139 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=3018, Invalid=23388, Unknown=0, NotChecked=0, Total=26406 [2019-09-07 21:46:17,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137014 states. [2019-09-07 21:46:19,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137014 to 128877. [2019-09-07 21:46:19,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128877 states. [2019-09-07 21:46:19,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128877 states to 128877 states and 148037 transitions. [2019-09-07 21:46:19,940 INFO L78 Accepts]: Start accepts. Automaton has 128877 states and 148037 transitions. Word has length 539 [2019-09-07 21:46:19,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:46:19,941 INFO L475 AbstractCegarLoop]: Abstraction has 128877 states and 148037 transitions. [2019-09-07 21:46:19,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 21:46:19,941 INFO L276 IsEmpty]: Start isEmpty. Operand 128877 states and 148037 transitions. [2019-09-07 21:46:19,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2019-09-07 21:46:19,975 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:46:19,975 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:46:19,976 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:46:19,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:46:19,976 INFO L82 PathProgramCache]: Analyzing trace with hash -253852153, now seen corresponding path program 1 times [2019-09-07 21:46:19,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:46:19,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:46:19,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:46:19,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:46:19,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:46:20,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:46:21,696 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 82 proven. 292 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 21:46:21,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:46:21,697 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:46:21,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:46:21,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:46:21,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-07 21:46:21,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:46:21,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 21:46:21,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:46:21,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:46:21,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:46:21,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:46:21,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:46:21,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:46:21,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:46:21,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:46:22,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-07 21:46:22,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:46:22,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:46:22,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:46:22,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:46:22,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:46:22,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:46:22,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:46:22,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:46:22,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:46:22,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:46:22,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:46:22,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:46:22,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:46:22,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:46:22,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:46:22,549 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 33 [2019-09-07 21:46:22,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:46:22,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:46:25,133 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 108 proven. 270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:46:25,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:46:25,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2019-09-07 21:46:25,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 21:46:25,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 21:46:25,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2019-09-07 21:46:25,140 INFO L87 Difference]: Start difference. First operand 128877 states and 148037 transitions. Second operand 25 states. [2019-09-07 21:46:34,820 WARN L188 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-09-07 21:46:35,282 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-09-07 21:46:38,970 WARN L188 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 60 DAG size of output: 43 [2019-09-07 21:46:44,915 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-09-07 21:46:50,152 WARN L188 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2019-09-07 21:46:51,340 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-09-07 21:46:59,744 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2019-09-07 21:47:01,185 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-09-07 21:47:01,774 WARN L188 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2019-09-07 21:47:04,384 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-09-07 21:47:06,598 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-09-07 21:47:16,205 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-09-07 21:47:23,233 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-07 21:47:23,819 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-09-07 21:47:26,770 WARN L188 SmtUtils]: Spent 625.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2019-09-07 21:47:33,838 WARN L188 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 84 DAG size of output: 67 [2019-09-07 21:47:34,030 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-09-07 21:47:36,526 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-09-07 21:47:38,996 WARN L188 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 45 [2019-09-07 21:47:43,135 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-07 21:47:49,747 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 62 [2019-09-07 21:47:58,678 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-09-07 21:48:01,199 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2019-09-07 21:48:16,139 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-07 21:48:33,043 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-07 21:48:36,312 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-07 21:48:36,831 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-09-07 21:48:42,385 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-09-07 21:48:47,945 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-09-07 21:48:49,263 WARN L188 SmtUtils]: Spent 784.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2019-09-07 21:48:51,961 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-07 21:48:54,871 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-09-07 21:48:55,705 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2019-09-07 21:48:58,422 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-07 21:49:09,637 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2019-09-07 21:49:17,320 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-07 21:49:17,924 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-09-07 21:49:21,802 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-07 21:49:22,240 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-07 21:49:26,175 WARN L188 SmtUtils]: Spent 614.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-09-07 21:49:27,382 WARN L188 SmtUtils]: Spent 951.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-09-07 21:49:27,575 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-07 21:49:30,243 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-07 21:49:30,692 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-09-07 21:49:33,446 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-09-07 21:49:34,195 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-09-07 21:49:40,884 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-07 21:49:48,584 WARN L188 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 96 DAG size of output: 70 [2019-09-07 21:49:48,843 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2019-09-07 21:49:49,511 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2019-09-07 21:49:53,055 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 70 [2019-09-07 21:50:01,078 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2019-09-07 21:50:05,853 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-09-07 21:50:11,443 WARN L188 SmtUtils]: Spent 833.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-07 21:50:11,729 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-09-07 21:50:12,789 WARN L188 SmtUtils]: Spent 981.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-09-07 21:50:13,690 WARN L188 SmtUtils]: Spent 667.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2019-09-07 21:50:13,873 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-09-07 21:50:19,611 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 68 [2019-09-07 21:50:24,627 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-09-07 21:50:28,973 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2019-09-07 21:50:43,306 WARN L188 SmtUtils]: Spent 980.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-09-07 21:50:46,077 WARN L188 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-09-07 21:50:50,874 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 62