java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem13_label25.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 19:35:49,884 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 19:35:49,887 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 19:35:49,904 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 19:35:49,905 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 19:35:49,906 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 19:35:49,908 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 19:35:49,921 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 19:35:49,923 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 19:35:49,924 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 19:35:49,925 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 19:35:49,926 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 19:35:49,926 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 19:35:49,927 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 19:35:49,928 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 19:35:49,929 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 19:35:49,932 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 19:35:49,934 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 19:35:49,936 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 19:35:49,938 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 19:35:49,940 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 19:35:49,943 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 19:35:49,944 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 19:35:49,944 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 19:35:49,949 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 19:35:49,949 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 19:35:49,949 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 19:35:49,951 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 19:35:49,953 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 19:35:49,954 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 19:35:49,954 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 19:35:49,955 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 19:35:49,955 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 19:35:49,956 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 19:35:49,957 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 19:35:49,957 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 19:35:49,958 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 19:35:49,958 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 19:35:49,958 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 19:35:49,959 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 19:35:49,960 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 19:35:49,960 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 19:35:49,978 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 19:35:49,979 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 19:35:49,982 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 19:35:49,983 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 19:35:49,983 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 19:35:49,983 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 19:35:49,983 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 19:35:49,983 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 19:35:49,984 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 19:35:49,984 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 19:35:49,984 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 19:35:49,985 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 19:35:49,985 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 19:35:49,985 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 19:35:49,985 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 19:35:49,986 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 19:35:49,986 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 19:35:49,986 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 19:35:49,986 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 19:35:49,987 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 19:35:49,987 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 19:35:49,987 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 19:35:49,988 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 19:35:49,989 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 19:35:49,989 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 19:35:49,989 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 19:35:49,989 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 19:35:49,990 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 19:35:49,990 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 19:35:50,039 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 19:35:50,056 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 19:35:50,060 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 19:35:50,062 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 19:35:50,062 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 19:35:50,063 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label25.c [2019-09-07 19:35:50,134 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d13da18c/7bce90e4d7dc40f9aeba0802d560c181/FLAG7f351cfba [2019-09-07 19:35:51,006 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 19:35:51,007 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label25.c [2019-09-07 19:35:51,060 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d13da18c/7bce90e4d7dc40f9aeba0802d560c181/FLAG7f351cfba [2019-09-07 19:35:51,477 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d13da18c/7bce90e4d7dc40f9aeba0802d560c181 [2019-09-07 19:35:51,487 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 19:35:51,488 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 19:35:51,489 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 19:35:51,489 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 19:35:51,492 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 19:35:51,493 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:35:51" (1/1) ... [2019-09-07 19:35:51,495 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24c983d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:35:51, skipping insertion in model container [2019-09-07 19:35:51,495 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:35:51" (1/1) ... [2019-09-07 19:35:51,503 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 19:35:51,671 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 19:35:53,555 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 19:35:53,564 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 19:35:54,321 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 19:35:54,367 INFO L192 MainTranslator]: Completed translation [2019-09-07 19:35:54,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:35:54 WrapperNode [2019-09-07 19:35:54,369 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 19:35:54,370 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 19:35:54,370 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 19:35:54,370 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 19:35:54,391 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:35:54" (1/1) ... [2019-09-07 19:35:54,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:35:54" (1/1) ... [2019-09-07 19:35:54,483 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:35:54" (1/1) ... [2019-09-07 19:35:54,485 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:35:54" (1/1) ... [2019-09-07 19:35:54,652 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:35:54" (1/1) ... [2019-09-07 19:35:54,691 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:35:54" (1/1) ... [2019-09-07 19:35:54,752 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:35:54" (1/1) ... [2019-09-07 19:35:54,813 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 19:35:54,813 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 19:35:54,814 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 19:35:54,814 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 19:35:54,815 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:35:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 19:35:54,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 19:35:54,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 19:35:54,879 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 19:35:54,880 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 19:35:54,880 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2019-09-07 19:35:54,880 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2019-09-07 19:35:54,880 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 19:35:54,880 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 19:35:54,881 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 19:35:54,881 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2019-09-07 19:35:54,881 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2019-09-07 19:35:54,881 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 19:35:54,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 19:35:54,882 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 19:35:54,883 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 19:35:54,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 19:35:54,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 19:36:01,698 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 19:36:01,699 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 19:36:01,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:36:01 BoogieIcfgContainer [2019-09-07 19:36:01,701 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 19:36:01,702 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 19:36:01,702 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 19:36:01,705 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 19:36:01,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 07:35:51" (1/3) ... [2019-09-07 19:36:01,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27eb31a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:36:01, skipping insertion in model container [2019-09-07 19:36:01,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:35:54" (2/3) ... [2019-09-07 19:36:01,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27eb31a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:36:01, skipping insertion in model container [2019-09-07 19:36:01,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:36:01" (3/3) ... [2019-09-07 19:36:01,708 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem13_label25.c [2019-09-07 19:36:01,718 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 19:36:01,728 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 19:36:01,746 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 19:36:01,795 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 19:36:01,796 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 19:36:01,796 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 19:36:01,796 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 19:36:01,796 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 19:36:01,797 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 19:36:01,797 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 19:36:01,797 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 19:36:01,797 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 19:36:01,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states. [2019-09-07 19:36:01,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-07 19:36:01,840 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:36:01,841 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] [2019-09-07 19:36:01,843 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:36:01,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:36:01,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1804033680, now seen corresponding path program 1 times [2019-09-07 19:36:01,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:36:01,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:36:01,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:36:01,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:36:01,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:36:01,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:36:02,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:36:02,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:36:02,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 19:36:02,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 19:36:02,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 19:36:02,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:36:02,160 INFO L87 Difference]: Start difference. First operand 1119 states. Second operand 4 states. [2019-09-07 19:36:12,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:36:12,424 INFO L93 Difference]: Finished difference Result 4059 states and 7607 transitions. [2019-09-07 19:36:12,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 19:36:12,427 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-09-07 19:36:12,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:36:12,467 INFO L225 Difference]: With dead ends: 4059 [2019-09-07 19:36:12,468 INFO L226 Difference]: Without dead ends: 2859 [2019-09-07 19:36:12,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:36:12,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2859 states. [2019-09-07 19:36:12,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2859 to 1920. [2019-09-07 19:36:12,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1920 states. [2019-09-07 19:36:12,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1920 states to 1920 states and 3303 transitions. [2019-09-07 19:36:12,636 INFO L78 Accepts]: Start accepts. Automaton has 1920 states and 3303 transitions. Word has length 29 [2019-09-07 19:36:12,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:36:12,638 INFO L475 AbstractCegarLoop]: Abstraction has 1920 states and 3303 transitions. [2019-09-07 19:36:12,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 19:36:12,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1920 states and 3303 transitions. [2019-09-07 19:36:12,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-07 19:36:12,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:36:12,646 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:36:12,646 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:36:12,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:36:12,647 INFO L82 PathProgramCache]: Analyzing trace with hash -678409448, now seen corresponding path program 1 times [2019-09-07 19:36:12,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:36:12,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:36:12,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:36:12,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:36:12,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:36:12,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:36:12,874 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:36:12,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:36:12,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:36:12,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:36:12,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:36:12,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:36:12,877 INFO L87 Difference]: Start difference. First operand 1920 states and 3303 transitions. Second operand 6 states. [2019-09-07 19:36:21,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:36:21,693 INFO L93 Difference]: Finished difference Result 5573 states and 9713 transitions. [2019-09-07 19:36:21,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:36:21,694 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-09-07 19:36:21,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:36:21,732 INFO L225 Difference]: With dead ends: 5573 [2019-09-07 19:36:21,733 INFO L226 Difference]: Without dead ends: 3659 [2019-09-07 19:36:21,742 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 19:36:21,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3659 states. [2019-09-07 19:36:21,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3659 to 3612. [2019-09-07 19:36:21,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3612 states. [2019-09-07 19:36:21,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3612 states to 3612 states and 6092 transitions. [2019-09-07 19:36:21,918 INFO L78 Accepts]: Start accepts. Automaton has 3612 states and 6092 transitions. Word has length 99 [2019-09-07 19:36:21,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:36:21,919 INFO L475 AbstractCegarLoop]: Abstraction has 3612 states and 6092 transitions. [2019-09-07 19:36:21,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:36:21,919 INFO L276 IsEmpty]: Start isEmpty. Operand 3612 states and 6092 transitions. [2019-09-07 19:36:21,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-07 19:36:21,929 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:36:21,930 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:36:21,930 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:36:21,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:36:21,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1037005519, now seen corresponding path program 1 times [2019-09-07 19:36:21,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:36:21,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:36:21,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:36:21,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:36:21,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:36:21,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:36:22,146 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:36:22,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:36:22,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:36:22,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:36:22,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:36:22,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:36:22,148 INFO L87 Difference]: Start difference. First operand 3612 states and 6092 transitions. Second operand 6 states. [2019-09-07 19:36:30,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:36:30,518 INFO L93 Difference]: Finished difference Result 8995 states and 15257 transitions. [2019-09-07 19:36:30,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:36:30,519 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2019-09-07 19:36:30,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:36:30,548 INFO L225 Difference]: With dead ends: 8995 [2019-09-07 19:36:30,551 INFO L226 Difference]: Without dead ends: 5389 [2019-09-07 19:36:30,562 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 19:36:30,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5389 states. [2019-09-07 19:36:30,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5389 to 5334. [2019-09-07 19:36:30,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5334 states. [2019-09-07 19:36:30,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5334 states to 5334 states and 8555 transitions. [2019-09-07 19:36:30,714 INFO L78 Accepts]: Start accepts. Automaton has 5334 states and 8555 transitions. Word has length 102 [2019-09-07 19:36:30,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:36:30,715 INFO L475 AbstractCegarLoop]: Abstraction has 5334 states and 8555 transitions. [2019-09-07 19:36:30,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:36:30,715 INFO L276 IsEmpty]: Start isEmpty. Operand 5334 states and 8555 transitions. [2019-09-07 19:36:30,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-07 19:36:30,716 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:36:30,717 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:36:30,717 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:36:30,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:36:30,718 INFO L82 PathProgramCache]: Analyzing trace with hash -507297851, now seen corresponding path program 1 times [2019-09-07 19:36:30,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:36:30,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:36:30,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:36:30,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:36:30,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:36:30,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:36:30,861 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:36:30,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:36:30,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 19:36:30,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 19:36:30,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 19:36:30,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 19:36:30,863 INFO L87 Difference]: Start difference. First operand 5334 states and 8555 transitions. Second operand 5 states. [2019-09-07 19:36:39,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:36:39,010 INFO L93 Difference]: Finished difference Result 16204 states and 27274 transitions. [2019-09-07 19:36:39,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 19:36:39,011 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 112 [2019-09-07 19:36:39,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:36:39,079 INFO L225 Difference]: With dead ends: 16204 [2019-09-07 19:36:39,079 INFO L226 Difference]: Without dead ends: 10876 [2019-09-07 19:36:39,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 19:36:39,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10876 states. [2019-09-07 19:36:39,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10876 to 10658. [2019-09-07 19:36:39,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10658 states. [2019-09-07 19:36:39,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10658 states to 10658 states and 16087 transitions. [2019-09-07 19:36:39,412 INFO L78 Accepts]: Start accepts. Automaton has 10658 states and 16087 transitions. Word has length 112 [2019-09-07 19:36:39,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:36:39,412 INFO L475 AbstractCegarLoop]: Abstraction has 10658 states and 16087 transitions. [2019-09-07 19:36:39,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 19:36:39,413 INFO L276 IsEmpty]: Start isEmpty. Operand 10658 states and 16087 transitions. [2019-09-07 19:36:39,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-07 19:36:39,415 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:36:39,415 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:36:39,416 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:36:39,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:36:39,416 INFO L82 PathProgramCache]: Analyzing trace with hash -123191767, now seen corresponding path program 1 times [2019-09-07 19:36:39,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:36:39,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:36:39,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:36:39,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:36:39,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:36:39,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:36:39,548 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 19:36:39,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:36:39,549 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:36:39,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:36:39,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:36:39,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 19:36:39,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:36:39,753 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 19:36:39,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:36:39,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-09-07 19:36:39,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:36:39,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:36:39,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:36:39,769 INFO L87 Difference]: Start difference. First operand 10658 states and 16087 transitions. Second operand 6 states. [2019-09-07 19:36:51,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:36:51,805 INFO L93 Difference]: Finished difference Result 41508 states and 68099 transitions. [2019-09-07 19:36:51,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 19:36:51,805 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2019-09-07 19:36:51,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:36:51,989 INFO L225 Difference]: With dead ends: 41508 [2019-09-07 19:36:51,989 INFO L226 Difference]: Without dead ends: 30856 [2019-09-07 19:36:52,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-09-07 19:36:52,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30856 states. [2019-09-07 19:36:52,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30856 to 30700. [2019-09-07 19:36:52,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30700 states. [2019-09-07 19:36:53,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30700 states to 30700 states and 46095 transitions. [2019-09-07 19:36:53,074 INFO L78 Accepts]: Start accepts. Automaton has 30700 states and 46095 transitions. Word has length 129 [2019-09-07 19:36:53,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:36:53,076 INFO L475 AbstractCegarLoop]: Abstraction has 30700 states and 46095 transitions. [2019-09-07 19:36:53,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:36:53,076 INFO L276 IsEmpty]: Start isEmpty. Operand 30700 states and 46095 transitions. [2019-09-07 19:36:53,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-07 19:36:53,083 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:36:53,084 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:36:53,084 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:36:53,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:36:53,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1548418201, now seen corresponding path program 1 times [2019-09-07 19:36:53,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:36:53,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:36:53,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:36:53,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:36:53,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:36:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:36:53,329 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:36:53,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:36:53,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:36:53,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:36:53,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:36:53,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:36:53,331 INFO L87 Difference]: Start difference. First operand 30700 states and 46095 transitions. Second operand 6 states. [2019-09-07 19:37:03,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:37:03,311 INFO L93 Difference]: Finished difference Result 87556 states and 144478 transitions. [2019-09-07 19:37:03,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:37:03,312 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 138 [2019-09-07 19:37:03,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:37:04,884 INFO L225 Difference]: With dead ends: 87556 [2019-09-07 19:37:04,885 INFO L226 Difference]: Without dead ends: 56862 [2019-09-07 19:37:04,967 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 19:37:05,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56862 states. [2019-09-07 19:37:06,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56862 to 56724. [2019-09-07 19:37:06,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56724 states. [2019-09-07 19:37:06,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56724 states to 56724 states and 85201 transitions. [2019-09-07 19:37:06,515 INFO L78 Accepts]: Start accepts. Automaton has 56724 states and 85201 transitions. Word has length 138 [2019-09-07 19:37:06,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:37:06,518 INFO L475 AbstractCegarLoop]: Abstraction has 56724 states and 85201 transitions. [2019-09-07 19:37:06,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:37:06,522 INFO L276 IsEmpty]: Start isEmpty. Operand 56724 states and 85201 transitions. [2019-09-07 19:37:06,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-07 19:37:06,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:37:06,528 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:37:06,528 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:37:06,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:37:06,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1487069098, now seen corresponding path program 1 times [2019-09-07 19:37:06,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:37:06,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:37:06,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:37:06,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:37:06,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:37:06,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:37:06,721 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 102 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 19:37:06,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:37:06,722 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 19:37:06,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:37:06,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:37:06,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 19:37:06,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:37:07,193 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-07 19:37:07,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:37:07,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-09-07 19:37:07,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:37:07,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:37:07,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:37:07,200 INFO L87 Difference]: Start difference. First operand 56724 states and 85201 transitions. Second operand 6 states. [2019-09-07 19:37:23,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:37:23,560 INFO L93 Difference]: Finished difference Result 136386 states and 214023 transitions. [2019-09-07 19:37:23,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 19:37:23,561 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 232 [2019-09-07 19:37:23,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:37:23,960 INFO L225 Difference]: With dead ends: 136386 [2019-09-07 19:37:23,961 INFO L226 Difference]: Without dead ends: 79668 [2019-09-07 19:37:24,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-09-07 19:37:24,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79668 states. [2019-09-07 19:37:26,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79668 to 77765. [2019-09-07 19:37:26,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77765 states. [2019-09-07 19:37:26,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77765 states to 77765 states and 101403 transitions. [2019-09-07 19:37:26,479 INFO L78 Accepts]: Start accepts. Automaton has 77765 states and 101403 transitions. Word has length 232 [2019-09-07 19:37:26,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:37:26,480 INFO L475 AbstractCegarLoop]: Abstraction has 77765 states and 101403 transitions. [2019-09-07 19:37:26,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:37:26,480 INFO L276 IsEmpty]: Start isEmpty. Operand 77765 states and 101403 transitions. [2019-09-07 19:37:26,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-07 19:37:26,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:37:26,486 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:37:26,486 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:37:26,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:37:26,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1034822032, now seen corresponding path program 1 times [2019-09-07 19:37:26,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:37:26,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:37:26,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:37:26,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:37:26,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:37:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:37:26,883 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 45 proven. 2 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-09-07 19:37:26,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:37:26,884 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 19:37:26,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:37:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:37:27,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:37:27,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:37:27,206 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 150 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:37:27,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:37:27,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-09-07 19:37:27,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 19:37:27,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 19:37:27,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-07 19:37:27,223 INFO L87 Difference]: Start difference. First operand 77765 states and 101403 transitions. Second operand 8 states. [2019-09-07 19:37:39,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:37:39,040 INFO L93 Difference]: Finished difference Result 146735 states and 195386 transitions. [2019-09-07 19:37:39,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 19:37:39,041 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 254 [2019-09-07 19:37:39,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:37:39,338 INFO L225 Difference]: With dead ends: 146735 [2019-09-07 19:37:39,339 INFO L226 Difference]: Without dead ends: 76295 [2019-09-07 19:37:39,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 255 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-09-07 19:37:39,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76295 states. [2019-09-07 19:37:40,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76295 to 72034. [2019-09-07 19:37:40,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72034 states. [2019-09-07 19:37:41,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72034 states to 72034 states and 93143 transitions. [2019-09-07 19:37:41,051 INFO L78 Accepts]: Start accepts. Automaton has 72034 states and 93143 transitions. Word has length 254 [2019-09-07 19:37:41,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:37:41,052 INFO L475 AbstractCegarLoop]: Abstraction has 72034 states and 93143 transitions. [2019-09-07 19:37:41,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 19:37:41,052 INFO L276 IsEmpty]: Start isEmpty. Operand 72034 states and 93143 transitions. [2019-09-07 19:37:41,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-09-07 19:37:41,070 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:37:41,071 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:37:41,071 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:37:41,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:37:41,072 INFO L82 PathProgramCache]: Analyzing trace with hash 428894232, now seen corresponding path program 1 times [2019-09-07 19:37:41,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:37:41,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:37:41,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:37:41,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:37:41,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:37:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:37:41,823 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 232 proven. 75 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-07 19:37:41,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:37:41,823 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:37:41,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:37:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:37:41,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 19:37:41,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:37:42,106 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 68 proven. 4 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2019-09-07 19:37:42,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:37:42,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:37:42,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:37:42,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:37:42,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:37:42,112 INFO L87 Difference]: Start difference. First operand 72034 states and 93143 transitions. Second operand 9 states. [2019-09-07 19:37:53,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:37:53,970 INFO L93 Difference]: Finished difference Result 244142 states and 336507 transitions. [2019-09-07 19:37:53,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 19:37:53,970 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 370 [2019-09-07 19:37:53,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:37:54,414 INFO L225 Difference]: With dead ends: 244142 [2019-09-07 19:37:54,414 INFO L226 Difference]: Without dead ends: 172114 [2019-09-07 19:37:54,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-09-07 19:37:54,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172114 states. [2019-09-07 19:38:01,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172114 to 162136. [2019-09-07 19:38:01,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162136 states. [2019-09-07 19:38:01,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162136 states to 162136 states and 209113 transitions. [2019-09-07 19:38:01,871 INFO L78 Accepts]: Start accepts. Automaton has 162136 states and 209113 transitions. Word has length 370 [2019-09-07 19:38:01,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:38:01,872 INFO L475 AbstractCegarLoop]: Abstraction has 162136 states and 209113 transitions. [2019-09-07 19:38:01,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:38:01,872 INFO L276 IsEmpty]: Start isEmpty. Operand 162136 states and 209113 transitions. [2019-09-07 19:38:01,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2019-09-07 19:38:01,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:38:01,895 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:38:01,895 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:38:01,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:38:01,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1267291605, now seen corresponding path program 1 times [2019-09-07 19:38:01,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:38:01,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:38:01,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:38:01,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:38:01,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:38:01,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:38:02,238 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-09-07 19:38:02,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:38:02,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 19:38:02,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 19:38:02,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 19:38:02,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:38:02,240 INFO L87 Difference]: Start difference. First operand 162136 states and 209113 transitions. Second operand 4 states. [2019-09-07 19:38:12,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:38:12,046 INFO L93 Difference]: Finished difference Result 406705 states and 529546 transitions. [2019-09-07 19:38:12,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 19:38:12,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 374 [2019-09-07 19:38:12,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:38:12,750 INFO L225 Difference]: With dead ends: 406705 [2019-09-07 19:38:12,751 INFO L226 Difference]: Without dead ends: 244575 [2019-09-07 19:38:12,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:38:13,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244575 states. [2019-09-07 19:38:20,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244575 to 231648. [2019-09-07 19:38:20,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231648 states. [2019-09-07 19:38:20,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231648 states to 231648 states and 289005 transitions. [2019-09-07 19:38:20,794 INFO L78 Accepts]: Start accepts. Automaton has 231648 states and 289005 transitions. Word has length 374 [2019-09-07 19:38:20,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:38:20,795 INFO L475 AbstractCegarLoop]: Abstraction has 231648 states and 289005 transitions. [2019-09-07 19:38:20,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 19:38:20,795 INFO L276 IsEmpty]: Start isEmpty. Operand 231648 states and 289005 transitions. [2019-09-07 19:38:20,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2019-09-07 19:38:20,893 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:38:20,894 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:38:20,894 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:38:20,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:38:20,894 INFO L82 PathProgramCache]: Analyzing trace with hash 258153913, now seen corresponding path program 1 times [2019-09-07 19:38:20,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:38:20,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:38:20,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:38:20,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:38:20,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:38:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:38:22,217 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 102 proven. 2 refuted. 0 times theorem prover too weak. 541 trivial. 0 not checked. [2019-09-07 19:38:22,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:38:22,218 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 19:38:22,240 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 19:38:22,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:38:22,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 905 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 19:38:22,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:38:22,658 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 357 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-09-07 19:38:22,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:38:22,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2019-09-07 19:38:22,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 19:38:22,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 19:38:22,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:38:22,665 INFO L87 Difference]: Start difference. First operand 231648 states and 289005 transitions. Second operand 4 states. [2019-09-07 19:38:31,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:38:31,176 INFO L93 Difference]: Finished difference Result 441388 states and 553220 transitions. [2019-09-07 19:38:31,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 19:38:31,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 590 [2019-09-07 19:38:31,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:38:31,734 INFO L225 Difference]: With dead ends: 441388 [2019-09-07 19:38:31,735 INFO L226 Difference]: Without dead ends: 229160 [2019-09-07 19:38:31,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 593 GetRequests, 591 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:38:32,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229160 states. [2019-09-07 19:38:34,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229160 to 229154. [2019-09-07 19:38:34,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229154 states. [2019-09-07 19:38:35,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229154 states to 229154 states and 285360 transitions. [2019-09-07 19:38:35,015 INFO L78 Accepts]: Start accepts. Automaton has 229154 states and 285360 transitions. Word has length 590 [2019-09-07 19:38:35,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:38:35,015 INFO L475 AbstractCegarLoop]: Abstraction has 229154 states and 285360 transitions. [2019-09-07 19:38:35,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 19:38:35,015 INFO L276 IsEmpty]: Start isEmpty. Operand 229154 states and 285360 transitions. [2019-09-07 19:38:35,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 613 [2019-09-07 19:38:35,063 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:38:35,064 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:38:35,064 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:38:35,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:38:35,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1581755918, now seen corresponding path program 1 times [2019-09-07 19:38:35,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:38:35,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:38:35,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:38:35,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:38:35,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:38:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:38:39,258 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 210 proven. 142 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-09-07 19:38:39,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:38:39,259 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:38:39,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:38:39,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:38:39,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 882 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 19:38:39,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:38:39,809 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-09-07 19:38:39,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:38:39,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2019-09-07 19:38:39,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 19:38:39,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 19:38:39,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-07 19:38:39,830 INFO L87 Difference]: Start difference. First operand 229154 states and 285360 transitions. Second operand 8 states. [2019-09-07 19:38:59,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:38:59,413 INFO L93 Difference]: Finished difference Result 526802 states and 699312 transitions. [2019-09-07 19:38:59,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 19:38:59,414 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 612 [2019-09-07 19:38:59,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:39:00,435 INFO L225 Difference]: With dead ends: 526802 [2019-09-07 19:39:00,435 INFO L226 Difference]: Without dead ends: 317068 [2019-09-07 19:39:00,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 634 GetRequests, 619 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-09-07 19:39:00,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317068 states. [2019-09-07 19:39:07,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317068 to 306484. [2019-09-07 19:39:07,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306484 states. [2019-09-07 19:39:07,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306484 states to 306484 states and 377747 transitions. [2019-09-07 19:39:07,636 INFO L78 Accepts]: Start accepts. Automaton has 306484 states and 377747 transitions. Word has length 612 [2019-09-07 19:39:07,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:39:07,637 INFO L475 AbstractCegarLoop]: Abstraction has 306484 states and 377747 transitions. [2019-09-07 19:39:07,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 19:39:07,637 INFO L276 IsEmpty]: Start isEmpty. Operand 306484 states and 377747 transitions. [2019-09-07 19:39:07,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 643 [2019-09-07 19:39:07,703 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:39:07,704 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:39:07,704 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:39:07,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:39:07,704 INFO L82 PathProgramCache]: Analyzing trace with hash 797175340, now seen corresponding path program 1 times [2019-09-07 19:39:07,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:39:07,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:39:07,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:39:07,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:39:07,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:39:07,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:39:09,005 INFO L134 CoverageAnalysis]: Checked inductivity of 723 backedges. 297 proven. 142 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2019-09-07 19:39:09,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:39:09,005 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 19:39:09,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:39:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:39:09,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 961 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 19:39:09,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:39:09,361 INFO L134 CoverageAnalysis]: Checked inductivity of 723 backedges. 608 proven. 2 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-09-07 19:39:09,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:39:09,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2019-09-07 19:39:09,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:39:09,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:39:09,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:39:09,368 INFO L87 Difference]: Start difference. First operand 306484 states and 377747 transitions. Second operand 6 states. [2019-09-07 19:39:25,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:39:25,750 INFO L93 Difference]: Finished difference Result 610414 states and 753222 transitions. [2019-09-07 19:39:25,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 19:39:25,751 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 642 [2019-09-07 19:39:25,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:39:26,506 INFO L225 Difference]: With dead ends: 610414 [2019-09-07 19:39:26,506 INFO L226 Difference]: Without dead ends: 304739 [2019-09-07 19:39:27,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 646 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:39:27,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304739 states. [2019-09-07 19:39:30,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304739 to 282166. [2019-09-07 19:39:30,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282166 states. [2019-09-07 19:39:37,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282166 states to 282166 states and 335442 transitions. [2019-09-07 19:39:37,950 INFO L78 Accepts]: Start accepts. Automaton has 282166 states and 335442 transitions. Word has length 642 [2019-09-07 19:39:37,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:39:37,951 INFO L475 AbstractCegarLoop]: Abstraction has 282166 states and 335442 transitions. [2019-09-07 19:39:37,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:39:37,952 INFO L276 IsEmpty]: Start isEmpty. Operand 282166 states and 335442 transitions. [2019-09-07 19:39:38,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2019-09-07 19:39:38,001 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:39:38,002 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:39:38,002 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:39:38,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:39:38,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1345943720, now seen corresponding path program 1 times [2019-09-07 19:39:38,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:39:38,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:39:38,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:39:38,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:39:38,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:39:38,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:39:38,447 INFO L134 CoverageAnalysis]: Checked inductivity of 959 backedges. 269 proven. 140 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2019-09-07 19:39:38,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:39:38,447 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:39:38,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:39:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:39:38,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 1050 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 19:39:38,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:39:38,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:39:39,672 INFO L134 CoverageAnalysis]: Checked inductivity of 959 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2019-09-07 19:39:39,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:39:39,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 19:39:39,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:39:39,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:39:39,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:39:39,678 INFO L87 Difference]: Start difference. First operand 282166 states and 335442 transitions. Second operand 9 states. [2019-09-07 19:40:02,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:40:02,773 INFO L93 Difference]: Finished difference Result 629774 states and 788171 transitions. [2019-09-07 19:40:02,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 19:40:02,774 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 689 [2019-09-07 19:40:02,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:40:03,832 INFO L225 Difference]: With dead ends: 629774 [2019-09-07 19:40:03,833 INFO L226 Difference]: Without dead ends: 348417 [2019-09-07 19:40:04,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 740 GetRequests, 709 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=221, Invalid=835, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 19:40:04,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348417 states. [2019-09-07 19:40:10,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348417 to 320632. [2019-09-07 19:40:10,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320632 states. [2019-09-07 19:40:19,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320632 states to 320632 states and 377814 transitions. [2019-09-07 19:40:19,302 INFO L78 Accepts]: Start accepts. Automaton has 320632 states and 377814 transitions. Word has length 689 [2019-09-07 19:40:19,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:40:19,303 INFO L475 AbstractCegarLoop]: Abstraction has 320632 states and 377814 transitions. [2019-09-07 19:40:19,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:40:19,303 INFO L276 IsEmpty]: Start isEmpty. Operand 320632 states and 377814 transitions. [2019-09-07 19:40:19,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 735 [2019-09-07 19:40:19,351 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:40:19,352 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:40:19,352 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:40:19,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:40:19,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1152812862, now seen corresponding path program 1 times [2019-09-07 19:40:19,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:40:19,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:40:19,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:40:19,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:40:19,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:40:19,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:40:20,660 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 180 proven. 170 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2019-09-07 19:40:20,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:40:20,660 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 19:40:20,690 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 19:40:20,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:40:20,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 1050 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:40:20,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:40:21,137 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 498 proven. 2 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2019-09-07 19:40:21,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:40:21,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:40:21,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:40:21,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:40:21,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:40:21,143 INFO L87 Difference]: Start difference. First operand 320632 states and 377814 transitions. Second operand 9 states. [2019-09-07 19:40:40,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:40:40,039 INFO L93 Difference]: Finished difference Result 675335 states and 831679 transitions. [2019-09-07 19:40:40,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 19:40:40,039 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 734 [2019-09-07 19:40:40,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:40:42,168 INFO L225 Difference]: With dead ends: 675335 [2019-09-07 19:40:42,168 INFO L226 Difference]: Without dead ends: 352194 [2019-09-07 19:40:42,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 769 GetRequests, 747 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2019-09-07 19:40:42,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352194 states. [2019-09-07 19:40:56,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352194 to 348593. [2019-09-07 19:40:56,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348593 states. [2019-09-07 19:40:57,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348593 states to 348593 states and 428916 transitions. [2019-09-07 19:40:57,392 INFO L78 Accepts]: Start accepts. Automaton has 348593 states and 428916 transitions. Word has length 734 [2019-09-07 19:40:57,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:40:57,393 INFO L475 AbstractCegarLoop]: Abstraction has 348593 states and 428916 transitions. [2019-09-07 19:40:57,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:40:57,393 INFO L276 IsEmpty]: Start isEmpty. Operand 348593 states and 428916 transitions. [2019-09-07 19:40:57,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 759 [2019-09-07 19:40:57,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:40:57,458 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:40:57,458 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:40:57,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:40:57,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1619591931, now seen corresponding path program 1 times [2019-09-07 19:40:57,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:40:57,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:40:57,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:40:57,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:40:57,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:40:57,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:40:58,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1181 backedges. 435 proven. 149 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2019-09-07 19:40:58,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:40:58,632 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:40:58,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:40:58,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:40:58,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 1126 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 19:40:58,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:40:59,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1181 backedges. 659 proven. 2 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2019-09-07 19:40:59,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:40:59,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2019-09-07 19:40:59,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 19:40:59,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 19:40:59,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-07 19:40:59,552 INFO L87 Difference]: Start difference. First operand 348593 states and 428916 transitions. Second operand 11 states. [2019-09-07 19:42:03,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:42:03,067 INFO L93 Difference]: Finished difference Result 944258 states and 1236088 transitions. [2019-09-07 19:42:03,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-09-07 19:42:03,068 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 758 [2019-09-07 19:42:03,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:42:05,173 INFO L225 Difference]: With dead ends: 944258 [2019-09-07 19:42:05,174 INFO L226 Difference]: Without dead ends: 590580 [2019-09-07 19:42:05,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 927 GetRequests, 833 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3442 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1492, Invalid=7628, Unknown=0, NotChecked=0, Total=9120 [2019-09-07 19:42:06,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590580 states. [2019-09-07 19:42:25,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590580 to 572153. [2019-09-07 19:42:25,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572153 states. [2019-09-07 19:42:44,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572153 states to 572153 states and 725865 transitions. [2019-09-07 19:42:44,516 INFO L78 Accepts]: Start accepts. Automaton has 572153 states and 725865 transitions. Word has length 758 [2019-09-07 19:42:44,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:42:44,516 INFO L475 AbstractCegarLoop]: Abstraction has 572153 states and 725865 transitions. [2019-09-07 19:42:44,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 19:42:44,516 INFO L276 IsEmpty]: Start isEmpty. Operand 572153 states and 725865 transitions. [2019-09-07 19:42:44,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 803 [2019-09-07 19:42:44,604 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:42:44,605 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:42:44,605 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:42:44,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:42:44,606 INFO L82 PathProgramCache]: Analyzing trace with hash 693616415, now seen corresponding path program 1 times [2019-09-07 19:42:44,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:42:44,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:42:44,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:42:44,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:42:44,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:42:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:42:45,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1129 backedges. 656 proven. 6 refuted. 0 times theorem prover too weak. 467 trivial. 0 not checked. [2019-09-07 19:42:45,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:42:45,382 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:42:45,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:42:45,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:42:45,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 1165 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 19:42:45,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:42:45,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:42:46,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1129 backedges. 672 proven. 2 refuted. 0 times theorem prover too weak. 455 trivial. 0 not checked. [2019-09-07 19:42:46,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:42:46,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-09-07 19:42:46,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 19:42:46,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 19:42:46,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-07 19:42:46,183 INFO L87 Difference]: Start difference. First operand 572153 states and 725865 transitions. Second operand 13 states. [2019-09-07 19:43:52,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:43:52,802 INFO L93 Difference]: Finished difference Result 1404256 states and 1764661 transitions. [2019-09-07 19:43:52,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-07 19:43:52,803 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 802 [2019-09-07 19:43:52,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:44:08,262 INFO L225 Difference]: With dead ends: 1404256 [2019-09-07 19:44:08,262 INFO L226 Difference]: Without dead ends: 832932 [2019-09-07 19:44:09,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 966 GetRequests, 874 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3313 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1125, Invalid=7617, Unknown=0, NotChecked=0, Total=8742 [2019-09-07 19:44:09,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832932 states. [2019-09-07 19:44:34,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832932 to 798940. [2019-09-07 19:44:34,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798940 states. [2019-09-07 19:44:38,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798940 states to 798940 states and 987984 transitions. [2019-09-07 19:44:38,718 INFO L78 Accepts]: Start accepts. Automaton has 798940 states and 987984 transitions. Word has length 802 [2019-09-07 19:44:38,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:44:38,719 INFO L475 AbstractCegarLoop]: Abstraction has 798940 states and 987984 transitions. [2019-09-07 19:44:38,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 19:44:38,719 INFO L276 IsEmpty]: Start isEmpty. Operand 798940 states and 987984 transitions. [2019-09-07 19:44:48,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 820 [2019-09-07 19:44:48,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:44:48,066 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:44:48,066 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:44:48,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:44:48,067 INFO L82 PathProgramCache]: Analyzing trace with hash 977390449, now seen corresponding path program 1 times [2019-09-07 19:44:48,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:44:48,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:44:48,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:44:48,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:44:48,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:44:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:44:48,906 INFO L134 CoverageAnalysis]: Checked inductivity of 865 backedges. 300 proven. 103 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2019-09-07 19:44:48,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:44:48,907 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:44:48,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:44:49,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:44:49,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 1166 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 19:44:49,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:44:49,900 INFO L134 CoverageAnalysis]: Checked inductivity of 865 backedges. 566 proven. 2 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2019-09-07 19:44:49,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:44:49,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:44:49,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:44:49,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:44:49,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:44:49,915 INFO L87 Difference]: Start difference. First operand 798940 states and 987984 transitions. Second operand 9 states. [2019-09-07 19:45:49,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:45:49,127 INFO L93 Difference]: Finished difference Result 1641298 states and 2214599 transitions. [2019-09-07 19:45:49,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-07 19:45:49,128 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 819 [2019-09-07 19:45:49,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:45:54,257 INFO L225 Difference]: With dead ends: 1641298 [2019-09-07 19:45:54,257 INFO L226 Difference]: Without dead ends: 877535 [2019-09-07 19:45:55,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 890 GetRequests, 848 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=371, Invalid=1521, Unknown=0, NotChecked=0, Total=1892 [2019-09-07 19:45:56,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877535 states. [2019-09-07 19:46:13,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877535 to 850844. [2019-09-07 19:46:13,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850844 states.