java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem13_label27.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 19:36:29,438 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 19:36:29,440 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 19:36:29,452 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 19:36:29,452 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 19:36:29,453 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 19:36:29,455 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 19:36:29,456 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 19:36:29,458 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 19:36:29,459 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 19:36:29,460 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 19:36:29,461 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 19:36:29,461 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 19:36:29,462 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 19:36:29,463 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 19:36:29,464 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 19:36:29,465 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 19:36:29,466 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 19:36:29,468 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 19:36:29,470 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 19:36:29,471 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 19:36:29,472 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 19:36:29,473 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 19:36:29,474 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 19:36:29,476 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 19:36:29,477 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 19:36:29,477 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 19:36:29,478 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 19:36:29,478 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 19:36:29,479 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 19:36:29,479 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 19:36:29,480 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 19:36:29,481 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 19:36:29,482 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 19:36:29,483 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 19:36:29,483 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 19:36:29,484 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 19:36:29,484 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 19:36:29,484 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 19:36:29,485 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 19:36:29,486 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 19:36:29,486 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 19:36:29,501 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 19:36:29,501 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 19:36:29,502 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 19:36:29,503 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 19:36:29,503 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 19:36:29,503 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 19:36:29,503 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 19:36:29,503 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 19:36:29,504 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 19:36:29,504 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 19:36:29,504 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 19:36:29,504 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 19:36:29,504 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 19:36:29,505 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 19:36:29,505 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 19:36:29,505 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 19:36:29,505 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 19:36:29,505 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 19:36:29,506 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 19:36:29,506 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 19:36:29,506 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 19:36:29,506 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 19:36:29,507 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 19:36:29,507 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 19:36:29,507 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 19:36:29,507 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 19:36:29,507 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 19:36:29,508 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 19:36:29,508 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 19:36:29,535 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 19:36:29,547 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 19:36:29,551 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 19:36:29,552 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 19:36:29,552 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 19:36:29,553 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label27.c [2019-09-07 19:36:29,608 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edcb371ee/1b4e01b6b61c48a89ceda011ce5ddb07/FLAGc6924e043 [2019-09-07 19:36:30,380 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 19:36:30,381 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label27.c [2019-09-07 19:36:30,423 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edcb371ee/1b4e01b6b61c48a89ceda011ce5ddb07/FLAGc6924e043 [2019-09-07 19:36:30,446 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edcb371ee/1b4e01b6b61c48a89ceda011ce5ddb07 [2019-09-07 19:36:30,459 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 19:36:30,460 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 19:36:30,464 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 19:36:30,464 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 19:36:30,468 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 19:36:30,470 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:36:30" (1/1) ... [2019-09-07 19:36:30,473 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fbe1c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:36:30, skipping insertion in model container [2019-09-07 19:36:30,474 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:36:30" (1/1) ... [2019-09-07 19:36:30,481 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 19:36:30,656 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 19:36:32,246 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 19:36:32,252 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 19:36:32,930 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 19:36:32,969 INFO L192 MainTranslator]: Completed translation [2019-09-07 19:36:32,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:36:32 WrapperNode [2019-09-07 19:36:32,969 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 19:36:32,970 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 19:36:32,971 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 19:36:32,971 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 19:36:32,987 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:36:32" (1/1) ... [2019-09-07 19:36:32,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:36:32" (1/1) ... [2019-09-07 19:36:33,061 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:36:32" (1/1) ... [2019-09-07 19:36:33,063 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:36:32" (1/1) ... [2019-09-07 19:36:33,220 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:36:32" (1/1) ... [2019-09-07 19:36:33,259 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:36:32" (1/1) ... [2019-09-07 19:36:33,292 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:36:32" (1/1) ... [2019-09-07 19:36:33,326 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 19:36:33,326 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 19:36:33,326 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 19:36:33,327 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 19:36:33,328 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:36:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 19:36:33,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 19:36:33,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 19:36:33,403 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 19:36:33,403 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 19:36:33,403 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2019-09-07 19:36:33,403 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2019-09-07 19:36:33,404 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 19:36:33,404 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 19:36:33,405 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 19:36:33,405 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2019-09-07 19:36:33,406 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2019-09-07 19:36:33,406 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 19:36:33,406 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 19:36:33,407 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 19:36:33,408 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 19:36:33,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 19:36:33,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 19:36:40,023 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 19:36:40,023 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 19:36:40,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:36:40 BoogieIcfgContainer [2019-09-07 19:36:40,031 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 19:36:40,032 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 19:36:40,033 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 19:36:40,036 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 19:36:40,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 07:36:30" (1/3) ... [2019-09-07 19:36:40,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@473ed373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:36:40, skipping insertion in model container [2019-09-07 19:36:40,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:36:32" (2/3) ... [2019-09-07 19:36:40,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@473ed373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:36:40, skipping insertion in model container [2019-09-07 19:36:40,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:36:40" (3/3) ... [2019-09-07 19:36:40,047 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem13_label27.c [2019-09-07 19:36:40,057 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 19:36:40,065 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 19:36:40,083 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 19:36:40,125 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 19:36:40,125 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 19:36:40,126 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 19:36:40,126 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 19:36:40,126 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 19:36:40,126 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 19:36:40,126 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 19:36:40,126 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 19:36:40,127 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 19:36:40,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states. [2019-09-07 19:36:40,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-07 19:36:40,175 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:36:40,177 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 19:36:40,179 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:36:40,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:36:40,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1839105400, now seen corresponding path program 1 times [2019-09-07 19:36:40,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:36:40,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:36:40,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:36:40,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:36:40,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:36:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:36:40,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:36:40,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:36:40,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 19:36:40,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 19:36:40,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 19:36:40,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:36:40,559 INFO L87 Difference]: Start difference. First operand 1119 states. Second operand 3 states. [2019-09-07 19:36:46,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:36:46,742 INFO L93 Difference]: Finished difference Result 3101 states and 5726 transitions. [2019-09-07 19:36:46,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 19:36:46,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-09-07 19:36:46,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:36:46,779 INFO L225 Difference]: With dead ends: 3101 [2019-09-07 19:36:46,780 INFO L226 Difference]: Without dead ends: 1920 [2019-09-07 19:36:46,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:36:46,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1920 states. [2019-09-07 19:36:46,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1920 to 1903. [2019-09-07 19:36:46,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1903 states. [2019-09-07 19:36:46,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1903 states to 1903 states and 3344 transitions. [2019-09-07 19:36:46,969 INFO L78 Accepts]: Start accepts. Automaton has 1903 states and 3344 transitions. Word has length 51 [2019-09-07 19:36:46,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:36:46,970 INFO L475 AbstractCegarLoop]: Abstraction has 1903 states and 3344 transitions. [2019-09-07 19:36:46,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 19:36:46,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1903 states and 3344 transitions. [2019-09-07 19:36:46,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-07 19:36:46,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:36:46,988 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] [2019-09-07 19:36:46,988 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:36:46,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:36:46,989 INFO L82 PathProgramCache]: Analyzing trace with hash -25289727, now seen corresponding path program 1 times [2019-09-07 19:36:46,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:36:46,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:36:46,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:36:46,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:36:46,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:36:47,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:36:47,273 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 19:36:47,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:36:47,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 19:36:47,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 19:36:47,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 19:36:47,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 19:36:47,276 INFO L87 Difference]: Start difference. First operand 1903 states and 3344 transitions. Second operand 5 states. [2019-09-07 19:36:55,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:36:55,184 INFO L93 Difference]: Finished difference Result 5517 states and 9839 transitions. [2019-09-07 19:36:55,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:36:55,187 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-09-07 19:36:55,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:36:55,210 INFO L225 Difference]: With dead ends: 5517 [2019-09-07 19:36:55,211 INFO L226 Difference]: Without dead ends: 3620 [2019-09-07 19:36:55,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 19:36:55,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3620 states. [2019-09-07 19:36:55,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3620 to 3590. [2019-09-07 19:36:55,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3590 states. [2019-09-07 19:36:55,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3590 states to 3590 states and 5678 transitions. [2019-09-07 19:36:55,328 INFO L78 Accepts]: Start accepts. Automaton has 3590 states and 5678 transitions. Word has length 120 [2019-09-07 19:36:55,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:36:55,329 INFO L475 AbstractCegarLoop]: Abstraction has 3590 states and 5678 transitions. [2019-09-07 19:36:55,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 19:36:55,329 INFO L276 IsEmpty]: Start isEmpty. Operand 3590 states and 5678 transitions. [2019-09-07 19:36:55,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-07 19:36:55,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:36:55,332 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] [2019-09-07 19:36:55,332 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:36:55,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:36:55,333 INFO L82 PathProgramCache]: Analyzing trace with hash -821167643, now seen corresponding path program 1 times [2019-09-07 19:36:55,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:36:55,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:36:55,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:36:55,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:36:55,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:36:55,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:36:55,531 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 19:36:55,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:36:55,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 19:36:55,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 19:36:55,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 19:36:55,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 19:36:55,533 INFO L87 Difference]: Start difference. First operand 3590 states and 5678 transitions. Second operand 5 states. [2019-09-07 19:37:03,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:37:03,841 INFO L93 Difference]: Finished difference Result 10784 states and 17551 transitions. [2019-09-07 19:37:03,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 19:37:03,843 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2019-09-07 19:37:03,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:37:03,884 INFO L225 Difference]: With dead ends: 10784 [2019-09-07 19:37:03,885 INFO L226 Difference]: Without dead ends: 7200 [2019-09-07 19:37:03,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 19:37:03,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7200 states. [2019-09-07 19:37:04,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7200 to 7049. [2019-09-07 19:37:04,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7049 states. [2019-09-07 19:37:04,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7049 states to 7049 states and 10340 transitions. [2019-09-07 19:37:04,227 INFO L78 Accepts]: Start accepts. Automaton has 7049 states and 10340 transitions. Word has length 122 [2019-09-07 19:37:04,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:37:04,228 INFO L475 AbstractCegarLoop]: Abstraction has 7049 states and 10340 transitions. [2019-09-07 19:37:04,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 19:37:04,228 INFO L276 IsEmpty]: Start isEmpty. Operand 7049 states and 10340 transitions. [2019-09-07 19:37:04,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-07 19:37:04,230 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:37:04,231 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:37:04,231 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:37:04,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:37:04,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1162882097, now seen corresponding path program 1 times [2019-09-07 19:37:04,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:37:04,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:37:04,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:37:04,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:37:04,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:37:04,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:37:04,373 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 19:37:04,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:37:04,374 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 19:37:04,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:37:04,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:37:04,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 19:37:04,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:37:04,603 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 19:37:04,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:37:04,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-09-07 19:37:04,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:37:04,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:37:04,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:37:04,617 INFO L87 Difference]: Start difference. First operand 7049 states and 10340 transitions. Second operand 6 states. [2019-09-07 19:37:17,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:37:17,249 INFO L93 Difference]: Finished difference Result 27586 states and 43130 transitions. [2019-09-07 19:37:17,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 19:37:17,250 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-09-07 19:37:17,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:37:17,351 INFO L225 Difference]: With dead ends: 27586 [2019-09-07 19:37:17,351 INFO L226 Difference]: Without dead ends: 20543 [2019-09-07 19:37:17,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-09-07 19:37:17,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20543 states. [2019-09-07 19:37:17,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20543 to 20390. [2019-09-07 19:37:17,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20390 states. [2019-09-07 19:37:18,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20390 states to 20390 states and 29330 transitions. [2019-09-07 19:37:18,001 INFO L78 Accepts]: Start accepts. Automaton has 20390 states and 29330 transitions. Word has length 144 [2019-09-07 19:37:18,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:37:18,003 INFO L475 AbstractCegarLoop]: Abstraction has 20390 states and 29330 transitions. [2019-09-07 19:37:18,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:37:18,003 INFO L276 IsEmpty]: Start isEmpty. Operand 20390 states and 29330 transitions. [2019-09-07 19:37:18,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-07 19:37:18,009 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:37:18,009 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:37:18,010 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:37:18,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:37:18,010 INFO L82 PathProgramCache]: Analyzing trace with hash 655017647, now seen corresponding path program 1 times [2019-09-07 19:37:18,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:37:18,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:37:18,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:37:18,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:37:18,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:37:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:37:18,239 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 88 proven. 67 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 19:37:18,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:37:18,240 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 19:37:18,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:37:18,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:37:18,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 19:37:18,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:37:18,455 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-07 19:37:18,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:37:18,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 19:37:18,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:37:18,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:37:18,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:37:18,471 INFO L87 Difference]: Start difference. First operand 20390 states and 29330 transitions. Second operand 9 states. [2019-09-07 19:37:30,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:37:30,760 INFO L93 Difference]: Finished difference Result 62317 states and 98297 transitions. [2019-09-07 19:37:30,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 19:37:30,761 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 208 [2019-09-07 19:37:30,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:37:30,938 INFO L225 Difference]: With dead ends: 62317 [2019-09-07 19:37:30,939 INFO L226 Difference]: Without dead ends: 41933 [2019-09-07 19:37:31,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 219 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2019-09-07 19:37:31,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41933 states. [2019-09-07 19:37:31,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41933 to 41357. [2019-09-07 19:37:31,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41357 states. [2019-09-07 19:37:32,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41357 states to 41357 states and 60108 transitions. [2019-09-07 19:37:32,046 INFO L78 Accepts]: Start accepts. Automaton has 41357 states and 60108 transitions. Word has length 208 [2019-09-07 19:37:32,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:37:32,046 INFO L475 AbstractCegarLoop]: Abstraction has 41357 states and 60108 transitions. [2019-09-07 19:37:32,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:37:32,047 INFO L276 IsEmpty]: Start isEmpty. Operand 41357 states and 60108 transitions. [2019-09-07 19:37:32,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-07 19:37:32,055 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:37:32,055 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:37:32,056 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:37:32,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:37:32,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1695552652, now seen corresponding path program 1 times [2019-09-07 19:37:32,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:37:32,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:37:32,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:37:32,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:37:32,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:37:33,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:37:33,495 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 155 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:37:33,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:37:33,495 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) [2019-09-07 19:37:33,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:37:33,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:37:33,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:37:33,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:37:33,681 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 155 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:37:33,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:37:33,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:37:33,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:37:33,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:37:33,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:37:33,689 INFO L87 Difference]: Start difference. First operand 41357 states and 60108 transitions. Second operand 9 states. [2019-09-07 19:37:45,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:37:45,421 INFO L93 Difference]: Finished difference Result 151760 states and 245359 transitions. [2019-09-07 19:37:45,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 19:37:45,424 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 240 [2019-09-07 19:37:45,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:37:45,989 INFO L225 Difference]: With dead ends: 151760 [2019-09-07 19:37:45,989 INFO L226 Difference]: Without dead ends: 111212 [2019-09-07 19:37:46,135 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-09-07 19:37:46,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111212 states. [2019-09-07 19:37:50,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111212 to 107662. [2019-09-07 19:37:50,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107662 states. [2019-09-07 19:37:50,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107662 states to 107662 states and 156686 transitions. [2019-09-07 19:37:50,811 INFO L78 Accepts]: Start accepts. Automaton has 107662 states and 156686 transitions. Word has length 240 [2019-09-07 19:37:50,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:37:50,811 INFO L475 AbstractCegarLoop]: Abstraction has 107662 states and 156686 transitions. [2019-09-07 19:37:50,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:37:50,812 INFO L276 IsEmpty]: Start isEmpty. Operand 107662 states and 156686 transitions. [2019-09-07 19:37:50,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-07 19:37:50,820 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:37:50,821 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:37:50,821 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:37:50,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:37:50,822 INFO L82 PathProgramCache]: Analyzing trace with hash 10665635, now seen corresponding path program 1 times [2019-09-07 19:37:50,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:37:50,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:37:50,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:37:50,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:37:50,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:37:50,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:37:53,130 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 168 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:37:53,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:37:53,131 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 19:37:53,145 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 19:37:53,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:37:53,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:37:53,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:37:53,303 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 168 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 19:37:53,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:37:53,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:37:53,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:37:53,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:37:53,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:37:53,319 INFO L87 Difference]: Start difference. First operand 107662 states and 156686 transitions. Second operand 9 states. [2019-09-07 19:38:10,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:38:10,625 INFO L93 Difference]: Finished difference Result 261733 states and 426694 transitions. [2019-09-07 19:38:10,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 19:38:10,626 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 253 [2019-09-07 19:38:10,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:38:11,530 INFO L225 Difference]: With dead ends: 261733 [2019-09-07 19:38:11,531 INFO L226 Difference]: Without dead ends: 154880 [2019-09-07 19:38:11,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-07 19:38:11,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154880 states. [2019-09-07 19:38:15,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154880 to 152926. [2019-09-07 19:38:15,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152926 states. [2019-09-07 19:38:20,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152926 states to 152926 states and 241770 transitions. [2019-09-07 19:38:20,783 INFO L78 Accepts]: Start accepts. Automaton has 152926 states and 241770 transitions. Word has length 253 [2019-09-07 19:38:20,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:38:20,783 INFO L475 AbstractCegarLoop]: Abstraction has 152926 states and 241770 transitions. [2019-09-07 19:38:20,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:38:20,783 INFO L276 IsEmpty]: Start isEmpty. Operand 152926 states and 241770 transitions. [2019-09-07 19:38:20,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-09-07 19:38:20,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:38:20,793 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, 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] [2019-09-07 19:38:20,794 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:38:20,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:38:20,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1915420197, now seen corresponding path program 1 times [2019-09-07 19:38:20,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:38:20,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:38:20,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:38:20,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:38:20,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:38:20,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:38:21,118 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 131 proven. 151 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-07 19:38:21,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:38:21,118 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:38:21,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:38:21,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:38:21,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:38:21,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:38:21,262 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2019-09-07 19:38:21,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:38:21,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-09-07 19:38:21,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:38:21,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:38:21,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:38:21,267 INFO L87 Difference]: Start difference. First operand 152926 states and 241770 transitions. Second operand 9 states. [2019-09-07 19:38:37,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:38:37,050 INFO L93 Difference]: Finished difference Result 352780 states and 551862 transitions. [2019-09-07 19:38:37,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 19:38:37,050 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 292 [2019-09-07 19:38:37,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:38:37,727 INFO L225 Difference]: With dead ends: 352780 [2019-09-07 19:38:37,727 INFO L226 Difference]: Without dead ends: 199847 [2019-09-07 19:38:38,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 301 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-09-07 19:38:39,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199847 states. [2019-09-07 19:38:42,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199847 to 165884. [2019-09-07 19:38:42,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165884 states. [2019-09-07 19:38:43,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165884 states to 165884 states and 229808 transitions. [2019-09-07 19:38:43,025 INFO L78 Accepts]: Start accepts. Automaton has 165884 states and 229808 transitions. Word has length 292 [2019-09-07 19:38:43,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:38:43,026 INFO L475 AbstractCegarLoop]: Abstraction has 165884 states and 229808 transitions. [2019-09-07 19:38:43,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:38:43,026 INFO L276 IsEmpty]: Start isEmpty. Operand 165884 states and 229808 transitions. [2019-09-07 19:38:43,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-09-07 19:38:43,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:38:43,041 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, 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] [2019-09-07 19:38:43,042 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:38:43,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:38:43,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1794927675, now seen corresponding path program 1 times [2019-09-07 19:38:43,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:38:43,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:38:43,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:38:43,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:38:43,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:38:43,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:38:43,313 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 298 proven. 71 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-07 19:38:43,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:38:43,313 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:38:43,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:38:43,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:38:43,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:38:43,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:38:43,506 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 303 proven. 2 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-09-07 19:38:43,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:38:43,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:38:43,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:38:43,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:38:43,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:38:43,512 INFO L87 Difference]: Start difference. First operand 165884 states and 229808 transitions. Second operand 9 states. [2019-09-07 19:39:03,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:39:03,198 INFO L93 Difference]: Finished difference Result 348084 states and 510179 transitions. [2019-09-07 19:39:03,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 19:39:03,198 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 323 [2019-09-07 19:39:03,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:39:05,222 INFO L225 Difference]: With dead ends: 348084 [2019-09-07 19:39:05,222 INFO L226 Difference]: Without dead ends: 183009 [2019-09-07 19:39:05,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-07 19:39:05,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183009 states. [2019-09-07 19:39:13,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183009 to 180339. [2019-09-07 19:39:13,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180339 states. [2019-09-07 19:39:13,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180339 states to 180339 states and 247946 transitions. [2019-09-07 19:39:13,684 INFO L78 Accepts]: Start accepts. Automaton has 180339 states and 247946 transitions. Word has length 323 [2019-09-07 19:39:13,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:39:13,684 INFO L475 AbstractCegarLoop]: Abstraction has 180339 states and 247946 transitions. [2019-09-07 19:39:13,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:39:13,684 INFO L276 IsEmpty]: Start isEmpty. Operand 180339 states and 247946 transitions. [2019-09-07 19:39:13,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-09-07 19:39:13,696 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:39:13,696 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, 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] [2019-09-07 19:39:13,697 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:39:13,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:39:13,697 INFO L82 PathProgramCache]: Analyzing trace with hash -279841509, now seen corresponding path program 1 times [2019-09-07 19:39:13,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:39:13,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:39:13,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:39:13,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:39:13,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:39:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:39:13,874 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-09-07 19:39:13,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:39:13,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 19:39:13,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 19:39:13,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 19:39:13,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:39:13,876 INFO L87 Difference]: Start difference. First operand 180339 states and 247946 transitions. Second operand 3 states. [2019-09-07 19:39:23,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:39:23,326 INFO L93 Difference]: Finished difference Result 307091 states and 425141 transitions. [2019-09-07 19:39:23,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 19:39:23,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 323 [2019-09-07 19:39:23,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:39:23,660 INFO L225 Difference]: With dead ends: 307091 [2019-09-07 19:39:23,660 INFO L226 Difference]: Without dead ends: 125932 [2019-09-07 19:39:23,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:39:23,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125932 states. [2019-09-07 19:39:26,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125932 to 117752. [2019-09-07 19:39:26,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117752 states. [2019-09-07 19:39:26,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117752 states to 117752 states and 149071 transitions. [2019-09-07 19:39:26,462 INFO L78 Accepts]: Start accepts. Automaton has 117752 states and 149071 transitions. Word has length 323 [2019-09-07 19:39:26,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:39:26,463 INFO L475 AbstractCegarLoop]: Abstraction has 117752 states and 149071 transitions. [2019-09-07 19:39:26,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 19:39:26,463 INFO L276 IsEmpty]: Start isEmpty. Operand 117752 states and 149071 transitions. [2019-09-07 19:39:26,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-09-07 19:39:26,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:39:26,471 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, 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] [2019-09-07 19:39:26,471 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:39:26,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:39:26,472 INFO L82 PathProgramCache]: Analyzing trace with hash 738828269, now seen corresponding path program 1 times [2019-09-07 19:39:26,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:39:26,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:39:26,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:39:26,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:39:26,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:39:26,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:39:26,799 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 223 proven. 69 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-09-07 19:39:26,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:39:26,802 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) [2019-09-07 19:39:26,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:39:26,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:39:26,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 19:39:26,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:39:30,646 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 19:39:30,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:39:30,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 19:39:30,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:39:30,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:39:30,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:39:30,663 INFO L87 Difference]: Start difference. First operand 117752 states and 149071 transitions. Second operand 9 states. [2019-09-07 19:40:01,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:40:01,465 INFO L93 Difference]: Finished difference Result 325983 states and 491775 transitions. [2019-09-07 19:40:01,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-07 19:40:01,467 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 329 [2019-09-07 19:40:01,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:40:02,513 INFO L225 Difference]: With dead ends: 325983 [2019-09-07 19:40:02,513 INFO L226 Difference]: Without dead ends: 209040 [2019-09-07 19:40:03,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=403, Invalid=1853, Unknown=0, NotChecked=0, Total=2256 [2019-09-07 19:40:03,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209040 states. [2019-09-07 19:40:10,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209040 to 203491. [2019-09-07 19:40:10,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203491 states. [2019-09-07 19:40:10,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203491 states to 203491 states and 276067 transitions. [2019-09-07 19:40:11,000 INFO L78 Accepts]: Start accepts. Automaton has 203491 states and 276067 transitions. Word has length 329 [2019-09-07 19:40:11,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:40:11,001 INFO L475 AbstractCegarLoop]: Abstraction has 203491 states and 276067 transitions. [2019-09-07 19:40:11,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:40:11,001 INFO L276 IsEmpty]: Start isEmpty. Operand 203491 states and 276067 transitions. [2019-09-07 19:40:11,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2019-09-07 19:40:11,011 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:40:11,012 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:40:11,012 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:40:11,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:40:11,013 INFO L82 PathProgramCache]: Analyzing trace with hash -45551223, now seen corresponding path program 1 times [2019-09-07 19:40:11,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:40:11,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:40:11,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:40:11,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:40:11,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:40:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:40:11,939 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 190 proven. 2 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2019-09-07 19:40:11,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:40:11,940 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:40:11,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:40:12,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:40:12,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 19:40:12,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:40:12,208 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 342 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-09-07 19:40:12,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:40:12,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2019-09-07 19:40:12,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 19:40:12,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 19:40:12,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:40:12,214 INFO L87 Difference]: Start difference. First operand 203491 states and 276067 transitions. Second operand 4 states. [2019-09-07 19:40:21,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:40:21,712 INFO L93 Difference]: Finished difference Result 392212 states and 535970 transitions. [2019-09-07 19:40:21,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 19:40:21,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 410 [2019-09-07 19:40:21,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:40:22,370 INFO L225 Difference]: With dead ends: 392212 [2019-09-07 19:40:22,370 INFO L226 Difference]: Without dead ends: 202593 [2019-09-07 19:40:22,647 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:40:22,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202593 states. [2019-09-07 19:40:29,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202593 to 202591. [2019-09-07 19:40:29,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202591 states. [2019-09-07 19:40:29,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202591 states to 202591 states and 274220 transitions. [2019-09-07 19:40:29,750 INFO L78 Accepts]: Start accepts. Automaton has 202591 states and 274220 transitions. Word has length 410 [2019-09-07 19:40:29,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:40:29,750 INFO L475 AbstractCegarLoop]: Abstraction has 202591 states and 274220 transitions. [2019-09-07 19:40:29,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 19:40:29,751 INFO L276 IsEmpty]: Start isEmpty. Operand 202591 states and 274220 transitions. [2019-09-07 19:40:29,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-09-07 19:40:29,760 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:40:29,761 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, 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] [2019-09-07 19:40:29,761 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:40:29,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:40:29,761 INFO L82 PathProgramCache]: Analyzing trace with hash 78747274, now seen corresponding path program 1 times [2019-09-07 19:40:29,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:40:29,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:40:29,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:40:29,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:40:29,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:40:29,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:40:30,929 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 271 proven. 2 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-09-07 19:40:30,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:40:30,930 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:40:30,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:40:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:40:31,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 19:40:31,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:40:31,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:40:31,322 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-09-07 19:40:31,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:40:31,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-07 19:40:31,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 19:40:31,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 19:40:31,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-07 19:40:31,339 INFO L87 Difference]: Start difference. First operand 202591 states and 274220 transitions. Second operand 8 states. [2019-09-07 19:40:54,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:40:54,492 INFO L93 Difference]: Finished difference Result 429221 states and 584140 transitions. [2019-09-07 19:40:54,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 19:40:54,493 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 412 [2019-09-07 19:40:54,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:40:55,237 INFO L225 Difference]: With dead ends: 429221 [2019-09-07 19:40:55,238 INFO L226 Difference]: Without dead ends: 227439 [2019-09-07 19:40:55,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 428 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2019-09-07 19:40:55,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227439 states. [2019-09-07 19:41:05,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227439 to 224008. [2019-09-07 19:41:05,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224008 states. [2019-09-07 19:41:06,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224008 states to 224008 states and 302315 transitions. [2019-09-07 19:41:06,894 INFO L78 Accepts]: Start accepts. Automaton has 224008 states and 302315 transitions. Word has length 412 [2019-09-07 19:41:06,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:41:06,894 INFO L475 AbstractCegarLoop]: Abstraction has 224008 states and 302315 transitions. [2019-09-07 19:41:06,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 19:41:06,895 INFO L276 IsEmpty]: Start isEmpty. Operand 224008 states and 302315 transitions. [2019-09-07 19:41:06,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-09-07 19:41:06,901 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:41:06,901 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, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:41:06,901 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:41:06,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:41:06,902 INFO L82 PathProgramCache]: Analyzing trace with hash -875870884, now seen corresponding path program 1 times [2019-09-07 19:41:06,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:41:06,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:41:06,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:41:06,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:41:06,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:41:06,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:41:07,277 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 227 proven. 285 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2019-09-07 19:41:07,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:41:07,277 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:41:07,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:41:07,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:41:07,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 738 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 19:41:07,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:41:08,188 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 418 proven. 2 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-09-07 19:41:08,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:41:08,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2019-09-07 19:41:08,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 19:41:08,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 19:41:08,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-09-07 19:41:08,193 INFO L87 Difference]: Start difference. First operand 224008 states and 302315 transitions. Second operand 12 states. [2019-09-07 19:41:45,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:41:45,372 INFO L93 Difference]: Finished difference Result 576474 states and 784425 transitions. [2019-09-07 19:41:45,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 19:41:45,373 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 420 [2019-09-07 19:41:45,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:41:47,414 INFO L225 Difference]: With dead ends: 576474 [2019-09-07 19:41:47,415 INFO L226 Difference]: Without dead ends: 353275 [2019-09-07 19:41:47,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 437 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=310, Invalid=880, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 19:41:48,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353275 states. [2019-09-07 19:42:00,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353275 to 315233. [2019-09-07 19:42:00,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315233 states. [2019-09-07 19:42:00,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315233 states to 315233 states and 394975 transitions. [2019-09-07 19:42:00,725 INFO L78 Accepts]: Start accepts. Automaton has 315233 states and 394975 transitions. Word has length 420 [2019-09-07 19:42:00,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:42:00,726 INFO L475 AbstractCegarLoop]: Abstraction has 315233 states and 394975 transitions. [2019-09-07 19:42:00,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 19:42:00,726 INFO L276 IsEmpty]: Start isEmpty. Operand 315233 states and 394975 transitions. [2019-09-07 19:42:00,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2019-09-07 19:42:00,734 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:42:00,735 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:42:00,735 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:42:00,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:42:00,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1781649094, now seen corresponding path program 1 times [2019-09-07 19:42:00,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:42:00,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:42:00,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:42:00,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:42:00,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:42:00,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:42:01,746 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 387 proven. 2 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2019-09-07 19:42:01,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:42:01,746 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:42:01,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:42:01,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:42:01,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:42:01,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:42:02,067 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 387 proven. 2 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2019-09-07 19:42:02,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:42:02,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-09-07 19:42:02,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 19:42:02,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 19:42:02,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 19:42:02,076 INFO L87 Difference]: Start difference. First operand 315233 states and 394975 transitions. Second operand 7 states. [2019-09-07 19:42:20,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:42:20,205 INFO L93 Difference]: Finished difference Result 614855 states and 773423 transitions. [2019-09-07 19:42:20,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 19:42:20,206 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 487 [2019-09-07 19:42:20,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:42:21,087 INFO L225 Difference]: With dead ends: 614855 [2019-09-07 19:42:21,087 INFO L226 Difference]: Without dead ends: 315896 [2019-09-07 19:42:21,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 491 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-09-07 19:42:21,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315896 states. [2019-09-07 19:42:27,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315896 to 308420. [2019-09-07 19:42:27,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308420 states. [2019-09-07 19:42:28,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308420 states to 308420 states and 380334 transitions. [2019-09-07 19:42:28,439 INFO L78 Accepts]: Start accepts. Automaton has 308420 states and 380334 transitions. Word has length 487 [2019-09-07 19:42:28,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:42:28,439 INFO L475 AbstractCegarLoop]: Abstraction has 308420 states and 380334 transitions. [2019-09-07 19:42:28,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 19:42:28,440 INFO L276 IsEmpty]: Start isEmpty. Operand 308420 states and 380334 transitions. [2019-09-07 19:42:28,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 561 [2019-09-07 19:42:28,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:42:28,458 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, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:42:28,458 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:42:28,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:42:28,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1531741237, now seen corresponding path program 1 times [2019-09-07 19:42:28,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:42:28,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:42:28,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:42:28,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:42:28,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:42:28,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:42:33,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1021 backedges. 449 proven. 71 refuted. 0 times theorem prover too weak. 501 trivial. 0 not checked. [2019-09-07 19:42:33,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:42:33,772 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:42:33,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:42:34,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:42:34,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 911 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 19:42:34,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:42:34,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:42:34,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1021 backedges. 665 proven. 2 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2019-09-07 19:42:34,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:42:34,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 11 [2019-09-07 19:42:34,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 19:42:34,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 19:42:34,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-07 19:42:34,581 INFO L87 Difference]: Start difference. First operand 308420 states and 380334 transitions. Second operand 11 states. [2019-09-07 19:43:19,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:43:19,325 INFO L93 Difference]: Finished difference Result 718665 states and 886996 transitions. [2019-09-07 19:43:19,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-09-07 19:43:19,326 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 560 [2019-09-07 19:43:19,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:43:20,835 INFO L225 Difference]: With dead ends: 718665 [2019-09-07 19:43:20,836 INFO L226 Difference]: Without dead ends: 406174 [2019-09-07 19:43:22,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 742 GetRequests, 640 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4247 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1388, Invalid=9324, Unknown=0, NotChecked=0, Total=10712 [2019-09-07 19:43:22,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406174 states. [2019-09-07 19:43:29,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406174 to 389771. [2019-09-07 19:43:29,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389771 states. [2019-09-07 19:43:30,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389771 states to 389771 states and 465825 transitions. [2019-09-07 19:43:30,358 INFO L78 Accepts]: Start accepts. Automaton has 389771 states and 465825 transitions. Word has length 560 [2019-09-07 19:43:30,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:43:30,359 INFO L475 AbstractCegarLoop]: Abstraction has 389771 states and 465825 transitions. [2019-09-07 19:43:30,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 19:43:30,359 INFO L276 IsEmpty]: Start isEmpty. Operand 389771 states and 465825 transitions. [2019-09-07 19:43:30,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2019-09-07 19:43:30,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:43:30,383 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, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:43:30,383 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:43:30,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:43:30,384 INFO L82 PathProgramCache]: Analyzing trace with hash -618761609, now seen corresponding path program 1 times [2019-09-07 19:43:30,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:43:30,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:43:30,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:43:30,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:43:30,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:43:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:43:38,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1025 backedges. 528 proven. 430 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-09-07 19:43:38,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:43:38,125 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 19:43:38,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:43:38,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:43:38,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 965 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 19:43:38,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:43:38,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:43:38,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1025 backedges. 676 proven. 2 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2019-09-07 19:43:38,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:43:38,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 8] total 26 [2019-09-07 19:43:38,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-07 19:43:38,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-07 19:43:38,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2019-09-07 19:43:38,777 INFO L87 Difference]: Start difference. First operand 389771 states and 465825 transitions. Second operand 26 states. [2019-09-07 19:43:50,905 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-07 19:44:04,056 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-07 19:44:05,315 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-07 19:44:07,199 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-09-07 19:44:07,393 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2019-09-07 19:44:10,441 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2019-09-07 19:44:11,615 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-07 19:44:13,352 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-09-07 19:44:14,425 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-09-07 19:44:14,602 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-07 19:44:15,654 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-09-07 19:44:16,339 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-07 19:44:18,648 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-07 19:44:19,529 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-09-07 19:44:23,345 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-09-07 19:44:29,429 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-07 19:44:35,277 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-09-07 19:44:40,581 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-07 19:44:45,253 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 43 [2019-09-07 19:44:45,976 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-07 19:44:49,321 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-07 19:44:50,462 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 44 [2019-09-07 19:44:51,083 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-09-07 19:44:58,681 WARN L188 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 33 [2019-09-07 19:45:02,010 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-09-07 19:45:03,057 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-09-07 19:45:07,229 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-07 19:45:12,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:45:12,773 INFO L93 Difference]: Finished difference Result 857606 states and 1051587 transitions. [2019-09-07 19:45:12,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 249 states. [2019-09-07 19:45:12,773 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 608 [2019-09-07 19:45:12,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:45:14,188 INFO L225 Difference]: With dead ends: 857606 [2019-09-07 19:45:14,188 INFO L226 Difference]: Without dead ends: 451548 [2019-09-07 19:45:15,584 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1090 GetRequests, 819 SyntacticMatches, 0 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31785 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=8380, Invalid=65876, Unknown=0, NotChecked=0, Total=74256 [2019-09-07 19:45:15,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451548 states. [2019-09-07 19:45:25,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451548 to 434903. [2019-09-07 19:45:25,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434903 states. [2019-09-07 19:45:26,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434903 states to 434903 states and 506912 transitions. [2019-09-07 19:45:26,177 INFO L78 Accepts]: Start accepts. Automaton has 434903 states and 506912 transitions. Word has length 608 [2019-09-07 19:45:26,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:45:26,178 INFO L475 AbstractCegarLoop]: Abstraction has 434903 states and 506912 transitions. [2019-09-07 19:45:26,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-07 19:45:26,178 INFO L276 IsEmpty]: Start isEmpty. Operand 434903 states and 506912 transitions. [2019-09-07 19:45:26,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2019-09-07 19:45:26,183 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:45:26,183 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, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:45:26,184 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:45:26,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:45:26,184 INFO L82 PathProgramCache]: Analyzing trace with hash 811767233, now seen corresponding path program 1 times [2019-09-07 19:45:26,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:45:26,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:45:26,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:45:26,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:45:26,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:45:26,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:45:28,274 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 388 proven. 69 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2019-09-07 19:45:28,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:45:28,274 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 19:45:28,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:45:28,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:45:28,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 984 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 19:45:28,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:45:28,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:45:34,850 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 387 proven. 2 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2019-09-07 19:45:34,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:45:34,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:45:34,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:45:34,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:45:34,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:45:34,856 INFO L87 Difference]: Start difference. First operand 434903 states and 506912 transitions. Second operand 9 states. [2019-09-07 19:46:06,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:46:06,291 INFO L93 Difference]: Finished difference Result 900629 states and 1101653 transitions. [2019-09-07 19:46:06,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-07 19:46:06,291 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 639 [2019-09-07 19:46:06,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:46:08,109 INFO L225 Difference]: With dead ends: 900629 [2019-09-07 19:46:08,109 INFO L226 Difference]: Without dead ends: 491703 [2019-09-07 19:46:14,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 712 GetRequests, 668 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=383, Invalid=1687, Unknown=0, NotChecked=0, Total=2070 [2019-09-07 19:46:15,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491703 states. [2019-09-07 19:46:22,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491703 to 483403. [2019-09-07 19:46:22,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483403 states. [2019-09-07 19:46:23,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483403 states to 483403 states and 564035 transitions. [2019-09-07 19:46:23,528 INFO L78 Accepts]: Start accepts. Automaton has 483403 states and 564035 transitions. Word has length 639 [2019-09-07 19:46:23,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:46:23,528 INFO L475 AbstractCegarLoop]: Abstraction has 483403 states and 564035 transitions. [2019-09-07 19:46:23,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:46:23,528 INFO L276 IsEmpty]: Start isEmpty. Operand 483403 states and 564035 transitions. [2019-09-07 19:46:23,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 830 [2019-09-07 19:46:23,541 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:46:23,541 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:46:23,542 INFO L418 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:46:23,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:46:23,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1978020253, now seen corresponding path program 1 times [2019-09-07 19:46:23,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:46:23,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:46:23,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:46:23,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:46:23,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:46:23,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:46:30,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1100 backedges. 469 proven. 156 refuted. 0 times theorem prover too weak. 475 trivial. 0 not checked. [2019-09-07 19:46:30,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:46:30,498 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:46:30,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:46:30,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:46:30,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 1221 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:46:30,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:46:30,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:46:31,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1100 backedges. 503 proven. 2 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-09-07 19:46:31,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:46:31,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-09-07 19:46:31,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 19:46:31,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 19:46:31,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-07 19:46:31,030 INFO L87 Difference]: Start difference. First operand 483403 states and 564035 transitions. Second operand 10 states. [2019-09-07 19:47:01,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:47:01,573 INFO L93 Difference]: Finished difference Result 948583 states and 1106773 transitions. [2019-09-07 19:47:01,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-07 19:47:01,574 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 829 [2019-09-07 19:47:01,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:47:02,808 INFO L225 Difference]: With dead ends: 948583 [2019-09-07 19:47:02,808 INFO L226 Difference]: Without dead ends: 465178 [2019-09-07 19:47:03,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 937 GetRequests, 878 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1261 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=664, Invalid=2996, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 19:47:04,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465178 states. [2019-09-07 19:47:12,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465178 to 442876. [2019-09-07 19:47:12,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442876 states. [2019-09-07 19:47:23,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442876 states to 442876 states and 490052 transitions. [2019-09-07 19:47:23,460 INFO L78 Accepts]: Start accepts. Automaton has 442876 states and 490052 transitions. Word has length 829 [2019-09-07 19:47:23,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:47:23,461 INFO L475 AbstractCegarLoop]: Abstraction has 442876 states and 490052 transitions. [2019-09-07 19:47:23,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 19:47:23,461 INFO L276 IsEmpty]: Start isEmpty. Operand 442876 states and 490052 transitions. [2019-09-07 19:47:23,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 911 [2019-09-07 19:47:23,484 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:47:23,485 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, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:47:23,485 INFO L418 AbstractCegarLoop]: === Iteration 20 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:47:23,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:47:23,486 INFO L82 PathProgramCache]: Analyzing trace with hash -201066786, now seen corresponding path program 1 times [2019-09-07 19:47:23,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:47:23,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:47:23,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:47:23,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:47:23,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:47:23,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:47:24,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1145 backedges. 232 proven. 0 refuted. 0 times theorem prover too weak. 913 trivial. 0 not checked. [2019-09-07 19:47:24,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:47:24,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 19:47:24,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 19:47:24,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 19:47:24,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:47:24,561 INFO L87 Difference]: Start difference. First operand 442876 states and 490052 transitions. Second operand 3 states. [2019-09-07 19:47:35,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:47:35,004 INFO L93 Difference]: Finished difference Result 901183 states and 998178 transitions. [2019-09-07 19:47:35,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 19:47:35,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 910 [2019-09-07 19:47:35,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:47:36,938 INFO L225 Difference]: With dead ends: 901183 [2019-09-07 19:47:36,938 INFO L226 Difference]: Without dead ends: 465539 [2019-09-07 19:47:37,280 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:47:37,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465539 states.