java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label17.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 13:19:05,336 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 13:19:05,339 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 13:19:05,353 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 13:19:05,354 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 13:19:05,355 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 13:19:05,356 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 13:19:05,359 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 13:19:05,363 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 13:19:05,364 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 13:19:05,365 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 13:19:05,367 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 13:19:05,367 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 13:19:05,374 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 13:19:05,375 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 13:19:05,380 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 13:19:05,382 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 13:19:05,383 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 13:19:05,386 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 13:19:05,390 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 13:19:05,393 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 13:19:05,395 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 13:19:05,396 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 13:19:05,397 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 13:19:05,401 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 13:19:05,402 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 13:19:05,402 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 13:19:05,404 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 13:19:05,404 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 13:19:05,407 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 13:19:05,407 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 13:19:05,408 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 13:19:05,408 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 13:19:05,409 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 13:19:05,413 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 13:19:05,413 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 13:19:05,414 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 13:19:05,414 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 13:19:05,414 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 13:19:05,416 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 13:19:05,417 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 13:19:05,418 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 13:19:05,446 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 13:19:05,446 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 13:19:05,448 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 13:19:05,449 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 13:19:05,449 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 13:19:05,449 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 13:19:05,449 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 13:19:05,450 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 13:19:05,450 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 13:19:05,450 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 13:19:05,452 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 13:19:05,452 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 13:19:05,452 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 13:19:05,453 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 13:19:05,453 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 13:19:05,453 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 13:19:05,453 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 13:19:05,453 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 13:19:05,454 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 13:19:05,454 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 13:19:05,454 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 13:19:05,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 13:19:05,455 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 13:19:05,455 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 13:19:05,455 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 13:19:05,456 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 13:19:05,456 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 13:19:05,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 13:19:05,456 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 13:19:05,513 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 13:19:05,525 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 13:19:05,528 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 13:19:05,530 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 13:19:05,530 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 13:19:05,531 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label17.c [2019-09-07 13:19:05,593 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7054b06d9/9f2324a320944f2b930ba3c69499d1a7/FLAG1d035ab9b [2019-09-07 13:19:06,203 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 13:19:06,204 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label17.c [2019-09-07 13:19:06,220 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7054b06d9/9f2324a320944f2b930ba3c69499d1a7/FLAG1d035ab9b [2019-09-07 13:19:06,365 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7054b06d9/9f2324a320944f2b930ba3c69499d1a7 [2019-09-07 13:19:06,374 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 13:19:06,376 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 13:19:06,377 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 13:19:06,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 13:19:06,380 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 13:19:06,381 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 01:19:06" (1/1) ... [2019-09-07 13:19:06,384 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50a11a94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:19:06, skipping insertion in model container [2019-09-07 13:19:06,385 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 01:19:06" (1/1) ... [2019-09-07 13:19:06,392 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 13:19:06,463 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 13:19:07,241 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 13:19:07,259 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 13:19:07,812 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 13:19:07,839 INFO L192 MainTranslator]: Completed translation [2019-09-07 13:19:07,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:19:07 WrapperNode [2019-09-07 13:19:07,840 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 13:19:07,841 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 13:19:07,841 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 13:19:07,841 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 13:19:07,856 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:19:07" (1/1) ... [2019-09-07 13:19:07,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:19:07" (1/1) ... [2019-09-07 13:19:07,903 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:19:07" (1/1) ... [2019-09-07 13:19:07,905 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:19:07" (1/1) ... [2019-09-07 13:19:07,982 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:19:07" (1/1) ... [2019-09-07 13:19:08,011 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:19:07" (1/1) ... [2019-09-07 13:19:08,028 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:19:07" (1/1) ... [2019-09-07 13:19:08,044 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 13:19:08,044 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 13:19:08,045 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 13:19:08,045 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 13:19:08,046 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:19:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 13:19:08,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 13:19:08,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 13:19:08,112 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 13:19:08,112 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 13:19:08,112 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 13:19:08,112 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 13:19:08,112 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 13:19:08,113 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 13:19:08,113 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 13:19:08,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 13:19:08,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 13:19:10,097 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 13:19:10,098 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 13:19:10,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 01:19:10 BoogieIcfgContainer [2019-09-07 13:19:10,100 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 13:19:10,102 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 13:19:10,102 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 13:19:10,105 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 13:19:10,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 01:19:06" (1/3) ... [2019-09-07 13:19:10,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79d3a885 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 01:19:10, skipping insertion in model container [2019-09-07 13:19:10,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:19:07" (2/3) ... [2019-09-07 13:19:10,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79d3a885 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 01:19:10, skipping insertion in model container [2019-09-07 13:19:10,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 01:19:10" (3/3) ... [2019-09-07 13:19:10,114 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label17.c [2019-09-07 13:19:10,127 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 13:19:10,137 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 13:19:10,155 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 13:19:10,204 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 13:19:10,204 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 13:19:10,205 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 13:19:10,205 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 13:19:10,206 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 13:19:10,206 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 13:19:10,206 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 13:19:10,206 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 13:19:10,206 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 13:19:10,245 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states. [2019-09-07 13:19:10,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-07 13:19:10,276 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:19:10,280 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:19:10,283 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:19:10,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:19:10,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1924076088, now seen corresponding path program 1 times [2019-09-07 13:19:10,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:19:10,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:19:10,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:19:10,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:19:10,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:19:10,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:19:11,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:19:11,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:19:11,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 13:19:11,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 13:19:11,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 13:19:11,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 13:19:11,283 INFO L87 Difference]: Start difference. First operand 311 states. Second operand 4 states. [2019-09-07 13:19:13,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:19:13,430 INFO L93 Difference]: Finished difference Result 1062 states and 1920 transitions. [2019-09-07 13:19:13,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 13:19:13,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 205 [2019-09-07 13:19:13,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:19:13,457 INFO L225 Difference]: With dead ends: 1062 [2019-09-07 13:19:13,457 INFO L226 Difference]: Without dead ends: 685 [2019-09-07 13:19:13,467 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 13:19:13,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2019-09-07 13:19:13,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 465. [2019-09-07 13:19:13,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-07 13:19:13,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 750 transitions. [2019-09-07 13:19:13,554 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 750 transitions. Word has length 205 [2019-09-07 13:19:13,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:19:13,555 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 750 transitions. [2019-09-07 13:19:13,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 13:19:13,555 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 750 transitions. [2019-09-07 13:19:13,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-09-07 13:19:13,561 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:19:13,561 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:19:13,562 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:19:13,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:19:13,562 INFO L82 PathProgramCache]: Analyzing trace with hash 66738683, now seen corresponding path program 1 times [2019-09-07 13:19:13,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:19:13,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:19:13,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:19:13,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:19:13,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:19:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:19:13,788 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:19:13,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:19:13,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 13:19:13,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:19:13,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:19:13,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:19:13,798 INFO L87 Difference]: Start difference. First operand 465 states and 750 transitions. Second operand 6 states. [2019-09-07 13:19:15,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:19:15,408 INFO L93 Difference]: Finished difference Result 1400 states and 2333 transitions. [2019-09-07 13:19:15,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 13:19:15,408 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 214 [2019-09-07 13:19:15,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:19:15,417 INFO L225 Difference]: With dead ends: 1400 [2019-09-07 13:19:15,417 INFO L226 Difference]: Without dead ends: 941 [2019-09-07 13:19:15,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:19:15,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2019-09-07 13:19:15,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 900. [2019-09-07 13:19:15,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2019-09-07 13:19:15,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1442 transitions. [2019-09-07 13:19:15,492 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1442 transitions. Word has length 214 [2019-09-07 13:19:15,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:19:15,492 INFO L475 AbstractCegarLoop]: Abstraction has 900 states and 1442 transitions. [2019-09-07 13:19:15,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:19:15,493 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1442 transitions. [2019-09-07 13:19:15,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-09-07 13:19:15,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:19:15,498 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 13:19:15,499 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:19:15,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:19:15,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1567892479, now seen corresponding path program 1 times [2019-09-07 13:19:15,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:19:15,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:19:15,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:19:15,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:19:15,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:19:15,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:19:15,634 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:19:15,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:19:15,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:19:15,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:19:15,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:19:15,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:19:15,639 INFO L87 Difference]: Start difference. First operand 900 states and 1442 transitions. Second operand 5 states. [2019-09-07 13:19:17,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:19:17,139 INFO L93 Difference]: Finished difference Result 2692 states and 4483 transitions. [2019-09-07 13:19:17,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 13:19:17,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 215 [2019-09-07 13:19:17,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:19:17,155 INFO L225 Difference]: With dead ends: 2692 [2019-09-07 13:19:17,156 INFO L226 Difference]: Without dead ends: 1798 [2019-09-07 13:19:17,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 13:19:17,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1798 states. [2019-09-07 13:19:17,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1798 to 1763. [2019-09-07 13:19:17,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1763 states. [2019-09-07 13:19:17,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1763 states and 2726 transitions. [2019-09-07 13:19:17,252 INFO L78 Accepts]: Start accepts. Automaton has 1763 states and 2726 transitions. Word has length 215 [2019-09-07 13:19:17,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:19:17,254 INFO L475 AbstractCegarLoop]: Abstraction has 1763 states and 2726 transitions. [2019-09-07 13:19:17,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:19:17,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 2726 transitions. [2019-09-07 13:19:17,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-07 13:19:17,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:19:17,270 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:19:17,270 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:19:17,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:19:17,270 INFO L82 PathProgramCache]: Analyzing trace with hash -333889460, now seen corresponding path program 1 times [2019-09-07 13:19:17,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:19:17,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:19:17,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:19:17,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:19:17,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:19:17,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:19:17,478 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:19:17,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:19:17,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:19:17,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:19:17,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:19:17,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:19:17,480 INFO L87 Difference]: Start difference. First operand 1763 states and 2726 transitions. Second operand 3 states. [2019-09-07 13:19:18,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:19:18,548 INFO L93 Difference]: Finished difference Result 5228 states and 8361 transitions. [2019-09-07 13:19:18,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:19:18,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-09-07 13:19:18,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:19:18,577 INFO L225 Difference]: With dead ends: 5228 [2019-09-07 13:19:18,577 INFO L226 Difference]: Without dead ends: 3471 [2019-09-07 13:19:18,583 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:19:18,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3471 states. [2019-09-07 13:19:18,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3471 to 3449. [2019-09-07 13:19:18,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3449 states. [2019-09-07 13:19:18,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3449 states to 3449 states and 5456 transitions. [2019-09-07 13:19:18,717 INFO L78 Accepts]: Start accepts. Automaton has 3449 states and 5456 transitions. Word has length 217 [2019-09-07 13:19:18,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:19:18,717 INFO L475 AbstractCegarLoop]: Abstraction has 3449 states and 5456 transitions. [2019-09-07 13:19:18,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:19:18,718 INFO L276 IsEmpty]: Start isEmpty. Operand 3449 states and 5456 transitions. [2019-09-07 13:19:18,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-09-07 13:19:18,734 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:19:18,734 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 13:19:18,735 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:19:18,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:19:18,735 INFO L82 PathProgramCache]: Analyzing trace with hash -359455240, now seen corresponding path program 1 times [2019-09-07 13:19:18,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:19:18,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:19:18,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:19:18,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:19:18,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:19:18,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:19:18,868 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:19:18,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:19:18,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-07 13:19:18,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 13:19:18,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 13:19:18,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:19:18,869 INFO L87 Difference]: Start difference. First operand 3449 states and 5456 transitions. Second operand 7 states. [2019-09-07 13:19:20,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:19:20,519 INFO L93 Difference]: Finished difference Result 10484 states and 18646 transitions. [2019-09-07 13:19:20,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 13:19:20,520 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 223 [2019-09-07 13:19:20,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:19:20,580 INFO L225 Difference]: With dead ends: 10484 [2019-09-07 13:19:20,580 INFO L226 Difference]: Without dead ends: 7041 [2019-09-07 13:19:20,593 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:19:20,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7041 states. [2019-09-07 13:19:20,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7041 to 6894. [2019-09-07 13:19:20,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6894 states. [2019-09-07 13:19:20,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6894 states to 6894 states and 11385 transitions. [2019-09-07 13:19:20,897 INFO L78 Accepts]: Start accepts. Automaton has 6894 states and 11385 transitions. Word has length 223 [2019-09-07 13:19:20,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:19:20,897 INFO L475 AbstractCegarLoop]: Abstraction has 6894 states and 11385 transitions. [2019-09-07 13:19:20,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 13:19:20,897 INFO L276 IsEmpty]: Start isEmpty. Operand 6894 states and 11385 transitions. [2019-09-07 13:19:20,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-07 13:19:20,925 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:19:20,925 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 13:19:20,926 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:19:20,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:19:20,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1581852841, now seen corresponding path program 1 times [2019-09-07 13:19:20,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:19:20,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:19:20,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:19:20,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:19:20,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:19:20,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:19:21,079 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:19:21,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:19:21,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 13:19:21,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:19:21,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:19:21,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:19:21,081 INFO L87 Difference]: Start difference. First operand 6894 states and 11385 transitions. Second operand 6 states. [2019-09-07 13:19:22,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:19:22,734 INFO L93 Difference]: Finished difference Result 20162 states and 35826 transitions. [2019-09-07 13:19:22,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 13:19:22,735 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 228 [2019-09-07 13:19:22,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:19:22,834 INFO L225 Difference]: With dead ends: 20162 [2019-09-07 13:19:22,834 INFO L226 Difference]: Without dead ends: 13274 [2019-09-07 13:19:22,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:19:22,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13274 states. [2019-09-07 13:19:23,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13274 to 13159. [2019-09-07 13:19:23,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13159 states. [2019-09-07 13:19:23,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13159 states to 13159 states and 20388 transitions. [2019-09-07 13:19:23,307 INFO L78 Accepts]: Start accepts. Automaton has 13159 states and 20388 transitions. Word has length 228 [2019-09-07 13:19:23,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:19:23,309 INFO L475 AbstractCegarLoop]: Abstraction has 13159 states and 20388 transitions. [2019-09-07 13:19:23,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:19:23,309 INFO L276 IsEmpty]: Start isEmpty. Operand 13159 states and 20388 transitions. [2019-09-07 13:19:23,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-09-07 13:19:23,356 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:19:23,357 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:19:23,358 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:19:23,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:19:23,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1650286248, now seen corresponding path program 1 times [2019-09-07 13:19:23,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:19:23,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:19:23,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:19:23,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:19:23,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:19:23,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:19:23,822 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-09-07 13:19:24,213 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-07 13:19:24,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:19:24,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 13:19:24,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:19:24,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:19:24,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:19:24,215 INFO L87 Difference]: Start difference. First operand 13159 states and 20388 transitions. Second operand 6 states. [2019-09-07 13:19:26,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:19:26,455 INFO L93 Difference]: Finished difference Result 27638 states and 42929 transitions. [2019-09-07 13:19:26,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:19:26,456 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 251 [2019-09-07 13:19:26,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:19:26,520 INFO L225 Difference]: With dead ends: 27638 [2019-09-07 13:19:26,520 INFO L226 Difference]: Without dead ends: 14145 [2019-09-07 13:19:26,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:19:26,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14145 states. [2019-09-07 13:19:26,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14145 to 13848. [2019-09-07 13:19:26,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13848 states. [2019-09-07 13:19:26,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13848 states to 13848 states and 21286 transitions. [2019-09-07 13:19:26,945 INFO L78 Accepts]: Start accepts. Automaton has 13848 states and 21286 transitions. Word has length 251 [2019-09-07 13:19:26,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:19:26,946 INFO L475 AbstractCegarLoop]: Abstraction has 13848 states and 21286 transitions. [2019-09-07 13:19:26,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:19:26,946 INFO L276 IsEmpty]: Start isEmpty. Operand 13848 states and 21286 transitions. [2019-09-07 13:19:26,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-09-07 13:19:26,995 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:19:26,996 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:19:26,996 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:19:26,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:19:26,997 INFO L82 PathProgramCache]: Analyzing trace with hash -678164258, now seen corresponding path program 1 times [2019-09-07 13:19:26,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:19:26,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:19:26,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:19:26,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:19:26,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:19:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:19:27,297 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:19:27,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:19:27,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:19:27,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:19:27,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:19:27,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:19:27,299 INFO L87 Difference]: Start difference. First operand 13848 states and 21286 transitions. Second operand 3 states. [2019-09-07 13:19:28,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:19:28,555 INFO L93 Difference]: Finished difference Result 38186 states and 59641 transitions. [2019-09-07 13:19:28,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:19:28,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 283 [2019-09-07 13:19:28,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:19:28,657 INFO L225 Difference]: With dead ends: 38186 [2019-09-07 13:19:28,658 INFO L226 Difference]: Without dead ends: 24344 [2019-09-07 13:19:28,710 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 13:19:28,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24344 states. [2019-09-07 13:19:29,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24344 to 24334. [2019-09-07 13:19:29,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24334 states. [2019-09-07 13:19:29,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24334 states to 24334 states and 36532 transitions. [2019-09-07 13:19:29,357 INFO L78 Accepts]: Start accepts. Automaton has 24334 states and 36532 transitions. Word has length 283 [2019-09-07 13:19:29,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:19:29,358 INFO L475 AbstractCegarLoop]: Abstraction has 24334 states and 36532 transitions. [2019-09-07 13:19:29,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:19:29,358 INFO L276 IsEmpty]: Start isEmpty. Operand 24334 states and 36532 transitions. [2019-09-07 13:19:29,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-09-07 13:19:29,426 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:19:29,426 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:19:29,427 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:19:29,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:19:29,427 INFO L82 PathProgramCache]: Analyzing trace with hash -239113930, now seen corresponding path program 1 times [2019-09-07 13:19:29,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:19:29,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:19:29,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:19:29,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:19:29,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:19:29,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:19:30,424 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 81 proven. 49 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 13:19:30,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:19:30,424 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 13:19:30,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:19:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:19:30,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 1274 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 13:19:30,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:19:30,839 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 116 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 13:19:30,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 13:19:30,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 13 [2019-09-07 13:19:30,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 13:19:30,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 13:19:30,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-09-07 13:19:30,857 INFO L87 Difference]: Start difference. First operand 24334 states and 36532 transitions. Second operand 13 states. [2019-09-07 13:19:38,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:19:38,114 INFO L93 Difference]: Finished difference Result 98894 states and 185951 transitions. [2019-09-07 13:19:38,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 13:19:38,115 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 292 [2019-09-07 13:19:38,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:19:38,955 INFO L225 Difference]: With dead ends: 98894 [2019-09-07 13:19:38,955 INFO L226 Difference]: Without dead ends: 74566 [2019-09-07 13:19:39,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=347, Invalid=1135, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 13:19:39,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74566 states. [2019-09-07 13:19:43,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74566 to 72177. [2019-09-07 13:19:43,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72177 states. [2019-09-07 13:19:43,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72177 states to 72177 states and 109462 transitions. [2019-09-07 13:19:43,826 INFO L78 Accepts]: Start accepts. Automaton has 72177 states and 109462 transitions. Word has length 292 [2019-09-07 13:19:43,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:19:43,826 INFO L475 AbstractCegarLoop]: Abstraction has 72177 states and 109462 transitions. [2019-09-07 13:19:43,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 13:19:43,826 INFO L276 IsEmpty]: Start isEmpty. Operand 72177 states and 109462 transitions. [2019-09-07 13:19:43,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-07 13:19:43,960 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:19:43,960 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:19:43,960 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:19:43,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:19:43,961 INFO L82 PathProgramCache]: Analyzing trace with hash -2041614316, now seen corresponding path program 1 times [2019-09-07 13:19:43,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:19:43,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:19:43,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:19:43,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:19:43,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:19:44,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:19:44,597 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 115 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:19:44,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:19:44,597 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 13:19:44,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:19:44,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:19:44,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 1124 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 13:19:44,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:19:44,979 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 115 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:19:44,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 13:19:44,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 13:19:44,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 13:19:44,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 13:19:44,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:19:44,995 INFO L87 Difference]: Start difference. First operand 72177 states and 109462 transitions. Second operand 9 states. [2019-09-07 13:19:49,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:19:49,492 INFO L93 Difference]: Finished difference Result 167838 states and 254990 transitions. [2019-09-07 13:19:49,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 13:19:49,493 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 316 [2019-09-07 13:19:49,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:19:49,943 INFO L225 Difference]: With dead ends: 167838 [2019-09-07 13:19:49,944 INFO L226 Difference]: Without dead ends: 95667 [2019-09-07 13:19:50,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-09-07 13:19:50,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95667 states. [2019-09-07 13:19:52,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95667 to 95481. [2019-09-07 13:19:52,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95481 states. [2019-09-07 13:19:52,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95481 states to 95481 states and 136190 transitions. [2019-09-07 13:19:52,632 INFO L78 Accepts]: Start accepts. Automaton has 95481 states and 136190 transitions. Word has length 316 [2019-09-07 13:19:52,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:19:52,633 INFO L475 AbstractCegarLoop]: Abstraction has 95481 states and 136190 transitions. [2019-09-07 13:19:52,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 13:19:52,633 INFO L276 IsEmpty]: Start isEmpty. Operand 95481 states and 136190 transitions. [2019-09-07 13:19:52,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-09-07 13:19:52,889 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:19:52,890 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-07 13:19:52,890 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:19:52,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:19:52,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1469424708, now seen corresponding path program 1 times [2019-09-07 13:19:52,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:19:52,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:19:52,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:19:52,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:19:52,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:19:52,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:19:53,349 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 131 proven. 58 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 13:19:53,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:19:53,349 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 13:19:53,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:19:53,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:19:53,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 1166 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 13:19:53,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:19:53,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 13:19:53,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 13:19:53,763 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 13:19:53,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 13:19:53,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2019-09-07 13:19:53,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 13:19:53,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 13:19:53,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-07 13:19:53,779 INFO L87 Difference]: Start difference. First operand 95481 states and 136190 transitions. Second operand 11 states. [2019-09-07 13:19:58,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:19:58,528 INFO L93 Difference]: Finished difference Result 193202 states and 286795 transitions. [2019-09-07 13:19:58,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 13:19:58,528 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 344 [2019-09-07 13:19:58,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:20:01,646 INFO L225 Difference]: With dead ends: 193202 [2019-09-07 13:20:01,646 INFO L226 Difference]: Without dead ends: 97725 [2019-09-07 13:20:01,785 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 352 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=392, Unknown=0, NotChecked=0, Total=552 [2019-09-07 13:20:01,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97725 states. [2019-09-07 13:20:04,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97725 to 96587. [2019-09-07 13:20:04,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96587 states. [2019-09-07 13:20:04,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96587 states to 96587 states and 139267 transitions. [2019-09-07 13:20:04,347 INFO L78 Accepts]: Start accepts. Automaton has 96587 states and 139267 transitions. Word has length 344 [2019-09-07 13:20:04,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:20:04,347 INFO L475 AbstractCegarLoop]: Abstraction has 96587 states and 139267 transitions. [2019-09-07 13:20:04,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 13:20:04,347 INFO L276 IsEmpty]: Start isEmpty. Operand 96587 states and 139267 transitions. [2019-09-07 13:20:04,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-09-07 13:20:04,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:20:04,516 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:20:04,516 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:20:04,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:20:04,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1801409681, now seen corresponding path program 1 times [2019-09-07 13:20:04,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:20:04,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:20:04,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:20:04,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:20:04,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:20:04,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:20:04,758 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 162 proven. 62 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-07 13:20:04,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:20:04,758 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 13:20:04,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 13:20:04,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:20:04,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 1330 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 13:20:04,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:20:05,107 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 174 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-07 13:20:05,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 13:20:05,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 13:20:05,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 13:20:05,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 13:20:05,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:20:05,114 INFO L87 Difference]: Start difference. First operand 96587 states and 139267 transitions. Second operand 9 states. [2019-09-07 13:20:21,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:20:21,615 INFO L93 Difference]: Finished difference Result 358897 states and 729767 transitions. [2019-09-07 13:20:21,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-07 13:20:21,616 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 360 [2019-09-07 13:20:21,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:20:24,255 INFO L225 Difference]: With dead ends: 358897 [2019-09-07 13:20:24,256 INFO L226 Difference]: Without dead ends: 262316 [2019-09-07 13:20:24,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=400, Invalid=1762, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 13:20:24,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262316 states. [2019-09-07 13:20:33,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262316 to 234044. [2019-09-07 13:20:33,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234044 states. [2019-09-07 13:20:42,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234044 states to 234044 states and 339064 transitions. [2019-09-07 13:20:42,599 INFO L78 Accepts]: Start accepts. Automaton has 234044 states and 339064 transitions. Word has length 360 [2019-09-07 13:20:42,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:20:42,599 INFO L475 AbstractCegarLoop]: Abstraction has 234044 states and 339064 transitions. [2019-09-07 13:20:42,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 13:20:42,599 INFO L276 IsEmpty]: Start isEmpty. Operand 234044 states and 339064 transitions. [2019-09-07 13:20:42,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-09-07 13:20:42,967 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:20:42,968 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 13:20:42,968 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:20:42,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:20:42,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1241020116, now seen corresponding path program 1 times [2019-09-07 13:20:42,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:20:42,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:20:42,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:20:42,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:20:42,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:20:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:20:43,327 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 214 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:20:43,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:20:43,328 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 13:20:43,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:20:43,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:20:43,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 1181 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 13:20:43,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:20:43,755 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 214 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:20:43,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 13:20:43,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 8 [2019-09-07 13:20:43,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 13:20:43,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 13:20:43,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-07 13:20:43,772 INFO L87 Difference]: Start difference. First operand 234044 states and 339064 transitions. Second operand 8 states. [2019-09-07 13:20:53,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:20:53,145 INFO L93 Difference]: Finished difference Result 439485 states and 690729 transitions. [2019-09-07 13:20:53,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 13:20:53,147 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 365 [2019-09-07 13:20:53,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:20:54,125 INFO L225 Difference]: With dead ends: 439485 [2019-09-07 13:20:54,125 INFO L226 Difference]: Without dead ends: 205467 [2019-09-07 13:20:54,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-09-07 13:20:54,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205467 states. [2019-09-07 13:21:00,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205467 to 170886. [2019-09-07 13:21:00,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170886 states. [2019-09-07 13:21:00,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170886 states to 170886 states and 231428 transitions. [2019-09-07 13:21:00,728 INFO L78 Accepts]: Start accepts. Automaton has 170886 states and 231428 transitions. Word has length 365 [2019-09-07 13:21:00,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:21:00,729 INFO L475 AbstractCegarLoop]: Abstraction has 170886 states and 231428 transitions. [2019-09-07 13:21:00,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 13:21:00,729 INFO L276 IsEmpty]: Start isEmpty. Operand 170886 states and 231428 transitions. [2019-09-07 13:21:01,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-09-07 13:21:01,059 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:21:01,060 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:21:01,060 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:21:01,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:21:01,060 INFO L82 PathProgramCache]: Analyzing trace with hash -849672204, now seen corresponding path program 1 times [2019-09-07 13:21:01,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:21:01,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:21:01,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:21:01,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:21:01,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:21:01,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:21:01,386 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 247 proven. 2 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-09-07 13:21:01,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:21:01,387 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 13:21:01,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:21:01,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:21:01,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 1357 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 13:21:01,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:21:01,765 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 247 proven. 2 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 13:21:01,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 13:21:01,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-09-07 13:21:01,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 13:21:01,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 13:21:01,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:21:01,778 INFO L87 Difference]: Start difference. First operand 170886 states and 231428 transitions. Second operand 7 states. [2019-09-07 13:21:16,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:21:16,365 INFO L93 Difference]: Finished difference Result 606779 states and 933711 transitions. [2019-09-07 13:21:16,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 13:21:16,367 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 392 [2019-09-07 13:21:16,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:21:19,238 INFO L225 Difference]: With dead ends: 606779 [2019-09-07 13:21:19,238 INFO L226 Difference]: Without dead ends: 437291 [2019-09-07 13:21:19,542 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 394 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:21:19,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437291 states. [2019-09-07 13:21:36,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437291 to 407132. [2019-09-07 13:21:36,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407132 states. [2019-09-07 13:21:39,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407132 states to 407132 states and 576014 transitions. [2019-09-07 13:21:39,311 INFO L78 Accepts]: Start accepts. Automaton has 407132 states and 576014 transitions. Word has length 392 [2019-09-07 13:21:39,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:21:39,312 INFO L475 AbstractCegarLoop]: Abstraction has 407132 states and 576014 transitions. [2019-09-07 13:21:39,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 13:21:39,312 INFO L276 IsEmpty]: Start isEmpty. Operand 407132 states and 576014 transitions. [2019-09-07 13:21:40,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2019-09-07 13:21:40,467 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:21:40,467 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:21:40,467 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:21:40,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:21:40,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1021584664, now seen corresponding path program 1 times [2019-09-07 13:21:40,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:21:40,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:21:40,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:21:40,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:21:40,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:21:40,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:21:40,854 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 261 proven. 91 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-07 13:21:40,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:21:40,855 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 13:21:42,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:21:42,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:21:42,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 1538 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 13:21:42,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:21:42,482 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 296 proven. 2 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-09-07 13:21:42,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 13:21:42,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 13 [2019-09-07 13:21:42,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 13:21:42,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 13:21:42,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-09-07 13:21:42,489 INFO L87 Difference]: Start difference. First operand 407132 states and 576014 transitions. Second operand 13 states. [2019-09-07 13:21:46,478 WARN L188 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 11 [2019-09-07 13:22:00,184 WARN L188 SmtUtils]: Spent 402.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-09-07 13:23:58,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:23:58,906 INFO L93 Difference]: Finished difference Result 2161154 states and 3849430 transitions. [2019-09-07 13:23:58,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-09-07 13:23:58,906 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 418 [2019-09-07 13:23:58,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:24:17,462 INFO L225 Difference]: With dead ends: 2161154 [2019-09-07 13:24:17,462 INFO L226 Difference]: Without dead ends: 1757750 [2019-09-07 13:24:19,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 492 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5043 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1624, Invalid=11258, Unknown=0, NotChecked=0, Total=12882 [2019-09-07 13:24:21,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757750 states.