/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_label45.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:52:53,905 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:52:53,908 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:52:53,923 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:52:53,924 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:52:53,925 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:52:53,928 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:52:53,930 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:52:53,934 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:52:53,935 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:52:53,936 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:52:53,939 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:52:53,939 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:52:53,945 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:52:53,946 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:52:53,951 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:52:53,952 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:52:53,952 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:52:53,954 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:52:53,959 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:52:53,963 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:52:53,964 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:52:53,965 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:52:53,966 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:52:53,970 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:52:53,972 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:52:53,972 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:52:53,973 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:52:53,973 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:52:53,974 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:52:53,974 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:52:53,975 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:52:53,976 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:52:53,976 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:52:53,980 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:52:53,980 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:52:53,982 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:52:53,982 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:52:53,982 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:52:53,983 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:52:53,985 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:52:53,988 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:52:54,002 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:52:54,003 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:52:54,004 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:52:54,004 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:52:54,004 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:52:54,005 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:52:54,005 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:52:54,005 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:52:54,005 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:52:54,006 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:52:54,006 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:52:54,006 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:52:54,006 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:52:54,006 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:52:54,007 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:52:54,007 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:52:54,007 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:52:54,007 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:52:54,007 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:52:54,008 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:52:54,008 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:52:54,008 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:52:54,008 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:52:54,009 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:52:54,009 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:52:54,009 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:52:54,009 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:52:54,009 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:52:54,010 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:52:54,010 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:52:54,328 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:52:54,341 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:52:54,344 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:52:54,346 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:52:54,346 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:52:54,347 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label45.c [2019-11-23 20:52:54,411 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b94767cf0/c90cc84564af45fc8d4d1bbde4e4d258/FLAG5871ba2f6 [2019-11-23 20:52:54,974 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:52:54,975 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label45.c [2019-11-23 20:52:54,992 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b94767cf0/c90cc84564af45fc8d4d1bbde4e4d258/FLAG5871ba2f6 [2019-11-23 20:52:55,220 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b94767cf0/c90cc84564af45fc8d4d1bbde4e4d258 [2019-11-23 20:52:55,228 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:52:55,230 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:52:55,231 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:52:55,231 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:52:55,235 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:52:55,236 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:52:55" (1/1) ... [2019-11-23 20:52:55,239 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@510c0d40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:55, skipping insertion in model container [2019-11-23 20:52:55,239 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:52:55" (1/1) ... [2019-11-23 20:52:55,248 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:52:55,307 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:52:55,978 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:52:55,989 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:52:56,139 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:52:56,168 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:52:56,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:56 WrapperNode [2019-11-23 20:52:56,169 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:52:56,170 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:52:56,170 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:52:56,170 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:52:56,179 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:52:56" (1/1) ... [2019-11-23 20:52:56,217 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:52:56" (1/1) ... [2019-11-23 20:52:56,316 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:52:56,317 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:52:56,317 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:52:56,317 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:52:56,327 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:56" (1/1) ... [2019-11-23 20:52:56,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:56" (1/1) ... [2019-11-23 20:52:56,345 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:56" (1/1) ... [2019-11-23 20:52:56,346 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:56" (1/1) ... [2019-11-23 20:52:56,380 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:56" (1/1) ... [2019-11-23 20:52:56,405 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:56" (1/1) ... [2019-11-23 20:52:56,415 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:56" (1/1) ... [2019-11-23 20:52:56,430 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:52:56,434 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:52:56,434 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:52:56,434 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:52:56,436 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:56" (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:52:56,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:52:56,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:52:57,749 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:52:57,750 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 20:52:57,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:52:57 BoogieIcfgContainer [2019-11-23 20:52:57,752 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:52:57,753 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:52:57,753 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:52:57,756 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:52:57,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:52:55" (1/3) ... [2019-11-23 20:52:57,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70db41f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:52:57, skipping insertion in model container [2019-11-23 20:52:57,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:56" (2/3) ... [2019-11-23 20:52:57,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70db41f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:52:57, skipping insertion in model container [2019-11-23 20:52:57,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:52:57" (3/3) ... [2019-11-23 20:52:57,760 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label45.c [2019-11-23 20:52:57,770 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:52:57,778 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:52:57,790 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:52:57,817 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:52:57,817 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:52:57,818 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:52:57,818 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:52:57,818 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:52:57,818 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:52:57,819 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:52:57,819 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:52:57,841 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-23 20:52:57,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-23 20:52:57,853 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:52:57,854 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] [2019-11-23 20:52:57,855 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:52:57,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:52:57,861 INFO L82 PathProgramCache]: Analyzing trace with hash -286323610, now seen corresponding path program 1 times [2019-11-23 20:52:57,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:52:57,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911079471] [2019-11-23 20:52:57,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:52:58,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:58,373 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:52:58,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911079471] [2019-11-23 20:52:58,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:52:58,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:52:58,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432074317] [2019-11-23 20:52:58,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:52:58,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:52:58,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:52:58,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:52:58,403 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 3 states. [2019-11-23 20:52:59,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:52:59,406 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions. [2019-11-23 20:52:59,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:52:59,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-11-23 20:52:59,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:52:59,439 INFO L225 Difference]: With dead ends: 528 [2019-11-23 20:52:59,439 INFO L226 Difference]: Without dead ends: 266 [2019-11-23 20:52:59,449 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:52:59,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-23 20:52:59,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2019-11-23 20:52:59,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-23 20:52:59,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2019-11-23 20:52:59,538 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 117 [2019-11-23 20:52:59,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:52:59,540 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2019-11-23 20:52:59,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:52:59,540 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2019-11-23 20:52:59,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-23 20:52:59,548 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:52:59,549 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 20:52:59,550 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:52:59,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:52:59,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1653159310, now seen corresponding path program 1 times [2019-11-23 20:52:59,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:52:59,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107640078] [2019-11-23 20:52:59,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:52:59,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:59,637 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:52:59,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107640078] [2019-11-23 20:52:59,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:52:59,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:52:59,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558231209] [2019-11-23 20:52:59,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:52:59,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:52:59,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:52:59,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:52:59,642 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 4 states. [2019-11-23 20:53:00,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:53:00,308 INFO L93 Difference]: Finished difference Result 792 states and 1135 transitions. [2019-11-23 20:53:00,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:53:00,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-11-23 20:53:00,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:53:00,312 INFO L225 Difference]: With dead ends: 792 [2019-11-23 20:53:00,312 INFO L226 Difference]: Without dead ends: 528 [2019-11-23 20:53:00,314 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:53:00,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-11-23 20:53:00,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2019-11-23 20:53:00,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-11-23 20:53:00,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 720 transitions. [2019-11-23 20:53:00,330 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 720 transitions. Word has length 122 [2019-11-23 20:53:00,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:53:00,331 INFO L462 AbstractCegarLoop]: Abstraction has 528 states and 720 transitions. [2019-11-23 20:53:00,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:53:00,331 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 720 transitions. [2019-11-23 20:53:00,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-23 20:53:00,333 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:53:00,333 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 20:53:00,333 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:53:00,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:53:00,334 INFO L82 PathProgramCache]: Analyzing trace with hash -691237342, now seen corresponding path program 1 times [2019-11-23 20:53:00,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:53:00,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125707575] [2019-11-23 20:53:00,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:53:00,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:00,410 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:53:00,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125707575] [2019-11-23 20:53:00,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:53:00,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:53:00,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575150203] [2019-11-23 20:53:00,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:53:00,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:53:00,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:53:00,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:53:00,413 INFO L87 Difference]: Start difference. First operand 528 states and 720 transitions. Second operand 3 states. [2019-11-23 20:53:01,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:53:01,044 INFO L93 Difference]: Finished difference Result 1185 states and 1617 transitions. [2019-11-23 20:53:01,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:53:01,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-11-23 20:53:01,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:53:01,049 INFO L225 Difference]: With dead ends: 1185 [2019-11-23 20:53:01,049 INFO L226 Difference]: Without dead ends: 659 [2019-11-23 20:53:01,050 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:53:01,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-11-23 20:53:01,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 528. [2019-11-23 20:53:01,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-11-23 20:53:01,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 714 transitions. [2019-11-23 20:53:01,063 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 714 transitions. Word has length 130 [2019-11-23 20:53:01,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:53:01,064 INFO L462 AbstractCegarLoop]: Abstraction has 528 states and 714 transitions. [2019-11-23 20:53:01,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:53:01,064 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 714 transitions. [2019-11-23 20:53:01,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-23 20:53:01,066 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:53:01,066 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:53:01,067 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:53:01,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:53:01,067 INFO L82 PathProgramCache]: Analyzing trace with hash -183469584, now seen corresponding path program 1 times [2019-11-23 20:53:01,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:53:01,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81131335] [2019-11-23 20:53:01,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:53:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:01,143 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-23 20:53:01,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81131335] [2019-11-23 20:53:01,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:53:01,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:53:01,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000038760] [2019-11-23 20:53:01,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:53:01,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:53:01,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:53:01,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:53:01,147 INFO L87 Difference]: Start difference. First operand 528 states and 714 transitions. Second operand 4 states. [2019-11-23 20:53:02,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:53:02,022 INFO L93 Difference]: Finished difference Result 1971 states and 2669 transitions. [2019-11-23 20:53:02,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:53:02,023 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-11-23 20:53:02,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:53:02,030 INFO L225 Difference]: With dead ends: 1971 [2019-11-23 20:53:02,031 INFO L226 Difference]: Without dead ends: 1445 [2019-11-23 20:53:02,032 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:53:02,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-11-23 20:53:02,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1314. [2019-11-23 20:53:02,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2019-11-23 20:53:02,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1706 transitions. [2019-11-23 20:53:02,071 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1706 transitions. Word has length 139 [2019-11-23 20:53:02,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:53:02,072 INFO L462 AbstractCegarLoop]: Abstraction has 1314 states and 1706 transitions. [2019-11-23 20:53:02,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:53:02,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1706 transitions. [2019-11-23 20:53:02,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-23 20:53:02,075 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:53:02,075 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 20:53:02,076 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:53:02,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:53:02,076 INFO L82 PathProgramCache]: Analyzing trace with hash 7667169, now seen corresponding path program 1 times [2019-11-23 20:53:02,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:53:02,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463042718] [2019-11-23 20:53:02,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:53:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:02,224 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-23 20:53:02,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463042718] [2019-11-23 20:53:02,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:53:02,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:53:02,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473075484] [2019-11-23 20:53:02,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:53:02,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:53:02,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:53:02,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:53:02,228 INFO L87 Difference]: Start difference. First operand 1314 states and 1706 transitions. Second operand 4 states. [2019-11-23 20:53:02,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:53:02,945 INFO L93 Difference]: Finished difference Result 2762 states and 3564 transitions. [2019-11-23 20:53:02,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:53:02,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-11-23 20:53:02,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:53:02,952 INFO L225 Difference]: With dead ends: 2762 [2019-11-23 20:53:02,954 INFO L226 Difference]: Without dead ends: 1450 [2019-11-23 20:53:02,956 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:53:02,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2019-11-23 20:53:02,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1445. [2019-11-23 20:53:02,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-23 20:53:02,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1843 transitions. [2019-11-23 20:53:02,998 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1843 transitions. Word has length 145 [2019-11-23 20:53:02,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:53:02,999 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1843 transitions. [2019-11-23 20:53:02,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:53:02,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1843 transitions. [2019-11-23 20:53:03,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-23 20:53:03,003 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:53:03,003 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:53:03,004 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:53:03,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:53:03,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1656987991, now seen corresponding path program 1 times [2019-11-23 20:53:03,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:53:03,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738337675] [2019-11-23 20:53:03,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:53:03,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:03,103 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-23 20:53:03,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738337675] [2019-11-23 20:53:03,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:53:03,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:53:03,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359053551] [2019-11-23 20:53:03,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 20:53:03,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:53:03,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 20:53:03,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:53:03,107 INFO L87 Difference]: Start difference. First operand 1445 states and 1843 transitions. Second operand 5 states. [2019-11-23 20:53:04,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:53:04,097 INFO L93 Difference]: Finished difference Result 2888 states and 3696 transitions. [2019-11-23 20:53:04,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:53:04,098 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 149 [2019-11-23 20:53:04,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:53:04,106 INFO L225 Difference]: With dead ends: 2888 [2019-11-23 20:53:04,106 INFO L226 Difference]: Without dead ends: 1576 [2019-11-23 20:53:04,108 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:53:04,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2019-11-23 20:53:04,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1576. [2019-11-23 20:53:04,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-23 20:53:04,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1968 transitions. [2019-11-23 20:53:04,140 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1968 transitions. Word has length 149 [2019-11-23 20:53:04,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:53:04,140 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 1968 transitions. [2019-11-23 20:53:04,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 20:53:04,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1968 transitions. [2019-11-23 20:53:04,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-23 20:53:04,144 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:53:04,144 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:53:04,145 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:53:04,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:53:04,145 INFO L82 PathProgramCache]: Analyzing trace with hash 945952174, now seen corresponding path program 1 times [2019-11-23 20:53:04,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:53:04,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323073056] [2019-11-23 20:53:04,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:53:04,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:04,194 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-23 20:53:04,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323073056] [2019-11-23 20:53:04,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:53:04,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:53:04,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402510696] [2019-11-23 20:53:04,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:53:04,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:53:04,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:53:04,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:53:04,197 INFO L87 Difference]: Start difference. First operand 1576 states and 1968 transitions. Second operand 3 states. [2019-11-23 20:53:04,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:53:04,683 INFO L93 Difference]: Finished difference Result 3674 states and 4634 transitions. [2019-11-23 20:53:04,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:53:04,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-11-23 20:53:04,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:53:04,692 INFO L225 Difference]: With dead ends: 3674 [2019-11-23 20:53:04,692 INFO L226 Difference]: Without dead ends: 1969 [2019-11-23 20:53:04,695 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:53:04,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-23 20:53:04,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1707. [2019-11-23 20:53:04,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-23 20:53:04,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1924 transitions. [2019-11-23 20:53:04,741 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1924 transitions. Word has length 152 [2019-11-23 20:53:04,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:53:04,741 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 1924 transitions. [2019-11-23 20:53:04,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:53:04,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1924 transitions. [2019-11-23 20:53:04,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-23 20:53:04,746 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:53:04,746 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:53:04,746 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:53:04,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:53:04,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1818027434, now seen corresponding path program 1 times [2019-11-23 20:53:04,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:53:04,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072403304] [2019-11-23 20:53:04,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:53:04,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:04,880 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:53:04,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072403304] [2019-11-23 20:53:04,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:53:04,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:53:04,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022575476] [2019-11-23 20:53:04,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 20:53:04,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:53:04,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 20:53:04,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:53:04,883 INFO L87 Difference]: Start difference. First operand 1707 states and 1924 transitions. Second operand 5 states. [2019-11-23 20:53:05,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:53:05,940 INFO L93 Difference]: Finished difference Result 4591 states and 5242 transitions. [2019-11-23 20:53:05,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:53:05,941 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 167 [2019-11-23 20:53:05,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:53:05,954 INFO L225 Difference]: With dead ends: 4591 [2019-11-23 20:53:05,954 INFO L226 Difference]: Without dead ends: 3017 [2019-11-23 20:53:05,957 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:53:05,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3017 states. [2019-11-23 20:53:06,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3017 to 2493. [2019-11-23 20:53:06,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2493 states. [2019-11-23 20:53:06,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2493 states to 2493 states and 2761 transitions. [2019-11-23 20:53:06,007 INFO L78 Accepts]: Start accepts. Automaton has 2493 states and 2761 transitions. Word has length 167 [2019-11-23 20:53:06,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:53:06,007 INFO L462 AbstractCegarLoop]: Abstraction has 2493 states and 2761 transitions. [2019-11-23 20:53:06,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 20:53:06,008 INFO L276 IsEmpty]: Start isEmpty. Operand 2493 states and 2761 transitions. [2019-11-23 20:53:06,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-11-23 20:53:06,014 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:53:06,014 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, 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] [2019-11-23 20:53:06,014 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:53:06,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:53:06,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1902421532, now seen corresponding path program 1 times [2019-11-23 20:53:06,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:53:06,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135886623] [2019-11-23 20:53:06,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:53:06,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:06,353 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 5 proven. 109 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-23 20:53:06,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135886623] [2019-11-23 20:53:06,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955476206] [2019-11-23 20:53:06,354 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:53:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:06,457 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 20:53:06,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:53:06,584 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-11-23 20:53:06,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:53:06,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-11-23 20:53:06,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763397010] [2019-11-23 20:53:06,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:53:06,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:53:06,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:53:06,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-23 20:53:06,588 INFO L87 Difference]: Start difference. First operand 2493 states and 2761 transitions. Second operand 3 states. [2019-11-23 20:53:07,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:53:07,007 INFO L93 Difference]: Finished difference Result 5246 states and 5799 transitions. [2019-11-23 20:53:07,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:53:07,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 221 [2019-11-23 20:53:07,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:53:07,020 INFO L225 Difference]: With dead ends: 5246 [2019-11-23 20:53:07,021 INFO L226 Difference]: Without dead ends: 2755 [2019-11-23 20:53:07,024 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 221 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-23 20:53:07,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2019-11-23 20:53:07,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 2231. [2019-11-23 20:53:07,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2231 states. [2019-11-23 20:53:07,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 2446 transitions. [2019-11-23 20:53:07,088 INFO L78 Accepts]: Start accepts. Automaton has 2231 states and 2446 transitions. Word has length 221 [2019-11-23 20:53:07,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:53:07,089 INFO L462 AbstractCegarLoop]: Abstraction has 2231 states and 2446 transitions. [2019-11-23 20:53:07,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:53:07,090 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 2446 transitions. [2019-11-23 20:53:07,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-11-23 20:53:07,096 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:53:07,097 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:07,300 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:53:07,300 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:53:07,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:53:07,301 INFO L82 PathProgramCache]: Analyzing trace with hash -770011340, now seen corresponding path program 1 times [2019-11-23 20:53:07,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:53:07,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611062733] [2019-11-23 20:53:07,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:53:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:07,551 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 173 proven. 27 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-11-23 20:53:07,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611062733] [2019-11-23 20:53:07,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813054341] [2019-11-23 20:53:07,553 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:53:07,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:07,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 20:53:07,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:53:07,860 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-11-23 20:53:07,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:53:07,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-23 20:53:07,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754448462] [2019-11-23 20:53:07,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:53:07,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:53:07,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:53:07,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:53:07,864 INFO L87 Difference]: Start difference. First operand 2231 states and 2446 transitions. Second operand 3 states. [2019-11-23 20:53:08,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:53:08,315 INFO L93 Difference]: Finished difference Result 5113 states and 5613 transitions. [2019-11-23 20:53:08,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:53:08,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2019-11-23 20:53:08,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:53:08,318 INFO L225 Difference]: With dead ends: 5113 [2019-11-23 20:53:08,318 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 20:53:08,323 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 260 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:53:08,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 20:53:08,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 20:53:08,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 20:53:08,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 20:53:08,324 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 260 [2019-11-23 20:53:08,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:53:08,324 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 20:53:08,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:53:08,324 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 20:53:08,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 20:53:08,525 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:53:08,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 20:53:08,880 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 32 [2019-11-23 20:53:09,020 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 32 [2019-11-23 20:53:09,024 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-23 20:53:09,024 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-23 20:53:09,024 INFO L444 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,024 INFO L444 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,024 INFO L444 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,024 INFO L444 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,024 INFO L444 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,025 INFO L444 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,025 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-23 20:53:09,025 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-23 20:53:09,025 INFO L444 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-23 20:53:09,025 INFO L444 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-23 20:53:09,025 INFO L444 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-23 20:53:09,025 INFO L444 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-23 20:53:09,025 INFO L444 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-23 20:53:09,026 INFO L444 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-23 20:53:09,026 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-23 20:53:09,026 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-23 20:53:09,027 INFO L444 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,027 INFO L444 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,027 INFO L444 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,027 INFO L444 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,027 INFO L444 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,027 INFO L444 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,028 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-23 20:53:09,028 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-23 20:53:09,029 INFO L444 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-23 20:53:09,029 INFO L444 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-23 20:53:09,029 INFO L444 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-23 20:53:09,029 INFO L444 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-23 20:53:09,030 INFO L444 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-23 20:53:09,030 INFO L444 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-23 20:53:09,030 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-23 20:53:09,030 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-23 20:53:09,030 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-23 20:53:09,030 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-23 20:53:09,030 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-23 20:53:09,030 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-23 20:53:09,031 INFO L444 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-23 20:53:09,031 INFO L444 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,031 INFO L444 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,031 INFO L444 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,031 INFO L444 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,031 INFO L444 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,031 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-23 20:53:09,032 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-23 20:53:09,032 INFO L444 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-23 20:53:09,032 INFO L444 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-23 20:53:09,032 INFO L444 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-23 20:53:09,032 INFO L444 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-23 20:53:09,033 INFO L444 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-23 20:53:09,033 INFO L444 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-23 20:53:09,033 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-23 20:53:09,035 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse4 (<= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse0 (= 1 ~a7~0)) (.cse2 (= ~a17~0 1)) (.cse1 (= ~a20~0 1)) (.cse5 (= ~a16~0 5))) (or (and .cse0 (<= ~a17~0 0) .cse1) (and .cse0 (not (= ~a16~0 6)) .cse2 .cse3) (and .cse2 .cse3 .cse1) (and .cse4 .cse5) (= 15 ~a8~0) (and .cse4 .cse2 .cse3) (and .cse0 .cse2 .cse1 .cse5) (<= ~a16~0 4))) [2019-11-23 20:53:09,035 INFO L444 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,035 INFO L444 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,035 INFO L444 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,035 INFO L444 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,036 INFO L444 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,036 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-23 20:53:09,036 INFO L444 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-23 20:53:09,036 INFO L444 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-23 20:53:09,036 INFO L444 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-23 20:53:09,036 INFO L444 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-23 20:53:09,036 INFO L444 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-23 20:53:09,036 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-23 20:53:09,037 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-23 20:53:09,037 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-23 20:53:09,037 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-23 20:53:09,037 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-23 20:53:09,037 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-23 20:53:09,037 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-23 20:53:09,038 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-23 20:53:09,038 INFO L444 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,038 INFO L444 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,038 INFO L444 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,038 INFO L444 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,038 INFO L444 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,038 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-23 20:53:09,038 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-23 20:53:09,038 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-23 20:53:09,039 INFO L444 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-23 20:53:09,039 INFO L444 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-23 20:53:09,039 INFO L444 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-23 20:53:09,039 INFO L444 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-23 20:53:09,039 INFO L444 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-23 20:53:09,039 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-23 20:53:09,039 INFO L444 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,039 INFO L444 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,039 INFO L444 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,040 INFO L444 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,040 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-23 20:53:09,040 INFO L444 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,040 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-23 20:53:09,041 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-23 20:53:09,041 INFO L444 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-23 20:53:09,041 INFO L444 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-23 20:53:09,041 INFO L444 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-23 20:53:09,041 INFO L444 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-23 20:53:09,041 INFO L444 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-23 20:53:09,041 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 20:53:09,041 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-23 20:53:09,041 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-23 20:53:09,042 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-23 20:53:09,042 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-23 20:53:09,042 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-23 20:53:09,042 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-23 20:53:09,042 INFO L444 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,043 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse4 (<= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse0 (= 1 ~a7~0)) (.cse2 (= ~a17~0 1)) (.cse1 (= ~a20~0 1)) (.cse5 (= ~a16~0 5))) (or (and .cse0 (<= ~a17~0 0) .cse1) (and .cse0 (not (= ~a16~0 6)) .cse2 .cse3) (and .cse2 .cse3 .cse1) (and .cse4 .cse5) (= 15 ~a8~0) (and .cse4 .cse2 .cse3) (and .cse0 .cse2 .cse1 .cse5) (<= ~a16~0 4))) [2019-11-23 20:53:09,043 INFO L444 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,043 INFO L444 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,043 INFO L444 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,043 INFO L444 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,043 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-23 20:53:09,043 INFO L444 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-23 20:53:09,043 INFO L444 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-23 20:53:09,044 INFO L444 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-23 20:53:09,044 INFO L444 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-23 20:53:09,044 INFO L444 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-23 20:53:09,044 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-23 20:53:09,044 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-23 20:53:09,044 INFO L444 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,044 INFO L444 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,044 INFO L444 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,044 INFO L444 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,045 INFO L444 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,045 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-23 20:53:09,045 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 20:53:09,045 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-23 20:53:09,045 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-23 20:53:09,045 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-23 20:53:09,045 INFO L444 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-23 20:53:09,045 INFO L444 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-23 20:53:09,045 INFO L444 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-23 20:53:09,045 INFO L444 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-23 20:53:09,046 INFO L444 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-23 20:53:09,046 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-23 20:53:09,046 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-23 20:53:09,046 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-23 20:53:09,046 INFO L444 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,046 INFO L444 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,046 INFO L444 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,046 INFO L444 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,046 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-23 20:53:09,047 INFO L444 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,047 INFO L444 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,047 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-23 20:53:09,047 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-23 20:53:09,047 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 20:53:09,047 INFO L444 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-23 20:53:09,047 INFO L444 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-23 20:53:09,047 INFO L444 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-23 20:53:09,047 INFO L444 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-23 20:53:09,047 INFO L444 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-23 20:53:09,048 INFO L444 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-23 20:53:09,048 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-23 20:53:09,048 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-23 20:53:09,048 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-23 20:53:09,048 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-23 20:53:09,048 INFO L444 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,048 INFO L444 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,048 INFO L444 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,048 INFO L444 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,048 INFO L444 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,049 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-23 20:53:09,049 INFO L444 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,049 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-23 20:53:09,049 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-23 20:53:09,049 INFO L444 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-23 20:53:09,049 INFO L444 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-23 20:53:09,049 INFO L444 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-23 20:53:09,050 INFO L444 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-23 20:53:09,050 INFO L444 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-23 20:53:09,050 INFO L444 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-23 20:53:09,050 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-23 20:53:09,050 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-23 20:53:09,050 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-23 20:53:09,050 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 20:53:09,050 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 527) no Hoare annotation was computed. [2019-11-23 20:53:09,050 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-23 20:53:09,051 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-23 20:53:09,051 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-23 20:53:09,051 INFO L444 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,051 INFO L444 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,051 INFO L444 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,051 INFO L444 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,051 INFO L444 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,051 INFO L444 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:09,051 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-23 20:53:09,051 INFO L444 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-23 20:53:09,051 INFO L444 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-23 20:53:09,052 INFO L444 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-23 20:53:09,052 INFO L444 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-23 20:53:09,052 INFO L444 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-23 20:53:09,052 INFO L444 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-23 20:53:09,052 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-23 20:53:09,052 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-23 20:53:09,052 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-23 20:53:09,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:53:09 BoogieIcfgContainer [2019-11-23 20:53:09,086 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 20:53:09,088 INFO L168 Benchmark]: Toolchain (without parser) took 13858.67 ms. Allocated memory was 139.5 MB in the beginning and 440.4 MB in the end (delta: 300.9 MB). Free memory was 102.1 MB in the beginning and 295.0 MB in the end (delta: -192.9 MB). Peak memory consumption was 108.0 MB. Max. memory is 7.1 GB. [2019-11-23 20:53:09,089 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-11-23 20:53:09,090 INFO L168 Benchmark]: CACSL2BoogieTranslator took 938.93 ms. Allocated memory was 139.5 MB in the beginning and 207.6 MB in the end (delta: 68.2 MB). Free memory was 101.9 MB in the beginning and 171.5 MB in the end (delta: -69.6 MB). Peak memory consumption was 34.7 MB. Max. memory is 7.1 GB. [2019-11-23 20:53:09,091 INFO L168 Benchmark]: Boogie Procedure Inliner took 146.42 ms. Allocated memory is still 207.6 MB. Free memory was 171.5 MB in the beginning and 166.0 MB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 7.1 GB. [2019-11-23 20:53:09,091 INFO L168 Benchmark]: Boogie Preprocessor took 113.67 ms. Allocated memory is still 207.6 MB. Free memory was 166.0 MB in the beginning and 161.1 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. [2019-11-23 20:53:09,092 INFO L168 Benchmark]: RCFGBuilder took 1317.90 ms. Allocated memory was 207.6 MB in the beginning and 235.9 MB in the end (delta: 28.3 MB). Free memory was 161.1 MB in the beginning and 166.9 MB in the end (delta: -5.8 MB). Peak memory consumption was 75.0 MB. Max. memory is 7.1 GB. [2019-11-23 20:53:09,093 INFO L168 Benchmark]: TraceAbstraction took 11333.49 ms. Allocated memory was 235.9 MB in the beginning and 440.4 MB in the end (delta: 204.5 MB). Free memory was 166.9 MB in the beginning and 295.0 MB in the end (delta: -128.1 MB). Peak memory consumption was 76.4 MB. Max. memory is 7.1 GB. [2019-11-23 20:53:09,097 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.23 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 938.93 ms. Allocated memory was 139.5 MB in the beginning and 207.6 MB in the end (delta: 68.2 MB). Free memory was 101.9 MB in the beginning and 171.5 MB in the end (delta: -69.6 MB). Peak memory consumption was 34.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 146.42 ms. Allocated memory is still 207.6 MB. Free memory was 171.5 MB in the beginning and 166.0 MB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 113.67 ms. Allocated memory is still 207.6 MB. Free memory was 166.0 MB in the beginning and 161.1 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1317.90 ms. Allocated memory was 207.6 MB in the beginning and 235.9 MB in the end (delta: 28.3 MB). Free memory was 161.1 MB in the beginning and 166.9 MB in the end (delta: -5.8 MB). Peak memory consumption was 75.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11333.49 ms. Allocated memory was 235.9 MB in the beginning and 440.4 MB in the end (delta: 204.5 MB). Free memory was 166.9 MB in the beginning and 295.0 MB in the end (delta: -128.1 MB). Peak memory consumption was 76.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 527]: 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: ((((((((1 == a7 && a17 <= 0) && a20 == 1) || (((1 == a7 && !(a16 == 6)) && a17 == 1) && a21 == 1)) || ((a17 == 1 && a21 == 1) && a20 == 1)) || (14 <= a8 && a16 == 5)) || 15 == a8) || ((14 <= a8 && a17 == 1) && a21 == 1)) || (((1 == a7 && a17 == 1) && a20 == 1) && a16 == 5)) || a16 <= 4 - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((1 == a7 && a17 <= 0) && a20 == 1) || (((1 == a7 && !(a16 == 6)) && a17 == 1) && a21 == 1)) || ((a17 == 1 && a21 == 1) && a20 == 1)) || (14 <= a8 && a16 == 5)) || 15 == a8) || ((14 <= a8 && a17 == 1) && a21 == 1)) || (((1 == a7 && a17 == 1) && a20 == 1) && a16 == 5)) || a16 <= 4 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 11.2s, OverallIterations: 10, TraceHistogramMax: 5, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 711 SDtfs, 1931 SDslu, 96 SDs, 0 SdLazy, 4815 SolverSat, 749 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 523 GetRequests, 490 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2493occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 1577 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 53 NumberOfFragments, 143 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2528 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 308 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 2083 NumberOfCodeBlocks, 2083 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2071 ConstructedInterpolants, 0 QuantifiedInterpolants, 862658 SizeOfPredicates, 2 NumberOfNonLiveVariables, 799 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 962/1098 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...