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/Problem03_label03.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 13:12:30,393 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 13:12:30,395 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 13:12:30,407 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 13:12:30,407 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 13:12:30,408 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 13:12:30,409 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 13:12:30,411 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 13:12:30,412 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 13:12:30,413 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 13:12:30,414 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 13:12:30,415 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 13:12:30,416 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 13:12:30,416 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 13:12:30,417 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 13:12:30,418 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 13:12:30,419 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 13:12:30,420 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 13:12:30,422 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 13:12:30,424 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 13:12:30,425 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 13:12:30,426 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 13:12:30,427 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 13:12:30,428 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 13:12:30,430 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 13:12:30,431 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 13:12:30,431 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 13:12:30,432 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 13:12:30,432 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 13:12:30,433 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 13:12:30,433 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 13:12:30,434 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 13:12:30,435 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 13:12:30,435 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 13:12:30,436 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 13:12:30,437 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 13:12:30,437 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 13:12:30,437 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 13:12:30,438 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 13:12:30,438 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 13:12:30,439 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 13:12:30,440 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 13:12:30,455 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 13:12:30,455 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 13:12:30,456 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 13:12:30,456 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 13:12:30,456 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 13:12:30,457 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 13:12:30,457 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 13:12:30,457 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 13:12:30,457 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 13:12:30,457 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 13:12:30,458 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 13:12:30,458 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 13:12:30,458 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 13:12:30,458 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 13:12:30,458 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 13:12:30,459 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 13:12:30,459 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 13:12:30,459 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 13:12:30,459 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 13:12:30,459 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 13:12:30,460 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 13:12:30,460 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 13:12:30,460 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 13:12:30,460 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 13:12:30,460 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 13:12:30,461 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 13:12:30,461 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 13:12:30,461 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 13:12:30,461 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 13:12:30,498 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 13:12:30,511 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 13:12:30,516 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 13:12:30,518 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 13:12:30,518 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 13:12:30,519 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label03.c [2019-09-07 13:12:30,586 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9e7997fa/e66ec79faeae4779b3632e5eed04a918/FLAGaa191ad65 [2019-09-07 13:12:31,165 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 13:12:31,166 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label03.c [2019-09-07 13:12:31,188 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9e7997fa/e66ec79faeae4779b3632e5eed04a918/FLAGaa191ad65 [2019-09-07 13:12:31,353 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9e7997fa/e66ec79faeae4779b3632e5eed04a918 [2019-09-07 13:12:31,364 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 13:12:31,365 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 13:12:31,367 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 13:12:31,367 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 13:12:31,370 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 13:12:31,371 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 01:12:31" (1/1) ... [2019-09-07 13:12:31,374 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61381dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:12:31, skipping insertion in model container [2019-09-07 13:12:31,374 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 01:12:31" (1/1) ... [2019-09-07 13:12:31,382 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 13:12:31,467 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 13:12:32,181 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 13:12:32,198 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 13:12:32,570 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 13:12:32,596 INFO L192 MainTranslator]: Completed translation [2019-09-07 13:12:32,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:12:32 WrapperNode [2019-09-07 13:12:32,596 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 13:12:32,598 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 13:12:32,598 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 13:12:32,598 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 13:12:32,612 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:12:32" (1/1) ... [2019-09-07 13:12:32,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:12:32" (1/1) ... [2019-09-07 13:12:32,651 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:12:32" (1/1) ... [2019-09-07 13:12:32,651 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:12:32" (1/1) ... [2019-09-07 13:12:32,716 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:12:32" (1/1) ... [2019-09-07 13:12:32,745 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:12:32" (1/1) ... [2019-09-07 13:12:32,756 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:12:32" (1/1) ... [2019-09-07 13:12:32,770 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 13:12:32,770 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 13:12:32,770 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 13:12:32,770 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 13:12:32,771 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:12: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 13:12:32,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 13:12:32,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 13:12:32,821 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 13:12:32,821 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 13:12:32,821 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 13:12:32,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 13:12:32,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 13:12:32,822 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 13:12:32,822 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 13:12:32,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 13:12:32,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 13:12:34,705 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 13:12:34,708 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 13:12:34,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 01:12:34 BoogieIcfgContainer [2019-09-07 13:12:34,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 13:12:34,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 13:12:34,712 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 13:12:34,716 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 13:12:34,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 01:12:31" (1/3) ... [2019-09-07 13:12:34,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@209d4efd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 01:12:34, skipping insertion in model container [2019-09-07 13:12:34,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:12:32" (2/3) ... [2019-09-07 13:12:34,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@209d4efd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 01:12:34, skipping insertion in model container [2019-09-07 13:12:34,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 01:12:34" (3/3) ... [2019-09-07 13:12:34,725 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label03.c [2019-09-07 13:12:34,738 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 13:12:34,749 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 13:12:34,766 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 13:12:34,817 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 13:12:34,818 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 13:12:34,820 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 13:12:34,820 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 13:12:34,820 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 13:12:34,820 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 13:12:34,821 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 13:12:34,821 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 13:12:34,821 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 13:12:34,855 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states. [2019-09-07 13:12:34,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-07 13:12:34,874 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:12:34,876 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:12:34,878 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:12:34,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:12:34,883 INFO L82 PathProgramCache]: Analyzing trace with hash 642919317, now seen corresponding path program 1 times [2019-09-07 13:12:34,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:12:34,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:12:34,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:34,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:12:34,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:35,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:12:35,629 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 13:12:35,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:12:35,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:12:35,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:12:35,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:12:35,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:12:35,654 INFO L87 Difference]: Start difference. First operand 311 states. Second operand 3 states. [2019-09-07 13:12:36,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:12:36,940 INFO L93 Difference]: Finished difference Result 842 states and 1484 transitions. [2019-09-07 13:12:36,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:12:36,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-09-07 13:12:36,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:12:36,968 INFO L225 Difference]: With dead ends: 842 [2019-09-07 13:12:36,968 INFO L226 Difference]: Without dead ends: 469 [2019-09-07 13:12:36,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 13:12:37,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2019-09-07 13:12:37,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 468. [2019-09-07 13:12:37,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2019-09-07 13:12:37,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 718 transitions. [2019-09-07 13:12:37,109 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 718 transitions. Word has length 170 [2019-09-07 13:12:37,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:12:37,114 INFO L475 AbstractCegarLoop]: Abstraction has 468 states and 718 transitions. [2019-09-07 13:12:37,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:12:37,114 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 718 transitions. [2019-09-07 13:12:37,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-07 13:12:37,125 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:12:37,131 INFO L399 BasicCegarLoop]: trace histogram [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 13:12:37,132 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:12:37,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:12:37,132 INFO L82 PathProgramCache]: Analyzing trace with hash -726767950, now seen corresponding path program 1 times [2019-09-07 13:12:37,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:12:37,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:12:37,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:37,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:12:37,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:37,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:12:37,343 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:12:37,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:12:37,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 13:12:37,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:12:37,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:12:37,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:12:37,346 INFO L87 Difference]: Start difference. First operand 468 states and 718 transitions. Second operand 6 states. [2019-09-07 13:12:39,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:12:39,065 INFO L93 Difference]: Finished difference Result 1409 states and 2231 transitions. [2019-09-07 13:12:39,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 13:12:39,066 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 179 [2019-09-07 13:12:39,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:12:39,074 INFO L225 Difference]: With dead ends: 1409 [2019-09-07 13:12:39,074 INFO L226 Difference]: Without dead ends: 947 [2019-09-07 13:12:39,076 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:12:39,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2019-09-07 13:12:39,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 910. [2019-09-07 13:12:39,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 910 states. [2019-09-07 13:12:39,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1387 transitions. [2019-09-07 13:12:39,134 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1387 transitions. Word has length 179 [2019-09-07 13:12:39,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:12:39,134 INFO L475 AbstractCegarLoop]: Abstraction has 910 states and 1387 transitions. [2019-09-07 13:12:39,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:12:39,135 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1387 transitions. [2019-09-07 13:12:39,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-07 13:12:39,138 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:12:39,139 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 13:12:39,139 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:12:39,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:12:39,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1820689921, now seen corresponding path program 1 times [2019-09-07 13:12:39,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:12:39,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:12:39,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:39,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:12:39,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:39,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:12:39,405 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:12:39,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:12:39,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:12:39,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:12:39,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:12:39,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:12:39,407 INFO L87 Difference]: Start difference. First operand 910 states and 1387 transitions. Second operand 3 states. [2019-09-07 13:12:40,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:12:40,476 INFO L93 Difference]: Finished difference Result 2663 states and 4139 transitions. [2019-09-07 13:12:40,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:12:40,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-09-07 13:12:40,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:12:40,495 INFO L225 Difference]: With dead ends: 2663 [2019-09-07 13:12:40,496 INFO L226 Difference]: Without dead ends: 1759 [2019-09-07 13:12:40,500 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 13:12:40,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states. [2019-09-07 13:12:40,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 1752. [2019-09-07 13:12:40,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1752 states. [2019-09-07 13:12:40,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 2584 transitions. [2019-09-07 13:12:40,589 INFO L78 Accepts]: Start accepts. Automaton has 1752 states and 2584 transitions. Word has length 182 [2019-09-07 13:12:40,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:12:40,592 INFO L475 AbstractCegarLoop]: Abstraction has 1752 states and 2584 transitions. [2019-09-07 13:12:40,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:12:40,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 2584 transitions. [2019-09-07 13:12:40,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-07 13:12:40,608 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:12:40,608 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 13:12:40,609 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:12:40,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:12:40,610 INFO L82 PathProgramCache]: Analyzing trace with hash -62187522, now seen corresponding path program 1 times [2019-09-07 13:12:40,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:12:40,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:12:40,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:40,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:12:40,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:40,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:12:40,749 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:12:40,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:12:40,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 13:12:40,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:12:40,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:12:40,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:12:40,751 INFO L87 Difference]: Start difference. First operand 1752 states and 2584 transitions. Second operand 6 states. [2019-09-07 13:12:42,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:12:42,380 INFO L93 Difference]: Finished difference Result 5300 states and 8364 transitions. [2019-09-07 13:12:42,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 13:12:42,380 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 189 [2019-09-07 13:12:42,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:12:42,407 INFO L225 Difference]: With dead ends: 5300 [2019-09-07 13:12:42,407 INFO L226 Difference]: Without dead ends: 3554 [2019-09-07 13:12:42,414 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:12:42,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3554 states. [2019-09-07 13:12:42,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3554 to 3499. [2019-09-07 13:12:42,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3499 states. [2019-09-07 13:12:42,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3499 states to 3499 states and 5095 transitions. [2019-09-07 13:12:42,554 INFO L78 Accepts]: Start accepts. Automaton has 3499 states and 5095 transitions. Word has length 189 [2019-09-07 13:12:42,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:12:42,554 INFO L475 AbstractCegarLoop]: Abstraction has 3499 states and 5095 transitions. [2019-09-07 13:12:42,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:12:42,555 INFO L276 IsEmpty]: Start isEmpty. Operand 3499 states and 5095 transitions. [2019-09-07 13:12:42,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-09-07 13:12:42,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:12:42,567 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:12:42,568 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:12:42,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:12:42,568 INFO L82 PathProgramCache]: Analyzing trace with hash -88419817, now seen corresponding path program 1 times [2019-09-07 13:12:42,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:12:42,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:12:42,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:42,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:12:42,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:42,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:12:42,705 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 38 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:12:42,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:12:42,706 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 13:12:42,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:12:42,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:12:42,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 1031 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 13:12:42,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:12:43,090 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-07 13:12:43,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 13:12:43,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-07 13:12:43,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 13:12:43,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 13:12:43,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:12:43,098 INFO L87 Difference]: Start difference. First operand 3499 states and 5095 transitions. Second operand 7 states. [2019-09-07 13:12:44,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:12:44,890 INFO L93 Difference]: Finished difference Result 10309 states and 15575 transitions. [2019-09-07 13:12:44,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:12:44,891 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 206 [2019-09-07 13:12:44,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:12:44,937 INFO L225 Difference]: With dead ends: 10309 [2019-09-07 13:12:44,937 INFO L226 Difference]: Without dead ends: 6816 [2019-09-07 13:12:44,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:12:44,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6816 states. [2019-09-07 13:12:45,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6816 to 6804. [2019-09-07 13:12:45,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6804 states. [2019-09-07 13:12:45,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6804 states to 6804 states and 9923 transitions. [2019-09-07 13:12:45,161 INFO L78 Accepts]: Start accepts. Automaton has 6804 states and 9923 transitions. Word has length 206 [2019-09-07 13:12:45,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:12:45,162 INFO L475 AbstractCegarLoop]: Abstraction has 6804 states and 9923 transitions. [2019-09-07 13:12:45,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 13:12:45,162 INFO L276 IsEmpty]: Start isEmpty. Operand 6804 states and 9923 transitions. [2019-09-07 13:12:45,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-09-07 13:12:45,189 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:12:45,189 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:12:45,190 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:12:45,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:12:45,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1278467369, now seen corresponding path program 1 times [2019-09-07 13:12:45,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:12:45,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:12:45,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:45,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:12:45,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:12:45,406 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 53 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-07 13:12:45,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:12:45,407 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 13:12:45,430 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 13:12:45,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:12:45,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 1201 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 13:12:45,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:12:45,743 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-07 13:12:45,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 13:12:45,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-09-07 13:12:45,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:12:45,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:12:45,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:12:45,755 INFO L87 Difference]: Start difference. First operand 6804 states and 9923 transitions. Second operand 6 states. [2019-09-07 13:12:47,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:12:47,362 INFO L93 Difference]: Finished difference Result 19397 states and 29511 transitions. [2019-09-07 13:12:47,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 13:12:47,362 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 224 [2019-09-07 13:12:47,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:12:47,438 INFO L225 Difference]: With dead ends: 19397 [2019-09-07 13:12:47,439 INFO L226 Difference]: Without dead ends: 12599 [2019-09-07 13:12:47,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-07 13:12:47,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12599 states. [2019-09-07 13:12:47,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12599 to 12546. [2019-09-07 13:12:47,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12546 states. [2019-09-07 13:12:47,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12546 states to 12546 states and 16927 transitions. [2019-09-07 13:12:47,912 INFO L78 Accepts]: Start accepts. Automaton has 12546 states and 16927 transitions. Word has length 224 [2019-09-07 13:12:47,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:12:47,914 INFO L475 AbstractCegarLoop]: Abstraction has 12546 states and 16927 transitions. [2019-09-07 13:12:47,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:12:47,914 INFO L276 IsEmpty]: Start isEmpty. Operand 12546 states and 16927 transitions. [2019-09-07 13:12:47,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-07 13:12:47,947 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:12:47,948 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:12:47,948 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:12:47,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:12:47,954 INFO L82 PathProgramCache]: Analyzing trace with hash -549482121, now seen corresponding path program 1 times [2019-09-07 13:12:47,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:12:47,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:12:47,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:47,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:12:47,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:48,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:12:48,280 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:12:48,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:12:48,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-07 13:12:48,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 13:12:48,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 13:12:48,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:12:48,282 INFO L87 Difference]: Start difference. First operand 12546 states and 16927 transitions. Second operand 7 states. [2019-09-07 13:12:50,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:12:50,273 INFO L93 Difference]: Finished difference Result 25619 states and 35287 transitions. [2019-09-07 13:12:50,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 13:12:50,274 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 247 [2019-09-07 13:12:50,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:12:50,348 INFO L225 Difference]: With dead ends: 25619 [2019-09-07 13:12:50,348 INFO L226 Difference]: Without dead ends: 13078 [2019-09-07 13:12:50,386 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-09-07 13:12:50,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13078 states. [2019-09-07 13:12:51,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13078 to 13009. [2019-09-07 13:12:51,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13009 states. [2019-09-07 13:12:51,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13009 states to 13009 states and 17597 transitions. [2019-09-07 13:12:51,289 INFO L78 Accepts]: Start accepts. Automaton has 13009 states and 17597 transitions. Word has length 247 [2019-09-07 13:12:51,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:12:51,290 INFO L475 AbstractCegarLoop]: Abstraction has 13009 states and 17597 transitions. [2019-09-07 13:12:51,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 13:12:51,290 INFO L276 IsEmpty]: Start isEmpty. Operand 13009 states and 17597 transitions. [2019-09-07 13:12:51,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-07 13:12:51,324 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:12:51,324 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 13:12:51,324 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:12:51,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:12:51,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1387689462, now seen corresponding path program 1 times [2019-09-07 13:12:51,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:12:51,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:12:51,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:51,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:12:51,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:12:51,573 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:12:51,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:12:51,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 13:12:51,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:12:51,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:12:51,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:12:51,575 INFO L87 Difference]: Start difference. First operand 13009 states and 17597 transitions. Second operand 6 states. [2019-09-07 13:12:53,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:12:53,347 INFO L93 Difference]: Finished difference Result 30787 states and 43569 transitions. [2019-09-07 13:12:53,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 13:12:53,348 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 249 [2019-09-07 13:12:53,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:12:53,464 INFO L225 Difference]: With dead ends: 30787 [2019-09-07 13:12:53,465 INFO L226 Difference]: Without dead ends: 18240 [2019-09-07 13:12:53,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-07 13:12:53,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18240 states. [2019-09-07 13:12:53,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18240 to 18051. [2019-09-07 13:12:53,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18051 states. [2019-09-07 13:12:54,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18051 states to 18051 states and 24538 transitions. [2019-09-07 13:12:54,020 INFO L78 Accepts]: Start accepts. Automaton has 18051 states and 24538 transitions. Word has length 249 [2019-09-07 13:12:54,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:12:54,020 INFO L475 AbstractCegarLoop]: Abstraction has 18051 states and 24538 transitions. [2019-09-07 13:12:54,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:12:54,020 INFO L276 IsEmpty]: Start isEmpty. Operand 18051 states and 24538 transitions. [2019-09-07 13:12:54,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-09-07 13:12:54,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:12:54,067 INFO L399 BasicCegarLoop]: trace histogram [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, 2, 2, 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] [2019-09-07 13:12:54,067 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:12:54,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:12:54,068 INFO L82 PathProgramCache]: Analyzing trace with hash 249780064, now seen corresponding path program 1 times [2019-09-07 13:12:54,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:12:54,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:12:54,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:54,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:12:54,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:54,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:12:54,372 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 120 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:12:54,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:12:54,373 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 13:12:54,387 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 13:12:54,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:12:54,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 1249 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 13:12:54,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:12:54,681 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 13:12:54,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 13:12:54,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2019-09-07 13:12:54,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 13:12:54,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 13:12:54,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-07 13:12:54,691 INFO L87 Difference]: Start difference. First operand 18051 states and 24538 transitions. Second operand 13 states. [2019-09-07 13:12:58,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:12:58,620 INFO L93 Difference]: Finished difference Result 52707 states and 79356 transitions. [2019-09-07 13:12:58,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-07 13:12:58,621 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 272 [2019-09-07 13:12:58,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:12:58,810 INFO L225 Difference]: With dead ends: 52707 [2019-09-07 13:12:58,810 INFO L226 Difference]: Without dead ends: 34662 [2019-09-07 13:12:58,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=195, Invalid=617, Unknown=0, NotChecked=0, Total=812 [2019-09-07 13:12:58,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34662 states. [2019-09-07 13:13:00,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34662 to 33847. [2019-09-07 13:13:00,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33847 states. [2019-09-07 13:13:00,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33847 states to 33847 states and 45128 transitions. [2019-09-07 13:13:00,661 INFO L78 Accepts]: Start accepts. Automaton has 33847 states and 45128 transitions. Word has length 272 [2019-09-07 13:13:00,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:13:00,662 INFO L475 AbstractCegarLoop]: Abstraction has 33847 states and 45128 transitions. [2019-09-07 13:13:00,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 13:13:00,662 INFO L276 IsEmpty]: Start isEmpty. Operand 33847 states and 45128 transitions. [2019-09-07 13:13:00,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-09-07 13:13:00,699 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:13:00,699 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 13:13:00,700 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:13:00,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:13:00,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1447893844, now seen corresponding path program 1 times [2019-09-07 13:13:00,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:13:00,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:13:00,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:13:00,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:13:00,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:13:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:13:01,022 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 157 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-07 13:13:01,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:13:01,023 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 13:13:01,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:13:01,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:13:01,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 1254 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 13:13:01,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:13:01,463 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 157 proven. 2 refuted. 0 times theorem prover too weak. 8 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 13:13:01,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 13:13:01,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 13:13:01,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 13:13:01,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 13:13:01,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:13:01,481 INFO L87 Difference]: Start difference. First operand 33847 states and 45128 transitions. Second operand 9 states. [2019-09-07 13:13:09,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:13:09,213 INFO L93 Difference]: Finished difference Result 82123 states and 129461 transitions. [2019-09-07 13:13:09,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-07 13:13:09,214 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 292 [2019-09-07 13:13:09,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:13:09,463 INFO L225 Difference]: With dead ends: 82123 [2019-09-07 13:13:09,463 INFO L226 Difference]: Without dead ends: 48282 [2019-09-07 13:13:09,527 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=409, Invalid=1753, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 13:13:09,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48282 states. [2019-09-07 13:13:11,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48282 to 42265. [2019-09-07 13:13:11,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42265 states. [2019-09-07 13:13:11,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42265 states to 42265 states and 52448 transitions. [2019-09-07 13:13:11,199 INFO L78 Accepts]: Start accepts. Automaton has 42265 states and 52448 transitions. Word has length 292 [2019-09-07 13:13:11,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:13:11,200 INFO L475 AbstractCegarLoop]: Abstraction has 42265 states and 52448 transitions. [2019-09-07 13:13:11,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 13:13:11,200 INFO L276 IsEmpty]: Start isEmpty. Operand 42265 states and 52448 transitions. [2019-09-07 13:13:11,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-07 13:13:11,244 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:13:11,244 INFO L399 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 13:13:11,245 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:13:11,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:13:11,245 INFO L82 PathProgramCache]: Analyzing trace with hash -279874483, now seen corresponding path program 1 times [2019-09-07 13:13:11,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:13:11,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:13:11,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:13:11,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:13:11,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:13:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:13:11,810 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 142 proven. 32 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-07 13:13:11,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:13:11,811 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 13:13:11,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:13:12,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:13:12,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 1277 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 13:13:12,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:13:13,389 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 161 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 13:13:13,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 13:13:13,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-09-07 13:13:13,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 13:13:13,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 13:13:13,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-07 13:13:13,396 INFO L87 Difference]: Start difference. First operand 42265 states and 52448 transitions. Second operand 10 states. [2019-09-07 13:13:18,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:13:18,526 INFO L93 Difference]: Finished difference Result 81856 states and 106216 transitions. [2019-09-07 13:13:18,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 13:13:18,527 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 300 [2019-09-07 13:13:18,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:13:18,677 INFO L225 Difference]: With dead ends: 81856 [2019-09-07 13:13:18,677 INFO L226 Difference]: Without dead ends: 44296 [2019-09-07 13:13:18,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2019-09-07 13:13:18,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44296 states. [2019-09-07 13:13:19,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44296 to 43519. [2019-09-07 13:13:19,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43519 states. [2019-09-07 13:13:19,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43519 states to 43519 states and 52630 transitions. [2019-09-07 13:13:19,748 INFO L78 Accepts]: Start accepts. Automaton has 43519 states and 52630 transitions. Word has length 300 [2019-09-07 13:13:19,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:13:19,749 INFO L475 AbstractCegarLoop]: Abstraction has 43519 states and 52630 transitions. [2019-09-07 13:13:19,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 13:13:19,749 INFO L276 IsEmpty]: Start isEmpty. Operand 43519 states and 52630 transitions. [2019-09-07 13:13:19,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-09-07 13:13:19,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:13:19,793 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 13:13:19,794 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:13:19,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:13:19,794 INFO L82 PathProgramCache]: Analyzing trace with hash 461836199, now seen corresponding path program 1 times [2019-09-07 13:13:19,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:13:19,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:13:19,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:13:19,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:13:19,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:13:19,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:13:20,629 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:13:20,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:13:20,632 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 13:13:20,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 13:13:20,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:13:20,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 974 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 13:13:20,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:13:20,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 13:13:21,024 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:13:21,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 13:13:21,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2019-09-07 13:13:21,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 13:13:21,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 13:13:21,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-07 13:13:21,031 INFO L87 Difference]: Start difference. First operand 43519 states and 52630 transitions. Second operand 12 states. [2019-09-07 13:13:22,516 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2019-09-07 13:13:30,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:13:30,410 INFO L93 Difference]: Finished difference Result 152434 states and 190416 transitions. [2019-09-07 13:13:30,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-07 13:13:30,411 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 313 [2019-09-07 13:13:30,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:13:30,672 INFO L225 Difference]: With dead ends: 152434 [2019-09-07 13:13:30,672 INFO L226 Difference]: Without dead ends: 115103 [2019-09-07 13:13:30,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=706, Invalid=2834, Unknown=0, NotChecked=0, Total=3540 [2019-09-07 13:13:30,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115103 states. [2019-09-07 13:13:32,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115103 to 112004. [2019-09-07 13:13:32,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112004 states. [2019-09-07 13:13:32,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112004 states to 112004 states and 133888 transitions. [2019-09-07 13:13:32,422 INFO L78 Accepts]: Start accepts. Automaton has 112004 states and 133888 transitions. Word has length 313 [2019-09-07 13:13:32,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:13:32,423 INFO L475 AbstractCegarLoop]: Abstraction has 112004 states and 133888 transitions. [2019-09-07 13:13:32,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 13:13:32,423 INFO L276 IsEmpty]: Start isEmpty. Operand 112004 states and 133888 transitions. [2019-09-07 13:13:32,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2019-09-07 13:13:32,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:13:32,499 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 13:13:32,499 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:13:32,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:13:32,499 INFO L82 PathProgramCache]: Analyzing trace with hash -2047717062, now seen corresponding path program 1 times [2019-09-07 13:13:32,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:13:32,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:13:32,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:13:32,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:13:32,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:13:32,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:13:34,642 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 264 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 13:13:34,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:13:34,642 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 13:13:34,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:13:34,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:13:34,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 1328 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 13:13:34,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:13:34,950 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 264 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 13:13:34,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 13:13:34,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2019-09-07 13:13:34,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:13:34,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:13:34,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:13:34,956 INFO L87 Difference]: Start difference. First operand 112004 states and 133888 transitions. Second operand 6 states. [2019-09-07 13:13:37,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:13:37,954 INFO L93 Difference]: Finished difference Result 233269 states and 288158 transitions. [2019-09-07 13:13:37,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 13:13:37,954 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 355 [2019-09-07 13:13:37,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:13:38,258 INFO L225 Difference]: With dead ends: 233269 [2019-09-07 13:13:38,258 INFO L226 Difference]: Without dead ends: 123627 [2019-09-07 13:13:38,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:13:38,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123627 states. [2019-09-07 13:13:40,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123627 to 121118. [2019-09-07 13:13:40,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121118 states. [2019-09-07 13:13:40,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121118 states to 121118 states and 140209 transitions. [2019-09-07 13:13:40,293 INFO L78 Accepts]: Start accepts. Automaton has 121118 states and 140209 transitions. Word has length 355 [2019-09-07 13:13:40,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:13:40,293 INFO L475 AbstractCegarLoop]: Abstraction has 121118 states and 140209 transitions. [2019-09-07 13:13:40,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:13:40,293 INFO L276 IsEmpty]: Start isEmpty. Operand 121118 states and 140209 transitions. [2019-09-07 13:13:40,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2019-09-07 13:13:40,351 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:13:40,351 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:13:40,352 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:13:40,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:13:40,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1937838865, now seen corresponding path program 1 times [2019-09-07 13:13:40,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:13:40,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:13:40,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:13:40,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:13:40,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:13:40,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:13:40,761 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 262 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:13:40,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:13:40,762 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) [2019-09-07 13:13:40,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 13:13:40,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:13:40,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 1172 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 13:13:40,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:13:41,084 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-09-07 13:13:41,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 13:13:41,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-07 13:13:41,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 13:13:41,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 13:13:41,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:13:41,100 INFO L87 Difference]: Start difference. First operand 121118 states and 140209 transitions. Second operand 7 states. [2019-09-07 13:13:48,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:13:48,442 INFO L93 Difference]: Finished difference Result 296804 states and 366960 transitions. [2019-09-07 13:13:48,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 13:13:48,442 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 354 [2019-09-07 13:13:48,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:13:51,797 INFO L225 Difference]: With dead ends: 296804 [2019-09-07 13:13:51,797 INFO L226 Difference]: Without dead ends: 187018 [2019-09-07 13:13:51,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2019-09-07 13:13:52,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187018 states. [2019-09-07 13:13:54,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187018 to 180191. [2019-09-07 13:13:54,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180191 states. [2019-09-07 13:13:54,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180191 states to 180191 states and 209449 transitions. [2019-09-07 13:13:54,468 INFO L78 Accepts]: Start accepts. Automaton has 180191 states and 209449 transitions. Word has length 354 [2019-09-07 13:13:54,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:13:54,469 INFO L475 AbstractCegarLoop]: Abstraction has 180191 states and 209449 transitions. [2019-09-07 13:13:54,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 13:13:54,469 INFO L276 IsEmpty]: Start isEmpty. Operand 180191 states and 209449 transitions. [2019-09-07 13:13:54,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2019-09-07 13:13:54,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:13:54,550 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:13:54,550 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:13:54,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:13:54,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1151391000, now seen corresponding path program 1 times [2019-09-07 13:13:54,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:13:54,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:13:54,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:13:54,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:13:54,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:13:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:13:55,501 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-09-07 13:13:55,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:13:55,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 13:13:55,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 13:13:55,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 13:13:55,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 13:13:55,503 INFO L87 Difference]: Start difference. First operand 180191 states and 209449 transitions. Second operand 4 states. [2019-09-07 13:13:57,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:13:57,831 INFO L93 Difference]: Finished difference Result 346401 states and 402774 transitions. [2019-09-07 13:13:57,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 13:13:57,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 355 [2019-09-07 13:13:57,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:13:58,337 INFO L225 Difference]: With dead ends: 346401 [2019-09-07 13:13:58,337 INFO L226 Difference]: Without dead ends: 178670 [2019-09-07 13:13:58,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 13:13:58,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178670 states. [2019-09-07 13:14:04,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178670 to 175764. [2019-09-07 13:14:04,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175764 states. [2019-09-07 13:14:04,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175764 states to 175764 states and 203243 transitions. [2019-09-07 13:14:04,425 INFO L78 Accepts]: Start accepts. Automaton has 175764 states and 203243 transitions. Word has length 355 [2019-09-07 13:14:04,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:14:04,426 INFO L475 AbstractCegarLoop]: Abstraction has 175764 states and 203243 transitions. [2019-09-07 13:14:04,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 13:14:04,426 INFO L276 IsEmpty]: Start isEmpty. Operand 175764 states and 203243 transitions. [2019-09-07 13:14:04,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-09-07 13:14:04,540 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:14:04,540 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:14:04,541 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:14:04,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:14:04,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1934270936, now seen corresponding path program 1 times [2019-09-07 13:14:04,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:14:04,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:14:04,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:14:04,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:14:04,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:14:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:14:04,751 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 201 proven. 14 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-09-07 13:14:04,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:14:04,751 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) [2019-09-07 13:14:04,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 13:14:05,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:14:05,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 1497 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 13:14:05,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:14:05,122 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 213 proven. 2 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-09-07 13:14:05,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 13:14:05,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-07 13:14:05,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:14:05,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:14:05,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:14:05,132 INFO L87 Difference]: Start difference. First operand 175764 states and 203243 transitions. Second operand 6 states. [2019-09-07 13:14:10,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:14:10,106 INFO L93 Difference]: Finished difference Result 362479 states and 450023 transitions. [2019-09-07 13:14:10,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 13:14:10,106 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 371 [2019-09-07 13:14:10,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:14:10,675 INFO L225 Difference]: With dead ends: 362479 [2019-09-07 13:14:10,675 INFO L226 Difference]: Without dead ends: 188527 [2019-09-07 13:14:11,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-09-07 13:14:11,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188527 states. [2019-09-07 13:14:18,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188527 to 180950. [2019-09-07 13:14:18,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180950 states. [2019-09-07 13:14:19,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180950 states to 180950 states and 208307 transitions. [2019-09-07 13:14:19,129 INFO L78 Accepts]: Start accepts. Automaton has 180950 states and 208307 transitions. Word has length 371 [2019-09-07 13:14:19,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:14:19,129 INFO L475 AbstractCegarLoop]: Abstraction has 180950 states and 208307 transitions. [2019-09-07 13:14:19,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:14:19,129 INFO L276 IsEmpty]: Start isEmpty. Operand 180950 states and 208307 transitions. [2019-09-07 13:14:19,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2019-09-07 13:14:19,220 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:14:19,220 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:14:19,220 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:14:19,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:14:19,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1753650918, now seen corresponding path program 1 times [2019-09-07 13:14:19,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:14:19,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:14:19,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:14:19,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:14:19,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:14:19,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:14:19,794 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 213 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:14:19,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:14:19,794 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 13:14:19,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:14:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:14:20,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 1340 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 13:14:20,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:14:20,153 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-09-07 13:14:20,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 13:14:20,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 18 [2019-09-07 13:14:20,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 13:14:20,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 13:14:20,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2019-09-07 13:14:20,169 INFO L87 Difference]: Start difference. First operand 180950 states and 208307 transitions. Second operand 18 states. [2019-09-07 13:14:32,225 WARN L188 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-09-07 13:14:38,858 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2019-09-07 13:14:41,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:14:41,277 INFO L93 Difference]: Finished difference Result 584133 states and 696228 transitions. [2019-09-07 13:14:41,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2019-09-07 13:14:41,278 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 374 [2019-09-07 13:14:41,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:14:42,295 INFO L225 Difference]: With dead ends: 584133 [2019-09-07 13:14:42,295 INFO L226 Difference]: Without dead ends: 404524 [2019-09-07 13:14:42,538 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 373 SyntacticMatches, 1 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8257 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=2717, Invalid=17875, Unknown=0, NotChecked=0, Total=20592 [2019-09-07 13:14:43,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404524 states. [2019-09-07 13:14:49,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404524 to 382019. [2019-09-07 13:14:49,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382019 states. [2019-09-07 13:14:50,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382019 states to 382019 states and 434027 transitions. [2019-09-07 13:14:50,010 INFO L78 Accepts]: Start accepts. Automaton has 382019 states and 434027 transitions. Word has length 374 [2019-09-07 13:14:50,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:14:50,010 INFO L475 AbstractCegarLoop]: Abstraction has 382019 states and 434027 transitions. [2019-09-07 13:14:50,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 13:14:50,010 INFO L276 IsEmpty]: Start isEmpty. Operand 382019 states and 434027 transitions. [2019-09-07 13:14:50,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2019-09-07 13:14:50,112 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:14:50,113 INFO L399 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:14:50,113 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:14:50,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:14:50,113 INFO L82 PathProgramCache]: Analyzing trace with hash -916115530, now seen corresponding path program 1 times [2019-09-07 13:14:50,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:14:50,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:14:50,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:14:50,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:14:50,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:14:50,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:14:50,466 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 224 proven. 107 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-07 13:14:50,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:14:50,466 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 13:14:50,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:14:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:14:50,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 1515 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 13:14:50,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:14:50,941 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 244 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-09-07 13:14:50,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 13:14:50,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2019-09-07 13:14:50,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 13:14:50,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 13:14:50,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-07 13:14:50,953 INFO L87 Difference]: Start difference. First operand 382019 states and 434027 transitions. Second operand 12 states. [2019-09-07 13:14:54,980 WARN L188 SmtUtils]: Spent 3.95 s on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2019-09-07 13:15:14,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:15:14,809 INFO L93 Difference]: Finished difference Result 1354305 states and 1598915 transitions. [2019-09-07 13:15:14,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 13:15:14,810 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 399 [2019-09-07 13:15:14,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:15:18,474 INFO L225 Difference]: With dead ends: 1354305 [2019-09-07 13:15:18,474 INFO L226 Difference]: Without dead ends: 1012540 [2019-09-07 13:15:18,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 415 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=245, Invalid=685, Unknown=0, NotChecked=0, Total=930 [2019-09-07 13:15:19,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012540 states. [2019-09-07 13:15:51,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012540 to 1002092. [2019-09-07 13:15:51,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1002092 states. [2019-09-07 13:16:06,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002092 states to 1002092 states and 1178343 transitions. [2019-09-07 13:16:06,141 INFO L78 Accepts]: Start accepts. Automaton has 1002092 states and 1178343 transitions. Word has length 399 [2019-09-07 13:16:06,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:16:06,141 INFO L475 AbstractCegarLoop]: Abstraction has 1002092 states and 1178343 transitions. [2019-09-07 13:16:06,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 13:16:06,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1002092 states and 1178343 transitions. [2019-09-07 13:16:06,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2019-09-07 13:16:06,321 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:16:06,321 INFO L399 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:16:06,321 INFO L418 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:16:06,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:16:06,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1775392884, now seen corresponding path program 1 times [2019-09-07 13:16:06,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:16:06,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:16:06,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:16:06,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:16:06,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:16:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:16:06,737 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 247 proven. 115 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-07 13:16:06,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:16:06,738 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 13:16:06,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:16:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:16:06,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 1520 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 13:16:07,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:16:07,160 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 331 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-07 13:16:07,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 13:16:07,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2019-09-07 13:16:07,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 13:16:07,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 13:16:07,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-07 13:16:07,167 INFO L87 Difference]: Start difference. First operand 1002092 states and 1178343 transitions. Second operand 12 states. [2019-09-07 13:17:01,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:17:01,935 INFO L93 Difference]: Finished difference Result 2008177 states and 2545221 transitions. [2019-09-07 13:17:01,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-07 13:17:01,936 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 399 [2019-09-07 13:17:01,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:17:06,108 INFO L225 Difference]: With dead ends: 2008177 [2019-09-07 13:17:06,108 INFO L226 Difference]: Without dead ends: 1018747 [2019-09-07 13:17:07,888 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 458 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2183 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=868, Invalid=5294, Unknown=0, NotChecked=0, Total=6162 [2019-09-07 13:17:08,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018747 states. [2019-09-07 13:17:50,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018747 to 966996. [2019-09-07 13:17:50,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966996 states. [2019-09-07 13:18:08,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966996 states to 966996 states and 1111671 transitions. [2019-09-07 13:18:08,510 INFO L78 Accepts]: Start accepts. Automaton has 966996 states and 1111671 transitions. Word has length 399 [2019-09-07 13:18:08,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:18:08,511 INFO L475 AbstractCegarLoop]: Abstraction has 966996 states and 1111671 transitions. [2019-09-07 13:18:08,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 13:18:08,511 INFO L276 IsEmpty]: Start isEmpty. Operand 966996 states and 1111671 transitions. [2019-09-07 13:18:08,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2019-09-07 13:18:08,677 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:18:08,677 INFO L399 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:18:08,677 INFO L418 AbstractCegarLoop]: === Iteration 20 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:18:08,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:18:08,678 INFO L82 PathProgramCache]: Analyzing trace with hash 2028992810, now seen corresponding path program 1 times [2019-09-07 13:18:08,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:18:08,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:18:08,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:18:08,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:18:08,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:18:08,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:18:09,079 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 313 proven. 32 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-07 13:18:09,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:18:09,080 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) [2019-09-07 13:18:09,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 13:18:09,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:18:09,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 1533 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 13:18:09,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:18:11,624 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 350 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-07 13:18:11,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 13:18:11,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 13:18:11,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 13:18:11,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 13:18:11,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:18:11,630 INFO L87 Difference]: Start difference. First operand 966996 states and 1111671 transitions. Second operand 9 states.