./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec4_product38_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_spec4_product38_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 764a558f84753bff2f3381f04a56ebf221297041 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:48:40,453 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:48:40,455 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:48:40,466 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:48:40,467 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:48:40,468 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:48:40,469 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:48:40,471 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:48:40,472 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:48:40,473 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:48:40,474 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:48:40,474 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:48:40,475 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:48:40,476 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:48:40,477 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:48:40,478 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:48:40,479 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:48:40,480 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:48:40,482 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:48:40,484 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:48:40,485 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:48:40,486 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:48:40,489 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:48:40,489 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:48:40,490 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:48:40,490 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:48:40,491 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:48:40,492 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:48:40,493 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:48:40,494 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:48:40,494 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:48:40,495 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:48:40,495 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:48:40,496 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:48:40,497 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:48:40,497 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:48:40,498 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:48:40,514 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:48:40,514 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:48:40,515 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:48:40,515 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:48:40,516 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:48:40,516 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:48:40,516 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:48:40,516 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:48:40,516 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:48:40,517 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:48:40,517 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:48:40,517 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:48:40,517 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:48:40,517 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:48:40,518 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:48:40,518 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:48:40,518 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:48:40,518 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:48:40,518 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:48:40,518 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:48:40,519 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:48:40,519 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:48:40,519 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:48:40,519 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:48:40,519 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:48:40,520 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:48:40,520 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:48:40,520 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:48:40,520 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 -> 764a558f84753bff2f3381f04a56ebf221297041 [2019-01-12 14:48:40,554 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:48:40,572 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:48:40,577 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:48:40,578 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:48:40,578 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:48:40,579 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec4_product38_false-unreach-call_false-termination.cil.c [2019-01-12 14:48:40,648 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/977bb52f0/cd1cf806fe724d2d8f691068aa5cf05d/FLAG027e9f09d [2019-01-12 14:48:41,155 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:48:41,156 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec4_product38_false-unreach-call_false-termination.cil.c [2019-01-12 14:48:41,170 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/977bb52f0/cd1cf806fe724d2d8f691068aa5cf05d/FLAG027e9f09d [2019-01-12 14:48:41,401 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/977bb52f0/cd1cf806fe724d2d8f691068aa5cf05d [2019-01-12 14:48:41,405 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:48:41,406 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:48:41,408 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:48:41,408 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:48:41,416 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:48:41,417 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:48:41" (1/1) ... [2019-01-12 14:48:41,420 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13568bae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:48:41, skipping insertion in model container [2019-01-12 14:48:41,420 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:48:41" (1/1) ... [2019-01-12 14:48:41,427 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:48:41,480 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:48:41,859 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:48:41,875 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:48:42,018 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:48:42,146 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:48:42,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:48:42 WrapperNode [2019-01-12 14:48:42,147 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:48:42,148 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:48:42,148 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:48:42,148 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:48:42,158 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:48:42" (1/1) ... [2019-01-12 14:48:42,177 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:48:42" (1/1) ... [2019-01-12 14:48:42,224 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:48:42,224 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:48:42,224 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:48:42,225 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:48:42,235 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:48:42" (1/1) ... [2019-01-12 14:48:42,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:48:42" (1/1) ... [2019-01-12 14:48:42,240 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:48:42" (1/1) ... [2019-01-12 14:48:42,240 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:48:42" (1/1) ... [2019-01-12 14:48:42,252 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:48:42" (1/1) ... [2019-01-12 14:48:42,262 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:48:42" (1/1) ... [2019-01-12 14:48:42,276 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:48:42" (1/1) ... [2019-01-12 14:48:42,283 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:48:42,284 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:48:42,284 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:48:42,284 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:48:42,285 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:48:42" (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:48:42,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 14:48:42,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-12 14:48:42,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:48:42,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:48:43,843 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:48:43,843 INFO L286 CfgBuilder]: Removed 158 assue(true) statements. [2019-01-12 14:48:43,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:48:43 BoogieIcfgContainer [2019-01-12 14:48:43,845 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:48:43,846 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:48:43,846 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:48:43,850 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:48:43,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:48:41" (1/3) ... [2019-01-12 14:48:43,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@439a0c6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:48:43, skipping insertion in model container [2019-01-12 14:48:43,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:48:42" (2/3) ... [2019-01-12 14:48:43,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@439a0c6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:48:43, skipping insertion in model container [2019-01-12 14:48:43,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:48:43" (3/3) ... [2019-01-12 14:48:43,856 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product38_false-unreach-call_false-termination.cil.c [2019-01-12 14:48:43,866 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:48:43,876 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 14:48:43,892 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 14:48:43,921 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:48:43,922 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:48:43,922 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:48:43,922 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:48:43,923 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:48:43,923 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:48:43,923 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:48:43,924 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:48:43,924 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:48:43,940 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2019-01-12 14:48:43,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 14:48:43,948 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:48:43,949 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:48:43,952 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:48:43,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:48:43,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1529342393, now seen corresponding path program 1 times [2019-01-12 14:48:43,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:48:43,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:48:44,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:44,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:48:44,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:44,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:48:44,238 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:48:44,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:48:44,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:48:44,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 14:48:44,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 14:48:44,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:48:44,260 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 2 states. [2019-01-12 14:48:44,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:48:44,291 INFO L93 Difference]: Finished difference Result 216 states and 329 transitions. [2019-01-12 14:48:44,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 14:48:44,294 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-01-12 14:48:44,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:48:44,307 INFO L225 Difference]: With dead ends: 216 [2019-01-12 14:48:44,307 INFO L226 Difference]: Without dead ends: 107 [2019-01-12 14:48:44,312 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:48:44,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-12 14:48:44,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-01-12 14:48:44,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-12 14:48:44,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 156 transitions. [2019-01-12 14:48:44,374 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 156 transitions. Word has length 16 [2019-01-12 14:48:44,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:48:44,375 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 156 transitions. [2019-01-12 14:48:44,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 14:48:44,376 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 156 transitions. [2019-01-12 14:48:44,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 14:48:44,379 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:48:44,379 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:48:44,379 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:48:44,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:48:44,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1945506518, now seen corresponding path program 1 times [2019-01-12 14:48:44,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:48:44,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:48:44,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:44,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:48:44,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:44,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:48:44,587 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:48:44,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:48:44,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:48:44,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:48:44,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:48:44,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:48:44,590 INFO L87 Difference]: Start difference. First operand 107 states and 156 transitions. Second operand 3 states. [2019-01-12 14:48:44,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:48:44,621 INFO L93 Difference]: Finished difference Result 107 states and 156 transitions. [2019-01-12 14:48:44,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:48:44,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-12 14:48:44,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:48:44,623 INFO L225 Difference]: With dead ends: 107 [2019-01-12 14:48:44,624 INFO L226 Difference]: Without dead ends: 45 [2019-01-12 14:48:44,627 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:48:44,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-12 14:48:44,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-12 14:48:44,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-12 14:48:44,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 65 transitions. [2019-01-12 14:48:44,642 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 65 transitions. Word has length 17 [2019-01-12 14:48:44,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:48:44,646 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 65 transitions. [2019-01-12 14:48:44,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:48:44,646 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 65 transitions. [2019-01-12 14:48:44,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 14:48:44,649 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:48:44,650 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:48:44,650 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:48:44,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:48:44,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1939738244, now seen corresponding path program 1 times [2019-01-12 14:48:44,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:48:44,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:48:44,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:44,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:48:44,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:48:44,936 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:48:44,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:48:44,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:48:44,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:48:44,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:48:44,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:48:44,938 INFO L87 Difference]: Start difference. First operand 45 states and 65 transitions. Second operand 5 states. [2019-01-12 14:48:45,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:48:45,077 INFO L93 Difference]: Finished difference Result 84 states and 124 transitions. [2019-01-12 14:48:45,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 14:48:45,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-01-12 14:48:45,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:48:45,080 INFO L225 Difference]: With dead ends: 84 [2019-01-12 14:48:45,080 INFO L226 Difference]: Without dead ends: 45 [2019-01-12 14:48:45,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:48:45,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-12 14:48:45,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-12 14:48:45,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-12 14:48:45,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 64 transitions. [2019-01-12 14:48:45,095 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 64 transitions. Word has length 22 [2019-01-12 14:48:45,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:48:45,095 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 64 transitions. [2019-01-12 14:48:45,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:48:45,095 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 64 transitions. [2019-01-12 14:48:45,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-12 14:48:45,096 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:48:45,097 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:48:45,097 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:48:45,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:48:45,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1547834963, now seen corresponding path program 1 times [2019-01-12 14:48:45,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:48:45,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:48:45,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:45,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:48:45,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:45,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:48:45,186 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:48:45,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:48:45,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:48:45,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:48:45,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:48:45,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:48:45,187 INFO L87 Difference]: Start difference. First operand 45 states and 64 transitions. Second operand 3 states. [2019-01-12 14:48:45,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:48:45,271 INFO L93 Difference]: Finished difference Result 105 states and 152 transitions. [2019-01-12 14:48:45,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:48:45,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-12 14:48:45,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:48:45,274 INFO L225 Difference]: With dead ends: 105 [2019-01-12 14:48:45,275 INFO L226 Difference]: Without dead ends: 66 [2019-01-12 14:48:45,276 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:48:45,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-12 14:48:45,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-01-12 14:48:45,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-12 14:48:45,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 90 transitions. [2019-01-12 14:48:45,290 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 90 transitions. Word has length 24 [2019-01-12 14:48:45,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:48:45,291 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 90 transitions. [2019-01-12 14:48:45,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:48:45,291 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 90 transitions. [2019-01-12 14:48:45,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-12 14:48:45,293 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:48:45,293 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] [2019-01-12 14:48:45,293 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:48:45,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:48:45,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1827782978, now seen corresponding path program 1 times [2019-01-12 14:48:45,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:48:45,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:48:45,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:45,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:48:45,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:45,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:48:45,576 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:48:45,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:48:45,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:48:45,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:48:45,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:48:45,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:48:45,577 INFO L87 Difference]: Start difference. First operand 64 states and 90 transitions. Second operand 5 states. [2019-01-12 14:48:45,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:48:45,824 INFO L93 Difference]: Finished difference Result 171 states and 239 transitions. [2019-01-12 14:48:45,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:48:45,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-01-12 14:48:45,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:48:45,826 INFO L225 Difference]: With dead ends: 171 [2019-01-12 14:48:45,826 INFO L226 Difference]: Without dead ends: 113 [2019-01-12 14:48:45,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:48:45,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-12 14:48:45,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 70. [2019-01-12 14:48:45,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-12 14:48:45,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 96 transitions. [2019-01-12 14:48:45,838 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 96 transitions. Word has length 30 [2019-01-12 14:48:45,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:48:45,838 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 96 transitions. [2019-01-12 14:48:45,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:48:45,839 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 96 transitions. [2019-01-12 14:48:45,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-12 14:48:45,840 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:48:45,840 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] [2019-01-12 14:48:45,841 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:48:45,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:48:45,841 INFO L82 PathProgramCache]: Analyzing trace with hash 834728065, now seen corresponding path program 1 times [2019-01-12 14:48:45,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:48:45,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:48:45,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:45,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:48:45,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:45,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:48:45,956 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:48:45,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:48:45,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:48:45,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:48:45,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:48:45,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:48:45,957 INFO L87 Difference]: Start difference. First operand 70 states and 96 transitions. Second operand 5 states. [2019-01-12 14:48:46,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:48:46,235 INFO L93 Difference]: Finished difference Result 247 states and 346 transitions. [2019-01-12 14:48:46,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:48:46,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-01-12 14:48:46,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:48:46,238 INFO L225 Difference]: With dead ends: 247 [2019-01-12 14:48:46,238 INFO L226 Difference]: Without dead ends: 183 [2019-01-12 14:48:46,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:48:46,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-01-12 14:48:46,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 113. [2019-01-12 14:48:46,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-12 14:48:46,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 152 transitions. [2019-01-12 14:48:46,258 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 152 transitions. Word has length 30 [2019-01-12 14:48:46,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:48:46,258 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 152 transitions. [2019-01-12 14:48:46,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:48:46,259 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 152 transitions. [2019-01-12 14:48:46,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-12 14:48:46,261 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:48:46,262 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:48:46,265 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:48:46,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:48:46,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1173088129, now seen corresponding path program 1 times [2019-01-12 14:48:46,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:48:46,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:48:46,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:46,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:48:46,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:46,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:48:46,562 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:48:46,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:48:46,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:48:46,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:48:46,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:48:46,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:48:46,572 INFO L87 Difference]: Start difference. First operand 113 states and 152 transitions. Second operand 5 states. [2019-01-12 14:48:47,034 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-12 14:48:47,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:48:47,779 INFO L93 Difference]: Finished difference Result 241 states and 330 transitions. [2019-01-12 14:48:47,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:48:47,780 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-01-12 14:48:47,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:48:47,786 INFO L225 Difference]: With dead ends: 241 [2019-01-12 14:48:47,786 INFO L226 Difference]: Without dead ends: 239 [2019-01-12 14:48:47,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 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:48:47,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-01-12 14:48:47,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 113. [2019-01-12 14:48:47,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-12 14:48:47,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 151 transitions. [2019-01-12 14:48:47,820 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 151 transitions. Word has length 31 [2019-01-12 14:48:47,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:48:47,823 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 151 transitions. [2019-01-12 14:48:47,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:48:47,824 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 151 transitions. [2019-01-12 14:48:47,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-12 14:48:47,825 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:48:47,825 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:48:47,826 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:48:47,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:48:47,830 INFO L82 PathProgramCache]: Analyzing trace with hash 66341114, now seen corresponding path program 1 times [2019-01-12 14:48:47,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:48:47,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:48:47,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:47,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:48:47,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:48:47,999 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:48:47,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:48:47,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:48:48,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 14:48:48,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 14:48:48,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 14:48:48,003 INFO L87 Difference]: Start difference. First operand 113 states and 151 transitions. Second operand 4 states. [2019-01-12 14:48:48,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:48:48,400 INFO L93 Difference]: Finished difference Result 246 states and 329 transitions. [2019-01-12 14:48:48,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 14:48:48,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-01-12 14:48:48,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:48:48,403 INFO L225 Difference]: With dead ends: 246 [2019-01-12 14:48:48,403 INFO L226 Difference]: Without dead ends: 139 [2019-01-12 14:48:48,405 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 [2019-01-12 14:48:48,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-01-12 14:48:48,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 98. [2019-01-12 14:48:48,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-12 14:48:48,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 128 transitions. [2019-01-12 14:48:48,423 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 128 transitions. Word has length 31 [2019-01-12 14:48:48,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:48:48,423 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 128 transitions. [2019-01-12 14:48:48,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 14:48:48,424 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 128 transitions. [2019-01-12 14:48:48,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-12 14:48:48,426 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:48:48,426 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:48:48,426 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:48:48,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:48:48,428 INFO L82 PathProgramCache]: Analyzing trace with hash 324506552, now seen corresponding path program 1 times [2019-01-12 14:48:48,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:48:48,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:48:48,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:48,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:48:48,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:48,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:48:48,631 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:48:48,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:48:48,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:48:48,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:48:48,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:48:48,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:48:48,633 INFO L87 Difference]: Start difference. First operand 98 states and 128 transitions. Second operand 5 states. [2019-01-12 14:48:49,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:48:49,404 INFO L93 Difference]: Finished difference Result 265 states and 357 transitions. [2019-01-12 14:48:49,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:48:49,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-01-12 14:48:49,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:48:49,407 INFO L225 Difference]: With dead ends: 265 [2019-01-12 14:48:49,407 INFO L226 Difference]: Without dead ends: 197 [2019-01-12 14:48:49,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:48:49,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-01-12 14:48:49,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 139. [2019-01-12 14:48:49,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-01-12 14:48:49,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 180 transitions. [2019-01-12 14:48:49,432 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 180 transitions. Word has length 31 [2019-01-12 14:48:49,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:48:49,433 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 180 transitions. [2019-01-12 14:48:49,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:48:49,434 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 180 transitions. [2019-01-12 14:48:49,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-12 14:48:49,436 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:48:49,436 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:48:49,436 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:48:49,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:48:49,437 INFO L82 PathProgramCache]: Analyzing trace with hash -337830252, now seen corresponding path program 1 times [2019-01-12 14:48:49,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:48:49,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:48:49,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:49,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:48:49,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:49,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:48:49,600 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:48:49,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:48:49,601 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:48:49,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:48:49,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:48:49,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:48:49,767 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:48:49,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:48:49,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-12 14:48:49,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:48:49,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:48:49,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:48:49,825 INFO L87 Difference]: Start difference. First operand 139 states and 180 transitions. Second operand 6 states. [2019-01-12 14:48:50,532 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-12 14:48:50,736 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-12 14:48:51,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:48:51,467 INFO L93 Difference]: Finished difference Result 431 states and 573 transitions. [2019-01-12 14:48:51,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:48:51,470 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2019-01-12 14:48:51,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:48:51,473 INFO L225 Difference]: With dead ends: 431 [2019-01-12 14:48:51,474 INFO L226 Difference]: Without dead ends: 322 [2019-01-12 14:48:51,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-12 14:48:51,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-01-12 14:48:51,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 191. [2019-01-12 14:48:51,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-01-12 14:48:51,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 250 transitions. [2019-01-12 14:48:51,519 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 250 transitions. Word has length 50 [2019-01-12 14:48:51,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:48:51,520 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 250 transitions. [2019-01-12 14:48:51,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:48:51,520 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 250 transitions. [2019-01-12 14:48:51,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-12 14:48:51,525 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:48:51,525 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 14:48:51,525 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:48:51,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:48:51,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1076130248, now seen corresponding path program 2 times [2019-01-12 14:48:51,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:48:51,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:48:51,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:51,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:48:51,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:52,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:48:52,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:48:52,568 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 14:48:52,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:48:52 BoogieIcfgContainer [2019-01-12 14:48:52,757 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:48:52,757 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:48:52,757 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:48:52,757 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:48:52,759 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:48:43" (3/4) ... [2019-01-12 14:48:52,762 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 14:48:52,965 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:48:52,965 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:48:52,966 INFO L168 Benchmark]: Toolchain (without parser) took 11560.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 215.5 MB). Free memory was 954.0 MB in the beginning and 909.7 MB in the end (delta: 44.4 MB). Peak memory consumption was 259.8 MB. Max. memory is 11.5 GB. [2019-01-12 14:48:52,967 INFO L168 Benchmark]: CDTParser took 0.15 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:48:52,968 INFO L168 Benchmark]: CACSL2BoogieTranslator took 739.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -180.6 MB). Peak memory consumption was 38.0 MB. Max. memory is 11.5 GB. [2019-01-12 14:48:52,968 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.12 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:48:52,968 INFO L168 Benchmark]: Boogie Preprocessor took 59.22 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:48:52,969 INFO L168 Benchmark]: RCFGBuilder took 1561.41 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: 66.6 MB). Peak memory consumption was 66.6 MB. Max. memory is 11.5 GB. [2019-01-12 14:48:52,970 INFO L168 Benchmark]: TraceAbstraction took 8910.69 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 940.8 MB in the end (delta: 121.8 MB). Peak memory consumption was 194.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:48:52,970 INFO L168 Benchmark]: Witness Printer took 207.87 ms. Allocated memory is still 1.2 GB. Free memory was 940.8 MB in the beginning and 909.7 MB in the end (delta: 31.2 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. [2019-01-12 14:48:52,973 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.15 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 739.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -180.6 MB). Peak memory consumption was 38.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 76.12 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 59.22 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 1561.41 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: 66.6 MB). Peak memory consumption was 66.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8910.69 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 940.8 MB in the end (delta: 121.8 MB). Peak memory consumption was 194.7 MB. Max. memory is 11.5 GB. * Witness Printer took 207.87 ms. Allocated memory is still 1.2 GB. Free memory was 940.8 MB in the beginning and 909.7 MB in the end (delta: 31.2 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 247]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L40] int cleanupTimeShifts = 4; [L149] int waterLevel = 1; [L150] int methaneLevelCritical = 0; [L349] int pumpRunning = 0; [L350] int systemActive = 1; [L704] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L121] int retValue_acc ; [L122] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L927] int retValue_acc ; [L930] retValue_acc = 1 [L931] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L128] tmp = valid_product() [L130] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L281] int splverifierCounter ; [L282] int tmp ; [L283] int tmp___0 ; [L284] int tmp___1 ; [L285] int tmp___2 ; [L288] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L290] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L292] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L298] tmp = __VERIFIER_nondet_int() [L300] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L167] COND TRUE waterLevel < 2 [L168] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L308] tmp___0 = __VERIFIER_nondet_int() [L310] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L318] tmp___2 = __VERIFIER_nondet_int() [L320] COND TRUE \read(tmp___2) [L530] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L356] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L363] COND TRUE \read(systemActive) [L411] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L414] COND FALSE !(\read(pumpRunning)) [L385] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L388] COND TRUE ! pumpRunning [L508] int retValue_acc ; [L509] int tmp ; [L510] int tmp___0 ; [L229] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L232] COND FALSE !(waterLevel < 2) [L236] retValue_acc = 0 [L237] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L514] tmp = isHighWaterSensorDry() [L516] COND FALSE !(\read(tmp)) [L519] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L521] retValue_acc = tmp___0 [L522] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L390] tmp = isHighWaterLevel() [L392] COND TRUE \read(tmp) [L439] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L254] int tmp ; [L255] int tmp___0 ; [L220] int retValue_acc ; [L223] retValue_acc = waterLevel [L224] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L259] tmp = getWaterLevel() [L261] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L290] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L292] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L298] tmp = __VERIFIER_nondet_int() [L300] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L308] tmp___0 = __VERIFIER_nondet_int() [L310] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L318] tmp___2 = __VERIFIER_nondet_int() [L320] COND TRUE \read(tmp___2) [L530] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L356] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L155] COND TRUE waterLevel > 0 [L156] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L363] COND TRUE \read(systemActive) [L411] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L414] COND TRUE \read(pumpRunning) [L452] int retValue_acc ; [L188] int retValue_acc ; [L191] retValue_acc = methaneLevelCritical [L192] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L456] retValue_acc = isMethaneLevelCritical() [L458] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L416] tmp = isMethaneAlarm() [L418] COND FALSE !(\read(tmp)) [L385] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L388] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L254] int tmp ; [L255] int tmp___0 ; [L220] int retValue_acc ; [L223] retValue_acc = waterLevel [L224] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L259] tmp = getWaterLevel() [L261] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L290] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L292] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L298] tmp = __VERIFIER_nondet_int() [L300] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L308] tmp___0 = __VERIFIER_nondet_int() [L310] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L318] tmp___2 = __VERIFIER_nondet_int() [L320] COND TRUE \read(tmp___2) [L530] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L356] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L155] COND TRUE waterLevel > 0 [L156] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L363] COND TRUE \read(systemActive) [L411] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L414] COND TRUE \read(pumpRunning) [L452] int retValue_acc ; [L188] int retValue_acc ; [L191] retValue_acc = methaneLevelCritical [L192] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L456] retValue_acc = isMethaneLevelCritical() [L458] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L416] tmp = isMethaneAlarm() [L418] COND FALSE !(\read(tmp)) [L385] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L388] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L254] int tmp ; [L255] int tmp___0 ; [L220] int retValue_acc ; [L223] retValue_acc = waterLevel [L224] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L259] tmp = getWaterLevel() [L261] COND TRUE tmp == 0 [L463] int retValue_acc ; [L466] retValue_acc = pumpRunning [L467] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L263] tmp___0 = isPumpRunning() [L265] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L247] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 111 locations, 3 error locations. UNSAFE Result, 8.8s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 4.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 952 SDtfs, 1233 SDslu, 1367 SDs, 0 SdLazy, 233 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=191occurred 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, 471 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 401 NumberOfCodeBlocks, 401 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 321 ConstructedInterpolants, 0 QuantifiedInterpolants, 21005 SizeOfPredicates, 4 NumberOfNonLiveVariables, 397 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 22/28 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...