./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/minepump_spec4_product47.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_099debd6-4a5c-464a-8e59-7077e07dc70d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_099debd6-4a5c-464a-8e59-7077e07dc70d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_099debd6-4a5c-464a-8e59-7077e07dc70d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_099debd6-4a5c-464a-8e59-7077e07dc70d/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/product-lines/minepump_spec4_product47.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_099debd6-4a5c-464a-8e59-7077e07dc70d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_099debd6-4a5c-464a-8e59-7077e07dc70d/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 982cd7c832ad69be85d11abb6d88a1915810e691 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.25-f470102 [2019-12-07 18:22:19,578 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:22:19,580 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:22:19,588 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:22:19,588 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:22:19,588 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:22:19,589 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:22:19,591 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:22:19,593 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:22:19,594 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:22:19,595 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:22:19,595 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:22:19,596 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:22:19,596 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:22:19,597 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:22:19,598 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:22:19,598 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:22:19,599 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:22:19,601 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:22:19,602 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:22:19,603 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:22:19,604 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:22:19,604 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:22:19,605 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:22:19,607 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:22:19,607 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:22:19,607 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:22:19,607 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:22:19,608 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:22:19,609 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:22:19,609 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:22:19,609 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:22:19,610 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:22:19,611 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:22:19,611 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:22:19,612 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:22:19,612 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:22:19,612 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:22:19,612 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:22:19,613 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:22:19,614 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:22:19,614 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_099debd6-4a5c-464a-8e59-7077e07dc70d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:22:19,626 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:22:19,627 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:22:19,627 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:22:19,628 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:22:19,628 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:22:19,628 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:22:19,628 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:22:19,628 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:22:19,628 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:22:19,629 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:22:19,629 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:22:19,629 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:22:19,629 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:22:19,629 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:22:19,629 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:22:19,630 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:22:19,630 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:22:19,630 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:22:19,630 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:22:19,630 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:22:19,630 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:22:19,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:22:19,631 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:22:19,631 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:22:19,631 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:22:19,631 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:22:19,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:22:19,632 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:22:19,632 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:22:19,632 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_099debd6-4a5c-464a-8e59-7077e07dc70d/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 -> 982cd7c832ad69be85d11abb6d88a1915810e691 [2019-12-07 18:22:19,741 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:22:19,751 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:22:19,754 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:22:19,755 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:22:19,756 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:22:19,756 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_099debd6-4a5c-464a-8e59-7077e07dc70d/bin/uautomizer/../../sv-benchmarks/c/product-lines/minepump_spec4_product47.cil.c [2019-12-07 18:22:19,795 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_099debd6-4a5c-464a-8e59-7077e07dc70d/bin/uautomizer/data/903ff74dd/d955e4f887204dc7a419111b80ffedd5/FLAG3f99d2fe2 [2019-12-07 18:22:20,233 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:22:20,234 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_099debd6-4a5c-464a-8e59-7077e07dc70d/sv-benchmarks/c/product-lines/minepump_spec4_product47.cil.c [2019-12-07 18:22:20,242 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_099debd6-4a5c-464a-8e59-7077e07dc70d/bin/uautomizer/data/903ff74dd/d955e4f887204dc7a419111b80ffedd5/FLAG3f99d2fe2 [2019-12-07 18:22:20,250 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_099debd6-4a5c-464a-8e59-7077e07dc70d/bin/uautomizer/data/903ff74dd/d955e4f887204dc7a419111b80ffedd5 [2019-12-07 18:22:20,252 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:22:20,253 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:22:20,254 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:22:20,254 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:22:20,257 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:22:20,257 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:22:20" (1/1) ... [2019-12-07 18:22:20,259 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70ecabc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:20, skipping insertion in model container [2019-12-07 18:22:20,259 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:22:20" (1/1) ... [2019-12-07 18:22:20,264 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:22:20,296 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:22:20,504 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:22:20,511 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:22:20,558 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:22:20,580 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:22:20,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:20 WrapperNode [2019-12-07 18:22:20,580 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:22:20,581 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:22:20,581 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:22:20,581 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:22:20,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:20" (1/1) ... [2019-12-07 18:22:20,600 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:20" (1/1) ... [2019-12-07 18:22:20,630 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:22:20,630 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:22:20,630 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:22:20,630 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:22:20,637 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:20" (1/1) ... [2019-12-07 18:22:20,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:20" (1/1) ... [2019-12-07 18:22:20,641 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:20" (1/1) ... [2019-12-07 18:22:20,642 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:20" (1/1) ... [2019-12-07 18:22:20,651 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:20" (1/1) ... [2019-12-07 18:22:20,658 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:20" (1/1) ... [2019-12-07 18:22:20,660 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:20" (1/1) ... [2019-12-07 18:22:20,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:22:20,664 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:22:20,664 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:22:20,664 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:22:20,665 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_099debd6-4a5c-464a-8e59-7077e07dc70d/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-12-07 18:22:20,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:22:20,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-07 18:22:20,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:22:20,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:22:21,177 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:22:21,177 INFO L287 CfgBuilder]: Removed 196 assume(true) statements. [2019-12-07 18:22:21,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:22:21 BoogieIcfgContainer [2019-12-07 18:22:21,178 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:22:21,179 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:22:21,179 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:22:21,182 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:22:21,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:22:20" (1/3) ... [2019-12-07 18:22:21,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@591fbb37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:22:21, skipping insertion in model container [2019-12-07 18:22:21,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:20" (2/3) ... [2019-12-07 18:22:21,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@591fbb37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:22:21, skipping insertion in model container [2019-12-07 18:22:21,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:22:21" (3/3) ... [2019-12-07 18:22:21,185 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product47.cil.c [2019-12-07 18:22:21,194 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:22:21,200 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-12-07 18:22:21,211 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-12-07 18:22:21,233 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:22:21,233 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:22:21,233 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:22:21,233 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:22:21,233 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:22:21,233 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:22:21,233 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:22:21,233 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:22:21,246 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2019-12-07 18:22:21,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 18:22:21,250 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:21,250 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:21,251 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:22:21,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:21,254 INFO L82 PathProgramCache]: Analyzing trace with hash -330245923, now seen corresponding path program 1 times [2019-12-07 18:22:21,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:21,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885934908] [2019-12-07 18:22:21,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:21,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:21,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885934908] [2019-12-07 18:22:21,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:21,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:22:21,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071577596] [2019-12-07 18:22:21,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 18:22:21,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:21,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 18:22:21,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 18:22:21,440 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 2 states. [2019-12-07 18:22:21,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:21,462 INFO L93 Difference]: Finished difference Result 256 states and 383 transitions. [2019-12-07 18:22:21,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 18:22:21,463 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-12-07 18:22:21,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:21,471 INFO L225 Difference]: With dead ends: 256 [2019-12-07 18:22:21,471 INFO L226 Difference]: Without dead ends: 127 [2019-12-07 18:22:21,474 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-12-07 18:22:21,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-12-07 18:22:21,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-12-07 18:22:21,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-12-07 18:22:21,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 183 transitions. [2019-12-07 18:22:21,504 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 183 transitions. Word has length 16 [2019-12-07 18:22:21,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:21,505 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 183 transitions. [2019-12-07 18:22:21,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 18:22:21,505 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 183 transitions. [2019-12-07 18:22:21,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 18:22:21,506 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:21,506 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:21,506 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:22:21,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:21,506 INFO L82 PathProgramCache]: Analyzing trace with hash 450073546, now seen corresponding path program 1 times [2019-12-07 18:22:21,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:21,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249431568] [2019-12-07 18:22:21,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:21,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:21,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249431568] [2019-12-07 18:22:21,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:21,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:22:21,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824667688] [2019-12-07 18:22:21,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:22:21,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:21,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:22:21,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:22:21,563 INFO L87 Difference]: Start difference. First operand 127 states and 183 transitions. Second operand 3 states. [2019-12-07 18:22:21,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:21,572 INFO L93 Difference]: Finished difference Result 127 states and 183 transitions. [2019-12-07 18:22:21,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:22:21,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 18:22:21,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:21,573 INFO L225 Difference]: With dead ends: 127 [2019-12-07 18:22:21,573 INFO L226 Difference]: Without dead ends: 53 [2019-12-07 18:22:21,574 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-12-07 18:22:21,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-12-07 18:22:21,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-12-07 18:22:21,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-07 18:22:21,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 76 transitions. [2019-12-07 18:22:21,579 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 76 transitions. Word has length 17 [2019-12-07 18:22:21,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:21,579 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 76 transitions. [2019-12-07 18:22:21,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:22:21,579 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 76 transitions. [2019-12-07 18:22:21,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 18:22:21,580 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:21,580 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:21,580 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:22:21,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:21,580 INFO L82 PathProgramCache]: Analyzing trace with hash 445162074, now seen corresponding path program 1 times [2019-12-07 18:22:21,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:21,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963552622] [2019-12-07 18:22:21,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:21,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:21,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963552622] [2019-12-07 18:22:21,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:21,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:22:21,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348649205] [2019-12-07 18:22:21,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:22:21,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:21,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:22:21,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:22:21,640 INFO L87 Difference]: Start difference. First operand 53 states and 76 transitions. Second operand 6 states. [2019-12-07 18:22:21,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:21,739 INFO L93 Difference]: Finished difference Result 170 states and 250 transitions. [2019-12-07 18:22:21,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:22:21,740 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 18:22:21,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:21,741 INFO L225 Difference]: With dead ends: 170 [2019-12-07 18:22:21,741 INFO L226 Difference]: Without dead ends: 123 [2019-12-07 18:22:21,741 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-12-07 18:22:21,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-12-07 18:22:21,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 72. [2019-12-07 18:22:21,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-12-07 18:22:21,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 105 transitions. [2019-12-07 18:22:21,749 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 105 transitions. Word has length 22 [2019-12-07 18:22:21,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:21,750 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 105 transitions. [2019-12-07 18:22:21,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:22:21,750 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 105 transitions. [2019-12-07 18:22:21,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 18:22:21,750 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:21,751 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-12-07 18:22:21,751 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:22:21,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:21,751 INFO L82 PathProgramCache]: Analyzing trace with hash 96758808, now seen corresponding path program 1 times [2019-12-07 18:22:21,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:21,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132170319] [2019-12-07 18:22:21,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:21,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:21,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:21,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132170319] [2019-12-07 18:22:21,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:21,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:22:21,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702882030] [2019-12-07 18:22:21,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:22:21,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:21,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:22:21,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:22:21,786 INFO L87 Difference]: Start difference. First operand 72 states and 105 transitions. Second operand 3 states. [2019-12-07 18:22:21,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:21,809 INFO L93 Difference]: Finished difference Result 159 states and 234 transitions. [2019-12-07 18:22:21,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:22:21,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-12-07 18:22:21,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:21,810 INFO L225 Difference]: With dead ends: 159 [2019-12-07 18:22:21,810 INFO L226 Difference]: Without dead ends: 93 [2019-12-07 18:22:21,811 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-12-07 18:22:21,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-12-07 18:22:21,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2019-12-07 18:22:21,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-12-07 18:22:21,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 129 transitions. [2019-12-07 18:22:21,818 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 129 transitions. Word has length 24 [2019-12-07 18:22:21,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:21,818 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 129 transitions. [2019-12-07 18:22:21,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:22:21,818 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 129 transitions. [2019-12-07 18:22:21,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 18:22:21,819 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:21,819 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-12-07 18:22:21,819 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:22:21,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:21,820 INFO L82 PathProgramCache]: Analyzing trace with hash -732744145, now seen corresponding path program 1 times [2019-12-07 18:22:21,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:21,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652425919] [2019-12-07 18:22:21,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:21,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:21,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652425919] [2019-12-07 18:22:21,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:21,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:22:21,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275787483] [2019-12-07 18:22:21,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:22:21,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:21,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:22:21,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:22:21,861 INFO L87 Difference]: Start difference. First operand 91 states and 129 transitions. Second operand 5 states. [2019-12-07 18:22:21,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:21,932 INFO L93 Difference]: Finished difference Result 325 states and 468 transitions. [2019-12-07 18:22:21,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:22:21,933 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 18:22:21,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:21,935 INFO L225 Difference]: With dead ends: 325 [2019-12-07 18:22:21,935 INFO L226 Difference]: Without dead ends: 240 [2019-12-07 18:22:21,936 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:22:21,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-12-07 18:22:21,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 153. [2019-12-07 18:22:21,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-12-07 18:22:21,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 212 transitions. [2019-12-07 18:22:21,954 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 212 transitions. Word has length 25 [2019-12-07 18:22:21,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:21,955 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 212 transitions. [2019-12-07 18:22:21,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:22:21,955 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 212 transitions. [2019-12-07 18:22:21,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 18:22:21,956 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:21,957 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:21,957 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:22:21,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:21,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1602914161, now seen corresponding path program 1 times [2019-12-07 18:22:21,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:21,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971002663] [2019-12-07 18:22:21,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:21,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:21,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:21,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971002663] [2019-12-07 18:22:21,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:21,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:22:21,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702688226] [2019-12-07 18:22:21,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:22:21,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:21,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:22:21,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:22:21,999 INFO L87 Difference]: Start difference. First operand 153 states and 212 transitions. Second operand 5 states. [2019-12-07 18:22:22,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:22,097 INFO L93 Difference]: Finished difference Result 321 states and 453 transitions. [2019-12-07 18:22:22,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:22:22,098 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 18:22:22,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:22,099 INFO L225 Difference]: With dead ends: 321 [2019-12-07 18:22:22,099 INFO L226 Difference]: Without dead ends: 319 [2019-12-07 18:22:22,100 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-12-07 18:22:22,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-12-07 18:22:22,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 153. [2019-12-07 18:22:22,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-12-07 18:22:22,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 210 transitions. [2019-12-07 18:22:22,112 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 210 transitions. Word has length 26 [2019-12-07 18:22:22,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:22,113 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 210 transitions. [2019-12-07 18:22:22,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:22:22,113 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 210 transitions. [2019-12-07 18:22:22,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 18:22:22,114 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:22,114 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:22,114 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:22:22,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:22,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1235666169, now seen corresponding path program 1 times [2019-12-07 18:22:22,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:22,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656512651] [2019-12-07 18:22:22,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:22,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:22,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:22,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656512651] [2019-12-07 18:22:22,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:22,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:22:22,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151375455] [2019-12-07 18:22:22,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:22:22,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:22,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:22:22,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:22:22,149 INFO L87 Difference]: Start difference. First operand 153 states and 210 transitions. Second operand 4 states. [2019-12-07 18:22:22,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:22,207 INFO L93 Difference]: Finished difference Result 459 states and 638 transitions. [2019-12-07 18:22:22,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:22:22,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-12-07 18:22:22,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:22,210 INFO L225 Difference]: With dead ends: 459 [2019-12-07 18:22:22,210 INFO L226 Difference]: Without dead ends: 374 [2019-12-07 18:22:22,211 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-12-07 18:22:22,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-12-07 18:22:22,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 157. [2019-12-07 18:22:22,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-12-07 18:22:22,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 214 transitions. [2019-12-07 18:22:22,230 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 214 transitions. Word has length 34 [2019-12-07 18:22:22,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:22,230 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 214 transitions. [2019-12-07 18:22:22,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:22:22,230 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 214 transitions. [2019-12-07 18:22:22,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 18:22:22,232 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:22,232 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:22,232 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:22:22,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:22,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1822472183, now seen corresponding path program 1 times [2019-12-07 18:22:22,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:22,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576742409] [2019-12-07 18:22:22,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:22,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:22,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:22,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576742409] [2019-12-07 18:22:22,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:22,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:22:22,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827196416] [2019-12-07 18:22:22,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:22:22,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:22,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:22:22,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:22:22,285 INFO L87 Difference]: Start difference. First operand 157 states and 214 transitions. Second operand 5 states. [2019-12-07 18:22:22,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:22,388 INFO L93 Difference]: Finished difference Result 388 states and 543 transitions. [2019-12-07 18:22:22,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:22:22,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-07 18:22:22,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:22,391 INFO L225 Difference]: With dead ends: 388 [2019-12-07 18:22:22,391 INFO L226 Difference]: Without dead ends: 299 [2019-12-07 18:22:22,391 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:22:22,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-12-07 18:22:22,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 222. [2019-12-07 18:22:22,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-12-07 18:22:22,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 301 transitions. [2019-12-07 18:22:22,409 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 301 transitions. Word has length 34 [2019-12-07 18:22:22,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:22,409 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 301 transitions. [2019-12-07 18:22:22,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:22:22,410 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 301 transitions. [2019-12-07 18:22:22,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 18:22:22,411 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:22,411 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:22,411 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:22:22,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:22,411 INFO L82 PathProgramCache]: Analyzing trace with hash 44197509, now seen corresponding path program 1 times [2019-12-07 18:22:22,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:22,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125001388] [2019-12-07 18:22:22,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:22,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:22,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:22,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125001388] [2019-12-07 18:22:22,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:22,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:22:22,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776719083] [2019-12-07 18:22:22,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:22:22,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:22,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:22:22,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:22:22,450 INFO L87 Difference]: Start difference. First operand 222 states and 301 transitions. Second operand 5 states. [2019-12-07 18:22:22,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:22,512 INFO L93 Difference]: Finished difference Result 660 states and 894 transitions. [2019-12-07 18:22:22,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:22:22,513 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-07 18:22:22,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:22,515 INFO L225 Difference]: With dead ends: 660 [2019-12-07 18:22:22,515 INFO L226 Difference]: Without dead ends: 444 [2019-12-07 18:22:22,515 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-12-07 18:22:22,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2019-12-07 18:22:22,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 231. [2019-12-07 18:22:22,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-12-07 18:22:22,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 310 transitions. [2019-12-07 18:22:22,529 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 310 transitions. Word has length 34 [2019-12-07 18:22:22,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:22,529 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 310 transitions. [2019-12-07 18:22:22,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:22:22,530 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 310 transitions. [2019-12-07 18:22:22,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 18:22:22,530 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:22,530 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:22,531 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:22:22,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:22,531 INFO L82 PathProgramCache]: Analyzing trace with hash -542608505, now seen corresponding path program 1 times [2019-12-07 18:22:22,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:22,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213153893] [2019-12-07 18:22:22,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:22,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:22,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213153893] [2019-12-07 18:22:22,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:22,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:22:22,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50364734] [2019-12-07 18:22:22,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:22:22,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:22,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:22:22,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:22:22,573 INFO L87 Difference]: Start difference. First operand 231 states and 310 transitions. Second operand 6 states. [2019-12-07 18:22:22,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:22,635 INFO L93 Difference]: Finished difference Result 523 states and 704 transitions. [2019-12-07 18:22:22,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:22:22,635 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-07 18:22:22,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:22,637 INFO L225 Difference]: With dead ends: 523 [2019-12-07 18:22:22,637 INFO L226 Difference]: Without dead ends: 298 [2019-12-07 18:22:22,638 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:22:22,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-12-07 18:22:22,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 197. [2019-12-07 18:22:22,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-12-07 18:22:22,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 260 transitions. [2019-12-07 18:22:22,656 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 260 transitions. Word has length 34 [2019-12-07 18:22:22,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:22,656 INFO L462 AbstractCegarLoop]: Abstraction has 197 states and 260 transitions. [2019-12-07 18:22:22,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:22:22,657 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 260 transitions. [2019-12-07 18:22:22,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 18:22:22,657 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:22,657 INFO L410 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, 1, 1, 1] [2019-12-07 18:22:22,658 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:22:22,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:22,658 INFO L82 PathProgramCache]: Analyzing trace with hash 134497996, now seen corresponding path program 1 times [2019-12-07 18:22:22,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:22,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502096009] [2019-12-07 18:22:22,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:22,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:22,704 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:22,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502096009] [2019-12-07 18:22:22,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019601504] [2019-12-07 18:22:22,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_099debd6-4a5c-464a-8e59-7077e07dc70d/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:22:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:22,788 INFO L264 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 18:22:22,793 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:22:22,810 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:22,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:22:22,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-12-07 18:22:22,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050601749] [2019-12-07 18:22:22,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:22:22,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:22,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:22:22,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:22:22,811 INFO L87 Difference]: Start difference. First operand 197 states and 260 transitions. Second operand 6 states. [2019-12-07 18:22:22,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:22,963 INFO L93 Difference]: Finished difference Result 589 states and 795 transitions. [2019-12-07 18:22:22,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:22:22,963 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-07 18:22:22,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:22,966 INFO L225 Difference]: With dead ends: 589 [2019-12-07 18:22:22,966 INFO L226 Difference]: Without dead ends: 440 [2019-12-07 18:22:22,967 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:22:22,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2019-12-07 18:22:22,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 268. [2019-12-07 18:22:22,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-12-07 18:22:22,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 357 transitions. [2019-12-07 18:22:22,990 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 357 transitions. Word has length 53 [2019-12-07 18:22:22,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:22,990 INFO L462 AbstractCegarLoop]: Abstraction has 268 states and 357 transitions. [2019-12-07 18:22:22,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:22:22,991 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 357 transitions. [2019-12-07 18:22:22,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 18:22:22,992 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:22,992 INFO L410 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, 1, 1, 1] [2019-12-07 18:22:23,192 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:22:23,193 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:22:23,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:23,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1809371945, now seen corresponding path program 2 times [2019-12-07 18:22:23,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:23,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397705679] [2019-12-07 18:22:23,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:22:23,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:22:23,331 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:22:23,331 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:22:23,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:22:23 BoogieIcfgContainer [2019-12-07 18:22:23,442 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:22:23,442 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:22:23,442 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:22:23,442 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:22:23,443 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:22:21" (3/4) ... [2019-12-07 18:22:23,444 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 18:22:23,549 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_099debd6-4a5c-464a-8e59-7077e07dc70d/bin/uautomizer/witness.graphml [2019-12-07 18:22:23,549 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:22:23,551 INFO L168 Benchmark]: Toolchain (without parser) took 3297.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -195.2 MB). Peak memory consumption was 212.8 MB. Max. memory is 11.5 GB. [2019-12-07 18:22:23,551 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 954.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:22:23,551 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.73 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -157.0 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. [2019-12-07 18:22:23,552 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 11.5 GB. [2019-12-07 18:22:23,552 INFO L168 Benchmark]: Boogie Preprocessor took 33.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2019-12-07 18:22:23,552 INFO L168 Benchmark]: RCFGBuilder took 514.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 68.2 MB). Peak memory consumption was 68.2 MB. Max. memory is 11.5 GB. [2019-12-07 18:22:23,552 INFO L168 Benchmark]: TraceAbstraction took 2262.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 833.5 MB in the end (delta: 182.3 MB). Peak memory consumption was 182.3 MB. Max. memory is 11.5 GB. [2019-12-07 18:22:23,553 INFO L168 Benchmark]: Witness Printer took 107.62 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 56.1 MB). Free memory was 833.5 MB in the beginning and 1.1 GB in the end (delta: -298.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:22:23,554 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 954.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 326.73 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -157.0 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 514.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 68.2 MB). Peak memory consumption was 68.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2262.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 833.5 MB in the end (delta: 182.3 MB). Peak memory consumption was 182.3 MB. Max. memory is 11.5 GB. * Witness Printer took 107.62 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 56.1 MB). Free memory was 833.5 MB in the beginning and 1.1 GB in the end (delta: -298.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 828]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L40] int cleanupTimeShifts = 4; [L219] int pumpRunning = 0; [L220] int systemActive = 1; [L599] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L868] int waterLevel = 1; [L869] int methaneLevelCritical = 0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L121] int retValue_acc ; [L122] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L859] int retValue_acc ; [L862] retValue_acc = 1 [L863] 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] [L146] int splverifierCounter ; [L147] int tmp ; [L148] int tmp___0 ; [L149] int tmp___1 ; [L150] int tmp___2 ; [L153] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L155] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L157] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L163] tmp = __VERIFIER_nondet_int() [L165] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L886] COND TRUE waterLevel < 2 [L887] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L173] tmp___0 = __VERIFIER_nondet_int() [L175] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L183] tmp___2 = __VERIFIER_nondet_int() [L185] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L227] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L234] COND TRUE \read(systemActive) [L282] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L285] COND FALSE !(\read(pumpRunning)) [L256] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L259] COND TRUE ! pumpRunning [L396] int retValue_acc ; [L397] int tmp ; [L398] int tmp___0 ; [L948] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L951] COND FALSE !(waterLevel < 2) [L955] retValue_acc = 0 [L956] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L402] tmp = isHighWaterSensorDry() [L404] COND FALSE !(\read(tmp)) [L407] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L409] retValue_acc = tmp___0 [L410] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L261] tmp = isHighWaterLevel() [L263] COND TRUE \read(tmp) [L315] int tmp ; [L340] int retValue_acc ; [L907] int retValue_acc ; [L910] retValue_acc = methaneLevelCritical [L911] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L344] retValue_acc = isMethaneLevelCritical() [L346] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L319] tmp = isMethaneAlarm() [L321] COND FALSE !(\read(tmp)) [L310] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L799] int tmp ; [L800] int tmp___0 ; [L939] int retValue_acc ; [L942] retValue_acc = waterLevel [L943] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L804] tmp = getWaterLevel() [L806] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L155] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L157] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L163] tmp = __VERIFIER_nondet_int() [L165] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L173] tmp___0 = __VERIFIER_nondet_int() [L175] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L183] tmp___2 = __VERIFIER_nondet_int() [L185] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L227] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L874] COND TRUE waterLevel > 0 [L875] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L234] COND TRUE \read(systemActive) [L282] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L285] COND TRUE \read(pumpRunning) [L340] int retValue_acc ; [L907] int retValue_acc ; [L910] retValue_acc = methaneLevelCritical [L911] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L344] retValue_acc = isMethaneLevelCritical() [L346] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L287] tmp = isMethaneAlarm() [L289] COND FALSE !(\read(tmp)) [L256] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L259] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L799] int tmp ; [L800] int tmp___0 ; [L939] int retValue_acc ; [L942] retValue_acc = waterLevel [L943] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L804] tmp = getWaterLevel() [L806] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L155] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L157] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L163] tmp = __VERIFIER_nondet_int() [L165] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L173] tmp___0 = __VERIFIER_nondet_int() [L175] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L183] tmp___2 = __VERIFIER_nondet_int() [L185] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L227] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L874] COND TRUE waterLevel > 0 [L875] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L234] COND TRUE \read(systemActive) [L282] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L285] COND TRUE \read(pumpRunning) [L340] int retValue_acc ; [L907] int retValue_acc ; [L910] retValue_acc = methaneLevelCritical [L911] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L344] retValue_acc = isMethaneLevelCritical() [L346] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L287] tmp = isMethaneAlarm() [L289] COND FALSE !(\read(tmp)) [L256] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L259] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L799] int tmp ; [L800] int tmp___0 ; [L939] int retValue_acc ; [L942] retValue_acc = waterLevel [L943] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L804] tmp = getWaterLevel() [L806] COND TRUE tmp == 0 [L351] int retValue_acc ; [L354] retValue_acc = pumpRunning [L355] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L808] tmp___0 = isPumpRunning() [L810] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L828] __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, 131 locations, 3 error locations. Result: UNSAFE, OverallTime: 2.1s, OverallIterations: 12, TraceHistogramMax: 3, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1371 SDtfs, 1873 SDslu, 2130 SDs, 0 SdLazy, 283 SolverSat, 65 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 132 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=268occurred in iteration=11, 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, 11 MinimizatonAttempts, 1086 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 444 NumberOfCodeBlocks, 444 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 360 ConstructedInterpolants, 0 QuantifiedInterpolants, 23957 SizeOfPredicates, 4 NumberOfNonLiveVariables, 410 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 22/28 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...