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_label51.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 13:31:48,862 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 13:31:48,864 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 13:31:48,876 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 13:31:48,877 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 13:31:48,878 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 13:31:48,879 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 13:31:48,881 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 13:31:48,882 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 13:31:48,883 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 13:31:48,884 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 13:31:48,885 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 13:31:48,886 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 13:31:48,886 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 13:31:48,887 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 13:31:48,888 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 13:31:48,889 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 13:31:48,890 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 13:31:48,892 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 13:31:48,894 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 13:31:48,895 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 13:31:48,896 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 13:31:48,897 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 13:31:48,898 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 13:31:48,900 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 13:31:48,900 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 13:31:48,901 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 13:31:48,902 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 13:31:48,902 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 13:31:48,903 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 13:31:48,903 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 13:31:48,904 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 13:31:48,905 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 13:31:48,905 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 13:31:48,906 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 13:31:48,907 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 13:31:48,907 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 13:31:48,907 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 13:31:48,908 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 13:31:48,908 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 13:31:48,909 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 13:31:48,910 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:31:48,931 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 13:31:48,931 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 13:31:48,933 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 13:31:48,933 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 13:31:48,933 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 13:31:48,933 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 13:31:48,934 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 13:31:48,934 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 13:31:48,935 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 13:31:48,935 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 13:31:48,935 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 13:31:48,935 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 13:31:48,935 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 13:31:48,935 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 13:31:48,936 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 13:31:48,936 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 13:31:48,936 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 13:31:48,936 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 13:31:48,936 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 13:31:48,937 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 13:31:48,937 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 13:31:48,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 13:31:48,939 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 13:31:48,939 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 13:31:48,939 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 13:31:48,939 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 13:31:48,939 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 13:31:48,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 13:31:48,940 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 13:31:48,969 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 13:31:48,981 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 13:31:48,985 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 13:31:48,986 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 13:31:48,987 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 13:31:48,987 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label51.c [2019-09-07 13:31:49,048 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7026ace5a/6cbf967e130b4b68835c121cabf24d4a/FLAG10f9451ca [2019-09-07 13:31:49,708 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 13:31:49,709 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label51.c [2019-09-07 13:31:49,726 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7026ace5a/6cbf967e130b4b68835c121cabf24d4a/FLAG10f9451ca [2019-09-07 13:31:49,886 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7026ace5a/6cbf967e130b4b68835c121cabf24d4a [2019-09-07 13:31:49,896 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 13:31:49,898 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 13:31:49,898 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 13:31:49,898 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 13:31:49,902 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 13:31:49,903 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 01:31:49" (1/1) ... [2019-09-07 13:31:49,906 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@390dd54b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:31:49, skipping insertion in model container [2019-09-07 13:31:49,906 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 01:31:49" (1/1) ... [2019-09-07 13:31:49,913 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 13:31:49,985 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 13:31:50,834 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 13:31:50,853 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 13:31:51,173 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 13:31:51,199 INFO L192 MainTranslator]: Completed translation [2019-09-07 13:31:51,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:31:51 WrapperNode [2019-09-07 13:31:51,200 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 13:31:51,201 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 13:31:51,201 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 13:31:51,201 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 13:31:51,221 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:31:51" (1/1) ... [2019-09-07 13:31:51,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:31:51" (1/1) ... [2019-09-07 13:31:51,279 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:31:51" (1/1) ... [2019-09-07 13:31:51,280 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:31:51" (1/1) ... [2019-09-07 13:31:51,365 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:31:51" (1/1) ... [2019-09-07 13:31:51,395 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:31:51" (1/1) ... [2019-09-07 13:31:51,411 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:31:51" (1/1) ... [2019-09-07 13:31:51,426 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 13:31:51,427 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 13:31:51,427 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 13:31:51,427 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 13:31:51,428 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:31:51" (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:31:51,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 13:31:51,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 13:31:51,503 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 13:31:51,503 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 13:31:51,504 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 13:31:51,504 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 13:31:51,504 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 13:31:51,504 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 13:31:51,504 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 13:31:51,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 13:31:51,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 13:31:53,522 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 13:31:53,522 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 13:31:53,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 01:31:53 BoogieIcfgContainer [2019-09-07 13:31:53,524 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 13:31:53,527 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 13:31:53,528 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 13:31:53,532 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 13:31:53,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 01:31:49" (1/3) ... [2019-09-07 13:31:53,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76ff3d46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 01:31:53, skipping insertion in model container [2019-09-07 13:31:53,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:31:51" (2/3) ... [2019-09-07 13:31:53,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76ff3d46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 01:31:53, skipping insertion in model container [2019-09-07 13:31:53,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 01:31:53" (3/3) ... [2019-09-07 13:31:53,537 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label51.c [2019-09-07 13:31:53,550 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 13:31:53,563 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 13:31:53,580 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 13:31:53,632 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 13:31:53,633 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 13:31:53,633 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 13:31:53,633 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 13:31:53,633 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 13:31:53,633 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 13:31:53,634 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 13:31:53,634 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 13:31:53,634 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 13:31:53,670 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states. [2019-09-07 13:31:53,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-07 13:31:53,701 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:31:53,706 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, 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:31:53,708 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:31:53,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:31:53,714 INFO L82 PathProgramCache]: Analyzing trace with hash 388330613, now seen corresponding path program 1 times [2019-09-07 13:31:53,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:31:53,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:31:53,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:31:53,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:31:53,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:31:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:31:54,613 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:31:54,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:31:54,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 13:31:54,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 13:31:54,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 13:31:54,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 13:31:54,676 INFO L87 Difference]: Start difference. First operand 311 states. Second operand 4 states. [2019-09-07 13:31:56,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:31:56,865 INFO L93 Difference]: Finished difference Result 1073 states and 1923 transitions. [2019-09-07 13:31:56,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 13:31:56,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2019-09-07 13:31:56,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:31:56,894 INFO L225 Difference]: With dead ends: 1073 [2019-09-07 13:31:56,894 INFO L226 Difference]: Without dead ends: 680 [2019-09-07 13:31:56,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 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:31:56,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2019-09-07 13:31:56,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 457. [2019-09-07 13:31:56,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2019-09-07 13:31:57,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 751 transitions. [2019-09-07 13:31:57,002 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 751 transitions. Word has length 194 [2019-09-07 13:31:57,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:31:57,003 INFO L475 AbstractCegarLoop]: Abstraction has 457 states and 751 transitions. [2019-09-07 13:31:57,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 13:31:57,003 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 751 transitions. [2019-09-07 13:31:57,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-09-07 13:31:57,008 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:31:57,009 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:57,009 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:31:57,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:31:57,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1307095378, now seen corresponding path program 1 times [2019-09-07 13:31:57,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:31:57,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:31:57,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:31:57,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:31:57,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:31:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:31:57,259 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:31:57,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:31:57,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 13:31:57,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:31:57,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:31:57,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:31:57,263 INFO L87 Difference]: Start difference. First operand 457 states and 751 transitions. Second operand 6 states. [2019-09-07 13:31:58,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:31:58,729 INFO L93 Difference]: Finished difference Result 1352 states and 2254 transitions. [2019-09-07 13:31:58,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 13:31:58,730 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 221 [2019-09-07 13:31:58,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:31:58,737 INFO L225 Difference]: With dead ends: 1352 [2019-09-07 13:31:58,738 INFO L226 Difference]: Without dead ends: 901 [2019-09-07 13:31:58,740 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:31:58,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2019-09-07 13:31:58,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 885. [2019-09-07 13:31:58,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2019-09-07 13:31:58,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1304 transitions. [2019-09-07 13:31:58,800 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1304 transitions. Word has length 221 [2019-09-07 13:31:58,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:31:58,801 INFO L475 AbstractCegarLoop]: Abstraction has 885 states and 1304 transitions. [2019-09-07 13:31:58,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:31:58,801 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1304 transitions. [2019-09-07 13:31:58,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-07 13:31:58,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:31:58,807 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:58,807 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:31:58,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:31:58,808 INFO L82 PathProgramCache]: Analyzing trace with hash 207619566, now seen corresponding path program 1 times [2019-09-07 13:31:58,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:31:58,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:31:58,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:31:58,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:31:58,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:31:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:31:59,007 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:31:59,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:31:59,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 13:31:59,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:31:59,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:31:59,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:31:59,009 INFO L87 Difference]: Start difference. First operand 885 states and 1304 transitions. Second operand 6 states. [2019-09-07 13:32:00,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:32:00,682 INFO L93 Difference]: Finished difference Result 2662 states and 4066 transitions. [2019-09-07 13:32:00,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 13:32:00,683 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 228 [2019-09-07 13:32:00,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:32:00,704 INFO L225 Difference]: With dead ends: 2662 [2019-09-07 13:32:00,704 INFO L226 Difference]: Without dead ends: 1783 [2019-09-07 13:32:00,708 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:32:00,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2019-09-07 13:32:00,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1748. [2019-09-07 13:32:00,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1748 states. [2019-09-07 13:32:00,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2579 transitions. [2019-09-07 13:32:00,818 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2579 transitions. Word has length 228 [2019-09-07 13:32:00,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:32:00,820 INFO L475 AbstractCegarLoop]: Abstraction has 1748 states and 2579 transitions. [2019-09-07 13:32:00,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:32:00,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2579 transitions. [2019-09-07 13:32:00,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-07 13:32:00,843 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:32:00,843 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:32:00,843 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:32:00,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:32:00,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1820245670, now seen corresponding path program 1 times [2019-09-07 13:32:00,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:32:00,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:32:00,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:32:00,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:32:00,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:32:00,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:32:01,033 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 50 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:32:01,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:32:01,033 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 13:32:01,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 13:32:01,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:32:01,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 1057 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 13:32:01,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:32:01,525 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 13:32:01,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 13:32:01,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-09-07 13:32:01,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 13:32:01,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 13:32:01,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-07 13:32:01,534 INFO L87 Difference]: Start difference. First operand 1748 states and 2579 transitions. Second operand 8 states. [2019-09-07 13:32:07,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:32:07,246 INFO L93 Difference]: Finished difference Result 7698 states and 13680 transitions. [2019-09-07 13:32:07,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-07 13:32:07,247 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 240 [2019-09-07 13:32:07,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:32:07,299 INFO L225 Difference]: With dead ends: 7698 [2019-09-07 13:32:07,299 INFO L226 Difference]: Without dead ends: 5956 [2019-09-07 13:32:07,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=193, Invalid=677, Unknown=0, NotChecked=0, Total=870 [2019-09-07 13:32:07,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5956 states. [2019-09-07 13:32:07,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5956 to 5712. [2019-09-07 13:32:07,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5712 states. [2019-09-07 13:32:07,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5712 states to 5712 states and 8026 transitions. [2019-09-07 13:32:07,605 INFO L78 Accepts]: Start accepts. Automaton has 5712 states and 8026 transitions. Word has length 240 [2019-09-07 13:32:07,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:32:07,606 INFO L475 AbstractCegarLoop]: Abstraction has 5712 states and 8026 transitions. [2019-09-07 13:32:07,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 13:32:07,606 INFO L276 IsEmpty]: Start isEmpty. Operand 5712 states and 8026 transitions. [2019-09-07 13:32:07,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-07 13:32:07,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:32:07,630 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:07,631 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:32:07,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:32:07,631 INFO L82 PathProgramCache]: Analyzing trace with hash -21769117, now seen corresponding path program 1 times [2019-09-07 13:32:07,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:32:07,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:32:07,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:32:07,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:32:07,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:32:07,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:32:07,877 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:32:07,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:32:07,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:32:07,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:32:07,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:32:07,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:32:07,879 INFO L87 Difference]: Start difference. First operand 5712 states and 8026 transitions. Second operand 3 states. [2019-09-07 13:32:09,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:32:09,051 INFO L93 Difference]: Finished difference Result 15855 states and 22994 transitions. [2019-09-07 13:32:09,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:32:09,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-09-07 13:32:09,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:32:09,108 INFO L225 Difference]: With dead ends: 15855 [2019-09-07 13:32:09,108 INFO L226 Difference]: Without dead ends: 10157 [2019-09-07 13:32:09,127 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:32:09,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10157 states. [2019-09-07 13:32:09,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10157 to 10144. [2019-09-07 13:32:09,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10144 states. [2019-09-07 13:32:09,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10144 states to 10144 states and 14306 transitions. [2019-09-07 13:32:09,439 INFO L78 Accepts]: Start accepts. Automaton has 10144 states and 14306 transitions. Word has length 239 [2019-09-07 13:32:09,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:32:09,439 INFO L475 AbstractCegarLoop]: Abstraction has 10144 states and 14306 transitions. [2019-09-07 13:32:09,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:32:09,440 INFO L276 IsEmpty]: Start isEmpty. Operand 10144 states and 14306 transitions. [2019-09-07 13:32:09,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-07 13:32:09,485 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:32:09,486 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:32:09,486 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:32:09,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:32:09,487 INFO L82 PathProgramCache]: Analyzing trace with hash -987774248, now seen corresponding path program 1 times [2019-09-07 13:32:09,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:32:09,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:32:09,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:32:09,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:32:09,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:32:09,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:32:09,665 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 43 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 13:32:09,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:32:09,665 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:32:09,682 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:32:09,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:32:09,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 1061 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 13:32:09,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:32:09,953 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-07 13:32:09,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 13:32:09,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 13:32:09,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 13:32:09,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 13:32:09,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:32:09,960 INFO L87 Difference]: Start difference. First operand 10144 states and 14306 transitions. Second operand 9 states. [2019-09-07 13:32:11,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:32:11,754 INFO L93 Difference]: Finished difference Result 20440 states and 30489 transitions. [2019-09-07 13:32:11,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 13:32:11,755 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 245 [2019-09-07 13:32:11,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:32:11,832 INFO L225 Difference]: With dead ends: 20440 [2019-09-07 13:32:11,832 INFO L226 Difference]: Without dead ends: 10310 [2019-09-07 13:32:11,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-09-07 13:32:11,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10310 states. [2019-09-07 13:32:12,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10310 to 9302. [2019-09-07 13:32:12,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9302 states. [2019-09-07 13:32:12,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9302 states to 9302 states and 12329 transitions. [2019-09-07 13:32:12,194 INFO L78 Accepts]: Start accepts. Automaton has 9302 states and 12329 transitions. Word has length 245 [2019-09-07 13:32:12,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:32:12,194 INFO L475 AbstractCegarLoop]: Abstraction has 9302 states and 12329 transitions. [2019-09-07 13:32:12,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 13:32:12,195 INFO L276 IsEmpty]: Start isEmpty. Operand 9302 states and 12329 transitions. [2019-09-07 13:32:12,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-07 13:32:12,220 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:32:12,220 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:32:12,221 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:32:12,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:32:12,224 INFO L82 PathProgramCache]: Analyzing trace with hash 2080072400, now seen corresponding path program 1 times [2019-09-07 13:32:12,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:32:12,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:32:12,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:32:12,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:32:12,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:32:12,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:32:12,369 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 70 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-07 13:32:12,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:32:12,370 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 13:32:12,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:32:12,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:32:12,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 1229 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 13:32:12,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:32:12,830 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 77 proven. 2 refuted. 0 times theorem prover too weak. 25 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:32:12,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 13:32:12,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 13:32:12,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 13:32:12,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 13:32:12,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:32:12,852 INFO L87 Difference]: Start difference. First operand 9302 states and 12329 transitions. Second operand 9 states. [2019-09-07 13:32:15,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:32:15,036 INFO L93 Difference]: Finished difference Result 23481 states and 32014 transitions. [2019-09-07 13:32:15,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 13:32:15,037 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 259 [2019-09-07 13:32:15,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:32:15,093 INFO L225 Difference]: With dead ends: 23481 [2019-09-07 13:32:15,093 INFO L226 Difference]: Without dead ends: 14189 [2019-09-07 13:32:15,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-09-07 13:32:15,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14189 states. [2019-09-07 13:32:15,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14189 to 14106. [2019-09-07 13:32:15,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14106 states. [2019-09-07 13:32:15,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14106 states to 14106 states and 18206 transitions. [2019-09-07 13:32:15,530 INFO L78 Accepts]: Start accepts. Automaton has 14106 states and 18206 transitions. Word has length 259 [2019-09-07 13:32:15,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:32:15,531 INFO L475 AbstractCegarLoop]: Abstraction has 14106 states and 18206 transitions. [2019-09-07 13:32:15,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 13:32:15,531 INFO L276 IsEmpty]: Start isEmpty. Operand 14106 states and 18206 transitions. [2019-09-07 13:32:15,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-09-07 13:32:15,576 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:32:15,576 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:15,577 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:32:15,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:32:15,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1661458033, now seen corresponding path program 1 times [2019-09-07 13:32:15,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:32:15,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:32:15,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:32:15,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:32:15,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:32:15,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:32:16,022 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:32:16,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:32:16,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) [2019-09-07 13:32:16,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 13:32:16,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:32:16,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 927 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 13:32:16,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:32:16,317 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:32:16,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 13:32:16,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2019-09-07 13:32:16,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 13:32:16,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 13:32:16,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-07 13:32:16,335 INFO L87 Difference]: Start difference. First operand 14106 states and 18206 transitions. Second operand 8 states. [2019-09-07 13:32:21,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:32:21,946 INFO L93 Difference]: Finished difference Result 64050 states and 93451 transitions. [2019-09-07 13:32:21,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 13:32:21,947 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 272 [2019-09-07 13:32:21,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:32:22,335 INFO L225 Difference]: With dead ends: 64050 [2019-09-07 13:32:22,336 INFO L226 Difference]: Without dead ends: 49954 [2019-09-07 13:32:22,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2019-09-07 13:32:22,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49954 states. [2019-09-07 13:32:24,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49954 to 48620. [2019-09-07 13:32:24,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48620 states. [2019-09-07 13:32:25,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48620 states to 48620 states and 69460 transitions. [2019-09-07 13:32:25,091 INFO L78 Accepts]: Start accepts. Automaton has 48620 states and 69460 transitions. Word has length 272 [2019-09-07 13:32:25,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:32:25,092 INFO L475 AbstractCegarLoop]: Abstraction has 48620 states and 69460 transitions. [2019-09-07 13:32:25,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 13:32:25,092 INFO L276 IsEmpty]: Start isEmpty. Operand 48620 states and 69460 transitions. [2019-09-07 13:32:25,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-09-07 13:32:25,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:32:25,235 INFO L399 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:32:25,235 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:32:25,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:32:25,235 INFO L82 PathProgramCache]: Analyzing trace with hash 334507625, now seen corresponding path program 1 times [2019-09-07 13:32:25,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:32:25,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:32:25,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:32:25,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:32:25,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:32:25,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:32:25,410 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 118 proven. 8 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-07 13:32:25,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:32:25,411 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 13:32:25,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 13:32:25,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:32:25,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 1285 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 13:32:25,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:32:25,713 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-07 13:32:25,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 13:32:25,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-09-07 13:32:25,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:32:25,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:32:25,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:32:25,726 INFO L87 Difference]: Start difference. First operand 48620 states and 69460 transitions. Second operand 6 states. [2019-09-07 13:32:31,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:32:31,521 INFO L93 Difference]: Finished difference Result 189029 states and 327188 transitions. [2019-09-07 13:32:31,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 13:32:31,521 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 315 [2019-09-07 13:32:31,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:32:33,064 INFO L225 Difference]: With dead ends: 189029 [2019-09-07 13:32:33,064 INFO L226 Difference]: Without dead ends: 140832 [2019-09-07 13:32:33,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-09-07 13:32:33,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140832 states. [2019-09-07 13:32:39,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140832 to 129709. [2019-09-07 13:32:39,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129709 states. [2019-09-07 13:32:43,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129709 states to 129709 states and 199348 transitions. [2019-09-07 13:32:43,301 INFO L78 Accepts]: Start accepts. Automaton has 129709 states and 199348 transitions. Word has length 315 [2019-09-07 13:32:43,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:32:43,302 INFO L475 AbstractCegarLoop]: Abstraction has 129709 states and 199348 transitions. [2019-09-07 13:32:43,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:32:43,302 INFO L276 IsEmpty]: Start isEmpty. Operand 129709 states and 199348 transitions. [2019-09-07 13:32:43,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-09-07 13:32:43,554 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:32:43,555 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:32:43,555 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:32:43,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:32:43,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1209871512, now seen corresponding path program 1 times [2019-09-07 13:32:43,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:32:43,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:32:43,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:32:43,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:32:43,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:32:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:32:43,822 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 115 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 13:32:43,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:32:43,822 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:32:43,845 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:32:44,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:32:44,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 1134 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 13:32:44,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:32:44,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 13:32:44,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 13:32:44,177 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 13:32:44,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 13:32:44,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2019-09-07 13:32:44,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 13:32:44,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 13:32:44,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-07 13:32:44,194 INFO L87 Difference]: Start difference. First operand 129709 states and 199348 transitions. Second operand 11 states. [2019-09-07 13:32:50,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:32:50,602 INFO L93 Difference]: Finished difference Result 250887 states and 404571 transitions. [2019-09-07 13:32:50,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 13:32:50,602 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 317 [2019-09-07 13:32:50,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:32:51,960 INFO L225 Difference]: With dead ends: 250887 [2019-09-07 13:32:51,960 INFO L226 Difference]: Without dead ends: 135397 [2019-09-07 13:32:52,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 325 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=392, Unknown=0, NotChecked=0, Total=552 [2019-09-07 13:32:52,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135397 states. [2019-09-07 13:32:56,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135397 to 129447. [2019-09-07 13:32:56,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129447 states. [2019-09-07 13:32:56,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129447 states to 129447 states and 197506 transitions. [2019-09-07 13:32:56,901 INFO L78 Accepts]: Start accepts. Automaton has 129447 states and 197506 transitions. Word has length 317 [2019-09-07 13:32:56,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:32:56,901 INFO L475 AbstractCegarLoop]: Abstraction has 129447 states and 197506 transitions. [2019-09-07 13:32:56,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 13:32:56,902 INFO L276 IsEmpty]: Start isEmpty. Operand 129447 states and 197506 transitions. [2019-09-07 13:32:57,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-09-07 13:32:57,103 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:32:57,104 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:32:57,104 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:32:57,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:32:57,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1423633685, now seen corresponding path program 1 times [2019-09-07 13:32:57,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:32:57,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:32:57,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:32:57,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:32:57,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:32:57,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:32:58,390 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 119 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 13:32:58,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:32:58,392 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:32:58,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:32:58,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:32:58,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 1130 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 13:32:58,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:32:58,711 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 13:32:58,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 13:32:58,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 13:32:58,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 13:32:58,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 13:32:58,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:32:58,731 INFO L87 Difference]: Start difference. First operand 129447 states and 197506 transitions. Second operand 9 states. [2019-09-07 13:33:05,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:33:05,472 INFO L93 Difference]: Finished difference Result 342163 states and 528865 transitions. [2019-09-07 13:33:05,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 13:33:05,472 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 319 [2019-09-07 13:33:05,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:33:06,425 INFO L225 Difference]: With dead ends: 342163 [2019-09-07 13:33:06,425 INFO L226 Difference]: Without dead ends: 216360 [2019-09-07 13:33:06,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 327 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2019-09-07 13:33:06,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216360 states. [2019-09-07 13:33:16,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216360 to 213395. [2019-09-07 13:33:16,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213395 states. [2019-09-07 13:33:17,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213395 states to 213395 states and 326573 transitions. [2019-09-07 13:33:17,733 INFO L78 Accepts]: Start accepts. Automaton has 213395 states and 326573 transitions. Word has length 319 [2019-09-07 13:33:17,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:33:17,734 INFO L475 AbstractCegarLoop]: Abstraction has 213395 states and 326573 transitions. [2019-09-07 13:33:17,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 13:33:17,734 INFO L276 IsEmpty]: Start isEmpty. Operand 213395 states and 326573 transitions. [2019-09-07 13:33:18,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-07 13:33:18,050 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:33:18,051 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:18,051 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:33:18,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:33:18,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1510567215, now seen corresponding path program 1 times [2019-09-07 13:33:18,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:33:18,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:33:18,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:33:18,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:33:18,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:33:18,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:33:18,608 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:33:18,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:33:18,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-07 13:33:18,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 13:33:18,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 13:33:18,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:33:18,610 INFO L87 Difference]: Start difference. First operand 213395 states and 326573 transitions. Second operand 7 states. [2019-09-07 13:33:30,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:33:30,992 INFO L93 Difference]: Finished difference Result 447716 states and 683505 transitions. [2019-09-07 13:33:30,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 13:33:30,993 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 328 [2019-09-07 13:33:30,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:33:32,146 INFO L225 Difference]: With dead ends: 447716 [2019-09-07 13:33:32,146 INFO L226 Difference]: Without dead ends: 253286 [2019-09-07 13:33:32,548 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-09-07 13:33:32,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253286 states. [2019-09-07 13:33:39,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253286 to 251972. [2019-09-07 13:33:39,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251972 states. [2019-09-07 13:33:40,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251972 states to 251972 states and 375923 transitions. [2019-09-07 13:33:40,230 INFO L78 Accepts]: Start accepts. Automaton has 251972 states and 375923 transitions. Word has length 328 [2019-09-07 13:33:40,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:33:40,231 INFO L475 AbstractCegarLoop]: Abstraction has 251972 states and 375923 transitions. [2019-09-07 13:33:40,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 13:33:40,231 INFO L276 IsEmpty]: Start isEmpty. Operand 251972 states and 375923 transitions. [2019-09-07 13:33:40,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-09-07 13:33:40,581 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:33:40,581 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 13:33:40,581 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:33:40,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:33:40,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1571216088, now seen corresponding path program 1 times [2019-09-07 13:33:40,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:33:40,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:33:40,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:33:40,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:33:40,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:33:40,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:33:45,572 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 182 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:33:45,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:33:45,573 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 13:33:45,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:33:45,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:33:45,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 1149 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 13:33:45,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:33:45,912 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-07 13:33:45,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 13:33:45,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2019-09-07 13:33:45,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 13:33:45,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 13:33:45,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-07 13:33:45,920 INFO L87 Difference]: Start difference. First operand 251972 states and 375923 transitions. Second operand 10 states. [2019-09-07 13:34:05,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:34:05,022 INFO L93 Difference]: Finished difference Result 557786 states and 985045 transitions. [2019-09-07 13:34:05,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-07 13:34:05,023 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 338 [2019-09-07 13:34:05,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:34:07,743 INFO L225 Difference]: With dead ends: 557786 [2019-09-07 13:34:07,743 INFO L226 Difference]: Without dead ends: 325425 [2019-09-07 13:34:09,354 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1765 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=745, Invalid=4225, Unknown=0, NotChecked=0, Total=4970 [2019-09-07 13:34:09,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325425 states. [2019-09-07 13:34:28,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325425 to 304445. [2019-09-07 13:34:28,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304445 states. [2019-09-07 13:34:29,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304445 states to 304445 states and 444345 transitions. [2019-09-07 13:34:29,451 INFO L78 Accepts]: Start accepts. Automaton has 304445 states and 444345 transitions. Word has length 338 [2019-09-07 13:34:29,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:34:29,452 INFO L475 AbstractCegarLoop]: Abstraction has 304445 states and 444345 transitions. [2019-09-07 13:34:29,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 13:34:29,452 INFO L276 IsEmpty]: Start isEmpty. Operand 304445 states and 444345 transitions. [2019-09-07 13:34:29,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-09-07 13:34:29,902 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:34:29,902 INFO L399 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 13:34:29,902 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:34:29,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:34:29,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1664456027, now seen corresponding path program 1 times [2019-09-07 13:34:29,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:34:29,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:34:29,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:34:29,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:34:29,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:34:29,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:34:31,111 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 155 proven. 8 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-07 13:34:31,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:34:31,112 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:34:31,137 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:34:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:34:31,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 1321 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 13:34:31,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:34:31,472 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 161 proven. 2 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-07 13:34:31,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 13:34:31,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-07 13:34:31,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:34:31,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:34:31,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:34:31,490 INFO L87 Difference]: Start difference. First operand 304445 states and 444345 transitions. Second operand 6 states. [2019-09-07 13:34:59,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:34:59,241 INFO L93 Difference]: Finished difference Result 653459 states and 1156708 transitions. [2019-09-07 13:34:59,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 13:34:59,242 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 350 [2019-09-07 13:34:59,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:35:02,642 INFO L225 Difference]: With dead ends: 653459 [2019-09-07 13:35:02,642 INFO L226 Difference]: Without dead ends: 350069 [2019-09-07 13:35:03,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-09-07 13:35:03,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350069 states. [2019-09-07 13:35:19,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350069 to 319307. [2019-09-07 13:35:19,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319307 states. [2019-09-07 13:35:20,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319307 states to 319307 states and 460897 transitions. [2019-09-07 13:35:20,310 INFO L78 Accepts]: Start accepts. Automaton has 319307 states and 460897 transitions. Word has length 350 [2019-09-07 13:35:20,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:35:20,310 INFO L475 AbstractCegarLoop]: Abstraction has 319307 states and 460897 transitions. [2019-09-07 13:35:20,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:35:20,310 INFO L276 IsEmpty]: Start isEmpty. Operand 319307 states and 460897 transitions. [2019-09-07 13:35:22,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-09-07 13:35:22,329 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:35:22,330 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:35:22,330 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:35:22,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:35:22,330 INFO L82 PathProgramCache]: Analyzing trace with hash 125725689, now seen corresponding path program 1 times [2019-09-07 13:35:22,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:35:22,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:35:22,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:35:22,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:35:22,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:35:22,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:35:22,683 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 169 proven. 51 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-07 13:35:22,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:35:22,684 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:35:22,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:35:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:35:22,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 1486 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 13:35:22,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:35:23,110 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 188 proven. 30 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-07 13:35:23,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 13:35:23,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-09-07 13:35:23,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 13:35:23,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 13:35:23,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-07 13:35:23,126 INFO L87 Difference]: Start difference. First operand 319307 states and 460897 transitions. Second operand 8 states. [2019-09-07 13:35:47,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:35:47,381 INFO L93 Difference]: Finished difference Result 679512 states and 1157103 transitions. [2019-09-07 13:35:47,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-07 13:35:47,382 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 357 [2019-09-07 13:35:47,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:35:51,186 INFO L225 Difference]: With dead ends: 679512 [2019-09-07 13:35:51,187 INFO L226 Difference]: Without dead ends: 363229 [2019-09-07 13:35:51,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=247, Invalid=875, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 13:35:52,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363229 states. [2019-09-07 13:36:12,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363229 to 342982. [2019-09-07 13:36:12,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342982 states. [2019-09-07 13:36:14,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342982 states to 342982 states and 475900 transitions. [2019-09-07 13:36:14,041 INFO L78 Accepts]: Start accepts. Automaton has 342982 states and 475900 transitions. Word has length 357 [2019-09-07 13:36:14,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:36:14,042 INFO L475 AbstractCegarLoop]: Abstraction has 342982 states and 475900 transitions. [2019-09-07 13:36:14,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 13:36:14,042 INFO L276 IsEmpty]: Start isEmpty. Operand 342982 states and 475900 transitions. [2019-09-07 13:36:15,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2019-09-07 13:36:15,738 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:36:15,738 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 13:36:15,738 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:36:15,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:36:15,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1490182678, now seen corresponding path program 1 times [2019-09-07 13:36:15,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:36:15,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:36:15,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:36:15,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:36:15,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:36:15,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:36:16,089 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 165 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 13:36:16,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:36:16,089 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:36:16,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:36:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:36:16,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 1178 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 13:36:16,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:36:16,421 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-07 13:36:16,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 13:36:16,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2019-09-07 13:36:16,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 13:36:16,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 13:36:16,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-09-07 13:36:16,427 INFO L87 Difference]: Start difference. First operand 342982 states and 475900 transitions. Second operand 11 states. [2019-09-07 13:37:05,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:37:05,469 INFO L93 Difference]: Finished difference Result 1264651 states and 2165997 transitions. [2019-09-07 13:37:05,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-07 13:37:05,470 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 367 [2019-09-07 13:37:05,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:37:13,758 INFO L225 Difference]: With dead ends: 1264651 [2019-09-07 13:37:13,758 INFO L226 Difference]: Without dead ends: 955267 [2019-09-07 13:37:14,584 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=189, Invalid=513, Unknown=0, NotChecked=0, Total=702 [2019-09-07 13:37:16,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955267 states. [2019-09-07 13:38:09,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955267 to 895094. [2019-09-07 13:38:09,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895094 states. [2019-09-07 13:38:30,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895094 states to 895094 states and 1267640 transitions. [2019-09-07 13:38:30,465 INFO L78 Accepts]: Start accepts. Automaton has 895094 states and 1267640 transitions. Word has length 367 [2019-09-07 13:38:30,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:38:30,465 INFO L475 AbstractCegarLoop]: Abstraction has 895094 states and 1267640 transitions. [2019-09-07 13:38:30,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 13:38:30,466 INFO L276 IsEmpty]: Start isEmpty. Operand 895094 states and 1267640 transitions. [2019-09-07 13:38:31,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2019-09-07 13:38:31,170 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:38:31,170 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 13:38:31,171 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:38:31,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:38:31,171 INFO L82 PathProgramCache]: Analyzing trace with hash -87506288, now seen corresponding path program 1 times [2019-09-07 13:38:31,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:38:31,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:38:31,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:38:31,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:38:31,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:38:32,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:38:33,163 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 228 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:38:33,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:38:33,164 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:38:33,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:38:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:38:33,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 1196 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 13:38:33,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:38:33,544 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-07 13:38:33,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 13:38:33,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 13:38:33,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 13:38:33,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 13:38:33,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:38:33,557 INFO L87 Difference]: Start difference. First operand 895094 states and 1267640 transitions. Second operand 9 states. [2019-09-07 13:38:37,066 WARN L188 SmtUtils]: Spent 1.27 s on a formula simplification that was a NOOP. DAG size: 12 [2019-09-07 13:39:34,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:39:34,073 INFO L93 Difference]: Finished difference Result 1567780 states and 2516295 transitions. [2019-09-07 13:39:34,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-07 13:39:34,074 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 384 [2019-09-07 13:39:34,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:39:38,863 INFO L225 Difference]: With dead ends: 1567780 [2019-09-07 13:39:38,863 INFO L226 Difference]: Without dead ends: 673949 [2019-09-07 13:39:41,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 400 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=214, Invalid=842, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 13:39:41,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673949 states. [2019-09-07 13:40:17,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673949 to 560662. [2019-09-07 13:40:17,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560662 states. [2019-09-07 13:40:20,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560662 states to 560662 states and 734625 transitions. [2019-09-07 13:40:20,470 INFO L78 Accepts]: Start accepts. Automaton has 560662 states and 734625 transitions. Word has length 384 [2019-09-07 13:40:20,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:40:20,470 INFO L475 AbstractCegarLoop]: Abstraction has 560662 states and 734625 transitions. [2019-09-07 13:40:20,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 13:40:20,470 INFO L276 IsEmpty]: Start isEmpty. Operand 560662 states and 734625 transitions. [2019-09-07 13:40:22,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2019-09-07 13:40:22,495 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:40:22,495 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:22,495 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:40:22,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:40:22,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1424539559, now seen corresponding path program 1 times [2019-09-07 13:40:22,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:40:22,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:40:22,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:40:22,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:40:22,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:40:22,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:40:22,856 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 253 proven. 33 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-09-07 13:40:22,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:40:22,856 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:40:22,870 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:40:23,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:40:23,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 1676 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 13:40:23,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:40:23,234 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 277 proven. 2 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-09-07 13:40:23,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 13:40:23,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2019-09-07 13:40:23,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 13:40:23,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 13:40:23,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-07 13:40:23,242 INFO L87 Difference]: Start difference. First operand 560662 states and 734625 transitions. Second operand 12 states. [2019-09-07 13:40:55,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:40:55,116 INFO L93 Difference]: Finished difference Result 1110434 states and 1550802 transitions. [2019-09-07 13:40:55,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-07 13:40:55,116 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 399 [2019-09-07 13:40:55,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:40:58,338 INFO L225 Difference]: With dead ends: 1110434 [2019-09-07 13:40:58,339 INFO L226 Difference]: Without dead ends: 552146 [2019-09-07 13:40:59,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 422 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=1106, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 13:40:59,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552146 states. [2019-09-07 13:41:23,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552146 to 534496. [2019-09-07 13:41:23,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534496 states. [2019-09-07 13:41:29,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534496 states to 534496 states and 696908 transitions. [2019-09-07 13:41:29,573 INFO L78 Accepts]: Start accepts. Automaton has 534496 states and 696908 transitions. Word has length 399 [2019-09-07 13:41:29,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:41:29,574 INFO L475 AbstractCegarLoop]: Abstraction has 534496 states and 696908 transitions. [2019-09-07 13:41:29,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 13:41:29,574 INFO L276 IsEmpty]: Start isEmpty. Operand 534496 states and 696908 transitions. [2019-09-07 13:41:29,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2019-09-07 13:41:29,950 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:41:29,950 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:29,951 INFO L418 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:41:29,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:41:29,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1759966048, now seen corresponding path program 1 times [2019-09-07 13:41:29,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:41:29,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:41:29,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:41:29,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:41:29,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:41:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:41:30,451 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 239 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:41:30,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:41:30,452 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 13:41:30,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:41:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:41:30,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 1526 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 13:41:30,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:41:32,045 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 266 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-07 13:41:32,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 13:41:32,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 16 [2019-09-07 13:41:32,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 13:41:32,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 13:41:32,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-09-07 13:41:32,051 INFO L87 Difference]: Start difference. First operand 534496 states and 696908 transitions. Second operand 16 states.