java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem13_label58.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 20:00:44,953 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 20:00:44,955 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 20:00:44,966 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 20:00:44,967 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 20:00:44,968 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 20:00:44,969 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 20:00:44,971 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 20:00:44,973 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 20:00:44,974 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 20:00:44,975 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 20:00:44,976 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 20:00:44,976 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 20:00:44,977 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 20:00:44,978 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 20:00:44,980 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 20:00:44,980 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 20:00:44,981 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 20:00:44,983 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 20:00:44,985 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 20:00:44,986 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 20:00:44,988 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 20:00:44,989 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 20:00:44,990 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 20:00:44,992 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 20:00:44,992 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 20:00:44,992 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 20:00:44,993 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 20:00:44,994 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 20:00:44,995 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 20:00:44,995 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 20:00:44,996 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 20:00:44,996 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 20:00:44,997 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 20:00:44,998 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 20:00:44,998 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 20:00:44,999 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 20:00:44,999 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 20:00:45,000 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 20:00:45,001 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 20:00:45,001 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 20:00:45,002 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 20:00:45,016 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 20:00:45,017 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 20:00:45,018 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 20:00:45,018 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 20:00:45,018 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 20:00:45,019 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 20:00:45,019 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 20:00:45,019 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 20:00:45,019 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 20:00:45,019 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 20:00:45,019 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 20:00:45,020 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 20:00:45,020 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 20:00:45,020 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 20:00:45,020 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 20:00:45,020 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 20:00:45,021 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 20:00:45,021 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 20:00:45,021 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 20:00:45,021 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 20:00:45,022 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 20:00:45,022 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 20:00:45,022 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 20:00:45,022 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 20:00:45,022 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 20:00:45,022 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 20:00:45,023 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 20:00:45,023 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 20:00:45,023 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 20:00:45,069 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 20:00:45,082 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 20:00:45,086 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 20:00:45,087 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 20:00:45,087 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 20:00:45,088 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label58.c [2019-09-07 20:00:45,157 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97d47e6cd/a846d8eb38fd4b4db563ad124509019c/FLAG329f46c84 [2019-09-07 20:00:45,967 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 20:00:45,969 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label58.c [2019-09-07 20:00:46,010 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97d47e6cd/a846d8eb38fd4b4db563ad124509019c/FLAG329f46c84 [2019-09-07 20:00:46,488 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97d47e6cd/a846d8eb38fd4b4db563ad124509019c [2019-09-07 20:00:46,501 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 20:00:46,502 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 20:00:46,504 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 20:00:46,505 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 20:00:46,508 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 20:00:46,509 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:00:46" (1/1) ... [2019-09-07 20:00:46,511 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19de7cc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:00:46, skipping insertion in model container [2019-09-07 20:00:46,511 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:00:46" (1/1) ... [2019-09-07 20:00:46,519 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 20:00:46,694 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 20:00:48,297 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:00:48,304 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 20:00:48,980 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:00:49,014 INFO L192 MainTranslator]: Completed translation [2019-09-07 20:00:49,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:00:49 WrapperNode [2019-09-07 20:00:49,015 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 20:00:49,016 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 20:00:49,016 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 20:00:49,016 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 20:00:49,031 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:00:49" (1/1) ... [2019-09-07 20:00:49,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:00:49" (1/1) ... [2019-09-07 20:00:49,101 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:00:49" (1/1) ... [2019-09-07 20:00:49,102 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:00:49" (1/1) ... [2019-09-07 20:00:49,219 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:00:49" (1/1) ... [2019-09-07 20:00:49,256 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:00:49" (1/1) ... [2019-09-07 20:00:49,292 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:00:49" (1/1) ... [2019-09-07 20:00:49,327 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 20:00:49,328 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 20:00:49,328 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 20:00:49,328 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 20:00:49,329 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:00:49" (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 20:00:49,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 20:00:49,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 20:00:49,394 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 20:00:49,395 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 20:00:49,395 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2019-09-07 20:00:49,395 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2019-09-07 20:00:49,395 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 20:00:49,395 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 20:00:49,396 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 20:00:49,396 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2019-09-07 20:00:49,396 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2019-09-07 20:00:49,396 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 20:00:49,396 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 20:00:49,397 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 20:00:49,397 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 20:00:49,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 20:00:49,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 20:00:56,370 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 20:00:56,370 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 20:00:56,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:00:56 BoogieIcfgContainer [2019-09-07 20:00:56,376 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 20:00:56,377 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 20:00:56,377 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 20:00:56,383 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 20:00:56,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 08:00:46" (1/3) ... [2019-09-07 20:00:56,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aea55ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:00:56, skipping insertion in model container [2019-09-07 20:00:56,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:00:49" (2/3) ... [2019-09-07 20:00:56,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aea55ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:00:56, skipping insertion in model container [2019-09-07 20:00:56,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:00:56" (3/3) ... [2019-09-07 20:00:56,393 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem13_label58.c [2019-09-07 20:00:56,406 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 20:00:56,416 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 20:00:56,434 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 20:00:56,482 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 20:00:56,483 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 20:00:56,483 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 20:00:56,483 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 20:00:56,483 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 20:00:56,483 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 20:00:56,484 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 20:00:56,484 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 20:00:56,484 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 20:00:56,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states. [2019-09-07 20:00:56,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-07 20:00:56,525 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:00:56,526 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:00:56,528 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:00:56,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:00:56,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1431834345, now seen corresponding path program 1 times [2019-09-07 20:00:56,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:00:56,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:00:56,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:00:56,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:00:56,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:00:56,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:00:56,855 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 20:00:56,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:00:56,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 20:00:56,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 20:00:56,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 20:00:56,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:00:56,883 INFO L87 Difference]: Start difference. First operand 1119 states. Second operand 3 states. [2019-09-07 20:01:03,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:01:03,261 INFO L93 Difference]: Finished difference Result 3094 states and 5704 transitions. [2019-09-07 20:01:03,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 20:01:03,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-07 20:01:03,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:01:03,304 INFO L225 Difference]: With dead ends: 3094 [2019-09-07 20:01:03,304 INFO L226 Difference]: Without dead ends: 1913 [2019-09-07 20:01:03,316 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 20:01:03,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1913 states. [2019-09-07 20:01:03,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1913 to 1912. [2019-09-07 20:01:03,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1912 states. [2019-09-07 20:01:03,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1912 states to 1912 states and 3141 transitions. [2019-09-07 20:01:03,492 INFO L78 Accepts]: Start accepts. Automaton has 1912 states and 3141 transitions. Word has length 18 [2019-09-07 20:01:03,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:01:03,493 INFO L475 AbstractCegarLoop]: Abstraction has 1912 states and 3141 transitions. [2019-09-07 20:01:03,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 20:01:03,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 3141 transitions. [2019-09-07 20:01:03,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-07 20:01:03,501 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:01:03,501 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 20:01:03,502 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:01:03,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:01:03,503 INFO L82 PathProgramCache]: Analyzing trace with hash 6915315, now seen corresponding path program 1 times [2019-09-07 20:01:03,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:01:03,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:01:03,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:01:03,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:01:03,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:01:03,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:01:03,732 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:01:03,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:01:03,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 20:01:03,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 20:01:03,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 20:01:03,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 20:01:03,735 INFO L87 Difference]: Start difference. First operand 1912 states and 3141 transitions. Second operand 5 states. [2019-09-07 20:01:12,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:01:12,984 INFO L93 Difference]: Finished difference Result 5589 states and 9299 transitions. [2019-09-07 20:01:12,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 20:01:12,986 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-07 20:01:12,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:01:13,015 INFO L225 Difference]: With dead ends: 5589 [2019-09-07 20:01:13,015 INFO L226 Difference]: Without dead ends: 3683 [2019-09-07 20:01:13,023 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 20:01:13,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3683 states. [2019-09-07 20:01:13,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3683 to 3601. [2019-09-07 20:01:13,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3601 states. [2019-09-07 20:01:13,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3601 states to 3601 states and 5413 transitions. [2019-09-07 20:01:13,153 INFO L78 Accepts]: Start accepts. Automaton has 3601 states and 5413 transitions. Word has length 93 [2019-09-07 20:01:13,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:01:13,154 INFO L475 AbstractCegarLoop]: Abstraction has 3601 states and 5413 transitions. [2019-09-07 20:01:13,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 20:01:13,154 INFO L276 IsEmpty]: Start isEmpty. Operand 3601 states and 5413 transitions. [2019-09-07 20:01:13,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-07 20:01:13,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:01:13,164 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:01:13,165 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:01:13,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:01:13,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1205149463, now seen corresponding path program 1 times [2019-09-07 20:01:13,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:01:13,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:01:13,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:01:13,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:01:13,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:01:13,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:01:13,348 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:01:13,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:01:13,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 20:01:13,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 20:01:13,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 20:01:13,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 20:01:13,350 INFO L87 Difference]: Start difference. First operand 3601 states and 5413 transitions. Second operand 5 states. [2019-09-07 20:01:23,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:01:23,928 INFO L93 Difference]: Finished difference Result 10901 states and 16894 transitions. [2019-09-07 20:01:23,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 20:01:23,928 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-09-07 20:01:23,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:01:23,978 INFO L225 Difference]: With dead ends: 10901 [2019-09-07 20:01:23,981 INFO L226 Difference]: Without dead ends: 7306 [2019-09-07 20:01:23,994 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 20:01:24,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7306 states. [2019-09-07 20:01:24,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7306 to 7121. [2019-09-07 20:01:24,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7121 states. [2019-09-07 20:01:24,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7121 states to 7121 states and 10495 transitions. [2019-09-07 20:01:24,219 INFO L78 Accepts]: Start accepts. Automaton has 7121 states and 10495 transitions. Word has length 107 [2019-09-07 20:01:24,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:01:24,221 INFO L475 AbstractCegarLoop]: Abstraction has 7121 states and 10495 transitions. [2019-09-07 20:01:24,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 20:01:24,221 INFO L276 IsEmpty]: Start isEmpty. Operand 7121 states and 10495 transitions. [2019-09-07 20:01:24,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-07 20:01:24,227 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:01:24,227 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 20:01:24,228 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:01:24,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:01:24,228 INFO L82 PathProgramCache]: Analyzing trace with hash -933439565, now seen corresponding path program 1 times [2019-09-07 20:01:24,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:01:24,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:01:24,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:01:24,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:01:24,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:01:24,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:01:24,499 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:01:24,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:01:24,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 20:01:24,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 20:01:24,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 20:01:24,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 20:01:24,502 INFO L87 Difference]: Start difference. First operand 7121 states and 10495 transitions. Second operand 6 states. [2019-09-07 20:01:32,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:01:32,704 INFO L93 Difference]: Finished difference Result 21450 states and 33769 transitions. [2019-09-07 20:01:32,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 20:01:32,705 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 125 [2019-09-07 20:01:32,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:01:32,832 INFO L225 Difference]: With dead ends: 21450 [2019-09-07 20:01:32,832 INFO L226 Difference]: Without dead ends: 14335 [2019-09-07 20:01:32,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:01:32,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14335 states. [2019-09-07 20:01:33,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14335 to 14126. [2019-09-07 20:01:33,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14126 states. [2019-09-07 20:01:33,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14126 states to 14126 states and 21301 transitions. [2019-09-07 20:01:33,297 INFO L78 Accepts]: Start accepts. Automaton has 14126 states and 21301 transitions. Word has length 125 [2019-09-07 20:01:33,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:01:33,299 INFO L475 AbstractCegarLoop]: Abstraction has 14126 states and 21301 transitions. [2019-09-07 20:01:33,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 20:01:33,299 INFO L276 IsEmpty]: Start isEmpty. Operand 14126 states and 21301 transitions. [2019-09-07 20:01:33,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-07 20:01:33,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:01:33,303 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 20:01:33,303 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:01:33,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:01:33,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1922208204, now seen corresponding path program 1 times [2019-09-07 20:01:33,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:01:33,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:01:33,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:01:33,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:01:33,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:01:33,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:01:33,504 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:01:33,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:01:33,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 20:01:33,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 20:01:33,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 20:01:33,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 20:01:33,508 INFO L87 Difference]: Start difference. First operand 14126 states and 21301 transitions. Second operand 6 states. [2019-09-07 20:01:41,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:01:41,579 INFO L93 Difference]: Finished difference Result 42171 states and 69935 transitions. [2019-09-07 20:01:41,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 20:01:41,581 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 136 [2019-09-07 20:01:41,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:01:41,744 INFO L225 Difference]: With dead ends: 42171 [2019-09-07 20:01:41,744 INFO L226 Difference]: Without dead ends: 28051 [2019-09-07 20:01:41,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:01:41,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28051 states. [2019-09-07 20:01:42,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28051 to 27931. [2019-09-07 20:01:42,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27931 states. [2019-09-07 20:01:42,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27931 states to 27931 states and 41898 transitions. [2019-09-07 20:01:42,737 INFO L78 Accepts]: Start accepts. Automaton has 27931 states and 41898 transitions. Word has length 136 [2019-09-07 20:01:42,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:01:42,737 INFO L475 AbstractCegarLoop]: Abstraction has 27931 states and 41898 transitions. [2019-09-07 20:01:42,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 20:01:42,738 INFO L276 IsEmpty]: Start isEmpty. Operand 27931 states and 41898 transitions. [2019-09-07 20:01:42,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-07 20:01:42,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:01:42,741 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 20:01:42,741 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:01:42,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:01:42,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1503711845, now seen corresponding path program 1 times [2019-09-07 20:01:42,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:01:42,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:01:42,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:01:42,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:01:42,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:01:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:01:42,929 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:01:42,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:01:42,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 20:01:42,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 20:01:42,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 20:01:42,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 20:01:42,931 INFO L87 Difference]: Start difference. First operand 27931 states and 41898 transitions. Second operand 6 states. [2019-09-07 20:01:49,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:01:49,887 INFO L93 Difference]: Finished difference Result 64050 states and 97298 transitions. [2019-09-07 20:01:49,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 20:01:49,890 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2019-09-07 20:01:49,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:01:50,052 INFO L225 Difference]: With dead ends: 64050 [2019-09-07 20:01:50,052 INFO L226 Difference]: Without dead ends: 36125 [2019-09-07 20:01:50,138 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:01:50,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36125 states. [2019-09-07 20:01:50,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36125 to 34426. [2019-09-07 20:01:50,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34426 states. [2019-09-07 20:01:50,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34426 states to 34426 states and 48593 transitions. [2019-09-07 20:01:50,936 INFO L78 Accepts]: Start accepts. Automaton has 34426 states and 48593 transitions. Word has length 164 [2019-09-07 20:01:50,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:01:50,937 INFO L475 AbstractCegarLoop]: Abstraction has 34426 states and 48593 transitions. [2019-09-07 20:01:50,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 20:01:50,937 INFO L276 IsEmpty]: Start isEmpty. Operand 34426 states and 48593 transitions. [2019-09-07 20:01:50,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-07 20:01:50,941 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:01:50,942 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:01:50,942 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:01:50,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:01:50,943 INFO L82 PathProgramCache]: Analyzing trace with hash 79559715, now seen corresponding path program 1 times [2019-09-07 20:01:50,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:01:50,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:01:50,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:01:50,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:01:50,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:01:50,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:01:51,153 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 95 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:01:51,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:01:51,154 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 20:01:51,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:01:51,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:01:51,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 20:01:51,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:01:52,547 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-09-07 20:01:52,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:01:52,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-07 20:01:52,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 20:01:52,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 20:01:52,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 20:01:52,555 INFO L87 Difference]: Start difference. First operand 34426 states and 48593 transitions. Second operand 7 states. [2019-09-07 20:02:10,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:02:10,294 INFO L93 Difference]: Finished difference Result 107910 states and 157326 transitions. [2019-09-07 20:02:10,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 20:02:10,295 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 213 [2019-09-07 20:02:10,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:02:10,839 INFO L225 Difference]: With dead ends: 107910 [2019-09-07 20:02:10,840 INFO L226 Difference]: Without dead ends: 73490 [2019-09-07 20:02:10,975 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-09-07 20:02:11,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73490 states. [2019-09-07 20:02:12,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73490 to 63723. [2019-09-07 20:02:12,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63723 states. [2019-09-07 20:02:12,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63723 states to 63723 states and 83945 transitions. [2019-09-07 20:02:12,718 INFO L78 Accepts]: Start accepts. Automaton has 63723 states and 83945 transitions. Word has length 213 [2019-09-07 20:02:12,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:02:12,719 INFO L475 AbstractCegarLoop]: Abstraction has 63723 states and 83945 transitions. [2019-09-07 20:02:12,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 20:02:12,719 INFO L276 IsEmpty]: Start isEmpty. Operand 63723 states and 83945 transitions. [2019-09-07 20:02:12,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-07 20:02:12,723 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:02:12,724 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 20:02:12,724 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:02:12,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:02:12,724 INFO L82 PathProgramCache]: Analyzing trace with hash -2087810757, now seen corresponding path program 1 times [2019-09-07 20:02:12,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:02:12,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:02:12,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:02:12,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:02:12,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:02:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:02:12,878 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-09-07 20:02:12,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:02:12,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 20:02:12,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 20:02:12,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 20:02:12,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:02:12,880 INFO L87 Difference]: Start difference. First operand 63723 states and 83945 transitions. Second operand 3 states. [2019-09-07 20:02:19,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:02:19,661 INFO L93 Difference]: Finished difference Result 144550 states and 195288 transitions. [2019-09-07 20:02:19,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 20:02:19,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2019-09-07 20:02:19,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:02:20,048 INFO L225 Difference]: With dead ends: 144550 [2019-09-07 20:02:20,048 INFO L226 Difference]: Without dead ends: 80837 [2019-09-07 20:02:20,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 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 20:02:20,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80837 states. [2019-09-07 20:02:23,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80837 to 80031. [2019-09-07 20:02:23,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80031 states. [2019-09-07 20:02:23,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80031 states to 80031 states and 106186 transitions. [2019-09-07 20:02:23,511 INFO L78 Accepts]: Start accepts. Automaton has 80031 states and 106186 transitions. Word has length 218 [2019-09-07 20:02:23,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:02:23,512 INFO L475 AbstractCegarLoop]: Abstraction has 80031 states and 106186 transitions. [2019-09-07 20:02:23,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 20:02:23,512 INFO L276 IsEmpty]: Start isEmpty. Operand 80031 states and 106186 transitions. [2019-09-07 20:02:23,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-09-07 20:02:23,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:02:23,519 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 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 20:02:23,519 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:02:23,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:02:23,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1794111763, now seen corresponding path program 1 times [2019-09-07 20:02:23,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:02:23,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:02:23,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:02:23,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:02:23,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:02:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:02:23,672 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2019-09-07 20:02:23,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:02:23,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:02:23,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:02:23,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:02:23,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:02:23,674 INFO L87 Difference]: Start difference. First operand 80031 states and 106186 transitions. Second operand 4 states. [2019-09-07 20:02:34,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:02:34,374 INFO L93 Difference]: Finished difference Result 221914 states and 304857 transitions. [2019-09-07 20:02:34,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:02:34,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 263 [2019-09-07 20:02:34,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:02:34,876 INFO L225 Difference]: With dead ends: 221914 [2019-09-07 20:02:34,876 INFO L226 Difference]: Without dead ends: 140219 [2019-09-07 20:02:35,042 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 20:02:35,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140219 states. [2019-09-07 20:02:40,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140219 to 134514. [2019-09-07 20:02:40,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134514 states. [2019-09-07 20:02:41,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134514 states to 134514 states and 175761 transitions. [2019-09-07 20:02:41,486 INFO L78 Accepts]: Start accepts. Automaton has 134514 states and 175761 transitions. Word has length 263 [2019-09-07 20:02:41,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:02:41,487 INFO L475 AbstractCegarLoop]: Abstraction has 134514 states and 175761 transitions. [2019-09-07 20:02:41,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:02:41,488 INFO L276 IsEmpty]: Start isEmpty. Operand 134514 states and 175761 transitions. [2019-09-07 20:02:41,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2019-09-07 20:02:41,629 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:02:41,629 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2019-09-07 20:02:41,630 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:02:41,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:02:41,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1214446566, now seen corresponding path program 1 times [2019-09-07 20:02:41,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:02:41,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:02:41,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:02:41,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:02:41,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:02:41,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:02:42,235 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 241 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-07 20:02:42,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:02:42,235 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:02:42,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:02:42,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:02:42,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 20:02:42,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:02:42,675 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 241 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 20:02:42,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:02:42,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-09-07 20:02:42,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 20:02:42,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 20:02:42,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-07 20:02:42,695 INFO L87 Difference]: Start difference. First operand 134514 states and 175761 transitions. Second operand 8 states. [2019-09-07 20:03:05,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:03:05,437 INFO L93 Difference]: Finished difference Result 311349 states and 457699 transitions. [2019-09-07 20:03:05,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 20:03:05,438 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 523 [2019-09-07 20:03:05,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:03:06,072 INFO L225 Difference]: With dead ends: 311349 [2019-09-07 20:03:06,072 INFO L226 Difference]: Without dead ends: 175143 [2019-09-07 20:03:06,258 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 531 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2019-09-07 20:03:06,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175143 states. [2019-09-07 20:03:12,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175143 to 171653. [2019-09-07 20:03:12,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171653 states. [2019-09-07 20:03:12,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171653 states to 171653 states and 225134 transitions. [2019-09-07 20:03:12,947 INFO L78 Accepts]: Start accepts. Automaton has 171653 states and 225134 transitions. Word has length 523 [2019-09-07 20:03:12,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:03:12,948 INFO L475 AbstractCegarLoop]: Abstraction has 171653 states and 225134 transitions. [2019-09-07 20:03:12,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 20:03:12,948 INFO L276 IsEmpty]: Start isEmpty. Operand 171653 states and 225134 transitions. [2019-09-07 20:03:13,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2019-09-07 20:03:13,083 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:03:13,084 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 20:03:13,085 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:03:13,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:03:13,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1555553292, now seen corresponding path program 1 times [2019-09-07 20:03:13,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:03:13,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:03:13,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:03:13,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:03:13,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:03:13,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:03:13,530 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 128 proven. 133 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-07 20:03:13,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:03:13,531 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 20:03:13,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:03:13,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:03:13,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 20:03:13,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:03:13,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:03:14,249 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2019-09-07 20:03:14,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:03:14,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 20:03:14,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:03:14,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:03:14,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:03:14,265 INFO L87 Difference]: Start difference. First operand 171653 states and 225134 transitions. Second operand 9 states. [2019-09-07 20:03:34,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:03:34,991 INFO L93 Difference]: Finished difference Result 392886 states and 497407 transitions. [2019-09-07 20:03:34,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 20:03:34,991 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 542 [2019-09-07 20:03:34,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:03:35,521 INFO L225 Difference]: With dead ends: 392886 [2019-09-07 20:03:35,522 INFO L226 Difference]: Without dead ends: 221243 [2019-09-07 20:03:35,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 554 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2019-09-07 20:03:35,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221243 states. [2019-09-07 20:03:38,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221243 to 197018. [2019-09-07 20:03:38,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197018 states. [2019-09-07 20:03:38,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197018 states to 197018 states and 241592 transitions. [2019-09-07 20:03:38,785 INFO L78 Accepts]: Start accepts. Automaton has 197018 states and 241592 transitions. Word has length 542 [2019-09-07 20:03:38,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:03:38,785 INFO L475 AbstractCegarLoop]: Abstraction has 197018 states and 241592 transitions. [2019-09-07 20:03:38,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:03:38,785 INFO L276 IsEmpty]: Start isEmpty. Operand 197018 states and 241592 transitions. [2019-09-07 20:03:38,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 624 [2019-09-07 20:03:38,841 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:03:38,841 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:03:38,842 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:03:38,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:03:38,842 INFO L82 PathProgramCache]: Analyzing trace with hash -450007356, now seen corresponding path program 1 times [2019-09-07 20:03:38,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:03:38,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:03:38,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:03:38,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:03:38,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:03:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:03:39,539 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 337 proven. 203 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-07 20:03:39,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:03:39,540 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 20:03:39,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:03:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:03:39,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 20:03:39,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:03:40,265 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 433 proven. 2 refuted. 0 times theorem prover too weak. 222 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 20:03:40,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:03:40,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-09-07 20:03:40,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 20:03:40,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 20:03:40,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-07 20:03:40,281 INFO L87 Difference]: Start difference. First operand 197018 states and 241592 transitions. Second operand 13 states. [2019-09-07 20:05:07,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:05:07,488 INFO L93 Difference]: Finished difference Result 506003 states and 626727 transitions. [2019-09-07 20:05:07,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-09-07 20:05:07,488 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 623 [2019-09-07 20:05:07,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:05:08,282 INFO L225 Difference]: With dead ends: 506003 [2019-09-07 20:05:08,282 INFO L226 Difference]: Without dead ends: 304845 [2019-09-07 20:05:08,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 825 GetRequests, 715 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4665 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1553, Invalid=10657, Unknown=0, NotChecked=0, Total=12210 [2019-09-07 20:05:08,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304845 states. [2019-09-07 20:05:12,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304845 to 287746. [2019-09-07 20:05:12,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287746 states. [2019-09-07 20:05:12,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287746 states to 287746 states and 335370 transitions. [2019-09-07 20:05:12,830 INFO L78 Accepts]: Start accepts. Automaton has 287746 states and 335370 transitions. Word has length 623 [2019-09-07 20:05:12,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:05:12,831 INFO L475 AbstractCegarLoop]: Abstraction has 287746 states and 335370 transitions. [2019-09-07 20:05:12,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 20:05:12,831 INFO L276 IsEmpty]: Start isEmpty. Operand 287746 states and 335370 transitions. [2019-09-07 20:05:12,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 767 [2019-09-07 20:05:12,883 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:05:12,884 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 20:05:12,884 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:05:12,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:05:12,884 INFO L82 PathProgramCache]: Analyzing trace with hash -866507746, now seen corresponding path program 1 times [2019-09-07 20:05:12,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:05:12,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:05:12,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:05:12,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:05:12,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:05:12,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:05:17,927 INFO L134 CoverageAnalysis]: Checked inductivity of 907 backedges. 119 proven. 627 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2019-09-07 20:05:17,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:05:17,928 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:05:17,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:05:18,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:05:18,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 1110 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 20:05:18,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:05:18,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:05:18,999 INFO L134 CoverageAnalysis]: Checked inductivity of 907 backedges. 728 proven. 2 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-09-07 20:05:19,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:05:19,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-09-07 20:05:19,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 20:05:19,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 20:05:19,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-09-07 20:05:19,010 INFO L87 Difference]: Start difference. First operand 287746 states and 335370 transitions. Second operand 16 states. [2019-09-07 20:06:06,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:06:06,451 INFO L93 Difference]: Finished difference Result 629609 states and 733670 transitions. [2019-09-07 20:06:06,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-09-07 20:06:06,452 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 766 [2019-09-07 20:06:06,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:06:07,859 INFO L225 Difference]: With dead ends: 629609 [2019-09-07 20:06:07,860 INFO L226 Difference]: Without dead ends: 321971 [2019-09-07 20:06:08,117 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 957 GetRequests, 846 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4812 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1779, Invalid=10653, Unknown=0, NotChecked=0, Total=12432 [2019-09-07 20:06:08,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321971 states. [2019-09-07 20:06:11,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321971 to 285408. [2019-09-07 20:06:11,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285408 states. [2019-09-07 20:06:12,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285408 states to 285408 states and 320640 transitions. [2019-09-07 20:06:12,138 INFO L78 Accepts]: Start accepts. Automaton has 285408 states and 320640 transitions. Word has length 766 [2019-09-07 20:06:12,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:06:12,139 INFO L475 AbstractCegarLoop]: Abstraction has 285408 states and 320640 transitions. [2019-09-07 20:06:12,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 20:06:12,139 INFO L276 IsEmpty]: Start isEmpty. Operand 285408 states and 320640 transitions. [2019-09-07 20:06:12,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1033 [2019-09-07 20:06:12,190 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:06:12,191 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:06:12,191 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:06:12,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:06:12,192 INFO L82 PathProgramCache]: Analyzing trace with hash 490781991, now seen corresponding path program 1 times [2019-09-07 20:06:12,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:06:12,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:06:12,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:06:12,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:06:12,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:06:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:06:14,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1150 backedges. 698 proven. 2 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2019-09-07 20:06:14,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:06:14,817 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 20:06:14,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:06:15,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:06:15,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 1403 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 20:06:15,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:06:15,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:06:15,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:06:16,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1150 backedges. 687 proven. 357 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-09-07 20:06:16,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:06:16,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 15 [2019-09-07 20:06:16,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 20:06:16,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 20:06:16,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-09-07 20:06:16,447 INFO L87 Difference]: Start difference. First operand 285408 states and 320640 transitions. Second operand 15 states. [2019-09-07 20:09:24,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:09:24,938 INFO L93 Difference]: Finished difference Result 779496 states and 915477 transitions. [2019-09-07 20:09:24,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 208 states. [2019-09-07 20:09:24,939 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 1032 [2019-09-07 20:09:24,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:09:26,156 INFO L225 Difference]: With dead ends: 779496 [2019-09-07 20:09:26,156 INFO L226 Difference]: Without dead ends: 498009 [2019-09-07 20:09:26,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1422 GetRequests, 1211 SyntacticMatches, 0 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19381 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=3129, Invalid=42027, Unknown=0, NotChecked=0, Total=45156 [2019-09-07 20:09:26,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498009 states. [2019-09-07 20:09:43,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498009 to 472405. [2019-09-07 20:09:43,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472405 states. [2019-09-07 20:09:44,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472405 states to 472405 states and 524084 transitions. [2019-09-07 20:09:44,067 INFO L78 Accepts]: Start accepts. Automaton has 472405 states and 524084 transitions. Word has length 1032 [2019-09-07 20:09:44,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:09:44,068 INFO L475 AbstractCegarLoop]: Abstraction has 472405 states and 524084 transitions. [2019-09-07 20:09:44,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 20:09:44,068 INFO L276 IsEmpty]: Start isEmpty. Operand 472405 states and 524084 transitions. [2019-09-07 20:09:44,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1038 [2019-09-07 20:09:44,106 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:09:44,107 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:09:44,107 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:09:44,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:09:44,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1367946372, now seen corresponding path program 1 times [2019-09-07 20:09:44,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:09:44,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:09:44,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:09:44,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:09:44,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:09:44,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:09:51,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1266 backedges. 691 proven. 2 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2019-09-07 20:09:51,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:09:51,616 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:09:51,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:09:51,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:09:51,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 1448 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 20:09:51,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:09:51,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:09:51,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:09:56,535 WARN L188 SmtUtils]: Spent 4.54 s on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2019-09-07 20:09:56,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:09:56,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:09:58,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:09:59,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1266 backedges. 909 proven. 2 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2019-09-07 20:09:59,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:09:59,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2019-09-07 20:09:59,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 20:09:59,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 20:09:59,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=105, Unknown=1, NotChecked=0, Total=132 [2019-09-07 20:09:59,352 INFO L87 Difference]: Start difference. First operand 472405 states and 524084 transitions. Second operand 12 states. [2019-09-07 20:10:03,942 WARN L188 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 45 DAG size of output: 31 [2019-09-07 20:10:25,514 WARN L188 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 32 DAG size of output: 17 [2019-09-07 20:10:56,596 WARN L188 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 35 DAG size of output: 21 [2019-09-07 20:11:08,836 WARN L188 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2019-09-07 20:11:42,640 WARN L188 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 40 DAG size of output: 26 [2019-09-07 20:11:46,891 WARN L188 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 35 DAG size of output: 21 [2019-09-07 20:12:08,168 WARN L188 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 35 DAG size of output: 21 [2019-09-07 20:12:33,899 WARN L188 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 37 DAG size of output: 23