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/Problem19_label59.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 23:32:41,022 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 23:32:41,024 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 23:32:41,036 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 23:32:41,037 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 23:32:41,038 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 23:32:41,039 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 23:32:41,041 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 23:32:41,043 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 23:32:41,043 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 23:32:41,045 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 23:32:41,046 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 23:32:41,046 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 23:32:41,047 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 23:32:41,048 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 23:32:41,049 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 23:32:41,050 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 23:32:41,052 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 23:32:41,054 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 23:32:41,056 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 23:32:41,057 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 23:32:41,058 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 23:32:41,060 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 23:32:41,060 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 23:32:41,062 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 23:32:41,063 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 23:32:41,063 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 23:32:41,064 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 23:32:41,064 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 23:32:41,065 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 23:32:41,066 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 23:32:41,066 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 23:32:41,067 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 23:32:41,068 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 23:32:41,069 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 23:32:41,069 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 23:32:41,070 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 23:32:41,070 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 23:32:41,070 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 23:32:41,071 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 23:32:41,072 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 23:32:41,073 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 23:32:41,087 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 23:32:41,087 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 23:32:41,088 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 23:32:41,089 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 23:32:41,089 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 23:32:41,089 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 23:32:41,089 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 23:32:41,089 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 23:32:41,090 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 23:32:41,090 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 23:32:41,090 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 23:32:41,090 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 23:32:41,090 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 23:32:41,091 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 23:32:41,091 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 23:32:41,091 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 23:32:41,091 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 23:32:41,091 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 23:32:41,092 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 23:32:41,092 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 23:32:41,092 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 23:32:41,092 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 23:32:41,092 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 23:32:41,093 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 23:32:41,093 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 23:32:41,093 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 23:32:41,093 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 23:32:41,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 23:32:41,094 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 23:32:41,125 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 23:32:41,137 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 23:32:41,142 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 23:32:41,143 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 23:32:41,144 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 23:32:41,148 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem19_label59.c [2019-09-07 23:32:41,216 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f345cf71/a4e82bf7e51c494380befc2bef0539fb/FLAGf463023db [2019-09-07 23:32:42,316 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 23:32:42,319 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem19_label59.c [2019-09-07 23:32:42,390 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f345cf71/a4e82bf7e51c494380befc2bef0539fb/FLAGf463023db [2019-09-07 23:32:42,541 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f345cf71/a4e82bf7e51c494380befc2bef0539fb [2019-09-07 23:32:42,554 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 23:32:42,558 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 23:32:42,560 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 23:32:42,560 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 23:32:42,564 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 23:32:42,565 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 11:32:42" (1/1) ... [2019-09-07 23:32:42,569 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cd55b72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:32:42, skipping insertion in model container [2019-09-07 23:32:42,569 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 11:32:42" (1/1) ... [2019-09-07 23:32:42,577 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 23:32:42,839 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 23:32:45,071 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 23:32:45,077 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 23:32:46,111 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 23:32:46,164 INFO L192 MainTranslator]: Completed translation [2019-09-07 23:32:46,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:32:46 WrapperNode [2019-09-07 23:32:46,164 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 23:32:46,165 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 23:32:46,166 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 23:32:46,166 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 23:32:46,181 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:32:46" (1/1) ... [2019-09-07 23:32:46,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:32:46" (1/1) ... [2019-09-07 23:32:46,261 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:32:46" (1/1) ... [2019-09-07 23:32:46,263 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:32:46" (1/1) ... [2019-09-07 23:32:46,454 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:32:46" (1/1) ... [2019-09-07 23:32:46,500 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:32:46" (1/1) ... [2019-09-07 23:32:46,554 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:32:46" (1/1) ... [2019-09-07 23:32:46,619 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 23:32:46,620 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 23:32:46,620 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 23:32:46,620 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 23:32:46,621 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:32:46" (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 23:32:46,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 23:32:46,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 23:32:46,689 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 23:32:46,689 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 23:32:46,689 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2019-09-07 23:32:46,689 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2019-09-07 23:32:46,690 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output5 [2019-09-07 23:32:46,690 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output6 [2019-09-07 23:32:46,690 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 23:32:46,690 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 23:32:46,690 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 23:32:46,691 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2019-09-07 23:32:46,691 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2019-09-07 23:32:46,691 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output5 [2019-09-07 23:32:46,691 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output6 [2019-09-07 23:32:46,691 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 23:32:46,692 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 23:32:46,692 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 23:32:46,692 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 23:32:46,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 23:32:46,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 23:32:57,209 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 23:32:57,209 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 23:32:57,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 11:32:57 BoogieIcfgContainer [2019-09-07 23:32:57,212 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 23:32:57,213 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 23:32:57,213 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 23:32:57,216 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 23:32:57,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 11:32:42" (1/3) ... [2019-09-07 23:32:57,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d19ea73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 11:32:57, skipping insertion in model container [2019-09-07 23:32:57,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:32:46" (2/3) ... [2019-09-07 23:32:57,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d19ea73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 11:32:57, skipping insertion in model container [2019-09-07 23:32:57,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 11:32:57" (3/3) ... [2019-09-07 23:32:57,227 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem19_label59.c [2019-09-07 23:32:57,238 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 23:32:57,245 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 23:32:57,260 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 23:32:57,316 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 23:32:57,317 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 23:32:57,317 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 23:32:57,318 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 23:32:57,318 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 23:32:57,318 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 23:32:57,318 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 23:32:57,318 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 23:32:57,318 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 23:32:57,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states. [2019-09-07 23:32:57,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-07 23:32:57,382 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:32:57,382 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 23:32:57,384 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:32:57,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:32:57,389 INFO L82 PathProgramCache]: Analyzing trace with hash 203787812, now seen corresponding path program 1 times [2019-09-07 23:32:57,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:32:57,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:32:57,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:32:57,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:32:57,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:32:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:32:57,709 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 23:32:57,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:32:57,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 23:32:57,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 23:32:57,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 23:32:57,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:32:57,739 INFO L87 Difference]: Start difference. First operand 1777 states. Second operand 3 states. [2019-09-07 23:33:09,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:33:09,529 INFO L93 Difference]: Finished difference Result 5046 states and 9510 transitions. [2019-09-07 23:33:09,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 23:33:09,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-07 23:33:09,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:33:09,581 INFO L225 Difference]: With dead ends: 5046 [2019-09-07 23:33:09,581 INFO L226 Difference]: Without dead ends: 3207 [2019-09-07 23:33:09,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:33:09,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3207 states. [2019-09-07 23:33:09,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3207 to 3156. [2019-09-07 23:33:09,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3156 states. [2019-09-07 23:33:09,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3156 states to 3156 states and 5827 transitions. [2019-09-07 23:33:09,791 INFO L78 Accepts]: Start accepts. Automaton has 3156 states and 5827 transitions. Word has length 31 [2019-09-07 23:33:09,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:33:09,792 INFO L475 AbstractCegarLoop]: Abstraction has 3156 states and 5827 transitions. [2019-09-07 23:33:09,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 23:33:09,792 INFO L276 IsEmpty]: Start isEmpty. Operand 3156 states and 5827 transitions. [2019-09-07 23:33:09,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-07 23:33:09,797 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:33:09,798 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 23:33:09,798 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:33:09,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:33:09,799 INFO L82 PathProgramCache]: Analyzing trace with hash -477797288, now seen corresponding path program 1 times [2019-09-07 23:33:09,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:33:09,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:33:09,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:33:09,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:33:09,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:33:09,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:33:10,009 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:33:10,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:33:10,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 23:33:10,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 23:33:10,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 23:33:10,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 23:33:10,013 INFO L87 Difference]: Start difference. First operand 3156 states and 5827 transitions. Second operand 6 states. [2019-09-07 23:33:23,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:33:23,232 INFO L93 Difference]: Finished difference Result 9280 states and 17297 transitions. [2019-09-07 23:33:23,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 23:33:23,234 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2019-09-07 23:33:23,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:33:23,274 INFO L225 Difference]: With dead ends: 9280 [2019-09-07 23:33:23,274 INFO L226 Difference]: Without dead ends: 6130 [2019-09-07 23:33:23,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 23:33:23,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6130 states. [2019-09-07 23:33:23,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6130 to 6069. [2019-09-07 23:33:23,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6069 states. [2019-09-07 23:33:23,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6069 states to 6069 states and 10871 transitions. [2019-09-07 23:33:23,495 INFO L78 Accepts]: Start accepts. Automaton has 6069 states and 10871 transitions. Word has length 102 [2019-09-07 23:33:23,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:33:23,496 INFO L475 AbstractCegarLoop]: Abstraction has 6069 states and 10871 transitions. [2019-09-07 23:33:23,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 23:33:23,497 INFO L276 IsEmpty]: Start isEmpty. Operand 6069 states and 10871 transitions. [2019-09-07 23:33:23,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-07 23:33:23,507 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:33:23,507 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 23:33:23,508 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:33:23,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:33:23,509 INFO L82 PathProgramCache]: Analyzing trace with hash 2089065162, now seen corresponding path program 1 times [2019-09-07 23:33:23,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:33:23,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:33:23,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:33:23,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:33:23,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:33:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:33:23,664 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:33:23,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:33:23,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 23:33:23,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 23:33:23,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 23:33:23,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 23:33:23,666 INFO L87 Difference]: Start difference. First operand 6069 states and 10871 transitions. Second operand 5 states. [2019-09-07 23:33:42,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:33:42,027 INFO L93 Difference]: Finished difference Result 18455 states and 33723 transitions. [2019-09-07 23:33:42,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 23:33:42,032 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-09-07 23:33:42,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:33:42,103 INFO L225 Difference]: With dead ends: 18455 [2019-09-07 23:33:42,103 INFO L226 Difference]: Without dead ends: 12392 [2019-09-07 23:33:42,125 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 23:33:42,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12392 states. [2019-09-07 23:33:42,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12392 to 12116. [2019-09-07 23:33:42,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12116 states. [2019-09-07 23:33:42,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12116 states to 12116 states and 18910 transitions. [2019-09-07 23:33:42,577 INFO L78 Accepts]: Start accepts. Automaton has 12116 states and 18910 transitions. Word has length 104 [2019-09-07 23:33:42,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:33:42,579 INFO L475 AbstractCegarLoop]: Abstraction has 12116 states and 18910 transitions. [2019-09-07 23:33:42,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 23:33:42,579 INFO L276 IsEmpty]: Start isEmpty. Operand 12116 states and 18910 transitions. [2019-09-07 23:33:42,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-07 23:33:42,585 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:33:42,585 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 23:33:42,586 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:33:42,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:33:42,586 INFO L82 PathProgramCache]: Analyzing trace with hash -122796284, now seen corresponding path program 1 times [2019-09-07 23:33:42,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:33:42,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:33:42,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:33:42,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:33:42,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:33:42,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:33:42,755 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:33:42,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:33:42,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 23:33:42,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 23:33:42,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 23:33:42,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 23:33:42,757 INFO L87 Difference]: Start difference. First operand 12116 states and 18910 transitions. Second operand 6 states. [2019-09-07 23:33:56,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:33:56,464 INFO L93 Difference]: Finished difference Result 30458 states and 48769 transitions. [2019-09-07 23:33:56,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 23:33:56,465 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2019-09-07 23:33:56,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:33:56,542 INFO L225 Difference]: With dead ends: 30458 [2019-09-07 23:33:56,543 INFO L226 Difference]: Without dead ends: 18348 [2019-09-07 23:33:56,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 23:33:56,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18348 states. [2019-09-07 23:33:56,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18348 to 18194. [2019-09-07 23:33:56,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18194 states. [2019-09-07 23:33:57,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18194 states to 18194 states and 27323 transitions. [2019-09-07 23:33:57,021 INFO L78 Accepts]: Start accepts. Automaton has 18194 states and 27323 transitions. Word has length 109 [2019-09-07 23:33:57,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:33:57,021 INFO L475 AbstractCegarLoop]: Abstraction has 18194 states and 27323 transitions. [2019-09-07 23:33:57,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 23:33:57,022 INFO L276 IsEmpty]: Start isEmpty. Operand 18194 states and 27323 transitions. [2019-09-07 23:33:57,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-07 23:33:57,030 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:33:57,030 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 23:33:57,031 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:33:57,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:33:57,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1169044637, now seen corresponding path program 1 times [2019-09-07 23:33:57,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:33:57,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:33:57,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:33:57,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:33:57,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:33:57,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:33:57,250 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:33:57,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:33:57,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 23:33:57,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 23:33:57,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 23:33:57,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 23:33:57,252 INFO L87 Difference]: Start difference. First operand 18194 states and 27323 transitions. Second operand 5 states. [2019-09-07 23:34:13,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:34:13,530 INFO L93 Difference]: Finished difference Result 54570 states and 87197 transitions. [2019-09-07 23:34:13,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 23:34:13,531 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 159 [2019-09-07 23:34:13,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:34:13,671 INFO L225 Difference]: With dead ends: 54570 [2019-09-07 23:34:13,671 INFO L226 Difference]: Without dead ends: 36382 [2019-09-07 23:34:13,730 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 23:34:13,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36382 states. [2019-09-07 23:34:14,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36382 to 35220. [2019-09-07 23:34:14,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35220 states. [2019-09-07 23:34:14,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35220 states to 35220 states and 49778 transitions. [2019-09-07 23:34:14,597 INFO L78 Accepts]: Start accepts. Automaton has 35220 states and 49778 transitions. Word has length 159 [2019-09-07 23:34:14,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:34:14,599 INFO L475 AbstractCegarLoop]: Abstraction has 35220 states and 49778 transitions. [2019-09-07 23:34:14,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 23:34:14,599 INFO L276 IsEmpty]: Start isEmpty. Operand 35220 states and 49778 transitions. [2019-09-07 23:34:14,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-07 23:34:14,603 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:34:14,603 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 23:34:14,604 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:34:14,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:34:14,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1257537688, now seen corresponding path program 1 times [2019-09-07 23:34:14,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:34:14,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:34:14,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:14,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:34:14,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:14,990 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:34:14,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:34:14,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 23:34:14,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 23:34:14,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 23:34:14,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 23:34:14,992 INFO L87 Difference]: Start difference. First operand 35220 states and 49778 transitions. Second operand 6 states. [2019-09-07 23:34:28,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:34:28,588 INFO L93 Difference]: Finished difference Result 83156 states and 122536 transitions. [2019-09-07 23:34:28,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 23:34:28,597 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 169 [2019-09-07 23:34:28,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:34:28,761 INFO L225 Difference]: With dead ends: 83156 [2019-09-07 23:34:28,761 INFO L226 Difference]: Without dead ends: 47942 [2019-09-07 23:34:29,095 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 23:34:29,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47942 states. [2019-09-07 23:34:29,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47942 to 47548. [2019-09-07 23:34:29,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47548 states. [2019-09-07 23:34:30,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47548 states to 47548 states and 65659 transitions. [2019-09-07 23:34:30,035 INFO L78 Accepts]: Start accepts. Automaton has 47548 states and 65659 transitions. Word has length 169 [2019-09-07 23:34:30,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:34:30,037 INFO L475 AbstractCegarLoop]: Abstraction has 47548 states and 65659 transitions. [2019-09-07 23:34:30,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 23:34:30,037 INFO L276 IsEmpty]: Start isEmpty. Operand 47548 states and 65659 transitions. [2019-09-07 23:34:30,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-07 23:34:30,040 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:34:30,041 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 23:34:30,042 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:34:30,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:34:30,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1845334372, now seen corresponding path program 1 times [2019-09-07 23:34:30,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:34:30,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:34:30,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:30,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:34:30,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:30,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:30,220 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 48 proven. 69 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 23:34:30,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:34:30,220 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 23:34:30,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:34:30,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:30,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 23:34:30,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:34:30,465 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-07 23:34:30,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 23:34:30,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2019-09-07 23:34:30,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 23:34:30,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 23:34:30,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 23:34:30,482 INFO L87 Difference]: Start difference. First operand 47548 states and 65659 transitions. Second operand 7 states. [2019-09-07 23:34:49,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:34:49,999 INFO L93 Difference]: Finished difference Result 142010 states and 205349 transitions. [2019-09-07 23:34:49,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 23:34:50,000 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 194 [2019-09-07 23:34:50,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:34:50,504 INFO L225 Difference]: With dead ends: 142010 [2019-09-07 23:34:50,504 INFO L226 Difference]: Without dead ends: 94468 [2019-09-07 23:34:50,623 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-09-07 23:34:50,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94468 states. [2019-09-07 23:34:56,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94468 to 85776. [2019-09-07 23:34:56,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85776 states. [2019-09-07 23:34:56,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85776 states to 85776 states and 116597 transitions. [2019-09-07 23:34:56,351 INFO L78 Accepts]: Start accepts. Automaton has 85776 states and 116597 transitions. Word has length 194 [2019-09-07 23:34:56,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:34:56,351 INFO L475 AbstractCegarLoop]: Abstraction has 85776 states and 116597 transitions. [2019-09-07 23:34:56,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 23:34:56,352 INFO L276 IsEmpty]: Start isEmpty. Operand 85776 states and 116597 transitions. [2019-09-07 23:34:56,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-07 23:34:56,355 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:34:56,355 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 23:34:56,355 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:34:56,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:34:56,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1992007722, now seen corresponding path program 1 times [2019-09-07 23:34:56,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:34:56,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:34:56,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:56,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:34:56,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:56,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:56,537 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:34:56,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:34:56,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 23:34:56,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 23:34:56,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 23:34:56,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:34:56,539 INFO L87 Difference]: Start difference. First operand 85776 states and 116597 transitions. Second operand 3 states. [2019-09-07 23:35:07,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:35:07,196 INFO L93 Difference]: Finished difference Result 175850 states and 238015 transitions. [2019-09-07 23:35:07,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 23:35:07,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 242 [2019-09-07 23:35:07,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:35:07,489 INFO L225 Difference]: With dead ends: 175850 [2019-09-07 23:35:07,489 INFO L226 Difference]: Without dead ends: 90080 [2019-09-07 23:35:07,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:35:07,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90080 states. [2019-09-07 23:35:09,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90080 to 87206. [2019-09-07 23:35:09,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87206 states. [2019-09-07 23:35:09,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87206 states to 87206 states and 112516 transitions. [2019-09-07 23:35:09,422 INFO L78 Accepts]: Start accepts. Automaton has 87206 states and 112516 transitions. Word has length 242 [2019-09-07 23:35:09,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:35:09,423 INFO L475 AbstractCegarLoop]: Abstraction has 87206 states and 112516 transitions. [2019-09-07 23:35:09,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 23:35:09,423 INFO L276 IsEmpty]: Start isEmpty. Operand 87206 states and 112516 transitions. [2019-09-07 23:35:09,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2019-09-07 23:35:09,450 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:35:09,451 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:35:09,451 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:35:09,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:35:09,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1714618190, now seen corresponding path program 1 times [2019-09-07 23:35:09,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:35:09,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:35:09,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:35:09,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:35:09,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:35:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:35:10,368 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:35:10,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:35:10,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 23:35:10,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 23:35:10,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 23:35:10,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 23:35:10,372 INFO L87 Difference]: Start difference. First operand 87206 states and 112516 transitions. Second operand 4 states. [2019-09-07 23:35:30,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:35:30,865 INFO L93 Difference]: Finished difference Result 254663 states and 355034 transitions. [2019-09-07 23:35:30,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 23:35:30,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 526 [2019-09-07 23:35:30,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:35:31,400 INFO L225 Difference]: With dead ends: 254663 [2019-09-07 23:35:31,400 INFO L226 Difference]: Without dead ends: 167463 [2019-09-07 23:35:31,538 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 23:35:31,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167463 states. [2019-09-07 23:35:35,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167463 to 158652. [2019-09-07 23:35:35,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158652 states. [2019-09-07 23:35:35,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158652 states to 158652 states and 222096 transitions. [2019-09-07 23:35:35,500 INFO L78 Accepts]: Start accepts. Automaton has 158652 states and 222096 transitions. Word has length 526 [2019-09-07 23:35:35,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:35:35,501 INFO L475 AbstractCegarLoop]: Abstraction has 158652 states and 222096 transitions. [2019-09-07 23:35:35,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 23:35:35,501 INFO L276 IsEmpty]: Start isEmpty. Operand 158652 states and 222096 transitions. [2019-09-07 23:35:35,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 849 [2019-09-07 23:35:35,530 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:35:35,531 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:35:35,531 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:35:35,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:35:35,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1750998997, now seen corresponding path program 1 times [2019-09-07 23:35:35,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:35:35,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:35:35,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:35:35,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:35:35,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:35:35,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:35:39,896 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 268 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:35:39,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:35:39,897 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 23:35:39,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:35:40,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:35:40,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 1106 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-07 23:35:40,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:35:40,626 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2019-09-07 23:35:40,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 23:35:40,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-07 23:35:40,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 23:35:40,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 23:35:40,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 23:35:40,638 INFO L87 Difference]: Start difference. First operand 158652 states and 222096 transitions. Second operand 7 states. [2019-09-07 23:36:17,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:36:17,964 INFO L93 Difference]: Finished difference Result 516103 states and 809794 transitions. [2019-09-07 23:36:17,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 23:36:17,964 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 848 [2019-09-07 23:36:17,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:36:19,231 INFO L225 Difference]: With dead ends: 516103 [2019-09-07 23:36:19,232 INFO L226 Difference]: Without dead ends: 354527 [2019-09-07 23:36:19,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 865 GetRequests, 854 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-09-07 23:36:19,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354527 states. [2019-09-07 23:36:35,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354527 to 341382. [2019-09-07 23:36:35,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341382 states. [2019-09-07 23:36:36,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341382 states to 341382 states and 511833 transitions. [2019-09-07 23:36:36,007 INFO L78 Accepts]: Start accepts. Automaton has 341382 states and 511833 transitions. Word has length 848 [2019-09-07 23:36:36,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:36:36,009 INFO L475 AbstractCegarLoop]: Abstraction has 341382 states and 511833 transitions. [2019-09-07 23:36:36,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 23:36:36,009 INFO L276 IsEmpty]: Start isEmpty. Operand 341382 states and 511833 transitions. [2019-09-07 23:36:36,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1007 [2019-09-07 23:36:36,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:36:36,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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:36:36,067 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:36:36,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:36:36,067 INFO L82 PathProgramCache]: Analyzing trace with hash 641280684, now seen corresponding path program 1 times [2019-09-07 23:36:36,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:36:36,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:36:36,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:36:36,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:36:36,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:36:36,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:36:39,310 INFO L134 CoverageAnalysis]: Checked inductivity of 936 backedges. 530 proven. 2 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2019-09-07 23:36:39,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:36:39,310 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 23:36:39,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:36:39,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:36:39,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 1330 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 23:36:39,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:36:45,523 INFO L134 CoverageAnalysis]: Checked inductivity of 936 backedges. 623 proven. 6 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2019-09-07 23:36:45,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:36:45,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2019-09-07 23:36:45,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 23:36:45,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 23:36:45,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-07 23:36:45,542 INFO L87 Difference]: Start difference. First operand 341382 states and 511833 transitions. Second operand 8 states. [2019-09-07 23:37:30,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:37:30,485 INFO L93 Difference]: Finished difference Result 964093 states and 1526310 transitions. [2019-09-07 23:37:30,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 23:37:30,485 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1006 [2019-09-07 23:37:30,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:37:32,924 INFO L225 Difference]: With dead ends: 964093 [2019-09-07 23:37:32,925 INFO L226 Difference]: Without dead ends: 624106 [2019-09-07 23:37:40,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1034 GetRequests, 1016 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2019-09-07 23:37:41,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624106 states. [2019-09-07 23:37:53,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624106 to 620134. [2019-09-07 23:37:53,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620134 states. [2019-09-07 23:38:07,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620134 states to 620134 states and 909359 transitions. [2019-09-07 23:38:07,331 INFO L78 Accepts]: Start accepts. Automaton has 620134 states and 909359 transitions. Word has length 1006 [2019-09-07 23:38:07,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:38:07,333 INFO L475 AbstractCegarLoop]: Abstraction has 620134 states and 909359 transitions. [2019-09-07 23:38:07,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 23:38:07,333 INFO L276 IsEmpty]: Start isEmpty. Operand 620134 states and 909359 transitions. [2019-09-07 23:38:07,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1073 [2019-09-07 23:38:07,373 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:38:07,374 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:38:07,374 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:38:07,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:38:07,375 INFO L82 PathProgramCache]: Analyzing trace with hash -965711867, now seen corresponding path program 1 times [2019-09-07 23:38:07,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:38:07,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:38:07,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:38:07,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:38:07,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:38:07,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:38:11,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 433 proven. 164 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2019-09-07 23:38:11,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:38:11,898 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 23:38:11,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:38:12,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:38:12,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 1398 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 23:38:12,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:38:20,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 896 proven. 2 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2019-09-07 23:38:20,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:38:20,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 23:38:20,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 23:38:20,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 23:38:20,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 23:38:20,236 INFO L87 Difference]: Start difference. First operand 620134 states and 909359 transitions. Second operand 9 states. [2019-09-07 23:39:17,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:39:17,432 INFO L93 Difference]: Finished difference Result 1355413 states and 2157777 transitions. [2019-09-07 23:39:17,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 23:39:17,432 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1072 [2019-09-07 23:39:17,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:39:20,556 INFO L225 Difference]: With dead ends: 1355413 [2019-09-07 23:39:20,556 INFO L226 Difference]: Without dead ends: 733729 [2019-09-07 23:39:21,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1095 GetRequests, 1079 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-07 23:39:22,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733729 states. [2019-09-07 23:39:38,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733729 to 724579. [2019-09-07 23:39:38,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724579 states. [2019-09-07 23:39:59,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724579 states to 724579 states and 1069363 transitions. [2019-09-07 23:39:59,785 INFO L78 Accepts]: Start accepts. Automaton has 724579 states and 1069363 transitions. Word has length 1072 [2019-09-07 23:39:59,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:39:59,786 INFO L475 AbstractCegarLoop]: Abstraction has 724579 states and 1069363 transitions. [2019-09-07 23:39:59,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 23:39:59,786 INFO L276 IsEmpty]: Start isEmpty. Operand 724579 states and 1069363 transitions. [2019-09-07 23:39:59,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1092 [2019-09-07 23:39:59,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:39:59,819 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:39:59,819 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:39:59,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:39:59,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1216863600, now seen corresponding path program 1 times [2019-09-07 23:39:59,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:39:59,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:39:59,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:39:59,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:39:59,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:39:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:40:14,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1264 backedges. 629 proven. 403 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2019-09-07 23:40:14,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:40:14,778 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 23:40:14,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:40:15,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:40:15,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 1457 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 23:40:15,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:40:15,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1264 backedges. 654 proven. 2 refuted. 0 times theorem prover too weak. 608 trivial. 0 not checked. [2019-09-07 23:40:15,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:40:15,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2019-09-07 23:40:15,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 23:40:15,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 23:40:15,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2019-09-07 23:40:15,631 INFO L87 Difference]: Start difference. First operand 724579 states and 1069363 transitions. Second operand 19 states. [2019-09-07 23:40:50,653 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-07 23:41:15,958 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-09-07 23:41:49,806 WARN L188 SmtUtils]: Spent 483.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-09-07 23:42:42,987 WARN L188 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-09-07 23:43:20,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:43:20,422 INFO L93 Difference]: Finished difference Result 2185676 states and 3858098 transitions. [2019-09-07 23:43:20,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2019-09-07 23:43:20,423 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 1091 [2019-09-07 23:43:20,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted.