./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec1_product51_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f 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_spec1_product51_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 0d6f6f11832d8f580d186172cf5d58d3f276ea91 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-0ed9222-m [2019-01-12 14:46:39,661 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:46:39,662 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:46:39,684 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:46:39,684 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:46:39,685 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:46:39,686 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:46:39,688 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:46:39,690 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:46:39,691 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:46:39,692 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:46:39,692 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:46:39,693 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:46:39,694 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:46:39,695 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:46:39,696 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:46:39,697 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:46:39,699 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:46:39,701 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:46:39,702 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:46:39,703 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:46:39,705 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:46:39,707 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:46:39,708 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:46:39,708 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:46:39,709 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:46:39,710 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:46:39,711 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:46:39,712 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:46:39,713 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:46:39,713 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:46:39,714 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:46:39,714 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:46:39,714 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:46:39,716 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:46:39,716 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:46:39,717 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 14:46:39,732 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:46:39,733 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:46:39,734 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:46:39,734 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:46:39,734 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:46:39,734 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:46:39,735 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:46:39,735 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:46:39,735 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:46:39,735 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:46:39,735 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:46:39,735 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:46:39,736 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:46:39,736 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:46:39,736 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:46:39,736 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:46:39,736 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:46:39,737 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:46:39,737 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:46:39,737 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:46:39,737 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:46:39,737 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:46:39,737 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:46:39,738 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:46:39,738 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:46:39,738 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:46:39,738 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:46:39,738 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:46:39,738 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 -> 0d6f6f11832d8f580d186172cf5d58d3f276ea91 [2019-01-12 14:46:39,787 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:46:39,806 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:46:39,810 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:46:39,811 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:46:39,812 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:46:39,813 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec1_product51_false-unreach-call_false-termination.cil.c [2019-01-12 14:46:39,874 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d9de9cdc/7bcad88368694ff8925d9fe6d68003e0/FLAGa4976129c [2019-01-12 14:46:40,380 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:46:40,381 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec1_product51_false-unreach-call_false-termination.cil.c [2019-01-12 14:46:40,394 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d9de9cdc/7bcad88368694ff8925d9fe6d68003e0/FLAGa4976129c [2019-01-12 14:46:40,643 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d9de9cdc/7bcad88368694ff8925d9fe6d68003e0 [2019-01-12 14:46:40,647 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:46:40,649 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:46:40,654 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:46:40,654 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:46:40,659 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:46:40,660 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:46:40" (1/1) ... [2019-01-12 14:46:40,663 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3024374b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:40, skipping insertion in model container [2019-01-12 14:46:40,663 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:46:40" (1/1) ... [2019-01-12 14:46:40,672 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:46:40,717 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:46:41,141 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:46:41,159 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:46:41,344 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:46:41,384 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:46:41,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:41 WrapperNode [2019-01-12 14:46:41,385 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:46:41,385 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:46:41,386 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:46:41,386 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:46:41,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:41" (1/1) ... [2019-01-12 14:46:41,414 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:41" (1/1) ... [2019-01-12 14:46:41,463 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:46:41,463 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:46:41,463 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:46:41,463 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:46:41,472 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:41" (1/1) ... [2019-01-12 14:46:41,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:41" (1/1) ... [2019-01-12 14:46:41,478 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:41" (1/1) ... [2019-01-12 14:46:41,478 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:41" (1/1) ... [2019-01-12 14:46:41,490 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:41" (1/1) ... [2019-01-12 14:46:41,501 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:41" (1/1) ... [2019-01-12 14:46:41,505 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:41" (1/1) ... [2019-01-12 14:46:41,510 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:46:41,510 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:46:41,511 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:46:41,511 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:46:41,512 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:41" (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-01-12 14:46:41,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 14:46:41,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-12 14:46:41,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:46:41,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:46:42,839 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:46:42,840 INFO L286 CfgBuilder]: Removed 160 assue(true) statements. [2019-01-12 14:46:42,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:46:42 BoogieIcfgContainer [2019-01-12 14:46:42,841 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:46:42,842 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:46:42,843 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:46:42,846 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:46:42,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:46:40" (1/3) ... [2019-01-12 14:46:42,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ffae512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:46:42, skipping insertion in model container [2019-01-12 14:46:42,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:41" (2/3) ... [2019-01-12 14:46:42,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ffae512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:46:42, skipping insertion in model container [2019-01-12 14:46:42,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:46:42" (3/3) ... [2019-01-12 14:46:42,851 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product51_false-unreach-call_false-termination.cil.c [2019-01-12 14:46:42,861 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:46:42,871 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 14:46:42,889 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 14:46:42,919 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:46:42,920 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:46:42,920 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:46:42,920 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:46:42,920 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:46:42,921 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:46:42,921 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:46:42,921 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:46:42,921 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:46:42,941 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states. [2019-01-12 14:46:42,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 14:46:42,950 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:42,951 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:46:42,953 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:42,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:42,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1844308238, now seen corresponding path program 1 times [2019-01-12 14:46:42,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:42,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:43,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:43,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:43,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:43,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:46:43,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:43,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:46:43,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 14:46:43,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 14:46:43,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:46:43,222 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 2 states. [2019-01-12 14:46:43,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:43,262 INFO L93 Difference]: Finished difference Result 232 states and 353 transitions. [2019-01-12 14:46:43,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 14:46:43,263 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-01-12 14:46:43,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:43,282 INFO L225 Difference]: With dead ends: 232 [2019-01-12 14:46:43,283 INFO L226 Difference]: Without dead ends: 115 [2019-01-12 14:46:43,289 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 [2019-01-12 14:46:43,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-12 14:46:43,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-01-12 14:46:43,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-12 14:46:43,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 168 transitions. [2019-01-12 14:46:43,349 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 168 transitions. Word has length 16 [2019-01-12 14:46:43,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:43,350 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 168 transitions. [2019-01-12 14:46:43,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 14:46:43,350 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 168 transitions. [2019-01-12 14:46:43,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 14:46:43,352 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:43,352 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:46:43,353 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:43,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:43,353 INFO L82 PathProgramCache]: Analyzing trace with hash -323074868, now seen corresponding path program 1 times [2019-01-12 14:46:43,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:43,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:43,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:43,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:43,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:43,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:46:43,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:43,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:46:43,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:46:43,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:46:43,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:46:43,530 INFO L87 Difference]: Start difference. First operand 115 states and 168 transitions. Second operand 3 states. [2019-01-12 14:46:43,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:43,558 INFO L93 Difference]: Finished difference Result 115 states and 168 transitions. [2019-01-12 14:46:43,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:46:43,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-12 14:46:43,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:43,560 INFO L225 Difference]: With dead ends: 115 [2019-01-12 14:46:43,561 INFO L226 Difference]: Without dead ends: 49 [2019-01-12 14:46:43,563 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 [2019-01-12 14:46:43,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-12 14:46:43,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-12 14:46:43,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-12 14:46:43,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2019-01-12 14:46:43,570 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 17 [2019-01-12 14:46:43,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:43,571 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 71 transitions. [2019-01-12 14:46:43,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:46:43,572 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 71 transitions. [2019-01-12 14:46:43,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 14:46:43,573 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:43,573 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] [2019-01-12 14:46:43,573 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:43,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:43,575 INFO L82 PathProgramCache]: Analyzing trace with hash -426243093, now seen corresponding path program 1 times [2019-01-12 14:46:43,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:43,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:43,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:43,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:43,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:43,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:46:43,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:43,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:46:43,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:46:43,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:46:43,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:46:43,719 INFO L87 Difference]: Start difference. First operand 49 states and 71 transitions. Second operand 3 states. [2019-01-12 14:46:43,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:43,783 INFO L93 Difference]: Finished difference Result 135 states and 201 transitions. [2019-01-12 14:46:43,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:46:43,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-01-12 14:46:43,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:43,785 INFO L225 Difference]: With dead ends: 135 [2019-01-12 14:46:43,785 INFO L226 Difference]: Without dead ends: 92 [2019-01-12 14:46:43,786 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 [2019-01-12 14:46:43,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-12 14:46:43,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2019-01-12 14:46:43,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-12 14:46:43,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 131 transitions. [2019-01-12 14:46:43,801 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 131 transitions. Word has length 22 [2019-01-12 14:46:43,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:43,801 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 131 transitions. [2019-01-12 14:46:43,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:46:43,802 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 131 transitions. [2019-01-12 14:46:43,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-12 14:46:43,804 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:43,804 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] [2019-01-12 14:46:43,804 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:43,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:43,805 INFO L82 PathProgramCache]: Analyzing trace with hash 844046893, now seen corresponding path program 1 times [2019-01-12 14:46:43,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:43,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:43,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:43,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:43,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:43,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:46:43,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:43,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:46:43,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:46:43,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:46:43,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:46:43,919 INFO L87 Difference]: Start difference. First operand 88 states and 131 transitions. Second operand 3 states. [2019-01-12 14:46:44,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:44,039 INFO L93 Difference]: Finished difference Result 211 states and 318 transitions. [2019-01-12 14:46:44,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:46:44,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-12 14:46:44,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:44,044 INFO L225 Difference]: With dead ends: 211 [2019-01-12 14:46:44,044 INFO L226 Difference]: Without dead ends: 129 [2019-01-12 14:46:44,045 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 [2019-01-12 14:46:44,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-12 14:46:44,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2019-01-12 14:46:44,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-12 14:46:44,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 185 transitions. [2019-01-12 14:46:44,062 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 185 transitions. Word has length 24 [2019-01-12 14:46:44,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:44,063 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 185 transitions. [2019-01-12 14:46:44,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:46:44,064 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 185 transitions. [2019-01-12 14:46:44,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-12 14:46:44,065 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:44,065 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] [2019-01-12 14:46:44,066 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:44,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:44,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1604149312, now seen corresponding path program 1 times [2019-01-12 14:46:44,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:44,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:44,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:44,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:44,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:44,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:44,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:46:44,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:44,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:46:44,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:46:44,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:46:44,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:46:44,323 INFO L87 Difference]: Start difference. First operand 127 states and 185 transitions. Second operand 5 states. [2019-01-12 14:46:44,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:44,608 INFO L93 Difference]: Finished difference Result 683 states and 1014 transitions. [2019-01-12 14:46:44,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 14:46:44,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-01-12 14:46:44,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:44,614 INFO L225 Difference]: With dead ends: 683 [2019-01-12 14:46:44,614 INFO L226 Difference]: Without dead ends: 562 [2019-01-12 14:46:44,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:46:44,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-01-12 14:46:44,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 238. [2019-01-12 14:46:44,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-01-12 14:46:44,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 343 transitions. [2019-01-12 14:46:44,656 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 343 transitions. Word has length 25 [2019-01-12 14:46:44,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:44,656 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 343 transitions. [2019-01-12 14:46:44,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:46:44,657 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 343 transitions. [2019-01-12 14:46:44,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-12 14:46:44,659 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:44,659 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] [2019-01-12 14:46:44,660 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:44,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:44,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1807956406, now seen corresponding path program 1 times [2019-01-12 14:46:44,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:44,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:44,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:44,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:44,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:44,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:44,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:46:44,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:44,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:46:44,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:46:44,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:46:44,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:46:44,980 INFO L87 Difference]: Start difference. First operand 238 states and 343 transitions. Second operand 5 states. [2019-01-12 14:46:46,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:46,144 INFO L93 Difference]: Finished difference Result 684 states and 990 transitions. [2019-01-12 14:46:46,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:46:46,146 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-01-12 14:46:46,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:46,151 INFO L225 Difference]: With dead ends: 684 [2019-01-12 14:46:46,151 INFO L226 Difference]: Without dead ends: 682 [2019-01-12 14:46:46,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:46:46,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2019-01-12 14:46:46,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 238. [2019-01-12 14:46:46,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-01-12 14:46:46,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 341 transitions. [2019-01-12 14:46:46,197 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 341 transitions. Word has length 26 [2019-01-12 14:46:46,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:46,198 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 341 transitions. [2019-01-12 14:46:46,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:46:46,199 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 341 transitions. [2019-01-12 14:46:46,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-12 14:46:46,204 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:46,204 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] [2019-01-12 14:46:46,205 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:46,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:46,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1131451540, now seen corresponding path program 1 times [2019-01-12 14:46:46,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:46,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:46,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:46,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:46,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:46,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:46,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:46:46,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:46,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:46:46,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:46:46,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:46:46,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:46:46,331 INFO L87 Difference]: Start difference. First operand 238 states and 341 transitions. Second operand 5 states. [2019-01-12 14:46:46,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:46,603 INFO L93 Difference]: Finished difference Result 650 states and 916 transitions. [2019-01-12 14:46:46,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:46:46,603 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-01-12 14:46:46,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:46,606 INFO L225 Difference]: With dead ends: 650 [2019-01-12 14:46:46,606 INFO L226 Difference]: Without dead ends: 418 [2019-01-12 14:46:46,608 INFO L631 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-01-12 14:46:46,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-01-12 14:46:46,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 262. [2019-01-12 14:46:46,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-01-12 14:46:46,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 365 transitions. [2019-01-12 14:46:46,645 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 365 transitions. Word has length 31 [2019-01-12 14:46:46,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:46,645 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 365 transitions. [2019-01-12 14:46:46,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:46:46,646 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 365 transitions. [2019-01-12 14:46:46,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-12 14:46:46,647 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:46,647 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] [2019-01-12 14:46:46,651 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:46,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:46,651 INFO L82 PathProgramCache]: Analyzing trace with hash 738424530, now seen corresponding path program 1 times [2019-01-12 14:46:46,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:46,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:46,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:46,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:46,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:46,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:46:46,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:46,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:46:46,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:46:46,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:46:46,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:46:46,913 INFO L87 Difference]: Start difference. First operand 262 states and 365 transitions. Second operand 5 states. [2019-01-12 14:46:48,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:48,012 INFO L93 Difference]: Finished difference Result 734 states and 1001 transitions. [2019-01-12 14:46:48,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:46:48,013 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-01-12 14:46:48,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:48,017 INFO L225 Difference]: With dead ends: 734 [2019-01-12 14:46:48,017 INFO L226 Difference]: Without dead ends: 478 [2019-01-12 14:46:48,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:46:48,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-01-12 14:46:48,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 278. [2019-01-12 14:46:48,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-01-12 14:46:48,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 381 transitions. [2019-01-12 14:46:48,060 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 381 transitions. Word has length 31 [2019-01-12 14:46:48,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:48,060 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 381 transitions. [2019-01-12 14:46:48,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:46:48,060 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 381 transitions. [2019-01-12 14:46:48,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-12 14:46:48,062 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:48,063 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] [2019-01-12 14:46:48,063 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:48,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:48,064 INFO L82 PathProgramCache]: Analyzing trace with hash 996589968, now seen corresponding path program 1 times [2019-01-12 14:46:48,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:48,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:48,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:48,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:48,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:48,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:48,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:46:48,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:48,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:46:48,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:46:48,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:46:48,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:46:48,156 INFO L87 Difference]: Start difference. First operand 278 states and 381 transitions. Second operand 3 states. [2019-01-12 14:46:48,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:48,358 INFO L93 Difference]: Finished difference Result 654 states and 890 transitions. [2019-01-12 14:46:48,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:46:48,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-01-12 14:46:48,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:48,362 INFO L225 Difference]: With dead ends: 654 [2019-01-12 14:46:48,363 INFO L226 Difference]: Without dead ends: 382 [2019-01-12 14:46:48,364 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 [2019-01-12 14:46:48,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-01-12 14:46:48,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2019-01-12 14:46:48,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-01-12 14:46:48,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 507 transitions. [2019-01-12 14:46:48,451 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 507 transitions. Word has length 31 [2019-01-12 14:46:48,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:48,453 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 507 transitions. [2019-01-12 14:46:48,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:46:48,453 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 507 transitions. [2019-01-12 14:46:48,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-12 14:46:48,460 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:48,460 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] [2019-01-12 14:46:48,461 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:48,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:48,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1116169902, now seen corresponding path program 1 times [2019-01-12 14:46:48,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:48,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:48,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:48,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:48,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:46:49,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:46:49,490 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 14:46:49,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:46:49 BoogieIcfgContainer [2019-01-12 14:46:49,650 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:46:49,650 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:46:49,651 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:46:49,651 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:46:49,652 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:46:42" (3/4) ... [2019-01-12 14:46:49,655 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 14:46:49,790 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:46:49,790 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:46:49,791 INFO L168 Benchmark]: Toolchain (without parser) took 9142.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 203.4 MB). Free memory was 951.3 MB in the beginning and 1.0 GB in the end (delta: -72.8 MB). Peak memory consumption was 130.6 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:49,792 INFO L168 Benchmark]: CDTParser took 0.81 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:46:49,793 INFO L168 Benchmark]: CACSL2BoogieTranslator took 730.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -153.5 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:49,794 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.38 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-01-12 14:46:49,794 INFO L168 Benchmark]: Boogie Preprocessor took 47.05 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:49,796 INFO L168 Benchmark]: RCFGBuilder took 1330.98 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: 60.1 MB). Peak memory consumption was 60.1 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:49,796 INFO L168 Benchmark]: TraceAbstraction took 6807.76 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 77.6 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.8 MB). Peak memory consumption was 83.4 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:49,798 INFO L168 Benchmark]: Witness Printer took 139.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:49,803 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.81 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 730.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -153.5 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 77.38 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. * Boogie Preprocessor took 47.05 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1330.98 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: 60.1 MB). Peak memory consumption was 60.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6807.76 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 77.6 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.8 MB). Peak memory consumption was 83.4 MB. Max. memory is 11.5 GB. * Witness Printer took 139.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 704]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L121] int pumpRunning = 0; [L122] int systemActive = 1; [L503] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L773] int cleanupTimeShifts = 4; [L870] int waterLevel = 1; [L871] int methaneLevelCritical = 0; [L846] int retValue_acc ; [L847] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L738] int retValue_acc ; [L741] retValue_acc = 1 [L742] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L853] tmp = valid_product() [L855] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L46] int splverifierCounter ; [L47] int tmp ; [L48] int tmp___0 ; [L49] int tmp___1 ; [L50] int tmp___2 ; [L53] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L55] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L57] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L63] tmp = __VERIFIER_nondet_int() [L65] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L888] COND TRUE waterLevel < 2 [L889] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L73] tmp___0 = __VERIFIER_nondet_int() [L75] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L900] COND FALSE !(\read(methaneLevelCritical)) [L903] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L83] tmp___2 = __VERIFIER_nondet_int() [L85] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L129] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L136] COND TRUE \read(systemActive) [L184] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L187] COND FALSE !(\read(pumpRunning)) [L158] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L161] COND TRUE ! pumpRunning [L281] int retValue_acc ; [L282] int tmp ; [L283] int tmp___0 ; [L950] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L953] COND FALSE !(waterLevel < 2) [L957] retValue_acc = 0 [L958] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L287] tmp = isHighWaterSensorDry() [L289] COND FALSE !(\read(tmp)) [L292] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L294] retValue_acc = tmp___0 [L295] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L163] tmp = isHighWaterLevel() [L165] COND TRUE \read(tmp) [L212] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L748] int tmp ; [L749] int tmp___0 ; [L909] int retValue_acc ; [L912] retValue_acc = methaneLevelCritical [L913] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L753] tmp = isMethaneLevelCritical() [L755] COND TRUE \read(tmp) [L236] int retValue_acc ; [L239] retValue_acc = pumpRunning [L240] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L757] tmp___0 = isPumpRunning() [L759] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L704] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 119 locations, 3 error locations. UNSAFE Result, 6.7s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 875 SDtfs, 1188 SDslu, 1284 SDs, 0 SdLazy, 160 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=382occurred in iteration=9, 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.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 1130 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 255 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 214 ConstructedInterpolants, 0 QuantifiedInterpolants, 11496 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...