java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem17_label58.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 22:12:28,309 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 22:12:28,312 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 22:12:28,324 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 22:12:28,324 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 22:12:28,325 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 22:12:28,327 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 22:12:28,329 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 22:12:28,330 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 22:12:28,332 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 22:12:28,333 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 22:12:28,334 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 22:12:28,334 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 22:12:28,335 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 22:12:28,336 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 22:12:28,338 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 22:12:28,339 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 22:12:28,340 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 22:12:28,342 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 22:12:28,344 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 22:12:28,345 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 22:12:28,350 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 22:12:28,352 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 22:12:28,353 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 22:12:28,357 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 22:12:28,358 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 22:12:28,358 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 22:12:28,361 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 22:12:28,361 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 22:12:28,362 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 22:12:28,363 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 22:12:28,365 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 22:12:28,368 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 22:12:28,369 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 22:12:28,370 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 22:12:28,370 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 22:12:28,371 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 22:12:28,371 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 22:12:28,373 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 22:12:28,375 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 22:12:28,375 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 22:12:28,378 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 22:12:28,408 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 22:12:28,408 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 22:12:28,410 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 22:12:28,411 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 22:12:28,411 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 22:12:28,411 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 22:12:28,411 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 22:12:28,412 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 22:12:28,412 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 22:12:28,412 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 22:12:28,413 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 22:12:28,414 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 22:12:28,414 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 22:12:28,414 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 22:12:28,415 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 22:12:28,415 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 22:12:28,415 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 22:12:28,415 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 22:12:28,416 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 22:12:28,416 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 22:12:28,416 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 22:12:28,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 22:12:28,417 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 22:12:28,417 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 22:12:28,417 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 22:12:28,418 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 22:12:28,418 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 22:12:28,418 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 22:12:28,418 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 22:12:28,476 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 22:12:28,498 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 22:12:28,503 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 22:12:28,504 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 22:12:28,506 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 22:12:28,507 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label58.c [2019-09-07 22:12:28,579 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c32cd68df/7d74ba6de2c347fb9a2597cdc3d80ae7/FLAG0620b3100 [2019-09-07 22:12:29,297 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 22:12:29,298 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label58.c [2019-09-07 22:12:29,318 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c32cd68df/7d74ba6de2c347fb9a2597cdc3d80ae7/FLAG0620b3100 [2019-09-07 22:12:29,462 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c32cd68df/7d74ba6de2c347fb9a2597cdc3d80ae7 [2019-09-07 22:12:29,472 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 22:12:29,473 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 22:12:29,474 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 22:12:29,475 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 22:12:29,478 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 22:12:29,479 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:12:29" (1/1) ... [2019-09-07 22:12:29,482 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@335c662c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:12:29, skipping insertion in model container [2019-09-07 22:12:29,482 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:12:29" (1/1) ... [2019-09-07 22:12:29,490 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 22:12:29,597 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 22:12:30,561 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 22:12:30,566 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 22:12:30,966 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 22:12:30,990 INFO L192 MainTranslator]: Completed translation [2019-09-07 22:12:30,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:12:30 WrapperNode [2019-09-07 22:12:30,992 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 22:12:30,993 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 22:12:30,993 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 22:12:30,993 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 22:12:31,006 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:12:30" (1/1) ... [2019-09-07 22:12:31,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:12:30" (1/1) ... [2019-09-07 22:12:31,067 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:12:30" (1/1) ... [2019-09-07 22:12:31,069 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:12:30" (1/1) ... [2019-09-07 22:12:31,237 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:12:30" (1/1) ... [2019-09-07 22:12:31,273 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:12:30" (1/1) ... [2019-09-07 22:12:31,301 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:12:30" (1/1) ... [2019-09-07 22:12:31,333 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 22:12:31,333 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 22:12:31,334 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 22:12:31,334 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 22:12:31,335 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:12:30" (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 22:12:31,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 22:12:31,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 22:12:31,409 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 22:12:31,409 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 22:12:31,409 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 22:12:31,409 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 22:12:31,410 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 22:12:31,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 22:12:31,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 22:12:31,410 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 22:12:31,411 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 22:12:31,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 22:12:31,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 22:12:35,606 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 22:12:35,607 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 22:12:35,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:12:35 BoogieIcfgContainer [2019-09-07 22:12:35,611 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 22:12:35,613 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 22:12:35,613 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 22:12:35,617 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 22:12:35,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 10:12:29" (1/3) ... [2019-09-07 22:12:35,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@104bf4f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:12:35, skipping insertion in model container [2019-09-07 22:12:35,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:12:30" (2/3) ... [2019-09-07 22:12:35,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@104bf4f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:12:35, skipping insertion in model container [2019-09-07 22:12:35,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:12:35" (3/3) ... [2019-09-07 22:12:35,634 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem17_label58.c [2019-09-07 22:12:35,649 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 22:12:35,661 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 22:12:35,686 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 22:12:35,755 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 22:12:35,756 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 22:12:35,757 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 22:12:35,757 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 22:12:35,757 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 22:12:35,757 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 22:12:35,757 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 22:12:35,758 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 22:12:35,758 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 22:12:35,798 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states. [2019-09-07 22:12:35,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-07 22:12:35,808 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:12:35,809 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:12:35,811 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:12:35,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:12:35,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1296937305, now seen corresponding path program 1 times [2019-09-07 22:12:35,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:12:35,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:12:35,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:12:35,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:12:35,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:12:36,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:12:36,214 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 22:12:36,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:12:36,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 22:12:36,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 22:12:36,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 22:12:36,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 22:12:36,239 INFO L87 Difference]: Start difference. First operand 603 states. Second operand 4 states. [2019-09-07 22:12:42,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:12:42,443 INFO L93 Difference]: Finished difference Result 2158 states and 4003 transitions. [2019-09-07 22:12:42,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 22:12:42,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-09-07 22:12:42,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:12:42,478 INFO L225 Difference]: With dead ends: 2158 [2019-09-07 22:12:42,478 INFO L226 Difference]: Without dead ends: 1474 [2019-09-07 22:12:42,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 22:12:42,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2019-09-07 22:12:42,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1447. [2019-09-07 22:12:42,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1447 states. [2019-09-07 22:12:42,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 2481 transitions. [2019-09-07 22:12:42,634 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 2481 transitions. Word has length 51 [2019-09-07 22:12:42,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:12:42,638 INFO L475 AbstractCegarLoop]: Abstraction has 1447 states and 2481 transitions. [2019-09-07 22:12:42,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 22:12:42,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 2481 transitions. [2019-09-07 22:12:42,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-07 22:12:42,653 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:12:42,653 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:12:42,654 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:12:42,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:12:42,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1989788201, now seen corresponding path program 1 times [2019-09-07 22:12:42,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:12:42,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:12:42,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:12:42,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:12:42,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:12:42,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:12:42,938 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:12:42,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:12:42,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 22:12:42,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 22:12:42,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 22:12:42,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-07 22:12:42,947 INFO L87 Difference]: Start difference. First operand 1447 states and 2481 transitions. Second operand 6 states. [2019-09-07 22:12:51,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:12:51,276 INFO L93 Difference]: Finished difference Result 5602 states and 9930 transitions. [2019-09-07 22:12:51,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 22:12:51,277 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2019-09-07 22:12:51,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:12:51,306 INFO L225 Difference]: With dead ends: 5602 [2019-09-07 22:12:51,307 INFO L226 Difference]: Without dead ends: 4161 [2019-09-07 22:12:51,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-07 22:12:51,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4161 states. [2019-09-07 22:12:51,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4161 to 4140. [2019-09-07 22:12:51,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4140 states. [2019-09-07 22:12:51,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4140 states to 4140 states and 6053 transitions. [2019-09-07 22:12:51,473 INFO L78 Accepts]: Start accepts. Automaton has 4140 states and 6053 transitions. Word has length 129 [2019-09-07 22:12:51,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:12:51,473 INFO L475 AbstractCegarLoop]: Abstraction has 4140 states and 6053 transitions. [2019-09-07 22:12:51,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 22:12:51,474 INFO L276 IsEmpty]: Start isEmpty. Operand 4140 states and 6053 transitions. [2019-09-07 22:12:51,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-07 22:12:51,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:12:51,477 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:12:51,477 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:12:51,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:12:51,478 INFO L82 PathProgramCache]: Analyzing trace with hash 2139691167, now seen corresponding path program 1 times [2019-09-07 22:12:51,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:12:51,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:12:51,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:12:51,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:12:51,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:12:51,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:12:51,765 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:12:51,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:12:51,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 22:12:51,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 22:12:51,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 22:12:51,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 22:12:51,771 INFO L87 Difference]: Start difference. First operand 4140 states and 6053 transitions. Second operand 6 states. [2019-09-07 22:12:56,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:12:56,587 INFO L93 Difference]: Finished difference Result 12482 states and 19726 transitions. [2019-09-07 22:12:56,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 22:12:56,588 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2019-09-07 22:12:56,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:12:56,650 INFO L225 Difference]: With dead ends: 12482 [2019-09-07 22:12:56,650 INFO L226 Difference]: Without dead ends: 8348 [2019-09-07 22:12:56,667 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:12:56,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8348 states. [2019-09-07 22:12:56,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8348 to 8275. [2019-09-07 22:12:56,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8275 states. [2019-09-07 22:12:56,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8275 states to 8275 states and 12051 transitions. [2019-09-07 22:12:56,953 INFO L78 Accepts]: Start accepts. Automaton has 8275 states and 12051 transitions. Word has length 130 [2019-09-07 22:12:56,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:12:56,963 INFO L475 AbstractCegarLoop]: Abstraction has 8275 states and 12051 transitions. [2019-09-07 22:12:56,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 22:12:56,964 INFO L276 IsEmpty]: Start isEmpty. Operand 8275 states and 12051 transitions. [2019-09-07 22:12:56,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-07 22:12:56,969 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:12:56,970 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:12:56,970 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:12:56,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:12:56,971 INFO L82 PathProgramCache]: Analyzing trace with hash 187688817, now seen corresponding path program 1 times [2019-09-07 22:12:56,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:12:56,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:12:56,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:12:56,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:12:56,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:12:57,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:12:57,284 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 89 proven. 5 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-09-07 22:12:57,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:12:57,285 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 22:12:57,300 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 22:12:57,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:12:57,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:12:57,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:12:57,515 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 160 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:12:57,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:12:57,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 22:12:57,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 22:12:57,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 22:12:57,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:12:57,532 INFO L87 Difference]: Start difference. First operand 8275 states and 12051 transitions. Second operand 9 states. [2019-09-07 22:13:04,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:13:04,016 INFO L93 Difference]: Finished difference Result 20630 states and 30023 transitions. [2019-09-07 22:13:04,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 22:13:04,017 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 203 [2019-09-07 22:13:04,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:13:04,077 INFO L225 Difference]: With dead ends: 20630 [2019-09-07 22:13:04,077 INFO L226 Difference]: Without dead ends: 11062 [2019-09-07 22:13:04,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2019-09-07 22:13:04,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11062 states. [2019-09-07 22:13:04,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11062 to 9699. [2019-09-07 22:13:04,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9699 states. [2019-09-07 22:13:04,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9699 states to 9699 states and 12440 transitions. [2019-09-07 22:13:04,365 INFO L78 Accepts]: Start accepts. Automaton has 9699 states and 12440 transitions. Word has length 203 [2019-09-07 22:13:04,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:13:04,365 INFO L475 AbstractCegarLoop]: Abstraction has 9699 states and 12440 transitions. [2019-09-07 22:13:04,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 22:13:04,366 INFO L276 IsEmpty]: Start isEmpty. Operand 9699 states and 12440 transitions. [2019-09-07 22:13:04,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-07 22:13:04,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:13:04,370 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:13:04,370 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:13:04,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:13:04,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1277639297, now seen corresponding path program 1 times [2019-09-07 22:13:04,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:13:04,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:13:04,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:13:04,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:13:04,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:13:04,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:13:04,637 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-07 22:13:04,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:13:04,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 22:13:04,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 22:13:04,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 22:13:04,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 22:13:04,639 INFO L87 Difference]: Start difference. First operand 9699 states and 12440 transitions. Second operand 4 states. [2019-09-07 22:13:10,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:13:10,192 INFO L93 Difference]: Finished difference Result 26510 states and 36107 transitions. [2019-09-07 22:13:10,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 22:13:10,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 216 [2019-09-07 22:13:10,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:13:10,255 INFO L225 Difference]: With dead ends: 26510 [2019-09-07 22:13:10,255 INFO L226 Difference]: Without dead ends: 14962 [2019-09-07 22:13:10,290 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 22:13:10,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14962 states. [2019-09-07 22:13:10,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14962 to 12293. [2019-09-07 22:13:10,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12293 states. [2019-09-07 22:13:10,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12293 states to 12293 states and 14948 transitions. [2019-09-07 22:13:10,582 INFO L78 Accepts]: Start accepts. Automaton has 12293 states and 14948 transitions. Word has length 216 [2019-09-07 22:13:10,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:13:10,583 INFO L475 AbstractCegarLoop]: Abstraction has 12293 states and 14948 transitions. [2019-09-07 22:13:10,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 22:13:10,583 INFO L276 IsEmpty]: Start isEmpty. Operand 12293 states and 14948 transitions. [2019-09-07 22:13:10,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-07 22:13:10,590 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:13:10,590 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 22:13:10,590 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:13:10,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:13:10,591 INFO L82 PathProgramCache]: Analyzing trace with hash -733287618, now seen corresponding path program 1 times [2019-09-07 22:13:10,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:13:10,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:13:10,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:13:10,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:13:10,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:13:10,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:13:10,978 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 118 proven. 51 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-07 22:13:10,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:13:10,979 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 22:13:10,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:13:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:13:11,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:13:11,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:13:11,334 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-07 22:13:11,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 22:13:11,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2019-09-07 22:13:11,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 22:13:11,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 22:13:11,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-07 22:13:11,346 INFO L87 Difference]: Start difference. First operand 12293 states and 14948 transitions. Second operand 8 states. [2019-09-07 22:13:16,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:13:16,195 INFO L93 Difference]: Finished difference Result 24653 states and 30395 transitions. [2019-09-07 22:13:16,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 22:13:16,196 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 328 [2019-09-07 22:13:16,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:13:16,247 INFO L225 Difference]: With dead ends: 24653 [2019-09-07 22:13:16,247 INFO L226 Difference]: Without dead ends: 12366 [2019-09-07 22:13:16,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-09-07 22:13:16,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12366 states. [2019-09-07 22:13:16,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12366 to 12288. [2019-09-07 22:13:16,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12288 states. [2019-09-07 22:13:16,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12288 states to 12288 states and 14833 transitions. [2019-09-07 22:13:16,591 INFO L78 Accepts]: Start accepts. Automaton has 12288 states and 14833 transitions. Word has length 328 [2019-09-07 22:13:16,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:13:16,591 INFO L475 AbstractCegarLoop]: Abstraction has 12288 states and 14833 transitions. [2019-09-07 22:13:16,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 22:13:16,592 INFO L276 IsEmpty]: Start isEmpty. Operand 12288 states and 14833 transitions. [2019-09-07 22:13:16,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-09-07 22:13:16,601 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:13:16,603 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:13:16,603 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:13:16,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:13:16,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1819953734, now seen corresponding path program 1 times [2019-09-07 22:13:16,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:13:16,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:13:16,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:13:16,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:13:16,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:13:16,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:13:16,992 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 306 proven. 2 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-09-07 22:13:16,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:13:16,993 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 22:13:17,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:13:17,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:13:17,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:13:17,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:13:17,279 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 306 proven. 2 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-09-07 22:13:17,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:13:17,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-09-07 22:13:17,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 22:13:17,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 22:13:17,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 22:13:17,287 INFO L87 Difference]: Start difference. First operand 12288 states and 14833 transitions. Second operand 7 states. [2019-09-07 22:13:25,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:13:25,122 INFO L93 Difference]: Finished difference Result 42481 states and 54968 transitions. [2019-09-07 22:13:25,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 22:13:25,122 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 352 [2019-09-07 22:13:25,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:13:25,331 INFO L225 Difference]: With dead ends: 42481 [2019-09-07 22:13:25,331 INFO L226 Difference]: Without dead ends: 29283 [2019-09-07 22:13:25,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-09-07 22:13:25,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29283 states. [2019-09-07 22:13:25,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29283 to 24795. [2019-09-07 22:13:25,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24795 states. [2019-09-07 22:13:25,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24795 states to 24795 states and 30187 transitions. [2019-09-07 22:13:25,830 INFO L78 Accepts]: Start accepts. Automaton has 24795 states and 30187 transitions. Word has length 352 [2019-09-07 22:13:25,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:13:25,831 INFO L475 AbstractCegarLoop]: Abstraction has 24795 states and 30187 transitions. [2019-09-07 22:13:25,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 22:13:25,831 INFO L276 IsEmpty]: Start isEmpty. Operand 24795 states and 30187 transitions. [2019-09-07 22:13:25,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-09-07 22:13:25,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:13:25,844 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:13:25,845 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:13:25,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:13:25,845 INFO L82 PathProgramCache]: Analyzing trace with hash 935505692, now seen corresponding path program 1 times [2019-09-07 22:13:25,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:13:25,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:13:25,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:13:25,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:13:25,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:13:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:13:26,224 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 288 proven. 43 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-07 22:13:26,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:13:26,225 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 22:13:26,252 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 22:13:26,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:13:26,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 22:13:26,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:13:26,470 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2019-09-07 22:13:26,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 22:13:26,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2019-09-07 22:13:26,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 22:13:26,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 22:13:26,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 22:13:26,479 INFO L87 Difference]: Start difference. First operand 24795 states and 30187 transitions. Second operand 8 states. [2019-09-07 22:13:36,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:13:36,831 INFO L93 Difference]: Finished difference Result 74354 states and 94332 transitions. [2019-09-07 22:13:36,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 22:13:36,834 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 375 [2019-09-07 22:13:36,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:13:36,974 INFO L225 Difference]: With dead ends: 74354 [2019-09-07 22:13:36,974 INFO L226 Difference]: Without dead ends: 44593 [2019-09-07 22:13:37,026 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2019-09-07 22:13:37,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44593 states. [2019-09-07 22:13:37,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44593 to 41288. [2019-09-07 22:13:37,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41288 states. [2019-09-07 22:13:37,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41288 states to 41288 states and 49455 transitions. [2019-09-07 22:13:37,810 INFO L78 Accepts]: Start accepts. Automaton has 41288 states and 49455 transitions. Word has length 375 [2019-09-07 22:13:37,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:13:37,810 INFO L475 AbstractCegarLoop]: Abstraction has 41288 states and 49455 transitions. [2019-09-07 22:13:37,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 22:13:37,811 INFO L276 IsEmpty]: Start isEmpty. Operand 41288 states and 49455 transitions. [2019-09-07 22:13:37,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2019-09-07 22:13:37,845 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:13:37,846 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:13:37,846 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:13:37,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:13:37,846 INFO L82 PathProgramCache]: Analyzing trace with hash 388896715, now seen corresponding path program 1 times [2019-09-07 22:13:37,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:13:37,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:13:37,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:13:37,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:13:37,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:13:38,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:13:38,834 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 17 proven. 133 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2019-09-07 22:13:38,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:13:38,834 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 22:13:38,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:13:38,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:13:38,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-07 22:13:39,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:13:39,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:39,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:43,124 WARN L188 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 35 DAG size of output: 21 [2019-09-07 22:13:43,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-07 22:13:43,883 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 171 proven. 133 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-07 22:13:44,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:13:44,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2019-09-07 22:13:44,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 22:13:44,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 22:13:44,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2019-09-07 22:13:44,028 INFO L87 Difference]: Start difference. First operand 41288 states and 49455 transitions. Second operand 20 states. [2019-09-07 22:15:30,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:15:30,361 INFO L93 Difference]: Finished difference Result 141805 states and 181326 transitions. [2019-09-07 22:15:30,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-07 22:15:30,362 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 541 [2019-09-07 22:15:30,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:15:30,754 INFO L225 Difference]: With dead ends: 141805 [2019-09-07 22:15:30,754 INFO L226 Difference]: Without dead ends: 100036 [2019-09-07 22:15:30,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 600 GetRequests, 539 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1196 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=842, Invalid=3064, Unknown=0, NotChecked=0, Total=3906 [2019-09-07 22:15:30,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100036 states. [2019-09-07 22:15:34,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100036 to 90342. [2019-09-07 22:15:34,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90342 states. [2019-09-07 22:15:34,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90342 states to 90342 states and 115946 transitions. [2019-09-07 22:15:34,537 INFO L78 Accepts]: Start accepts. Automaton has 90342 states and 115946 transitions. Word has length 541 [2019-09-07 22:15:34,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:15:34,538 INFO L475 AbstractCegarLoop]: Abstraction has 90342 states and 115946 transitions. [2019-09-07 22:15:34,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 22:15:34,539 INFO L276 IsEmpty]: Start isEmpty. Operand 90342 states and 115946 transitions. [2019-09-07 22:15:34,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2019-09-07 22:15:34,663 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:15:34,664 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:15:34,664 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:15:34,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:15:34,665 INFO L82 PathProgramCache]: Analyzing trace with hash -527888100, now seen corresponding path program 1 times [2019-09-07 22:15:34,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:15:34,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:15:34,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:15:34,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:15:34,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:15:34,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:15:35,626 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 190 proven. 2 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2019-09-07 22:15:35,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:15:35,627 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) [2019-09-07 22:15:35,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:15:35,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:15:35,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 983 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-07 22:15:35,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:15:36,077 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 372 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-09-07 22:15:36,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 22:15:36,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2019-09-07 22:15:36,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 22:15:36,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 22:15:36,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 22:15:36,085 INFO L87 Difference]: Start difference. First operand 90342 states and 115946 transitions. Second operand 3 states. [2019-09-07 22:15:40,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:15:40,021 INFO L93 Difference]: Finished difference Result 187145 states and 241977 transitions. [2019-09-07 22:15:40,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 22:15:40,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 687 [2019-09-07 22:15:40,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:15:40,304 INFO L225 Difference]: With dead ends: 187145 [2019-09-07 22:15:40,304 INFO L226 Difference]: Without dead ends: 98558 [2019-09-07 22:15:40,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 689 GetRequests, 688 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 22:15:40,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98558 states. [2019-09-07 22:15:41,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98558 to 96812. [2019-09-07 22:15:41,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96812 states. [2019-09-07 22:15:45,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96812 states to 96812 states and 122946 transitions. [2019-09-07 22:15:45,517 INFO L78 Accepts]: Start accepts. Automaton has 96812 states and 122946 transitions. Word has length 687 [2019-09-07 22:15:45,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:15:45,518 INFO L475 AbstractCegarLoop]: Abstraction has 96812 states and 122946 transitions. [2019-09-07 22:15:45,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 22:15:45,518 INFO L276 IsEmpty]: Start isEmpty. Operand 96812 states and 122946 transitions. [2019-09-07 22:15:45,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 714 [2019-09-07 22:15:45,672 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:15:45,673 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:15:45,673 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:15:45,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:15:45,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1657361263, now seen corresponding path program 1 times [2019-09-07 22:15:45,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:15:45,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:15:45,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:15:45,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:15:45,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:15:45,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:15:48,147 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 431 proven. 164 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-07 22:15:48,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:15:48,147 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 22:15:48,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:15:48,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:15:48,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 1006 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 22:15:48,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:15:48,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:15:48,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:15:48,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:15:48,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:15:48,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:15:48,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:15:48,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:15:48,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:15:48,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:15:48,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:15:48,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:15:48,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:15:48,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:15:48,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:15:50,373 WARN L188 SmtUtils]: Spent 1.82 s on a formula simplification. DAG size of input: 199 DAG size of output: 39 [2019-09-07 22:15:50,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:15:50,701 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 417 proven. 2 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-09-07 22:15:50,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:15:50,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5] total 17 [2019-09-07 22:15:50,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 22:15:50,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 22:15:50,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-09-07 22:15:50,709 INFO L87 Difference]: Start difference. First operand 96812 states and 122946 transitions. Second operand 17 states. [2019-09-07 22:16:12,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:16:12,461 INFO L93 Difference]: Finished difference Result 202447 states and 259176 transitions. [2019-09-07 22:16:12,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-07 22:16:12,461 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 713 [2019-09-07 22:16:12,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:16:12,738 INFO L225 Difference]: With dead ends: 202447 [2019-09-07 22:16:12,738 INFO L226 Difference]: Without dead ends: 107390 [2019-09-07 22:16:12,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 811 GetRequests, 753 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=639, Invalid=2783, Unknown=0, NotChecked=0, Total=3422 [2019-09-07 22:16:12,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107390 states. [2019-09-07 22:16:14,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107390 to 105620. [2019-09-07 22:16:14,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105620 states. [2019-09-07 22:16:14,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105620 states to 105620 states and 133195 transitions. [2019-09-07 22:16:14,251 INFO L78 Accepts]: Start accepts. Automaton has 105620 states and 133195 transitions. Word has length 713 [2019-09-07 22:16:14,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:16:14,251 INFO L475 AbstractCegarLoop]: Abstraction has 105620 states and 133195 transitions. [2019-09-07 22:16:14,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 22:16:14,252 INFO L276 IsEmpty]: Start isEmpty. Operand 105620 states and 133195 transitions. [2019-09-07 22:16:14,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2019-09-07 22:16:14,311 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:16:14,312 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:16:14,312 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:16:14,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:16:14,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1729877886, now seen corresponding path program 1 times [2019-09-07 22:16:14,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:16:14,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:16:14,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:16:14,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:16:14,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:16:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:16:15,098 WARN L188 SmtUtils]: Spent 478.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-09-07 22:16:15,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1052 backedges. 393 proven. 154 refuted. 0 times theorem prover too weak. 505 trivial. 0 not checked. [2019-09-07 22:16:15,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:16:15,342 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:16:15,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:16:15,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:16:15,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 1060 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 22:16:15,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:16:15,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:16:16,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1052 backedges. 736 proven. 6 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-09-07 22:16:16,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:16:16,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2019-09-07 22:16:16,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 22:16:16,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 22:16:16,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-07 22:16:16,245 INFO L87 Difference]: Start difference. First operand 105620 states and 133195 transitions. Second operand 11 states. [2019-09-07 22:16:45,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:16:45,292 INFO L93 Difference]: Finished difference Result 287608 states and 413564 transitions. [2019-09-07 22:16:45,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-09-07 22:16:45,293 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 728 [2019-09-07 22:16:45,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:16:46,387 INFO L225 Difference]: With dead ends: 287608 [2019-09-07 22:16:46,387 INFO L226 Difference]: Without dead ends: 179302 [2019-09-07 22:16:49,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 894 GetRequests, 803 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3194 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1414, Invalid=7142, Unknown=0, NotChecked=0, Total=8556 [2019-09-07 22:16:50,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179302 states. [2019-09-07 22:16:53,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179302 to 164957. [2019-09-07 22:16:53,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164957 states. [2019-09-07 22:16:53,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164957 states to 164957 states and 214048 transitions. [2019-09-07 22:16:53,446 INFO L78 Accepts]: Start accepts. Automaton has 164957 states and 214048 transitions. Word has length 728 [2019-09-07 22:16:53,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:16:53,447 INFO L475 AbstractCegarLoop]: Abstraction has 164957 states and 214048 transitions. [2019-09-07 22:16:53,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 22:16:53,447 INFO L276 IsEmpty]: Start isEmpty. Operand 164957 states and 214048 transitions. [2019-09-07 22:16:53,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2019-09-07 22:16:53,565 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:16:53,566 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:16:53,566 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:16:53,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:16:53,568 INFO L82 PathProgramCache]: Analyzing trace with hash 822849862, now seen corresponding path program 1 times [2019-09-07 22:16:53,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:16:53,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:16:53,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:16:53,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:16:53,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:16:53,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:16:54,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1068 backedges. 238 proven. 656 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2019-09-07 22:16:54,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:16:54,302 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:16:54,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:16:54,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:16:54,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 1067 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 22:16:54,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:16:54,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:16:54,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:16:54,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:16:55,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1068 backedges. 690 proven. 2 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2019-09-07 22:16:55,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:16:55,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-09-07 22:16:55,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 22:16:55,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 22:16:55,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-09-07 22:16:55,437 INFO L87 Difference]: Start difference. First operand 164957 states and 214048 transitions. Second operand 16 states. [2019-09-07 22:18:15,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:18:15,140 INFO L93 Difference]: Finished difference Result 432002 states and 638273 transitions. [2019-09-07 22:18:15,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-07 22:18:15,141 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 733 [2019-09-07 22:18:15,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:18:17,254 INFO L225 Difference]: With dead ends: 432002 [2019-09-07 22:18:17,254 INFO L226 Difference]: Without dead ends: 270116 [2019-09-07 22:18:17,464 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 882 GetRequests, 793 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2817 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1116, Invalid=7074, Unknown=0, NotChecked=0, Total=8190 [2019-09-07 22:18:17,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270116 states. [2019-09-07 22:18:26,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270116 to 251869. [2019-09-07 22:18:26,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251869 states. [2019-09-07 22:18:28,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251869 states to 251869 states and 316924 transitions. [2019-09-07 22:18:28,023 INFO L78 Accepts]: Start accepts. Automaton has 251869 states and 316924 transitions. Word has length 733 [2019-09-07 22:18:28,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:18:28,024 INFO L475 AbstractCegarLoop]: Abstraction has 251869 states and 316924 transitions. [2019-09-07 22:18:28,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 22:18:28,024 INFO L276 IsEmpty]: Start isEmpty. Operand 251869 states and 316924 transitions. [2019-09-07 22:18:28,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 754 [2019-09-07 22:18:28,094 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:18:28,094 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:18:28,095 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:18:28,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:18:28,095 INFO L82 PathProgramCache]: Analyzing trace with hash -2448018, now seen corresponding path program 1 times [2019-09-07 22:18:28,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:18:28,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:18:28,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:18:28,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:18:28,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:18:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:18:33,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1088 backedges. 235 proven. 600 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-09-07 22:18:33,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:18:33,639 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:18:33,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:18:33,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:18:33,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 1088 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 22:18:33,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:18:33,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:18:33,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:18:34,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:18:34,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:18:34,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:18:34,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-07 22:18:34,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1088 backedges. 820 proven. 185 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-09-07 22:18:34,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:18:34,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2019-09-07 22:18:34,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 22:18:34,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 22:18:34,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2019-09-07 22:18:34,792 INFO L87 Difference]: Start difference. First operand 251869 states and 316924 transitions. Second operand 23 states. [2019-09-07 22:18:37,410 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 49 [2019-09-07 22:18:38,387 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-09-07 22:18:38,816 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-07 22:18:40,139 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-07 22:18:41,054 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-09-07 22:18:42,528 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-07 22:18:42,812 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-09-07 22:18:43,386 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-09-07 22:18:43,623 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-09-07 22:18:44,250 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-07 22:18:44,928 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-09-07 22:18:45,429 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-07 22:18:45,829 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-09-07 22:18:46,110 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-07 22:18:46,262 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-07 22:18:46,524 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-09-07 22:18:47,126 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-07 22:18:47,380 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-09-07 22:18:47,710 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-07 22:18:47,921 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-07 22:18:48,455 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-07 22:18:49,144 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-09-07 22:18:51,458 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-09-07 22:18:51,970 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-09-07 22:18:52,395 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-07 22:18:53,009 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-07 22:18:53,346 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-07 22:18:54,759 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 68 [2019-09-07 22:18:55,558 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-07 22:18:56,707 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-07 22:18:57,380 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2019-09-07 22:18:57,917 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-09-07 22:18:58,518 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2019-09-07 22:18:59,026 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-07 22:19:00,250 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-07 22:19:00,810 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-09-07 22:19:01,847 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-09-07 22:19:03,811 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-07 22:19:06,965 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-07 22:19:08,064 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-07 22:19:10,887 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-07 22:19:11,634 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-07 22:19:11,793 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-07 22:19:12,439 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-09-07 22:19:14,470 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-09-07 22:19:14,913 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 63 [2019-09-07 22:19:18,988 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-07 22:19:19,978 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-07 22:19:20,479 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-09-07 22:19:20,684 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-09-07 22:19:21,368 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-07 22:19:23,793 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-09-07 22:19:26,838 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-09-07 22:19:27,827 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 51 [2019-09-07 22:19:30,480 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-07 22:19:30,712 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-07 22:19:31,042 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-09-07 22:19:32,188 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2019-09-07 22:19:33,191 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-07 22:19:35,107 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-07 22:19:35,471 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2019-09-07 22:19:35,856 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-09-07 22:19:37,472 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-07 22:19:38,062 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-09-07 22:19:38,493 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-09-07 22:19:38,975 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-09-07 22:19:39,430 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2019-09-07 22:19:39,744 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-09-07 22:19:42,003 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-07 22:19:45,385 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2019-09-07 22:19:45,649 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-07 22:19:46,797 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-07 22:19:50,517 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-09-07 22:19:50,812 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2019-09-07 22:19:51,974 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-07 22:19:52,715 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-09-07 22:19:58,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:19:58,332 INFO L93 Difference]: Finished difference Result 608027 states and 755244 transitions. [2019-09-07 22:19:58,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 226 states. [2019-09-07 22:19:58,332 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 753 [2019-09-07 22:19:58,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:19:59,569 INFO L225 Difference]: With dead ends: 608027 [2019-09-07 22:19:59,569 INFO L226 Difference]: Without dead ends: 362383 [2019-09-07 22:19:59,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1168 GetRequests, 924 SyntacticMatches, 1 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25112 ImplicationChecksByTransitivity, 25.3s TimeCoverageRelationStatistics Valid=7313, Invalid=52467, Unknown=0, NotChecked=0, Total=59780 [2019-09-07 22:20:00,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362383 states. [2019-09-07 22:20:05,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362383 to 339513. [2019-09-07 22:20:05,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339513 states. [2019-09-07 22:20:14,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339513 states to 339513 states and 412306 transitions. [2019-09-07 22:20:14,575 INFO L78 Accepts]: Start accepts. Automaton has 339513 states and 412306 transitions. Word has length 753 [2019-09-07 22:20:14,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:20:14,576 INFO L475 AbstractCegarLoop]: Abstraction has 339513 states and 412306 transitions. [2019-09-07 22:20:14,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-07 22:20:14,576 INFO L276 IsEmpty]: Start isEmpty. Operand 339513 states and 412306 transitions. [2019-09-07 22:20:14,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 975 [2019-09-07 22:20:14,704 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:20:14,704 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:20:14,705 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:20:14,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:20:14,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1727505873, now seen corresponding path program 1 times [2019-09-07 22:20:14,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:20:14,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:20:14,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:20:14,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:20:14,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:20:14,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:20:16,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1371 backedges. 507 proven. 285 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2019-09-07 22:20:16,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:20:16,352 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:20:16,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:20:16,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:20:16,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 1303 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 22:20:16,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:20:20,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1371 backedges. 543 proven. 2 refuted. 0 times theorem prover too weak. 826 trivial. 0 not checked. [2019-09-07 22:20:20,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:20:20,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-09-07 22:20:20,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 22:20:20,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 22:20:20,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-07 22:20:20,984 INFO L87 Difference]: Start difference. First operand 339513 states and 412306 transitions. Second operand 8 states. [2019-09-07 22:20:34,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:20:34,471 INFO L93 Difference]: Finished difference Result 655794 states and 795104 transitions. [2019-09-07 22:20:34,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-07 22:20:34,472 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 974 [2019-09-07 22:20:34,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:20:35,578 INFO L225 Difference]: With dead ends: 655794 [2019-09-07 22:20:35,578 INFO L226 Difference]: Without dead ends: 317593 [2019-09-07 22:20:35,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1016 GetRequests, 989 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=652, Unknown=0, NotChecked=0, Total=812 [2019-09-07 22:20:36,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317593 states. [2019-09-07 22:20:45,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317593 to 305807. [2019-09-07 22:20:45,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305807 states. [2019-09-07 22:20:46,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305807 states to 305807 states and 363624 transitions. [2019-09-07 22:20:46,521 INFO L78 Accepts]: Start accepts. Automaton has 305807 states and 363624 transitions. Word has length 974 [2019-09-07 22:20:46,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:20:46,521 INFO L475 AbstractCegarLoop]: Abstraction has 305807 states and 363624 transitions. [2019-09-07 22:20:46,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 22:20:46,521 INFO L276 IsEmpty]: Start isEmpty. Operand 305807 states and 363624 transitions. [2019-09-07 22:20:46,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1021 [2019-09-07 22:20:46,657 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:20:46,658 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:20:46,658 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:20:46,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:20:46,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1864873219, now seen corresponding path program 1 times [2019-09-07 22:20:46,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:20:46,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:20:46,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:20:46,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:20:46,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:20:46,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:20:48,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1672 backedges. 668 proven. 2 refuted. 0 times theorem prover too weak. 1002 trivial. 0 not checked. [2019-09-07 22:20:48,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:20:48,603 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:20:48,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:20:49,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:20:49,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 1389 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 22:20:49,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:20:49,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:20:49,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:22:14,039 WARN L188 SmtUtils]: Spent 1.30 m on a formula simplification. DAG size of input: 1023 DAG size of output: 49 [2019-09-07 22:22:16,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:22:17,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1672 backedges. 1061 proven. 83 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-09-07 22:22:17,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:22:17,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9] total 12 [2019-09-07 22:22:17,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 22:22:17,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 22:22:17,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=108, Unknown=1, NotChecked=0, Total=132 [2019-09-07 22:22:17,026 INFO L87 Difference]: Start difference. First operand 305807 states and 363624 transitions. Second operand 12 states. [2019-09-07 22:22:26,506 WARN L188 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 52 [2019-09-07 22:22:52,756 WARN L188 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 53 [2019-09-07 22:23:12,599 WARN L188 SmtUtils]: Spent 381.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-09-07 22:23:13,900 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-09-07 22:23:21,606 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-09-07 22:24:06,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:24:06,807 INFO L93 Difference]: Finished difference Result 682758 states and 816002 transitions. [2019-09-07 22:24:06,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-09-07 22:24:06,808 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 1020 [2019-09-07 22:24:06,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:24:08,630 INFO L225 Difference]: With dead ends: 682758 [2019-09-07 22:24:08,630 INFO L226 Difference]: Without dead ends: 382346 [2019-09-07 22:24:08,888 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1155 GetRequests, 1075 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2177 ImplicationChecksByTransitivity, 93.7s TimeCoverageRelationStatistics Valid=862, Invalid=5615, Unknown=3, NotChecked=0, Total=6480 [2019-09-07 22:24:09,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382346 states. [2019-09-07 22:24:16,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382346 to 372689. [2019-09-07 22:24:16,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372689 states. [2019-09-07 22:24:17,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372689 states to 372689 states and 441162 transitions. [2019-09-07 22:24:17,271 INFO L78 Accepts]: Start accepts. Automaton has 372689 states and 441162 transitions. Word has length 1020 [2019-09-07 22:24:17,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:24:17,272 INFO L475 AbstractCegarLoop]: Abstraction has 372689 states and 441162 transitions. [2019-09-07 22:24:17,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 22:24:17,272 INFO L276 IsEmpty]: Start isEmpty. Operand 372689 states and 441162 transitions. [2019-09-07 22:24:17,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1024 [2019-09-07 22:24:17,424 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:24:17,425 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:24:17,425 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:24:17,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:24:17,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1295005395, now seen corresponding path program 1 times [2019-09-07 22:24:17,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:24:17,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:24:17,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:24:17,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:24:17,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:24:17,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:24:24,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1929 backedges. 1156 proven. 71 refuted. 0 times theorem prover too weak. 702 trivial. 0 not checked. [2019-09-07 22:24:24,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:24:24,541 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:24:24,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:24:24,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:24:24,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 1392 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 22:24:24,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:24:24,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:24:25,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1929 backedges. 1156 proven. 6 refuted. 0 times theorem prover too weak. 767 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 22:24:25,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:24:25,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2019-09-07 22:24:25,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 22:24:25,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 22:24:25,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-07 22:24:25,404 INFO L87 Difference]: Start difference. First operand 372689 states and 441162 transitions. Second operand 10 states. [2019-09-07 22:24:37,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:24:37,095 INFO L93 Difference]: Finished difference Result 719456 states and 832968 transitions. [2019-09-07 22:24:37,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 22:24:37,095 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 1023 [2019-09-07 22:24:37,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:24:37,918 INFO L225 Difference]: With dead ends: 719456 [2019-09-07 22:24:37,918 INFO L226 Difference]: Without dead ends: 349977 [2019-09-07 22:24:38,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1066 GetRequests, 1040 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2019-09-07 22:24:38,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349977 states. [2019-09-07 22:24:49,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349977 to 276470. [2019-09-07 22:24:49,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276470 states. [2019-09-07 22:24:49,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276470 states to 276470 states and 310504 transitions. [2019-09-07 22:24:49,720 INFO L78 Accepts]: Start accepts. Automaton has 276470 states and 310504 transitions. Word has length 1023 [2019-09-07 22:24:49,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:24:49,721 INFO L475 AbstractCegarLoop]: Abstraction has 276470 states and 310504 transitions. [2019-09-07 22:24:49,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 22:24:49,722 INFO L276 IsEmpty]: Start isEmpty. Operand 276470 states and 310504 transitions. [2019-09-07 22:24:49,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1038 [2019-09-07 22:24:49,850 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:24:49,850 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:24:49,851 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:24:49,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:24:49,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1567978296, now seen corresponding path program 1 times [2019-09-07 22:24:49,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:24:49,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:24:49,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:24:49,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:24:49,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:24:49,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:24:51,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1537 backedges. 801 proven. 43 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2019-09-07 22:24:51,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:24:51,958 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:24:51,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:24:52,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:24:52,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 1372 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 22:24:52,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:24:52,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:24:52,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:24:52,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:24:52,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms