/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label16.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:51:47,406 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:51:47,408 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:51:47,420 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:51:47,421 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:51:47,422 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:51:47,423 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:51:47,425 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:51:47,426 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:51:47,427 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:51:47,428 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:51:47,429 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:51:47,429 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:51:47,430 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:51:47,431 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:51:47,432 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:51:47,433 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:51:47,434 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:51:47,436 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:51:47,438 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:51:47,439 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:51:47,440 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:51:47,441 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:51:47,442 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:51:47,444 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:51:47,444 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:51:47,445 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:51:47,445 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:51:47,446 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:51:47,447 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:51:47,447 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:51:47,448 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:51:47,448 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:51:47,449 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:51:47,450 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:51:47,450 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:51:47,451 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:51:47,451 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:51:47,451 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:51:47,452 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:51:47,453 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:51:47,454 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-11-23 20:51:47,471 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:51:47,473 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:51:47,474 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:51:47,475 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:51:47,475 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:51:47,476 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:51:47,476 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:51:47,476 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:51:47,476 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:51:47,476 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:51:47,476 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:51:47,477 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:51:47,477 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:51:47,477 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:51:47,477 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:51:47,477 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:51:47,478 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:51:47,478 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:51:47,478 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:51:47,478 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:51:47,479 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:51:47,479 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:51:47,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:51:47,479 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:51:47,479 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:51:47,480 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:51:47,480 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:51:47,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:51:47,480 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:51:47,480 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:51:47,737 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:51:47,750 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:51:47,753 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:51:47,755 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:51:47,755 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:51:47,756 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label16.c [2019-11-23 20:51:47,825 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70b072e09/7a6012f556d94c5c918602dd8466e28f/FLAG0b391fd4a [2019-11-23 20:51:48,321 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:51:48,322 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label16.c [2019-11-23 20:51:48,339 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70b072e09/7a6012f556d94c5c918602dd8466e28f/FLAG0b391fd4a [2019-11-23 20:51:48,639 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70b072e09/7a6012f556d94c5c918602dd8466e28f [2019-11-23 20:51:48,647 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:51:48,649 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:51:48,650 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:51:48,650 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:51:48,654 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:51:48,655 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:51:48" (1/1) ... [2019-11-23 20:51:48,657 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fbcd6a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:48, skipping insertion in model container [2019-11-23 20:51:48,658 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:51:48" (1/1) ... [2019-11-23 20:51:48,666 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:51:48,731 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:51:49,324 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:51:49,341 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:51:49,491 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:51:49,509 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:51:49,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:49 WrapperNode [2019-11-23 20:51:49,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:51:49,510 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:51:49,510 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:51:49,511 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:51:49,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:49" (1/1) ... [2019-11-23 20:51:49,549 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:49" (1/1) ... [2019-11-23 20:51:49,660 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:51:49,660 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:51:49,660 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:51:49,660 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:51:49,672 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:49" (1/1) ... [2019-11-23 20:51:49,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:49" (1/1) ... [2019-11-23 20:51:49,683 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:49" (1/1) ... [2019-11-23 20:51:49,683 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:49" (1/1) ... [2019-11-23 20:51:49,721 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:49" (1/1) ... [2019-11-23 20:51:49,744 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:49" (1/1) ... [2019-11-23 20:51:49,752 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:49" (1/1) ... [2019-11-23 20:51:49,763 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:51:49,763 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:51:49,763 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:51:49,763 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:51:49,764 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:49" (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-11-23 20:51:49,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:51:49,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:51:50,960 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:51:50,961 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 20:51:50,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:51:50 BoogieIcfgContainer [2019-11-23 20:51:50,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:51:50,963 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:51:50,964 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:51:50,967 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:51:50,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:51:48" (1/3) ... [2019-11-23 20:51:50,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@548b6d9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:51:50, skipping insertion in model container [2019-11-23 20:51:50,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:49" (2/3) ... [2019-11-23 20:51:50,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@548b6d9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:51:50, skipping insertion in model container [2019-11-23 20:51:50,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:51:50" (3/3) ... [2019-11-23 20:51:50,970 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label16.c [2019-11-23 20:51:50,980 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:51:50,987 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:51:51,002 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:51:51,034 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:51:51,035 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:51:51,035 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:51:51,035 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:51:51,036 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:51:51,036 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:51:51,036 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:51:51,036 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:51:51,059 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-23 20:51:51,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-23 20:51:51,074 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:51,075 INFO L410 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] [2019-11-23 20:51:51,076 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:51,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:51,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1597904809, now seen corresponding path program 1 times [2019-11-23 20:51:51,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:51,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675793440] [2019-11-23 20:51:51,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:52,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:51:52,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675793440] [2019-11-23 20:51:52,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:52,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-23 20:51:52,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183583583] [2019-11-23 20:51:52,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 20:51:52,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:52,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 20:51:52,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-11-23 20:51:52,208 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 10 states. [2019-11-23 20:51:52,501 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2019-11-23 20:51:53,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:53,885 INFO L93 Difference]: Finished difference Result 493 states and 846 transitions. [2019-11-23 20:51:53,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-23 20:51:53,887 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 130 [2019-11-23 20:51:53,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:53,901 INFO L225 Difference]: With dead ends: 493 [2019-11-23 20:51:53,901 INFO L226 Difference]: Without dead ends: 193 [2019-11-23 20:51:53,906 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2019-11-23 20:51:53,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-11-23 20:51:53,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2019-11-23 20:51:53,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-11-23 20:51:53,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 264 transitions. [2019-11-23 20:51:53,958 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 264 transitions. Word has length 130 [2019-11-23 20:51:53,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:53,958 INFO L462 AbstractCegarLoop]: Abstraction has 193 states and 264 transitions. [2019-11-23 20:51:53,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 20:51:53,959 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 264 transitions. [2019-11-23 20:51:53,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-23 20:51:53,961 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:53,962 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:51:53,962 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:53,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:53,963 INFO L82 PathProgramCache]: Analyzing trace with hash -2062675825, now seen corresponding path program 1 times [2019-11-23 20:51:53,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:53,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789043095] [2019-11-23 20:51:53,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:54,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:54,162 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:51:54,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789043095] [2019-11-23 20:51:54,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:54,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:51:54,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346322342] [2019-11-23 20:51:54,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:51:54,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:54,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:51:54,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:51:54,168 INFO L87 Difference]: Start difference. First operand 193 states and 264 transitions. Second operand 4 states. [2019-11-23 20:51:55,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:55,053 INFO L93 Difference]: Finished difference Result 588 states and 859 transitions. [2019-11-23 20:51:55,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:51:55,054 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-11-23 20:51:55,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:55,061 INFO L225 Difference]: With dead ends: 588 [2019-11-23 20:51:55,061 INFO L226 Difference]: Without dead ends: 455 [2019-11-23 20:51:55,065 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-11-23 20:51:55,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-11-23 20:51:55,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 324. [2019-11-23 20:51:55,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-11-23 20:51:55,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 437 transitions. [2019-11-23 20:51:55,091 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 437 transitions. Word has length 134 [2019-11-23 20:51:55,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:55,092 INFO L462 AbstractCegarLoop]: Abstraction has 324 states and 437 transitions. [2019-11-23 20:51:55,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:51:55,092 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 437 transitions. [2019-11-23 20:51:55,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-23 20:51:55,095 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:55,095 INFO L410 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] [2019-11-23 20:51:55,095 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:55,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:55,096 INFO L82 PathProgramCache]: Analyzing trace with hash -2061250518, now seen corresponding path program 1 times [2019-11-23 20:51:55,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:55,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106974411] [2019-11-23 20:51:55,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:55,334 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:51:55,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106974411] [2019-11-23 20:51:55,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:55,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:51:55,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8088811] [2019-11-23 20:51:55,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:51:55,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:55,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:51:55,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:51:55,337 INFO L87 Difference]: Start difference. First operand 324 states and 437 transitions. Second operand 4 states. [2019-11-23 20:51:56,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:56,223 INFO L93 Difference]: Finished difference Result 814 states and 1168 transitions. [2019-11-23 20:51:56,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:51:56,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-11-23 20:51:56,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:56,233 INFO L225 Difference]: With dead ends: 814 [2019-11-23 20:51:56,233 INFO L226 Difference]: Without dead ends: 455 [2019-11-23 20:51:56,235 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-11-23 20:51:56,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-11-23 20:51:56,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2019-11-23 20:51:56,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2019-11-23 20:51:56,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 536 transitions. [2019-11-23 20:51:56,284 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 536 transitions. Word has length 137 [2019-11-23 20:51:56,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:56,284 INFO L462 AbstractCegarLoop]: Abstraction has 455 states and 536 transitions. [2019-11-23 20:51:56,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:51:56,285 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 536 transitions. [2019-11-23 20:51:56,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-23 20:51:56,289 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:56,289 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:51:56,289 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:56,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:56,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1412559080, now seen corresponding path program 1 times [2019-11-23 20:51:56,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:56,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516423917] [2019-11-23 20:51:56,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:56,352 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 20:51:56,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516423917] [2019-11-23 20:51:56,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:56,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:51:56,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284192504] [2019-11-23 20:51:56,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:51:56,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:56,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:51:56,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:51:56,354 INFO L87 Difference]: Start difference. First operand 455 states and 536 transitions. Second operand 3 states. [2019-11-23 20:51:56,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:56,874 INFO L93 Difference]: Finished difference Result 981 states and 1171 transitions. [2019-11-23 20:51:56,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:51:56,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2019-11-23 20:51:56,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:56,878 INFO L225 Difference]: With dead ends: 981 [2019-11-23 20:51:56,879 INFO L226 Difference]: Without dead ends: 586 [2019-11-23 20:51:56,880 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-23 20:51:56,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-11-23 20:51:56,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2019-11-23 20:51:56,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-11-23 20:51:56,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 676 transitions. [2019-11-23 20:51:56,897 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 676 transitions. Word has length 145 [2019-11-23 20:51:56,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:56,898 INFO L462 AbstractCegarLoop]: Abstraction has 586 states and 676 transitions. [2019-11-23 20:51:56,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:51:56,898 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 676 transitions. [2019-11-23 20:51:56,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-23 20:51:56,901 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:56,901 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:51:56,901 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:56,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:56,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1731311838, now seen corresponding path program 1 times [2019-11-23 20:51:56,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:56,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078025024] [2019-11-23 20:51:56,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:56,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:57,004 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:51:57,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078025024] [2019-11-23 20:51:57,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:57,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:51:57,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065013837] [2019-11-23 20:51:57,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 20:51:57,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:57,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 20:51:57,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:51:57,007 INFO L87 Difference]: Start difference. First operand 586 states and 676 transitions. Second operand 5 states. [2019-11-23 20:51:58,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:58,065 INFO L93 Difference]: Finished difference Result 1898 states and 2221 transitions. [2019-11-23 20:51:58,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:51:58,067 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 149 [2019-11-23 20:51:58,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:58,073 INFO L225 Difference]: With dead ends: 1898 [2019-11-23 20:51:58,075 INFO L226 Difference]: Without dead ends: 1372 [2019-11-23 20:51:58,077 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:51:58,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2019-11-23 20:51:58,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1241. [2019-11-23 20:51:58,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1241 states. [2019-11-23 20:51:58,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 1410 transitions. [2019-11-23 20:51:58,108 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 1410 transitions. Word has length 149 [2019-11-23 20:51:58,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:58,108 INFO L462 AbstractCegarLoop]: Abstraction has 1241 states and 1410 transitions. [2019-11-23 20:51:58,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 20:51:58,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1410 transitions. [2019-11-23 20:51:58,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-23 20:51:58,113 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:58,113 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 20:51:58,113 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:58,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:58,114 INFO L82 PathProgramCache]: Analyzing trace with hash 911359967, now seen corresponding path program 1 times [2019-11-23 20:51:58,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:58,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282710884] [2019-11-23 20:51:58,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:58,922 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:51:58,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282710884] [2019-11-23 20:51:58,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:58,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-23 20:51:58,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122232953] [2019-11-23 20:51:58,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-23 20:51:58,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:58,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-23 20:51:58,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2019-11-23 20:51:58,925 INFO L87 Difference]: Start difference. First operand 1241 states and 1410 transitions. Second operand 12 states. [2019-11-23 20:52:00,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:52:00,828 INFO L93 Difference]: Finished difference Result 2794 states and 3292 transitions. [2019-11-23 20:52:00,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-23 20:52:00,828 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 167 [2019-11-23 20:52:00,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:52:00,838 INFO L225 Difference]: With dead ends: 2794 [2019-11-23 20:52:00,839 INFO L226 Difference]: Without dead ends: 1579 [2019-11-23 20:52:00,841 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2019-11-23 20:52:00,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states. [2019-11-23 20:52:00,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 1538. [2019-11-23 20:52:00,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1538 states. [2019-11-23 20:52:00,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 1742 transitions. [2019-11-23 20:52:00,900 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 1742 transitions. Word has length 167 [2019-11-23 20:52:00,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:52:00,902 INFO L462 AbstractCegarLoop]: Abstraction has 1538 states and 1742 transitions. [2019-11-23 20:52:00,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-23 20:52:00,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 1742 transitions. [2019-11-23 20:52:00,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-23 20:52:00,906 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:52:00,907 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 20:52:00,907 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:52:00,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:52:00,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1583433812, now seen corresponding path program 1 times [2019-11-23 20:52:00,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:52:00,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255282929] [2019-11-23 20:52:00,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:52:00,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:01,191 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 65 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-23 20:52:01,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255282929] [2019-11-23 20:52:01,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799105155] [2019-11-23 20:52:01,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:52:01,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:01,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 20:52:01,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:52:01,394 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-23 20:52:01,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:52:01,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-11-23 20:52:01,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546319393] [2019-11-23 20:52:01,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:52:01,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:52:01,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:52:01,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-23 20:52:01,396 INFO L87 Difference]: Start difference. First operand 1538 states and 1742 transitions. Second operand 3 states. [2019-11-23 20:52:01,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:52:01,933 INFO L93 Difference]: Finished difference Result 3706 states and 4171 transitions. [2019-11-23 20:52:01,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:52:01,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-11-23 20:52:01,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:52:01,946 INFO L225 Difference]: With dead ends: 3706 [2019-11-23 20:52:01,946 INFO L226 Difference]: Without dead ends: 2228 [2019-11-23 20:52:01,949 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 192 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-23 20:52:01,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2228 states. [2019-11-23 20:52:01,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2228 to 2228. [2019-11-23 20:52:02,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2228 states. [2019-11-23 20:52:02,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 2466 transitions. [2019-11-23 20:52:02,005 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 2466 transitions. Word has length 193 [2019-11-23 20:52:02,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:52:02,006 INFO L462 AbstractCegarLoop]: Abstraction has 2228 states and 2466 transitions. [2019-11-23 20:52:02,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:52:02,007 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 2466 transitions. [2019-11-23 20:52:02,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-11-23 20:52:02,015 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:52:02,015 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 20:52:02,219 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:52:02,219 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:52:02,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:52:02,220 INFO L82 PathProgramCache]: Analyzing trace with hash -79848107, now seen corresponding path program 1 times [2019-11-23 20:52:02,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:52:02,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374380287] [2019-11-23 20:52:02,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:52:02,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:02,456 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 85 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-23 20:52:02,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374380287] [2019-11-23 20:52:02,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146152801] [2019-11-23 20:52:02,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:52:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:02,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 20:52:02,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:52:02,641 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-23 20:52:02,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:52:02,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-23 20:52:02,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015710428] [2019-11-23 20:52:02,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:52:02,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:52:02,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:52:02,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:52:02,648 INFO L87 Difference]: Start difference. First operand 2228 states and 2466 transitions. Second operand 3 states. [2019-11-23 20:52:03,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:52:03,138 INFO L93 Difference]: Finished difference Result 4920 states and 5484 transitions. [2019-11-23 20:52:03,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:52:03,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2019-11-23 20:52:03,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:52:03,155 INFO L225 Difference]: With dead ends: 4920 [2019-11-23 20:52:03,155 INFO L226 Difference]: Without dead ends: 2752 [2019-11-23 20:52:03,159 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 209 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:52:03,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2752 states. [2019-11-23 20:52:03,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2752 to 2621. [2019-11-23 20:52:03,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2621 states. [2019-11-23 20:52:03,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2621 states to 2621 states and 2939 transitions. [2019-11-23 20:52:03,227 INFO L78 Accepts]: Start accepts. Automaton has 2621 states and 2939 transitions. Word has length 210 [2019-11-23 20:52:03,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:52:03,228 INFO L462 AbstractCegarLoop]: Abstraction has 2621 states and 2939 transitions. [2019-11-23 20:52:03,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:52:03,228 INFO L276 IsEmpty]: Start isEmpty. Operand 2621 states and 2939 transitions. [2019-11-23 20:52:03,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-11-23 20:52:03,240 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:52:03,240 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 20:52:03,452 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:52:03,453 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:52:03,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:52:03,453 INFO L82 PathProgramCache]: Analyzing trace with hash 290784368, now seen corresponding path program 1 times [2019-11-23 20:52:03,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:52:03,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927203768] [2019-11-23 20:52:03,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:52:03,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:03,620 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 129 proven. 1 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-11-23 20:52:03,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927203768] [2019-11-23 20:52:03,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731269315] [2019-11-23 20:52:03,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:52:03,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:03,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 20:52:03,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:52:03,777 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-23 20:52:03,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:52:03,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-23 20:52:03,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061235079] [2019-11-23 20:52:03,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:52:03,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:52:03,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:52:03,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:52:03,780 INFO L87 Difference]: Start difference. First operand 2621 states and 2939 transitions. Second operand 3 states. [2019-11-23 20:52:04,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:52:04,228 INFO L93 Difference]: Finished difference Result 5444 states and 6130 transitions. [2019-11-23 20:52:04,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:52:04,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 226 [2019-11-23 20:52:04,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:52:04,240 INFO L225 Difference]: With dead ends: 5444 [2019-11-23 20:52:04,240 INFO L226 Difference]: Without dead ends: 2883 [2019-11-23 20:52:04,244 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 225 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:52:04,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2883 states. [2019-11-23 20:52:04,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2883 to 2752. [2019-11-23 20:52:04,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2752 states. [2019-11-23 20:52:04,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2752 states to 2752 states and 3087 transitions. [2019-11-23 20:52:04,296 INFO L78 Accepts]: Start accepts. Automaton has 2752 states and 3087 transitions. Word has length 226 [2019-11-23 20:52:04,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:52:04,296 INFO L462 AbstractCegarLoop]: Abstraction has 2752 states and 3087 transitions. [2019-11-23 20:52:04,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:52:04,297 INFO L276 IsEmpty]: Start isEmpty. Operand 2752 states and 3087 transitions. [2019-11-23 20:52:04,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-11-23 20:52:04,304 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:52:04,304 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 20:52:04,508 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:52:04,508 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:52:04,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:52:04,509 INFO L82 PathProgramCache]: Analyzing trace with hash -2066967986, now seen corresponding path program 1 times [2019-11-23 20:52:04,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:52:04,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100633828] [2019-11-23 20:52:04,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:52:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:04,667 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-23 20:52:04,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100633828] [2019-11-23 20:52:04,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:52:04,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:52:04,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570477505] [2019-11-23 20:52:04,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:52:04,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:52:04,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:52:04,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:52:04,673 INFO L87 Difference]: Start difference. First operand 2752 states and 3087 transitions. Second operand 4 states. [2019-11-23 20:52:05,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:52:05,230 INFO L93 Difference]: Finished difference Result 6099 states and 6881 transitions. [2019-11-23 20:52:05,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:52:05,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 229 [2019-11-23 20:52:05,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:52:05,244 INFO L225 Difference]: With dead ends: 6099 [2019-11-23 20:52:05,244 INFO L226 Difference]: Without dead ends: 3407 [2019-11-23 20:52:05,248 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:52:05,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3407 states. [2019-11-23 20:52:05,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3407 to 2883. [2019-11-23 20:52:05,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2883 states. [2019-11-23 20:52:05,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2883 states to 2883 states and 3232 transitions. [2019-11-23 20:52:05,299 INFO L78 Accepts]: Start accepts. Automaton has 2883 states and 3232 transitions. Word has length 229 [2019-11-23 20:52:05,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:52:05,300 INFO L462 AbstractCegarLoop]: Abstraction has 2883 states and 3232 transitions. [2019-11-23 20:52:05,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:52:05,300 INFO L276 IsEmpty]: Start isEmpty. Operand 2883 states and 3232 transitions. [2019-11-23 20:52:05,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-11-23 20:52:05,307 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:52:05,307 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 20:52:05,308 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:52:05,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:52:05,308 INFO L82 PathProgramCache]: Analyzing trace with hash 2098359784, now seen corresponding path program 1 times [2019-11-23 20:52:05,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:52:05,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296642006] [2019-11-23 20:52:05,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:52:05,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:05,434 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 138 proven. 1 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-23 20:52:05,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296642006] [2019-11-23 20:52:05,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234034896] [2019-11-23 20:52:05,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:52:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:05,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 20:52:05,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:52:05,683 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-23 20:52:05,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:52:05,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-23 20:52:05,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165877464] [2019-11-23 20:52:05,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:52:05,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:52:05,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:52:05,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:52:05,686 INFO L87 Difference]: Start difference. First operand 2883 states and 3232 transitions. Second operand 3 states. [2019-11-23 20:52:06,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:52:06,219 INFO L93 Difference]: Finished difference Result 6230 states and 7042 transitions. [2019-11-23 20:52:06,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:52:06,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-11-23 20:52:06,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:52:06,234 INFO L225 Difference]: With dead ends: 6230 [2019-11-23 20:52:06,234 INFO L226 Difference]: Without dead ends: 3407 [2019-11-23 20:52:06,239 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 234 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:52:06,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3407 states. [2019-11-23 20:52:06,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3407 to 3145. [2019-11-23 20:52:06,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3145 states. [2019-11-23 20:52:06,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3145 states to 3145 states and 3527 transitions. [2019-11-23 20:52:06,298 INFO L78 Accepts]: Start accepts. Automaton has 3145 states and 3527 transitions. Word has length 235 [2019-11-23 20:52:06,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:52:06,299 INFO L462 AbstractCegarLoop]: Abstraction has 3145 states and 3527 transitions. [2019-11-23 20:52:06,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:52:06,299 INFO L276 IsEmpty]: Start isEmpty. Operand 3145 states and 3527 transitions. [2019-11-23 20:52:06,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-11-23 20:52:06,307 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:52:06,308 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 20:52:06,511 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:52:06,512 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:52:06,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:52:06,512 INFO L82 PathProgramCache]: Analyzing trace with hash -244499915, now seen corresponding path program 1 times [2019-11-23 20:52:06,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:52:06,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381025264] [2019-11-23 20:52:06,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:52:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:06,656 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 189 proven. 1 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-11-23 20:52:06,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381025264] [2019-11-23 20:52:06,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969103711] [2019-11-23 20:52:06,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:52:06,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:06,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 20:52:06,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:52:06,898 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-11-23 20:52:06,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:52:06,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-23 20:52:06,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969761031] [2019-11-23 20:52:06,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:52:06,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:52:06,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:52:06,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:52:06,901 INFO L87 Difference]: Start difference. First operand 3145 states and 3527 transitions. Second operand 3 states. [2019-11-23 20:52:07,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:52:07,399 INFO L93 Difference]: Finished difference Result 4883 states and 5449 transitions. [2019-11-23 20:52:07,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:52:07,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 280 [2019-11-23 20:52:07,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:52:07,400 INFO L225 Difference]: With dead ends: 4883 [2019-11-23 20:52:07,400 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 20:52:07,405 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 279 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:52:07,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 20:52:07,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 20:52:07,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 20:52:07,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 20:52:07,406 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 280 [2019-11-23 20:52:07,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:52:07,407 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 20:52:07,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:52:07,407 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 20:52:07,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 20:52:07,619 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:52:07,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 20:52:08,086 WARN L192 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-11-23 20:52:08,450 WARN L192 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-11-23 20:52:08,454 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-23 20:52:08,454 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-23 20:52:08,454 INFO L444 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,455 INFO L444 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,455 INFO L444 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,455 INFO L444 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,455 INFO L444 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,455 INFO L444 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,455 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-23 20:52:08,455 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-23 20:52:08,455 INFO L444 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-23 20:52:08,456 INFO L444 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-23 20:52:08,456 INFO L444 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-23 20:52:08,456 INFO L444 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-23 20:52:08,456 INFO L444 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-23 20:52:08,457 INFO L444 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-23 20:52:08,457 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-23 20:52:08,458 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-23 20:52:08,458 INFO L444 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,458 INFO L444 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,458 INFO L444 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,458 INFO L444 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,458 INFO L444 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,458 INFO L444 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,459 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-23 20:52:08,459 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-23 20:52:08,459 INFO L444 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-23 20:52:08,459 INFO L444 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-23 20:52:08,459 INFO L444 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-23 20:52:08,459 INFO L444 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-23 20:52:08,459 INFO L444 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-23 20:52:08,459 INFO L444 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-23 20:52:08,459 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-23 20:52:08,460 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-23 20:52:08,460 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-23 20:52:08,460 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-23 20:52:08,460 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-23 20:52:08,460 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-23 20:52:08,460 INFO L444 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-23 20:52:08,460 INFO L444 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,460 INFO L444 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,460 INFO L444 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,461 INFO L444 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,461 INFO L444 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,461 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-23 20:52:08,461 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-23 20:52:08,461 INFO L444 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-23 20:52:08,461 INFO L444 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-23 20:52:08,461 INFO L444 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-23 20:52:08,461 INFO L444 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-23 20:52:08,462 INFO L444 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-23 20:52:08,462 INFO L444 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-23 20:52:08,462 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-23 20:52:08,462 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse3 (= ~a20~0 1))) (let ((.cse6 (<= 14 ~a8~0)) (.cse8 (<= ~a21~0 0)) (.cse9 (not .cse3)) (.cse7 (<= ~a16~0 5)) (.cse4 (<= ~a7~0 0)) (.cse5 (= 1 ~a7~0)) (.cse0 (= ~a17~0 1)) (.cse1 (= ~a12~0 8)) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse1) (and .cse5 .cse8 .cse1 .cse3) (and (or (= 2 ULTIMATE.start_calculate_output_~input) (= 4 ULTIMATE.start_calculate_output_~input) (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse1 .cse2 (= 15 ~a8~0) (= ~a16~0 6) .cse4) (and .cse5 .cse9 .cse6 .cse7) (and .cse5 .cse9 .cse8 .cse7 .cse0) (and .cse9 (<= 15 ~a8~0) .cse4) (and .cse7 .cse4) (and .cse5 (= 13 ~a8~0) (= ~a16~0 4) .cse0 .cse1 .cse2 .cse3)))) [2019-11-23 20:52:08,463 INFO L444 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,463 INFO L444 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,463 INFO L444 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,463 INFO L444 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,463 INFO L444 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,463 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-23 20:52:08,463 INFO L444 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-23 20:52:08,463 INFO L444 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-23 20:52:08,464 INFO L444 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-23 20:52:08,464 INFO L444 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-23 20:52:08,464 INFO L444 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-23 20:52:08,464 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-23 20:52:08,464 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-23 20:52:08,464 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-23 20:52:08,464 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-23 20:52:08,464 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-23 20:52:08,464 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-23 20:52:08,465 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-23 20:52:08,465 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-23 20:52:08,465 INFO L444 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,465 INFO L444 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,465 INFO L444 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,465 INFO L444 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,465 INFO L444 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,465 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-23 20:52:08,465 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-23 20:52:08,466 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-23 20:52:08,466 INFO L444 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-23 20:52:08,466 INFO L444 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-23 20:52:08,466 INFO L444 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-23 20:52:08,466 INFO L444 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-23 20:52:08,466 INFO L444 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-23 20:52:08,466 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-23 20:52:08,466 INFO L444 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,466 INFO L444 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,467 INFO L444 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,467 INFO L444 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,467 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-23 20:52:08,467 INFO L444 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,467 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-23 20:52:08,467 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-23 20:52:08,467 INFO L444 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-23 20:52:08,467 INFO L444 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-23 20:52:08,467 INFO L444 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-23 20:52:08,467 INFO L444 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-23 20:52:08,468 INFO L444 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-23 20:52:08,468 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 20:52:08,468 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-23 20:52:08,468 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-23 20:52:08,468 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-23 20:52:08,468 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-23 20:52:08,468 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-23 20:52:08,468 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-23 20:52:08,468 INFO L444 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,469 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse3 (= ~a20~0 1))) (let ((.cse6 (<= 14 ~a8~0)) (.cse8 (<= ~a21~0 0)) (.cse9 (not .cse3)) (.cse7 (<= ~a16~0 5)) (.cse4 (<= ~a7~0 0)) (.cse5 (= 1 ~a7~0)) (.cse0 (= ~a17~0 1)) (.cse1 (= ~a12~0 8)) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse1) (and .cse5 .cse8 .cse1 .cse3) (and (or (= 2 ULTIMATE.start_calculate_output_~input) (= 4 ULTIMATE.start_calculate_output_~input) (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse1 .cse2 (= 15 ~a8~0) (= ~a16~0 6) .cse4) (and .cse5 .cse9 .cse6 .cse7) (and .cse5 .cse9 .cse8 .cse7 .cse0) (and .cse9 (<= 15 ~a8~0) .cse4) (and .cse7 .cse4) (and .cse5 (= 13 ~a8~0) (= ~a16~0 4) .cse0 .cse1 .cse2 .cse3)))) [2019-11-23 20:52:08,469 INFO L444 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,469 INFO L444 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,469 INFO L444 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,469 INFO L444 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,469 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-23 20:52:08,469 INFO L444 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-23 20:52:08,470 INFO L444 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-23 20:52:08,470 INFO L444 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-23 20:52:08,470 INFO L444 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-23 20:52:08,470 INFO L444 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-23 20:52:08,470 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-23 20:52:08,470 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-23 20:52:08,470 INFO L444 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,470 INFO L444 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,470 INFO L444 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,471 INFO L444 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,471 INFO L444 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,471 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-23 20:52:08,471 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 20:52:08,471 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-23 20:52:08,471 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-23 20:52:08,471 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-23 20:52:08,471 INFO L444 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-23 20:52:08,471 INFO L444 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-23 20:52:08,472 INFO L444 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-23 20:52:08,472 INFO L444 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-23 20:52:08,472 INFO L444 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-23 20:52:08,472 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-23 20:52:08,472 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-23 20:52:08,472 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-23 20:52:08,472 INFO L444 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,472 INFO L444 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,473 INFO L444 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,473 INFO L444 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,473 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-23 20:52:08,473 INFO L444 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,473 INFO L444 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,473 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-23 20:52:08,473 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-23 20:52:08,473 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 20:52:08,473 INFO L444 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-23 20:52:08,474 INFO L444 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-23 20:52:08,474 INFO L444 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-23 20:52:08,474 INFO L444 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-23 20:52:08,474 INFO L444 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-23 20:52:08,474 INFO L444 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-23 20:52:08,474 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-23 20:52:08,474 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-23 20:52:08,474 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-23 20:52:08,474 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-23 20:52:08,474 INFO L444 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,475 INFO L444 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,475 INFO L444 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,475 INFO L444 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,475 INFO L444 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,475 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-23 20:52:08,475 INFO L444 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,475 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-23 20:52:08,475 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-23 20:52:08,476 INFO L444 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-23 20:52:08,476 INFO L444 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-23 20:52:08,476 INFO L444 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-23 20:52:08,476 INFO L444 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-23 20:52:08,476 INFO L444 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-23 20:52:08,476 INFO L444 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-23 20:52:08,476 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-23 20:52:08,476 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-23 20:52:08,476 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-23 20:52:08,476 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 20:52:08,477 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 566) no Hoare annotation was computed. [2019-11-23 20:52:08,477 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-23 20:52:08,477 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-23 20:52:08,477 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-23 20:52:08,477 INFO L444 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,477 INFO L444 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,477 INFO L444 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,478 INFO L444 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,478 INFO L444 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,478 INFO L444 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:08,478 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-23 20:52:08,478 INFO L444 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-23 20:52:08,478 INFO L444 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-23 20:52:08,478 INFO L444 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-23 20:52:08,478 INFO L444 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-23 20:52:08,478 INFO L444 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-23 20:52:08,479 INFO L444 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-23 20:52:08,479 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-23 20:52:08,479 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-23 20:52:08,479 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-23 20:52:08,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:52:08 BoogieIcfgContainer [2019-11-23 20:52:08,502 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 20:52:08,504 INFO L168 Benchmark]: Toolchain (without parser) took 19855.18 ms. Allocated memory was 138.9 MB in the beginning and 532.2 MB in the end (delta: 393.2 MB). Free memory was 102.0 MB in the beginning and 314.0 MB in the end (delta: -212.0 MB). Peak memory consumption was 181.2 MB. Max. memory is 7.1 GB. [2019-11-23 20:52:08,505 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-11-23 20:52:08,505 INFO L168 Benchmark]: CACSL2BoogieTranslator took 859.99 ms. Allocated memory was 138.9 MB in the beginning and 205.5 MB in the end (delta: 66.6 MB). Free memory was 101.8 MB in the beginning and 168.7 MB in the end (delta: -66.9 MB). Peak memory consumption was 33.5 MB. Max. memory is 7.1 GB. [2019-11-23 20:52:08,506 INFO L168 Benchmark]: Boogie Procedure Inliner took 149.78 ms. Allocated memory is still 205.5 MB. Free memory was 168.7 MB in the beginning and 163.1 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 7.1 GB. [2019-11-23 20:52:08,507 INFO L168 Benchmark]: Boogie Preprocessor took 102.56 ms. Allocated memory is still 205.5 MB. Free memory was 163.1 MB in the beginning and 158.1 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. [2019-11-23 20:52:08,508 INFO L168 Benchmark]: RCFGBuilder took 1199.36 ms. Allocated memory was 205.5 MB in the beginning and 239.1 MB in the end (delta: 33.6 MB). Free memory was 158.1 MB in the beginning and 169.7 MB in the end (delta: -11.6 MB). Peak memory consumption was 75.7 MB. Max. memory is 7.1 GB. [2019-11-23 20:52:08,509 INFO L168 Benchmark]: TraceAbstraction took 17538.50 ms. Allocated memory was 239.1 MB in the beginning and 532.2 MB in the end (delta: 293.1 MB). Free memory was 169.7 MB in the beginning and 314.0 MB in the end (delta: -144.3 MB). Peak memory consumption was 148.8 MB. Max. memory is 7.1 GB. [2019-11-23 20:52:08,513 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 859.99 ms. Allocated memory was 138.9 MB in the beginning and 205.5 MB in the end (delta: 66.6 MB). Free memory was 101.8 MB in the beginning and 168.7 MB in the end (delta: -66.9 MB). Peak memory consumption was 33.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 149.78 ms. Allocated memory is still 205.5 MB. Free memory was 168.7 MB in the beginning and 163.1 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 102.56 ms. Allocated memory is still 205.5 MB. Free memory was 163.1 MB in the beginning and 158.1 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1199.36 ms. Allocated memory was 205.5 MB in the beginning and 239.1 MB in the end (delta: 33.6 MB). Free memory was 158.1 MB in the beginning and 169.7 MB in the end (delta: -11.6 MB). Peak memory consumption was 75.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17538.50 ms. Allocated memory was 239.1 MB in the beginning and 532.2 MB in the end (delta: 293.1 MB). Free memory was 169.7 MB in the beginning and 314.0 MB in the end (delta: -144.3 MB). Peak memory consumption was 148.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 566]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((((((a17 == 1 && a12 == 8) && a21 == 1) && a20 == 1) && a7 <= 0) || (((1 == a7 && 14 <= a8) && a16 <= 5) && a12 == 8)) || (((1 == a7 && a21 <= 0) && a12 == 8) && a20 == 1)) || ((((((((((2 == input || 4 == input) || 3 == input) || 6 == input) || 1 == input) || 5 == input) && a12 == 8) && a21 == 1) && 15 == a8) && a16 == 6) && a7 <= 0)) || (((1 == a7 && !(a20 == 1)) && 14 <= a8) && a16 <= 5)) || ((((1 == a7 && !(a20 == 1)) && a21 <= 0) && a16 <= 5) && a17 == 1)) || ((!(a20 == 1) && 15 <= a8) && a7 <= 0)) || (a16 <= 5 && a7 <= 0)) || ((((((1 == a7 && 13 == a8) && a16 == 4) && a17 == 1) && a12 == 8) && a21 == 1) && a20 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((((a17 == 1 && a12 == 8) && a21 == 1) && a20 == 1) && a7 <= 0) || (((1 == a7 && 14 <= a8) && a16 <= 5) && a12 == 8)) || (((1 == a7 && a21 <= 0) && a12 == 8) && a20 == 1)) || ((((((((((2 == input || 4 == input) || 3 == input) || 6 == input) || 1 == input) || 5 == input) && a12 == 8) && a21 == 1) && 15 == a8) && a16 == 6) && a7 <= 0)) || (((1 == a7 && !(a20 == 1)) && 14 <= a8) && a16 <= 5)) || ((((1 == a7 && !(a20 == 1)) && a21 <= 0) && a16 <= 5) && a17 == 1)) || ((!(a20 == 1) && 15 <= a8) && a7 <= 0)) || (a16 <= 5 && a7 <= 0)) || ((((((1 == a7 && 13 == a8) && a16 == 4) && a17 == 1) && a12 == 8) && a21 == 1) && a20 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 17.4s, OverallIterations: 12, TraceHistogramMax: 7, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, HoareTripleCheckerStatistics: 1029 SDtfs, 2057 SDslu, 145 SDs, 0 SdLazy, 6174 SolverSat, 794 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1229 GetRequests, 1157 SyntacticMatches, 11 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3145occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 1351 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 36 NumberOfFragments, 299 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1064 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 176 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 3379 NumberOfCodeBlocks, 3379 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 3362 ConstructedInterpolants, 0 QuantifiedInterpolants, 2503310 SizeOfPredicates, 4 NumberOfNonLiveVariables, 2066 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 17 InterpolantComputations, 12 PerfectInterpolantSequences, 2121/2136 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...