./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/minepump_spec2_product33.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3d7155f2-a005-4e7c-bdd0-8589705ec2ab/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3d7155f2-a005-4e7c-bdd0-8589705ec2ab/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3d7155f2-a005-4e7c-bdd0-8589705ec2ab/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3d7155f2-a005-4e7c-bdd0-8589705ec2ab/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/product-lines/minepump_spec2_product33.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_3d7155f2-a005-4e7c-bdd0-8589705ec2ab/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3d7155f2-a005-4e7c-bdd0-8589705ec2ab/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7aed16b7a73618bd36d72dc3243e4d7bd764fb49 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:47:38,409 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:47:38,411 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:47:38,421 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:47:38,421 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:47:38,422 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:47:38,424 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:47:38,425 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:47:38,427 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:47:38,428 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:47:38,429 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:47:38,430 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:47:38,431 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:47:38,432 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:47:38,433 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:47:38,434 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:47:38,435 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:47:38,435 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:47:38,437 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:47:38,439 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:47:38,441 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:47:38,442 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:47:38,443 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:47:38,443 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:47:38,446 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:47:38,446 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:47:38,447 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:47:38,448 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:47:38,448 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:47:38,449 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:47:38,449 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:47:38,450 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:47:38,450 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:47:38,451 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:47:38,452 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:47:38,452 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:47:38,453 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:47:38,453 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:47:38,453 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:47:38,454 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:47:38,455 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:47:38,456 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3d7155f2-a005-4e7c-bdd0-8589705ec2ab/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:47:38,468 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:47:38,468 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:47:38,469 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:47:38,469 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:47:38,469 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:47:38,469 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:47:38,470 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:47:38,470 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:47:38,470 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:47:38,470 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:47:38,470 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:47:38,471 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:47:38,471 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:47:38,471 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:47:38,471 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:47:38,472 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:47:38,472 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:47:38,472 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:47:38,472 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:47:38,472 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:47:38,473 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:47:38,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:47:38,473 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:47:38,473 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:47:38,474 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:47:38,474 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:47:38,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:47:38,474 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:47:38,474 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_3d7155f2-a005-4e7c-bdd0-8589705ec2ab/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7aed16b7a73618bd36d72dc3243e4d7bd764fb49 [2019-11-25 08:47:38,613 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:47:38,627 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:47:38,632 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:47:38,634 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:47:38,634 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:47:38,636 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3d7155f2-a005-4e7c-bdd0-8589705ec2ab/bin/uautomizer/../../sv-benchmarks/c/product-lines/minepump_spec2_product33.cil.c [2019-11-25 08:47:38,693 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3d7155f2-a005-4e7c-bdd0-8589705ec2ab/bin/uautomizer/data/851f4eaa0/4ccde8718c9d4f769c74c08f8311b9e4/FLAG1b0fc25f6 [2019-11-25 08:47:39,154 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:47:39,155 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3d7155f2-a005-4e7c-bdd0-8589705ec2ab/sv-benchmarks/c/product-lines/minepump_spec2_product33.cil.c [2019-11-25 08:47:39,167 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3d7155f2-a005-4e7c-bdd0-8589705ec2ab/bin/uautomizer/data/851f4eaa0/4ccde8718c9d4f769c74c08f8311b9e4/FLAG1b0fc25f6 [2019-11-25 08:47:39,186 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3d7155f2-a005-4e7c-bdd0-8589705ec2ab/bin/uautomizer/data/851f4eaa0/4ccde8718c9d4f769c74c08f8311b9e4 [2019-11-25 08:47:39,189 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:47:39,190 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:47:39,193 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:47:39,193 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:47:39,196 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:47:39,197 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:47:39" (1/1) ... [2019-11-25 08:47:39,199 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5df0d35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:39, skipping insertion in model container [2019-11-25 08:47:39,199 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:47:39" (1/1) ... [2019-11-25 08:47:39,206 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:47:39,275 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:47:39,621 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:47:39,631 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:47:39,695 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:47:39,728 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:47:39,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:39 WrapperNode [2019-11-25 08:47:39,728 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:47:39,729 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:47:39,729 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:47:39,729 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:47:39,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:39" (1/1) ... [2019-11-25 08:47:39,754 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:39" (1/1) ... [2019-11-25 08:47:39,793 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:47:39,793 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:47:39,793 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:47:39,794 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:47:39,803 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:39" (1/1) ... [2019-11-25 08:47:39,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:39" (1/1) ... [2019-11-25 08:47:39,808 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:39" (1/1) ... [2019-11-25 08:47:39,820 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:39" (1/1) ... [2019-11-25 08:47:39,830 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:39" (1/1) ... [2019-11-25 08:47:39,843 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:39" (1/1) ... [2019-11-25 08:47:39,852 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:39" (1/1) ... [2019-11-25 08:47:39,858 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:47:39,859 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:47:39,859 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:47:39,859 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:47:39,860 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d7155f2-a005-4e7c-bdd0-8589705ec2ab/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:47:39,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:47:39,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-25 08:47:39,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:47:39,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:47:40,600 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:47:40,600 INFO L284 CfgBuilder]: Removed 98 assume(true) statements. [2019-11-25 08:47:40,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:47:40 BoogieIcfgContainer [2019-11-25 08:47:40,601 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:47:40,602 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:47:40,602 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:47:40,605 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:47:40,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:47:39" (1/3) ... [2019-11-25 08:47:40,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49eeb875 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:47:40, skipping insertion in model container [2019-11-25 08:47:40,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:39" (2/3) ... [2019-11-25 08:47:40,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49eeb875 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:47:40, skipping insertion in model container [2019-11-25 08:47:40,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:47:40" (3/3) ... [2019-11-25 08:47:40,608 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product33.cil.c [2019-11-25 08:47:40,616 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:47:40,621 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-25 08:47:40,631 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-25 08:47:40,650 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:47:40,650 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:47:40,651 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:47:40,651 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:47:40,651 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:47:40,651 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:47:40,651 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:47:40,652 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:47:40,673 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2019-11-25 08:47:40,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-25 08:47:40,679 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:40,680 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:40,681 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:40,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:40,686 INFO L82 PathProgramCache]: Analyzing trace with hash -816697532, now seen corresponding path program 1 times [2019-11-25 08:47:40,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:40,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459595222] [2019-11-25 08:47:40,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:40,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:40,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459595222] [2019-11-25 08:47:40,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:40,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:47:40,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820098434] [2019-11-25 08:47:40,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-25 08:47:40,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:41,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-25 08:47:41,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-25 08:47:41,013 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 2 states. [2019-11-25 08:47:41,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:41,036 INFO L93 Difference]: Finished difference Result 157 states and 240 transitions. [2019-11-25 08:47:41,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-25 08:47:41,038 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-11-25 08:47:41,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:41,048 INFO L225 Difference]: With dead ends: 157 [2019-11-25 08:47:41,048 INFO L226 Difference]: Without dead ends: 78 [2019-11-25 08:47:41,051 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-25 08:47:41,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-25 08:47:41,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-11-25 08:47:41,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-25 08:47:41,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 112 transitions. [2019-11-25 08:47:41,096 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 112 transitions. Word has length 18 [2019-11-25 08:47:41,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:41,097 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 112 transitions. [2019-11-25 08:47:41,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-25 08:47:41,097 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 112 transitions. [2019-11-25 08:47:41,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-25 08:47:41,098 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:41,098 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:41,098 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:41,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:41,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1035533501, now seen corresponding path program 1 times [2019-11-25 08:47:41,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:41,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995792585] [2019-11-25 08:47:41,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:41,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:41,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:41,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995792585] [2019-11-25 08:47:41,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:41,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:47:41,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382669436] [2019-11-25 08:47:41,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:41,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:41,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:41,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:41,200 INFO L87 Difference]: Start difference. First operand 78 states and 112 transitions. Second operand 3 states. [2019-11-25 08:47:41,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:41,209 INFO L93 Difference]: Finished difference Result 78 states and 112 transitions. [2019-11-25 08:47:41,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:41,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-25 08:47:41,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:41,210 INFO L225 Difference]: With dead ends: 78 [2019-11-25 08:47:41,211 INFO L226 Difference]: Without dead ends: 36 [2019-11-25 08:47:41,212 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:41,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-25 08:47:41,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-25 08:47:41,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-25 08:47:41,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2019-11-25 08:47:41,216 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 19 [2019-11-25 08:47:41,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:41,216 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2019-11-25 08:47:41,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:41,217 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2019-11-25 08:47:41,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-25 08:47:41,218 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:41,218 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:41,218 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:41,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:41,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1153900874, now seen corresponding path program 1 times [2019-11-25 08:47:41,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:41,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774518270] [2019-11-25 08:47:41,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:41,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:41,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774518270] [2019-11-25 08:47:41,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:41,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:47:41,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530395924] [2019-11-25 08:47:41,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:47:41,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:41,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:47:41,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:47:41,309 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand 6 states. [2019-11-25 08:47:41,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:41,415 INFO L93 Difference]: Finished difference Result 65 states and 95 transitions. [2019-11-25 08:47:41,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:47:41,416 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-25 08:47:41,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:41,418 INFO L225 Difference]: With dead ends: 65 [2019-11-25 08:47:41,419 INFO L226 Difference]: Without dead ends: 36 [2019-11-25 08:47:41,420 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:47:41,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-25 08:47:41,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-25 08:47:41,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-25 08:47:41,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2019-11-25 08:47:41,427 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 50 transitions. Word has length 24 [2019-11-25 08:47:41,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:41,428 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 50 transitions. [2019-11-25 08:47:41,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:47:41,428 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2019-11-25 08:47:41,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-25 08:47:41,429 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:41,429 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:41,429 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:41,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:41,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1264883623, now seen corresponding path program 1 times [2019-11-25 08:47:41,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:41,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326002832] [2019-11-25 08:47:41,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:41,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:41,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-11-25 08:47:41,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326002832] [2019-11-25 08:47:41,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:41,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:47:41,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033551857] [2019-11-25 08:47:41,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:41,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:41,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:41,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:41,529 INFO L87 Difference]: Start difference. First operand 36 states and 50 transitions. Second operand 3 states. [2019-11-25 08:47:41,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:41,549 INFO L93 Difference]: Finished difference Result 87 states and 125 transitions. [2019-11-25 08:47:41,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:41,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-25 08:47:41,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:41,551 INFO L225 Difference]: With dead ends: 87 [2019-11-25 08:47:41,551 INFO L226 Difference]: Without dead ends: 58 [2019-11-25 08:47:41,552 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:41,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-25 08:47:41,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2019-11-25 08:47:41,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-25 08:47:41,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 79 transitions. [2019-11-25 08:47:41,559 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 79 transitions. Word has length 25 [2019-11-25 08:47:41,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:41,560 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 79 transitions. [2019-11-25 08:47:41,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:41,560 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 79 transitions. [2019-11-25 08:47:41,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-25 08:47:41,561 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:41,562 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:41,562 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:41,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:41,562 INFO L82 PathProgramCache]: Analyzing trace with hash -703728504, now seen corresponding path program 1 times [2019-11-25 08:47:41,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:41,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310294334] [2019-11-25 08:47:41,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:41,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:41,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:41,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310294334] [2019-11-25 08:47:41,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:41,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:47:41,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651868538] [2019-11-25 08:47:41,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:47:41,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:41,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:47:41,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:47:41,642 INFO L87 Difference]: Start difference. First operand 56 states and 79 transitions. Second operand 5 states. [2019-11-25 08:47:41,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:41,714 INFO L93 Difference]: Finished difference Result 145 states and 205 transitions. [2019-11-25 08:47:41,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:47:41,718 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-25 08:47:41,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:41,719 INFO L225 Difference]: With dead ends: 145 [2019-11-25 08:47:41,720 INFO L226 Difference]: Without dead ends: 96 [2019-11-25 08:47:41,720 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:47:41,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-25 08:47:41,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 59. [2019-11-25 08:47:41,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-25 08:47:41,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2019-11-25 08:47:41,731 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 31 [2019-11-25 08:47:41,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:41,732 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2019-11-25 08:47:41,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:47:41,732 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2019-11-25 08:47:41,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-25 08:47:41,737 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:41,737 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:41,737 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:41,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:41,738 INFO L82 PathProgramCache]: Analyzing trace with hash 229735205, now seen corresponding path program 1 times [2019-11-25 08:47:41,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:41,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296893845] [2019-11-25 08:47:41,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:41,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:41,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:41,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296893845] [2019-11-25 08:47:41,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:41,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:47:41,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852081352] [2019-11-25 08:47:41,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:47:41,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:41,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:47:41,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:47:41,845 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand 5 states. [2019-11-25 08:47:41,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:41,939 INFO L93 Difference]: Finished difference Result 207 states and 293 transitions. [2019-11-25 08:47:41,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 08:47:41,940 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-25 08:47:41,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:41,941 INFO L225 Difference]: With dead ends: 207 [2019-11-25 08:47:41,941 INFO L226 Difference]: Without dead ends: 155 [2019-11-25 08:47:41,942 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-25 08:47:41,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-25 08:47:41,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 58. [2019-11-25 08:47:41,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-25 08:47:41,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 79 transitions. [2019-11-25 08:47:41,953 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 79 transitions. Word has length 31 [2019-11-25 08:47:41,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:41,953 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 79 transitions. [2019-11-25 08:47:41,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:47:41,954 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 79 transitions. [2019-11-25 08:47:41,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-25 08:47:41,954 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:41,955 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:41,955 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:41,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:41,955 INFO L82 PathProgramCache]: Analyzing trace with hash -2663926, now seen corresponding path program 1 times [2019-11-25 08:47:41,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:41,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062217579] [2019-11-25 08:47:41,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:41,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:42,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:42,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062217579] [2019-11-25 08:47:42,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:42,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:47:42,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735816859] [2019-11-25 08:47:42,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:47:42,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:42,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:47:42,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:47:42,014 INFO L87 Difference]: Start difference. First operand 58 states and 79 transitions. Second operand 4 states. [2019-11-25 08:47:42,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:42,052 INFO L93 Difference]: Finished difference Result 133 states and 183 transitions. [2019-11-25 08:47:42,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:47:42,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-25 08:47:42,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:42,054 INFO L225 Difference]: With dead ends: 133 [2019-11-25 08:47:42,054 INFO L226 Difference]: Without dead ends: 82 [2019-11-25 08:47:42,055 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:47:42,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-25 08:47:42,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 60. [2019-11-25 08:47:42,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-25 08:47:42,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 81 transitions. [2019-11-25 08:47:42,070 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 81 transitions. Word has length 31 [2019-11-25 08:47:42,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:42,071 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 81 transitions. [2019-11-25 08:47:42,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:47:42,071 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 81 transitions. [2019-11-25 08:47:42,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-25 08:47:42,072 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:42,072 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:42,072 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:42,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:42,072 INFO L82 PathProgramCache]: Analyzing trace with hash -589469940, now seen corresponding path program 1 times [2019-11-25 08:47:42,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:42,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154611674] [2019-11-25 08:47:42,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:42,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:42,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:42,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154611674] [2019-11-25 08:47:42,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:42,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:47:42,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594997319] [2019-11-25 08:47:42,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:42,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:42,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:42,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:42,129 INFO L87 Difference]: Start difference. First operand 60 states and 81 transitions. Second operand 3 states. [2019-11-25 08:47:42,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:42,151 INFO L93 Difference]: Finished difference Result 138 states and 188 transitions. [2019-11-25 08:47:42,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:42,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-25 08:47:42,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:42,153 INFO L225 Difference]: With dead ends: 138 [2019-11-25 08:47:42,153 INFO L226 Difference]: Without dead ends: 85 [2019-11-25 08:47:42,154 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:42,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-25 08:47:42,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-11-25 08:47:42,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-25 08:47:42,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 112 transitions. [2019-11-25 08:47:42,174 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 112 transitions. Word has length 31 [2019-11-25 08:47:42,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:42,175 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 112 transitions. [2019-11-25 08:47:42,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:42,175 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 112 transitions. [2019-11-25 08:47:42,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-25 08:47:42,179 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:42,179 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:42,180 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:42,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:42,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1606491700, now seen corresponding path program 1 times [2019-11-25 08:47:42,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:42,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640341474] [2019-11-25 08:47:42,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:42,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:42,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:42,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640341474] [2019-11-25 08:47:42,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:42,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:47:42,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441414215] [2019-11-25 08:47:42,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:42,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:42,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:42,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:42,229 INFO L87 Difference]: Start difference. First operand 85 states and 112 transitions. Second operand 3 states. [2019-11-25 08:47:42,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:42,261 INFO L93 Difference]: Finished difference Result 126 states and 168 transitions. [2019-11-25 08:47:42,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:42,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-25 08:47:42,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:42,262 INFO L225 Difference]: With dead ends: 126 [2019-11-25 08:47:42,263 INFO L226 Difference]: Without dead ends: 124 [2019-11-25 08:47:42,263 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:42,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-25 08:47:42,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 114. [2019-11-25 08:47:42,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-25 08:47:42,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 155 transitions. [2019-11-25 08:47:42,284 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 155 transitions. Word has length 32 [2019-11-25 08:47:42,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:42,284 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 155 transitions. [2019-11-25 08:47:42,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:42,286 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 155 transitions. [2019-11-25 08:47:42,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-25 08:47:42,287 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:42,287 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:42,288 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:42,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:42,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1682990208, now seen corresponding path program 1 times [2019-11-25 08:47:42,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:42,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019580606] [2019-11-25 08:47:42,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:42,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:42,404 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:47:42,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019580606] [2019-11-25 08:47:42,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:42,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:47:42,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909536096] [2019-11-25 08:47:42,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:47:42,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:42,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:47:42,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:47:42,406 INFO L87 Difference]: Start difference. First operand 114 states and 155 transitions. Second operand 5 states. [2019-11-25 08:47:42,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:42,508 INFO L93 Difference]: Finished difference Result 358 states and 492 transitions. [2019-11-25 08:47:42,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:47:42,509 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-11-25 08:47:42,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:42,510 INFO L225 Difference]: With dead ends: 358 [2019-11-25 08:47:42,511 INFO L226 Difference]: Without dead ends: 251 [2019-11-25 08:47:42,511 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:47:42,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-11-25 08:47:42,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 183. [2019-11-25 08:47:42,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-11-25 08:47:42,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 244 transitions. [2019-11-25 08:47:42,530 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 244 transitions. Word has length 50 [2019-11-25 08:47:42,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:42,530 INFO L462 AbstractCegarLoop]: Abstraction has 183 states and 244 transitions. [2019-11-25 08:47:42,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:47:42,530 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 244 transitions. [2019-11-25 08:47:42,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-25 08:47:42,531 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:42,531 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:42,532 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:42,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:42,532 INFO L82 PathProgramCache]: Analyzing trace with hash 967205496, now seen corresponding path program 1 times [2019-11-25 08:47:42,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:42,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194700777] [2019-11-25 08:47:42,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:42,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:42,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:42,706 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:42,706 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-25 08:47:42,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:47:42 BoogieIcfgContainer [2019-11-25 08:47:42,827 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:47:42,828 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:47:42,828 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:47:42,828 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:47:42,829 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:47:40" (3/4) ... [2019-11-25 08:47:42,831 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-25 08:47:43,016 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3d7155f2-a005-4e7c-bdd0-8589705ec2ab/bin/uautomizer/witness.graphml [2019-11-25 08:47:43,016 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:47:43,018 INFO L168 Benchmark]: Toolchain (without parser) took 3827.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 212.3 MB). Free memory was 948.7 MB in the beginning and 1.2 GB in the end (delta: -247.4 MB). Peak memory consumption was 304.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:43,018 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:47:43,019 INFO L168 Benchmark]: CACSL2BoogieTranslator took 535.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -173.9 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:43,019 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.97 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:43,019 INFO L168 Benchmark]: Boogie Preprocessor took 65.61 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:47:43,019 INFO L168 Benchmark]: RCFGBuilder took 742.33 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: 66.0 MB). Peak memory consumption was 66.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:43,020 INFO L168 Benchmark]: TraceAbstraction took 2225.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 806.0 MB in the end (delta: 238.2 MB). Peak memory consumption was 238.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:43,020 INFO L168 Benchmark]: Witness Printer took 188.28 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 77.1 MB). Free memory was 806.0 MB in the beginning and 1.2 GB in the end (delta: -390.1 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:43,022 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 535.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -173.9 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.97 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.61 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 742.33 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: 66.0 MB). Peak memory consumption was 66.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2225.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 806.0 MB in the end (delta: 238.2 MB). Peak memory consumption was 238.2 MB. Max. memory is 11.5 GB. * Witness Printer took 188.28 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 77.1 MB). Free memory was 806.0 MB in the beginning and 1.2 GB in the end (delta: -390.1 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 284]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L85] int waterLevel = 1; [L86] int methaneLevelCritical = 0; [L179] int cleanupTimeShifts = 4; [L292] int pumpRunning = 0; [L293] int systemActive = 1; [L876] int methAndRunningLastTime ; [L679] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L257] int retValue_acc ; [L258] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L69] int retValue_acc ; [L72] retValue_acc = 1 [L73] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L264] tmp = valid_product() [L266] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L881] methAndRunningLastTime = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L446] int splverifierCounter ; [L447] int tmp ; [L448] int tmp___0 ; [L449] int tmp___1 ; [L450] int tmp___2 ; [L453] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L455] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L457] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L463] tmp = __VERIFIER_nondet_int() [L465] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L103] COND TRUE waterLevel < 2 [L104] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L473] tmp___0 = __VERIFIER_nondet_int() [L475] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L115] COND FALSE !(\read(methaneLevelCritical)) [L118] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L483] tmp___2 = __VERIFIER_nondet_int() [L485] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L300] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L307] COND TRUE \read(systemActive) [L329] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L332] COND TRUE ! pumpRunning [L426] int retValue_acc ; [L427] int tmp ; [L428] int tmp___0 ; [L165] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L168] COND FALSE !(waterLevel < 2) [L172] retValue_acc = 0 [L173] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L432] tmp = isHighWaterSensorDry() [L434] COND FALSE !(\read(tmp)) [L437] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L439] retValue_acc = tmp___0 [L440] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L334] tmp = isHighWaterLevel() [L336] COND TRUE \read(tmp) [L357] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L886] int tmp ; [L887] int tmp___0 ; [L124] int retValue_acc ; [L127] retValue_acc = methaneLevelCritical [L128] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L891] tmp = isMethaneLevelCritical() [L893] COND TRUE \read(tmp) [L381] int retValue_acc ; [L384] retValue_acc = pumpRunning [L385] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L895] tmp___0 = isPumpRunning() [L897] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L898] COND FALSE !(\read(methAndRunningLastTime)) [L903] methAndRunningLastTime = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L455] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L457] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L463] tmp = __VERIFIER_nondet_int() [L465] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L473] tmp___0 = __VERIFIER_nondet_int() [L475] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L483] tmp___2 = __VERIFIER_nondet_int() [L485] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L300] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L91] COND TRUE waterLevel > 0 [L92] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L307] COND TRUE \read(systemActive) [L329] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L332] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L886] int tmp ; [L887] int tmp___0 ; [L124] int retValue_acc ; [L127] retValue_acc = methaneLevelCritical [L128] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L891] tmp = isMethaneLevelCritical() [L893] COND TRUE \read(tmp) [L381] int retValue_acc ; [L384] retValue_acc = pumpRunning [L385] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L895] tmp___0 = isPumpRunning() [L897] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L898] COND TRUE \read(methAndRunningLastTime) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L284] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 82 locations, 3 error locations. Result: UNSAFE, OverallTime: 2.1s, OverallIterations: 11, TraceHistogramMax: 2, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 659 SDtfs, 686 SDslu, 743 SDs, 0 SdLazy, 102 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 236 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 343 NumberOfCodeBlocks, 343 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 282 ConstructedInterpolants, 0 QuantifiedInterpolants, 18228 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 17/17 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...