./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product44.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec1_product44.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b18fc9f0044b48e81511337a91deb94a0dfeec26 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 00:20:17,515 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:20:17,518 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:20:17,537 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:20:17,537 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:20:17,539 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:20:17,541 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:20:17,546 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:20:17,548 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:20:17,549 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:20:17,554 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:20:17,556 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:20:17,556 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:20:17,557 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:20:17,558 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:20:17,559 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:20:17,560 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:20:17,561 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:20:17,563 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:20:17,565 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:20:17,566 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:20:17,567 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:20:17,568 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:20:17,571 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:20:17,576 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:20:17,578 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:20:17,578 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:20:17,579 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:20:17,579 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:20:17,581 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:20:17,581 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:20:17,582 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:20:17,584 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:20:17,585 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:20:17,587 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:20:17,587 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:20:17,590 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:20:17,590 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:20:17,591 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:20:17,592 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:20:17,598 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:20:17,599 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:20:17,626 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:20:17,626 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:20:17,628 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:20:17,628 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:20:17,629 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:20:17,629 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:20:17,629 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:20:17,629 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:20:17,630 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:20:17,630 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:20:17,631 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:20:17,631 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:20:17,631 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:20:17,632 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:20:17,632 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:20:17,632 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:20:17,633 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:20:17,633 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:20:17,633 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:20:17,633 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:20:17,634 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:20:17,634 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:20:17,634 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:20:17,634 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:20:17,635 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:20:17,635 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:20:17,635 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:20:17,635 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:20:17,635 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b18fc9f0044b48e81511337a91deb94a0dfeec26 [2019-11-28 00:20:17,947 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:20:17,967 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:20:17,971 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:20:17,973 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:20:17,973 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:20:17,975 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product44.cil.c [2019-11-28 00:20:18,049 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b2b8f801/d29452c9ca1f4b41a5193ce43f3c0388/FLAGe15a1e2bf [2019-11-28 00:20:18,559 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:20:18,560 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product44.cil.c [2019-11-28 00:20:18,580 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b2b8f801/d29452c9ca1f4b41a5193ce43f3c0388/FLAGe15a1e2bf [2019-11-28 00:20:18,908 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b2b8f801/d29452c9ca1f4b41a5193ce43f3c0388 [2019-11-28 00:20:18,912 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:20:18,914 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:20:18,915 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:20:18,916 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:20:18,919 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:20:18,920 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:20:18" (1/1) ... [2019-11-28 00:20:18,924 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e2f9c1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:18, skipping insertion in model container [2019-11-28 00:20:18,924 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:20:18" (1/1) ... [2019-11-28 00:20:18,933 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:20:18,996 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:20:19,400 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:20:19,413 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:20:19,505 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:20:19,540 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:20:19,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:19 WrapperNode [2019-11-28 00:20:19,540 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:20:19,541 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:20:19,541 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:20:19,542 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:20:19,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:19" (1/1) ... [2019-11-28 00:20:19,586 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:19" (1/1) ... [2019-11-28 00:20:19,657 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:20:19,658 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:20:19,660 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:20:19,660 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:20:19,675 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:19" (1/1) ... [2019-11-28 00:20:19,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:19" (1/1) ... [2019-11-28 00:20:19,693 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:19" (1/1) ... [2019-11-28 00:20:19,697 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:19" (1/1) ... [2019-11-28 00:20:19,719 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:19" (1/1) ... [2019-11-28 00:20:19,734 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:19" (1/1) ... [2019-11-28 00:20:19,740 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:19" (1/1) ... [2019-11-28 00:20:19,748 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:20:19,750 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:20:19,750 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:20:19,751 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:20:19,753 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:19" (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-28 00:20:19,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 00:20:19,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 00:20:19,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:20:19,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:20:20,729 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:20:20,730 INFO L297 CfgBuilder]: Removed 120 assume(true) statements. [2019-11-28 00:20:20,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:20:20 BoogieIcfgContainer [2019-11-28 00:20:20,732 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:20:20,733 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:20:20,733 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:20:20,737 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:20:20,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:20:18" (1/3) ... [2019-11-28 00:20:20,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46cae1e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:20:20, skipping insertion in model container [2019-11-28 00:20:20,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:19" (2/3) ... [2019-11-28 00:20:20,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46cae1e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:20:20, skipping insertion in model container [2019-11-28 00:20:20,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:20:20" (3/3) ... [2019-11-28 00:20:20,741 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product44.cil.c [2019-11-28 00:20:20,753 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:20:20,761 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 00:20:20,775 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 00:20:20,803 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:20:20,804 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:20:20,804 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:20:20,804 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:20:20,804 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:20:20,805 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:20:20,805 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:20:20,805 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:20:20,824 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2019-11-28 00:20:20,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 00:20:20,831 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:20,832 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:20:20,832 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:20,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:20,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1782116946, now seen corresponding path program 1 times [2019-11-28 00:20:20,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:20,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206863938] [2019-11-28 00:20:20,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:21,130 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-28 00:20:21,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206863938] [2019-11-28 00:20:21,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:21,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:20:21,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088475815] [2019-11-28 00:20:21,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 00:20:21,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:21,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 00:20:21,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 00:20:21,156 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 2 states. [2019-11-28 00:20:21,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:21,189 INFO L93 Difference]: Finished difference Result 172 states and 257 transitions. [2019-11-28 00:20:21,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 00:20:21,191 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-28 00:20:21,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:21,204 INFO L225 Difference]: With dead ends: 172 [2019-11-28 00:20:21,204 INFO L226 Difference]: Without dead ends: 85 [2019-11-28 00:20:21,208 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 00:20:21,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-28 00:20:21,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-11-28 00:20:21,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-28 00:20:21,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 120 transitions. [2019-11-28 00:20:21,256 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 120 transitions. Word has length 16 [2019-11-28 00:20:21,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:21,256 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 120 transitions. [2019-11-28 00:20:21,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 00:20:21,257 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 120 transitions. [2019-11-28 00:20:21,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 00:20:21,258 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:21,258 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:20:21,259 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:21,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:21,259 INFO L82 PathProgramCache]: Analyzing trace with hash 735360049, now seen corresponding path program 1 times [2019-11-28 00:20:21,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:21,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376148582] [2019-11-28 00:20:21,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:21,378 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-28 00:20:21,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376148582] [2019-11-28 00:20:21,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:21,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:20:21,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964475950] [2019-11-28 00:20:21,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:20:21,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:21,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:20:21,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:20:21,390 INFO L87 Difference]: Start difference. First operand 85 states and 120 transitions. Second operand 3 states. [2019-11-28 00:20:21,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:21,427 INFO L93 Difference]: Finished difference Result 85 states and 120 transitions. [2019-11-28 00:20:21,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:20:21,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 00:20:21,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:21,433 INFO L225 Difference]: With dead ends: 85 [2019-11-28 00:20:21,434 INFO L226 Difference]: Without dead ends: 39 [2019-11-28 00:20:21,435 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-28 00:20:21,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-28 00:20:21,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-11-28 00:20:21,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 00:20:21,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2019-11-28 00:20:21,447 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 17 [2019-11-28 00:20:21,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:21,454 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2019-11-28 00:20:21,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:20:21,455 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2019-11-28 00:20:21,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 00:20:21,456 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:21,457 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] [2019-11-28 00:20:21,459 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:21,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:21,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1297648259, now seen corresponding path program 1 times [2019-11-28 00:20:21,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:21,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489705079] [2019-11-28 00:20:21,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:21,656 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-28 00:20:21,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489705079] [2019-11-28 00:20:21,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:21,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:20:21,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273853984] [2019-11-28 00:20:21,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:20:21,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:21,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:20:21,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:20:21,659 INFO L87 Difference]: Start difference. First operand 39 states and 55 transitions. Second operand 5 states. [2019-11-28 00:20:21,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:21,814 INFO L93 Difference]: Finished difference Result 95 states and 138 transitions. [2019-11-28 00:20:21,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:20:21,815 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-28 00:20:21,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:21,820 INFO L225 Difference]: With dead ends: 95 [2019-11-28 00:20:21,820 INFO L226 Difference]: Without dead ends: 62 [2019-11-28 00:20:21,821 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:20:21,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-28 00:20:21,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2019-11-28 00:20:21,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-28 00:20:21,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 84 transitions. [2019-11-28 00:20:21,838 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 84 transitions. Word has length 22 [2019-11-28 00:20:21,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:21,838 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 84 transitions. [2019-11-28 00:20:21,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:20:21,838 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 84 transitions. [2019-11-28 00:20:21,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 00:20:21,839 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:21,840 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] [2019-11-28 00:20:21,840 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:21,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:21,840 INFO L82 PathProgramCache]: Analyzing trace with hash -372126526, now seen corresponding path program 1 times [2019-11-28 00:20:21,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:21,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783468179] [2019-11-28 00:20:21,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:21,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:21,940 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-28 00:20:21,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783468179] [2019-11-28 00:20:21,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:21,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:20:21,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872174543] [2019-11-28 00:20:21,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:20:21,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:21,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:20:21,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:20:21,944 INFO L87 Difference]: Start difference. First operand 58 states and 84 transitions. Second operand 3 states. [2019-11-28 00:20:22,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:22,006 INFO L93 Difference]: Finished difference Result 131 states and 192 transitions. [2019-11-28 00:20:22,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:20:22,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 00:20:22,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:22,008 INFO L225 Difference]: With dead ends: 131 [2019-11-28 00:20:22,009 INFO L226 Difference]: Without dead ends: 79 [2019-11-28 00:20:22,010 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-28 00:20:22,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-28 00:20:22,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2019-11-28 00:20:22,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-28 00:20:22,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 109 transitions. [2019-11-28 00:20:22,022 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 109 transitions. Word has length 23 [2019-11-28 00:20:22,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:22,023 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 109 transitions. [2019-11-28 00:20:22,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:20:22,023 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 109 transitions. [2019-11-28 00:20:22,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 00:20:22,025 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:22,025 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] [2019-11-28 00:20:22,025 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:22,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:22,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1852423790, now seen corresponding path program 1 times [2019-11-28 00:20:22,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:22,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671071721] [2019-11-28 00:20:22,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:22,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:22,115 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-28 00:20:22,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671071721] [2019-11-28 00:20:22,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:22,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:20:22,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268032203] [2019-11-28 00:20:22,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:20:22,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:22,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:20:22,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:20:22,120 INFO L87 Difference]: Start difference. First operand 77 states and 109 transitions. Second operand 5 states. [2019-11-28 00:20:22,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:22,316 INFO L93 Difference]: Finished difference Result 371 states and 539 transitions. [2019-11-28 00:20:22,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 00:20:22,316 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-28 00:20:22,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:22,320 INFO L225 Difference]: With dead ends: 371 [2019-11-28 00:20:22,320 INFO L226 Difference]: Without dead ends: 300 [2019-11-28 00:20:22,321 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-28 00:20:22,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-28 00:20:22,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 140. [2019-11-28 00:20:22,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-28 00:20:22,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 196 transitions. [2019-11-28 00:20:22,349 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 196 transitions. Word has length 25 [2019-11-28 00:20:22,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:22,350 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 196 transitions. [2019-11-28 00:20:22,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:20:22,351 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 196 transitions. [2019-11-28 00:20:22,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 00:20:22,352 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:22,352 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] [2019-11-28 00:20:22,353 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:22,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:22,353 INFO L82 PathProgramCache]: Analyzing trace with hash -2056230884, now seen corresponding path program 1 times [2019-11-28 00:20:22,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:22,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280336582] [2019-11-28 00:20:22,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:22,495 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-28 00:20:22,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280336582] [2019-11-28 00:20:22,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:22,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:20:22,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585826732] [2019-11-28 00:20:22,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:20:22,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:22,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:20:22,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:20:22,500 INFO L87 Difference]: Start difference. First operand 140 states and 196 transitions. Second operand 5 states. [2019-11-28 00:20:22,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:22,657 INFO L93 Difference]: Finished difference Result 392 states and 553 transitions. [2019-11-28 00:20:22,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:20:22,658 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 00:20:22,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:22,661 INFO L225 Difference]: With dead ends: 392 [2019-11-28 00:20:22,662 INFO L226 Difference]: Without dead ends: 390 [2019-11-28 00:20:22,663 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-28 00:20:22,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-11-28 00:20:22,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 140. [2019-11-28 00:20:22,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-28 00:20:22,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 194 transitions. [2019-11-28 00:20:22,704 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 194 transitions. Word has length 26 [2019-11-28 00:20:22,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:22,705 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 194 transitions. [2019-11-28 00:20:22,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:20:22,705 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 194 transitions. [2019-11-28 00:20:22,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 00:20:22,708 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:22,708 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] [2019-11-28 00:20:22,708 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:22,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:22,709 INFO L82 PathProgramCache]: Analyzing trace with hash 437867349, now seen corresponding path program 1 times [2019-11-28 00:20:22,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:22,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106064537] [2019-11-28 00:20:22,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:22,785 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-28 00:20:22,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106064537] [2019-11-28 00:20:22,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:22,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:20:22,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773300299] [2019-11-28 00:20:22,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:20:22,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:22,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:20:22,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:20:22,789 INFO L87 Difference]: Start difference. First operand 140 states and 194 transitions. Second operand 5 states. [2019-11-28 00:20:22,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:22,896 INFO L93 Difference]: Finished difference Result 426 states and 588 transitions. [2019-11-28 00:20:22,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:20:22,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-11-28 00:20:22,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:22,900 INFO L225 Difference]: With dead ends: 426 [2019-11-28 00:20:22,900 INFO L226 Difference]: Without dead ends: 292 [2019-11-28 00:20:22,905 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:20:22,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-11-28 00:20:22,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 146. [2019-11-28 00:20:22,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-28 00:20:22,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 200 transitions. [2019-11-28 00:20:22,941 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 200 transitions. Word has length 33 [2019-11-28 00:20:22,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:22,943 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 200 transitions. [2019-11-28 00:20:22,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:20:22,944 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 200 transitions. [2019-11-28 00:20:22,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 00:20:22,952 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:22,953 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] [2019-11-28 00:20:22,953 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:22,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:22,954 INFO L82 PathProgramCache]: Analyzing trace with hash -148938665, now seen corresponding path program 1 times [2019-11-28 00:20:22,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:22,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949710601] [2019-11-28 00:20:22,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:22,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:23,028 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-28 00:20:23,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949710601] [2019-11-28 00:20:23,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:23,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:20:23,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161850406] [2019-11-28 00:20:23,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:20:23,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:23,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:20:23,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:20:23,031 INFO L87 Difference]: Start difference. First operand 146 states and 200 transitions. Second operand 4 states. [2019-11-28 00:20:23,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:23,081 INFO L93 Difference]: Finished difference Result 370 states and 506 transitions. [2019-11-28 00:20:23,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:20:23,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-11-28 00:20:23,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:23,083 INFO L225 Difference]: With dead ends: 370 [2019-11-28 00:20:23,083 INFO L226 Difference]: Without dead ends: 230 [2019-11-28 00:20:23,085 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-28 00:20:23,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-28 00:20:23,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 150. [2019-11-28 00:20:23,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-28 00:20:23,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 204 transitions. [2019-11-28 00:20:23,103 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 204 transitions. Word has length 33 [2019-11-28 00:20:23,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:23,104 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 204 transitions. [2019-11-28 00:20:23,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:20:23,104 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 204 transitions. [2019-11-28 00:20:23,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 00:20:23,107 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:23,107 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] [2019-11-28 00:20:23,108 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:23,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:23,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1428802343, now seen corresponding path program 1 times [2019-11-28 00:20:23,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:23,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385208002] [2019-11-28 00:20:23,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:23,170 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-28 00:20:23,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385208002] [2019-11-28 00:20:23,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:23,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:20:23,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166582663] [2019-11-28 00:20:23,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:20:23,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:23,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:20:23,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:20:23,174 INFO L87 Difference]: Start difference. First operand 150 states and 204 transitions. Second operand 3 states. [2019-11-28 00:20:23,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:23,227 INFO L93 Difference]: Finished difference Result 380 states and 516 transitions. [2019-11-28 00:20:23,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:20:23,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-28 00:20:23,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:23,229 INFO L225 Difference]: With dead ends: 380 [2019-11-28 00:20:23,229 INFO L226 Difference]: Without dead ends: 236 [2019-11-28 00:20:23,230 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-28 00:20:23,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-11-28 00:20:23,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2019-11-28 00:20:23,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-11-28 00:20:23,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 312 transitions. [2019-11-28 00:20:23,260 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 312 transitions. Word has length 33 [2019-11-28 00:20:23,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:23,260 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 312 transitions. [2019-11-28 00:20:23,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:20:23,261 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 312 transitions. [2019-11-28 00:20:23,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-28 00:20:23,263 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:23,263 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] [2019-11-28 00:20:23,264 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:23,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:23,264 INFO L82 PathProgramCache]: Analyzing trace with hash -271506405, now seen corresponding path program 1 times [2019-11-28 00:20:23,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:23,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044759751] [2019-11-28 00:20:23,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:23,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:23,360 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-28 00:20:23,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044759751] [2019-11-28 00:20:23,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:23,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 00:20:23,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521604481] [2019-11-28 00:20:23,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:20:23,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:23,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:20:23,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:20:23,365 INFO L87 Difference]: Start difference. First operand 236 states and 312 transitions. Second operand 6 states. [2019-11-28 00:20:23,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:23,752 INFO L93 Difference]: Finished difference Result 726 states and 964 transitions. [2019-11-28 00:20:23,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 00:20:23,753 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-11-28 00:20:23,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:23,757 INFO L225 Difference]: With dead ends: 726 [2019-11-28 00:20:23,757 INFO L226 Difference]: Without dead ends: 496 [2019-11-28 00:20:23,758 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-11-28 00:20:23,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2019-11-28 00:20:23,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 236. [2019-11-28 00:20:23,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-11-28 00:20:23,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 306 transitions. [2019-11-28 00:20:23,812 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 306 transitions. Word has length 34 [2019-11-28 00:20:23,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:23,814 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 306 transitions. [2019-11-28 00:20:23,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:20:23,815 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 306 transitions. [2019-11-28 00:20:23,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-28 00:20:23,817 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:23,817 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 00:20:23,818 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:23,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:23,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1907454321, now seen corresponding path program 1 times [2019-11-28 00:20:23,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:23,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736364983] [2019-11-28 00:20:23,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:23,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:20:23,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:20:24,057 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 00:20:24,057 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 00:20:24,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:20:24 BoogieIcfgContainer [2019-11-28 00:20:24,188 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:20:24,189 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:20:24,189 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:20:24,189 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:20:24,190 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:20:20" (3/4) ... [2019-11-28 00:20:24,192 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 00:20:24,300 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:20:24,300 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:20:24,302 INFO L168 Benchmark]: Toolchain (without parser) took 5388.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 218.1 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -144.7 MB). Peak memory consumption was 73.4 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:24,303 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:20:24,304 INFO L168 Benchmark]: CACSL2BoogieTranslator took 625.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -164.0 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:24,304 INFO L168 Benchmark]: Boogie Procedure Inliner took 116.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:24,304 INFO L168 Benchmark]: Boogie Preprocessor took 91.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:20:24,305 INFO L168 Benchmark]: RCFGBuilder took 981.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 63.9 MB). Peak memory consumption was 63.9 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:24,305 INFO L168 Benchmark]: TraceAbstraction took 3455.43 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 74.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -74.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:20:24,306 INFO L168 Benchmark]: Witness Printer took 111.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:24,308 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.34 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 625.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -164.0 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 116.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 91.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 981.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 63.9 MB). Peak memory consumption was 63.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3455.43 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 74.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -74.5 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 111.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 44]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L218] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L498] int pumpRunning = 0; [L499] int systemActive = 1; [L693] int waterLevel = 1; [L694] int methaneLevelCritical = 0; [L851] int cleanupTimeShifts = 4; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L924] int retValue_acc ; [L925] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L842] int retValue_acc ; [L845] retValue_acc = 1 [L846] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L931] tmp = valid_product() [L933] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L422] int splverifierCounter ; [L423] int tmp ; [L424] int tmp___0 ; [L425] int tmp___1 ; [L426] int tmp___2 ; [L429] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L431] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L433] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L439] tmp = __VERIFIER_nondet_int() [L441] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L711] COND TRUE waterLevel < 2 [L712] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L449] tmp___0 = __VERIFIER_nondet_int() [L451] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L459] tmp___2 = __VERIFIER_nondet_int() [L461] COND TRUE \read(tmp___2) [L687] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L506] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L513] COND TRUE \read(systemActive) [L535] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L538] COND TRUE ! pumpRunning [L650] int retValue_acc ; [L651] int tmp ; [L652] int tmp___0 ; [L773] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L776] COND FALSE !(waterLevel < 2) [L780] retValue_acc = 0 [L781] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L656] tmp = isHighWaterSensorDry() [L658] COND FALSE !(\read(tmp)) [L661] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L663] retValue_acc = tmp___0 [L664] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L540] tmp = isHighWaterLevel() [L542] COND TRUE \read(tmp) [L569] int tmp ; [L594] int retValue_acc ; [L732] int retValue_acc ; [L735] retValue_acc = methaneLevelCritical [L736] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L598] retValue_acc = isMethaneLevelCritical() [L600] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L573] tmp = isMethaneAlarm() [L575] COND FALSE !(\read(tmp)) [L563] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L788] int tmp ; [L789] int tmp___0 ; [L732] int retValue_acc ; [L735] retValue_acc = methaneLevelCritical [L736] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L793] tmp = isMethaneLevelCritical() [L795] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L431] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L433] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L439] tmp = __VERIFIER_nondet_int() [L441] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L449] tmp___0 = __VERIFIER_nondet_int() [L451] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L723] COND FALSE !(\read(methaneLevelCritical)) [L726] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L459] tmp___2 = __VERIFIER_nondet_int() [L461] COND TRUE \read(tmp___2) [L687] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L506] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L699] COND TRUE waterLevel > 0 [L700] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L513] COND TRUE \read(systemActive) [L535] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L538] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L788] int tmp ; [L789] int tmp___0 ; [L732] int retValue_acc ; [L735] retValue_acc = methaneLevelCritical [L736] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L793] tmp = isMethaneLevelCritical() [L795] COND TRUE \read(tmp) [L605] int retValue_acc ; [L608] retValue_acc = pumpRunning [L609] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L797] tmp___0 = isPumpRunning() [L799] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L44] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 89 locations, 3 error locations. Result: UNSAFE, OverallTime: 3.2s, OverallIterations: 11, TraceHistogramMax: 2, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 821 SDtfs, 1204 SDslu, 1337 SDs, 0 SdLazy, 175 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=236occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 902 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 311 NumberOfCodeBlocks, 311 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 252 ConstructedInterpolants, 0 QuantifiedInterpolants, 12350 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 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 incorrect! Received shutdown request...