./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec2_product33_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: 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 /storage/repos/svcomp/c/product-lines/minepump_spec2_product33_false-unreach-call_false-termination.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 7aed16b7a73618bd36d72dc3243e4d7bd764fb49 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-2e94e6a [2018-12-31 09:41:59,560 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 09:41:59,562 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 09:41:59,579 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 09:41:59,580 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 09:41:59,582 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 09:41:59,583 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 09:41:59,586 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 09:41:59,590 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 09:41:59,592 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 09:41:59,595 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 09:41:59,595 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 09:41:59,596 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 09:41:59,599 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 09:41:59,607 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 09:41:59,608 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 09:41:59,608 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 09:41:59,612 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 09:41:59,616 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 09:41:59,618 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 09:41:59,620 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 09:41:59,623 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 09:41:59,628 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 09:41:59,629 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 09:41:59,629 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 09:41:59,630 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 09:41:59,633 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 09:41:59,634 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 09:41:59,634 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 09:41:59,635 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 09:41:59,635 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 09:41:59,638 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 09:41:59,640 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 09:41:59,641 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 09:41:59,641 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 09:41:59,642 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 09:41:59,642 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 09:41:59,671 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 09:41:59,671 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 09:41:59,672 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 09:41:59,672 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 09:41:59,672 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 09:41:59,673 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 09:41:59,673 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 09:41:59,673 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 09:41:59,673 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 09:41:59,673 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 09:41:59,673 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 09:41:59,674 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 09:41:59,674 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 09:41:59,674 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 09:41:59,674 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 09:41:59,674 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 09:41:59,674 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 09:41:59,675 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 09:41:59,675 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 09:41:59,675 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 09:41:59,675 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 09:41:59,675 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:41:59,676 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 09:41:59,676 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 09:41:59,676 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 09:41:59,676 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 09:41:59,676 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 09:41:59,676 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 09:41:59,677 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> 7aed16b7a73618bd36d72dc3243e4d7bd764fb49 [2018-12-31 09:41:59,735 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 09:41:59,748 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 09:41:59,751 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 09:41:59,753 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 09:41:59,753 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 09:41:59,754 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec2_product33_false-unreach-call_false-termination.cil.c [2018-12-31 09:41:59,811 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/240403916/d7558be39e8b4361bd1df2249af1d237/FLAGb8e2a5bed [2018-12-31 09:42:00,347 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 09:42:00,348 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec2_product33_false-unreach-call_false-termination.cil.c [2018-12-31 09:42:00,365 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/240403916/d7558be39e8b4361bd1df2249af1d237/FLAGb8e2a5bed [2018-12-31 09:42:00,652 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/240403916/d7558be39e8b4361bd1df2249af1d237 [2018-12-31 09:42:00,657 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 09:42:00,658 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 09:42:00,660 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 09:42:00,660 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 09:42:00,666 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 09:42:00,668 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:42:00" (1/1) ... [2018-12-31 09:42:00,671 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f4fbf7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:42:00, skipping insertion in model container [2018-12-31 09:42:00,672 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:42:00" (1/1) ... [2018-12-31 09:42:00,680 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 09:42:00,732 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 09:42:01,176 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:42:01,192 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 09:42:01,385 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:42:01,434 INFO L195 MainTranslator]: Completed translation [2018-12-31 09:42:01,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:42:01 WrapperNode [2018-12-31 09:42:01,434 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 09:42:01,435 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 09:42:01,435 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 09:42:01,435 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 09:42:01,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:42:01" (1/1) ... [2018-12-31 09:42:01,466 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:42:01" (1/1) ... [2018-12-31 09:42:01,510 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 09:42:01,510 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 09:42:01,510 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 09:42:01,510 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 09:42:01,522 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:42:01" (1/1) ... [2018-12-31 09:42:01,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:42:01" (1/1) ... [2018-12-31 09:42:01,526 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:42:01" (1/1) ... [2018-12-31 09:42:01,527 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:42:01" (1/1) ... [2018-12-31 09:42:01,537 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:42:01" (1/1) ... [2018-12-31 09:42:01,545 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:42:01" (1/1) ... [2018-12-31 09:42:01,549 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:42:01" (1/1) ... [2018-12-31 09:42:01,553 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 09:42:01,554 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 09:42:01,554 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 09:42:01,554 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 09:42:01,555 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:42:01" (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 [2018-12-31 09:42:01,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 09:42:01,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-31 09:42:01,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 09:42:01,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 09:42:02,929 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 09:42:02,929 INFO L280 CfgBuilder]: Removed 98 assue(true) statements. [2018-12-31 09:42:02,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:42:02 BoogieIcfgContainer [2018-12-31 09:42:02,930 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 09:42:02,931 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 09:42:02,931 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 09:42:02,935 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 09:42:02,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 09:42:00" (1/3) ... [2018-12-31 09:42:02,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d6a378a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:42:02, skipping insertion in model container [2018-12-31 09:42:02,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:42:01" (2/3) ... [2018-12-31 09:42:02,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d6a378a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:42:02, skipping insertion in model container [2018-12-31 09:42:02,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:42:02" (3/3) ... [2018-12-31 09:42:02,941 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product33_false-unreach-call_false-termination.cil.c [2018-12-31 09:42:02,951 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 09:42:02,961 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 09:42:02,979 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 09:42:03,015 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 09:42:03,016 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 09:42:03,016 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 09:42:03,016 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 09:42:03,017 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 09:42:03,017 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 09:42:03,017 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 09:42:03,017 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 09:42:03,017 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 09:42:03,037 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-12-31 09:42:03,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-31 09:42:03,044 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:03,044 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:42:03,046 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:03,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:03,052 INFO L82 PathProgramCache]: Analyzing trace with hash -816697532, now seen corresponding path program 1 times [2018-12-31 09:42:03,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:03,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:03,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:03,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:03,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:03,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:03,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:42:03,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:03,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:42:03,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 09:42:03,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 09:42:03,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 09:42:03,385 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 2 states. [2018-12-31 09:42:03,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:03,416 INFO L93 Difference]: Finished difference Result 157 states and 240 transitions. [2018-12-31 09:42:03,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 09:42:03,417 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-12-31 09:42:03,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:03,431 INFO L225 Difference]: With dead ends: 157 [2018-12-31 09:42:03,431 INFO L226 Difference]: Without dead ends: 78 [2018-12-31 09:42:03,435 INFO L631 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 [2018-12-31 09:42:03,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-31 09:42:03,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-12-31 09:42:03,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-31 09:42:03,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 112 transitions. [2018-12-31 09:42:03,480 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 112 transitions. Word has length 18 [2018-12-31 09:42:03,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:03,481 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 112 transitions. [2018-12-31 09:42:03,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 09:42:03,481 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 112 transitions. [2018-12-31 09:42:03,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-31 09:42:03,482 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:03,482 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:42:03,483 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:03,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:03,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1035533501, now seen corresponding path program 1 times [2018-12-31 09:42:03,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:03,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:03,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:03,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:03,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:03,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:03,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:42:03,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:03,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:42:03,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:42:03,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:42:03,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:42:03,637 INFO L87 Difference]: Start difference. First operand 78 states and 112 transitions. Second operand 3 states. [2018-12-31 09:42:03,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:03,655 INFO L93 Difference]: Finished difference Result 78 states and 112 transitions. [2018-12-31 09:42:03,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:42:03,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-31 09:42:03,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:03,656 INFO L225 Difference]: With dead ends: 78 [2018-12-31 09:42:03,657 INFO L226 Difference]: Without dead ends: 36 [2018-12-31 09:42:03,658 INFO L631 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 [2018-12-31 09:42:03,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-31 09:42:03,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-31 09:42:03,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-31 09:42:03,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2018-12-31 09:42:03,665 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 19 [2018-12-31 09:42:03,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:03,665 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2018-12-31 09:42:03,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:42:03,665 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2018-12-31 09:42:03,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-31 09:42:03,666 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:03,666 INFO L402 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] [2018-12-31 09:42:03,667 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:03,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:03,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1153900874, now seen corresponding path program 1 times [2018-12-31 09:42:03,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:03,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:03,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:03,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:03,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:03,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:03,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:42:03,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:03,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:42:03,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 09:42:03,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 09:42:03,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 09:42:03,997 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand 6 states. [2018-12-31 09:42:04,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:04,276 INFO L93 Difference]: Finished difference Result 65 states and 95 transitions. [2018-12-31 09:42:04,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 09:42:04,278 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-12-31 09:42:04,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:04,281 INFO L225 Difference]: With dead ends: 65 [2018-12-31 09:42:04,281 INFO L226 Difference]: Without dead ends: 36 [2018-12-31 09:42:04,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:42:04,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-31 09:42:04,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-31 09:42:04,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-31 09:42:04,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2018-12-31 09:42:04,295 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 50 transitions. Word has length 24 [2018-12-31 09:42:04,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:04,295 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 50 transitions. [2018-12-31 09:42:04,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 09:42:04,297 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2018-12-31 09:42:04,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-31 09:42:04,298 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:04,298 INFO L402 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] [2018-12-31 09:42:04,300 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:04,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:04,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1264883623, now seen corresponding path program 1 times [2018-12-31 09:42:04,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:04,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:04,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:04,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:04,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:04,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:04,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:42:04,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:04,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:42:04,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:42:04,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:42:04,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:42:04,457 INFO L87 Difference]: Start difference. First operand 36 states and 50 transitions. Second operand 3 states. [2018-12-31 09:42:04,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:04,536 INFO L93 Difference]: Finished difference Result 87 states and 125 transitions. [2018-12-31 09:42:04,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:42:04,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-31 09:42:04,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:04,538 INFO L225 Difference]: With dead ends: 87 [2018-12-31 09:42:04,538 INFO L226 Difference]: Without dead ends: 58 [2018-12-31 09:42:04,538 INFO L631 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 [2018-12-31 09:42:04,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-31 09:42:04,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-12-31 09:42:04,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-31 09:42:04,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 79 transitions. [2018-12-31 09:42:04,547 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 79 transitions. Word has length 25 [2018-12-31 09:42:04,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:04,548 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 79 transitions. [2018-12-31 09:42:04,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:42:04,548 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 79 transitions. [2018-12-31 09:42:04,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 09:42:04,550 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:04,550 INFO L402 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] [2018-12-31 09:42:04,550 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:04,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:04,553 INFO L82 PathProgramCache]: Analyzing trace with hash -703728504, now seen corresponding path program 1 times [2018-12-31 09:42:04,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:04,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:04,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:04,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:04,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:04,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:04,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:42:04,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:04,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:42:04,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:42:04,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:42:04,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:42:04,697 INFO L87 Difference]: Start difference. First operand 56 states and 79 transitions. Second operand 5 states. [2018-12-31 09:42:04,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:04,786 INFO L93 Difference]: Finished difference Result 145 states and 205 transitions. [2018-12-31 09:42:04,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:42:04,790 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-12-31 09:42:04,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:04,791 INFO L225 Difference]: With dead ends: 145 [2018-12-31 09:42:04,792 INFO L226 Difference]: Without dead ends: 96 [2018-12-31 09:42:04,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 09:42:04,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-31 09:42:04,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 59. [2018-12-31 09:42:04,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-31 09:42:04,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2018-12-31 09:42:04,816 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 31 [2018-12-31 09:42:04,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:04,816 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2018-12-31 09:42:04,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:42:04,817 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2018-12-31 09:42:04,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 09:42:04,822 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:04,822 INFO L402 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] [2018-12-31 09:42:04,823 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:04,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:04,825 INFO L82 PathProgramCache]: Analyzing trace with hash 229735205, now seen corresponding path program 1 times [2018-12-31 09:42:04,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:04,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:04,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:04,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:04,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:05,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:42:05,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:05,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:42:05,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:42:05,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:42:05,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:42:05,121 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand 5 states. [2018-12-31 09:42:05,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:05,416 INFO L93 Difference]: Finished difference Result 207 states and 293 transitions. [2018-12-31 09:42:05,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 09:42:05,417 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-12-31 09:42:05,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:05,419 INFO L225 Difference]: With dead ends: 207 [2018-12-31 09:42:05,419 INFO L226 Difference]: Without dead ends: 155 [2018-12-31 09:42:05,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:42:05,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-12-31 09:42:05,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 58. [2018-12-31 09:42:05,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-31 09:42:05,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 79 transitions. [2018-12-31 09:42:05,443 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 79 transitions. Word has length 31 [2018-12-31 09:42:05,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:05,443 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 79 transitions. [2018-12-31 09:42:05,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:42:05,444 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 79 transitions. [2018-12-31 09:42:05,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 09:42:05,448 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:05,448 INFO L402 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] [2018-12-31 09:42:05,448 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:05,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:05,452 INFO L82 PathProgramCache]: Analyzing trace with hash -2663926, now seen corresponding path program 1 times [2018-12-31 09:42:05,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:05,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:05,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:05,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:05,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:05,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:05,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:42:05,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:05,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:42:05,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 09:42:05,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 09:42:05,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 09:42:05,634 INFO L87 Difference]: Start difference. First operand 58 states and 79 transitions. Second operand 4 states. [2018-12-31 09:42:05,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:05,866 INFO L93 Difference]: Finished difference Result 133 states and 183 transitions. [2018-12-31 09:42:05,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 09:42:05,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-12-31 09:42:05,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:05,870 INFO L225 Difference]: With dead ends: 133 [2018-12-31 09:42:05,871 INFO L226 Difference]: Without dead ends: 82 [2018-12-31 09:42:05,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:42:05,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-31 09:42:05,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 60. [2018-12-31 09:42:05,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-31 09:42:05,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 81 transitions. [2018-12-31 09:42:05,897 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 81 transitions. Word has length 31 [2018-12-31 09:42:05,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:05,898 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 81 transitions. [2018-12-31 09:42:05,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 09:42:05,898 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 81 transitions. [2018-12-31 09:42:05,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 09:42:05,899 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:05,899 INFO L402 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] [2018-12-31 09:42:05,905 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:05,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:05,905 INFO L82 PathProgramCache]: Analyzing trace with hash -589469940, now seen corresponding path program 1 times [2018-12-31 09:42:05,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:05,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:05,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:05,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:05,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:05,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:06,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:42:06,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:06,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:42:06,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:42:06,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:42:06,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:42:06,004 INFO L87 Difference]: Start difference. First operand 60 states and 81 transitions. Second operand 3 states. [2018-12-31 09:42:06,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:06,134 INFO L93 Difference]: Finished difference Result 138 states and 188 transitions. [2018-12-31 09:42:06,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:42:06,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-31 09:42:06,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:06,136 INFO L225 Difference]: With dead ends: 138 [2018-12-31 09:42:06,136 INFO L226 Difference]: Without dead ends: 85 [2018-12-31 09:42:06,137 INFO L631 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 [2018-12-31 09:42:06,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-31 09:42:06,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-31 09:42:06,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-31 09:42:06,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 112 transitions. [2018-12-31 09:42:06,163 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 112 transitions. Word has length 31 [2018-12-31 09:42:06,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:06,164 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 112 transitions. [2018-12-31 09:42:06,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:42:06,164 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 112 transitions. [2018-12-31 09:42:06,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-31 09:42:06,165 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:06,165 INFO L402 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] [2018-12-31 09:42:06,168 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:06,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:06,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1606491700, now seen corresponding path program 1 times [2018-12-31 09:42:06,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:06,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:06,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:06,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:06,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:06,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:06,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:42:06,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:06,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:42:06,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:42:06,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:42:06,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:42:06,268 INFO L87 Difference]: Start difference. First operand 85 states and 112 transitions. Second operand 3 states. [2018-12-31 09:42:06,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:06,399 INFO L93 Difference]: Finished difference Result 126 states and 168 transitions. [2018-12-31 09:42:06,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:42:06,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-31 09:42:06,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:06,400 INFO L225 Difference]: With dead ends: 126 [2018-12-31 09:42:06,401 INFO L226 Difference]: Without dead ends: 124 [2018-12-31 09:42:06,401 INFO L631 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 [2018-12-31 09:42:06,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-31 09:42:06,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 114. [2018-12-31 09:42:06,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-31 09:42:06,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 155 transitions. [2018-12-31 09:42:06,435 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 155 transitions. Word has length 32 [2018-12-31 09:42:06,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:06,435 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 155 transitions. [2018-12-31 09:42:06,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:42:06,436 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 155 transitions. [2018-12-31 09:42:06,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-31 09:42:06,438 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:06,438 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-31 09:42:06,438 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:06,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:06,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1682990208, now seen corresponding path program 1 times [2018-12-31 09:42:06,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:06,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:06,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:06,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:06,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:06,845 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-31 09:42:06,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:06,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:42:06,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:42:06,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:42:06,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:42:06,848 INFO L87 Difference]: Start difference. First operand 114 states and 155 transitions. Second operand 5 states. [2018-12-31 09:42:07,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:07,111 INFO L93 Difference]: Finished difference Result 358 states and 492 transitions. [2018-12-31 09:42:07,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 09:42:07,112 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-12-31 09:42:07,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:07,115 INFO L225 Difference]: With dead ends: 358 [2018-12-31 09:42:07,115 INFO L226 Difference]: Without dead ends: 251 [2018-12-31 09:42:07,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-31 09:42:07,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-12-31 09:42:07,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 183. [2018-12-31 09:42:07,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-12-31 09:42:07,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 244 transitions. [2018-12-31 09:42:07,143 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 244 transitions. Word has length 50 [2018-12-31 09:42:07,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:07,143 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 244 transitions. [2018-12-31 09:42:07,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:42:07,143 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 244 transitions. [2018-12-31 09:42:07,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-31 09:42:07,145 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:07,145 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-31 09:42:07,148 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:07,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:07,148 INFO L82 PathProgramCache]: Analyzing trace with hash 967205496, now seen corresponding path program 1 times [2018-12-31 09:42:07,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:07,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:07,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:07,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:07,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:07,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:42:07,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:42:07,776 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 09:42:07,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 09:42:07 BoogieIcfgContainer [2018-12-31 09:42:07,972 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 09:42:07,972 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 09:42:07,972 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 09:42:07,972 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 09:42:07,973 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:42:02" (3/4) ... [2018-12-31 09:42:07,976 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 09:42:08,109 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 09:42:08,110 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 09:42:08,110 INFO L168 Benchmark]: Toolchain (without parser) took 7453.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 216.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -191.2 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. [2018-12-31 09:42:08,112 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:42:08,112 INFO L168 Benchmark]: CACSL2BoogieTranslator took 775.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -186.2 MB). Peak memory consumption was 36.9 MB. Max. memory is 11.5 GB. [2018-12-31 09:42:08,113 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.59 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. [2018-12-31 09:42:08,113 INFO L168 Benchmark]: Boogie Preprocessor took 43.31 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. [2018-12-31 09:42:08,114 INFO L168 Benchmark]: RCFGBuilder took 1376.51 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: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 11.5 GB. [2018-12-31 09:42:08,114 INFO L168 Benchmark]: TraceAbstraction took 5040.68 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -85.9 MB). Peak memory consumption was 266.4 MB. Max. memory is 11.5 GB. [2018-12-31 09:42:08,115 INFO L168 Benchmark]: Witness Printer took 137.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 23.4 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2018-12-31 09:42:08,118 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 775.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -186.2 MB). Peak memory consumption was 36.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.59 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 43.31 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 1376.51 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: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5040.68 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -85.9 MB). Peak memory consumption was 266.4 MB. Max. memory is 11.5 GB. * Witness Printer took 137.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 23.4 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 284]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L85] int waterLevel = 1; [L86] int methaneLevelCritical = 0; [L179] int cleanupTimeShifts = 4; [L292] int pumpRunning = 0; [L293] int systemActive = 1; [L679] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L876] int methAndRunningLastTime ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L257] int retValue_acc ; [L258] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L69] int retValue_acc ; [L72] retValue_acc = 1 [L73] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L264] tmp = valid_product() [L266] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L881] methAndRunningLastTime = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L446] int splverifierCounter ; [L447] int tmp ; [L448] int tmp___0 ; [L449] int tmp___1 ; [L450] int tmp___2 ; [L453] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L455] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L457] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L463] tmp = __VERIFIER_nondet_int() [L465] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L103] COND TRUE waterLevel < 2 [L104] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L473] tmp___0 = __VERIFIER_nondet_int() [L475] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L115] COND FALSE !(\read(methaneLevelCritical)) [L118] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L483] tmp___2 = __VERIFIER_nondet_int() [L485] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L300] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L307] COND TRUE \read(systemActive) [L329] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L332] COND TRUE ! pumpRunning [L426] int retValue_acc ; [L427] int tmp ; [L428] int tmp___0 ; [L165] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L168] COND FALSE !(waterLevel < 2) [L172] retValue_acc = 0 [L173] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L432] tmp = isHighWaterSensorDry() [L434] COND FALSE !(\read(tmp)) [L437] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L439] retValue_acc = tmp___0 [L440] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L334] tmp = isHighWaterLevel() [L336] COND TRUE \read(tmp) [L357] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L886] int tmp ; [L887] int tmp___0 ; [L124] int retValue_acc ; [L127] retValue_acc = methaneLevelCritical [L128] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L891] tmp = isMethaneLevelCritical() [L893] COND TRUE \read(tmp) [L381] int retValue_acc ; [L384] retValue_acc = pumpRunning [L385] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L895] tmp___0 = isPumpRunning() [L897] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L898] COND FALSE !(\read(methAndRunningLastTime)) [L903] methAndRunningLastTime = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L455] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L457] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L463] tmp = __VERIFIER_nondet_int() [L465] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L473] tmp___0 = __VERIFIER_nondet_int() [L475] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L483] tmp___2 = __VERIFIER_nondet_int() [L485] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L300] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L91] COND TRUE waterLevel > 0 [L92] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L307] COND TRUE \read(systemActive) [L329] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L332] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L886] int tmp ; [L887] int tmp___0 ; [L124] int retValue_acc ; [L127] retValue_acc = methaneLevelCritical [L128] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L891] tmp = isMethaneLevelCritical() [L893] COND TRUE \read(tmp) [L381] int retValue_acc ; [L384] retValue_acc = pumpRunning [L385] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L895] tmp___0 = isPumpRunning() [L897] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L898] COND TRUE \read(methAndRunningLastTime) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L284] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 82 locations, 3 error locations. UNSAFE Result, 4.9s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 659 SDtfs, 686 SDslu, 743 SDs, 0 SdLazy, 102 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 236 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 343 NumberOfCodeBlocks, 343 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 282 ConstructedInterpolants, 0 QuantifiedInterpolants, 18228 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 17/17 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...