./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/minepump_spec4_product45.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1a6b2558-73bd-40fe-8fcd-bf393a8b39f1/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1a6b2558-73bd-40fe-8fcd-bf393a8b39f1/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1a6b2558-73bd-40fe-8fcd-bf393a8b39f1/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1a6b2558-73bd-40fe-8fcd-bf393a8b39f1/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/product-lines/minepump_spec4_product45.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_1a6b2558-73bd-40fe-8fcd-bf393a8b39f1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1a6b2558-73bd-40fe-8fcd-bf393a8b39f1/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 a9369a06c8d4df60e49baaf177cf32aba3e52d93 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-cad4683 [2019-11-16 00:44:47,314 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:44:47,316 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:44:47,330 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:44:47,330 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:44:47,331 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:44:47,333 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:44:47,342 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:44:47,346 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:44:47,350 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:44:47,352 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:44:47,354 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:44:47,354 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:44:47,356 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:44:47,357 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:44:47,358 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:44:47,359 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:44:47,359 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:44:47,362 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:44:47,365 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:44:47,368 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:44:47,370 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:44:47,372 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:44:47,374 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:44:47,376 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:44:47,377 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:44:47,377 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:44:47,379 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:44:47,380 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:44:47,380 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:44:47,381 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:44:47,381 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:44:47,382 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:44:47,384 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:44:47,385 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:44:47,385 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:44:47,386 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:44:47,386 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:44:47,386 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:44:47,387 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:44:47,388 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:44:47,389 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1a6b2558-73bd-40fe-8fcd-bf393a8b39f1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:44:47,413 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:44:47,423 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:44:47,425 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:44:47,425 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:44:47,425 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:44:47,426 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:44:47,426 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:44:47,426 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:44:47,426 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:44:47,426 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:44:47,427 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:44:47,427 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:44:47,427 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:44:47,427 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:44:47,428 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:44:47,429 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:44:47,429 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:44:47,429 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:44:47,429 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:44:47,430 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:44:47,430 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:44:47,430 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:44:47,430 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:44:47,431 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:44:47,431 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:44:47,431 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:44:47,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:44:47,432 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:44:47,432 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_1a6b2558-73bd-40fe-8fcd-bf393a8b39f1/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 -> a9369a06c8d4df60e49baaf177cf32aba3e52d93 [2019-11-16 00:44:47,468 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:44:47,482 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:44:47,486 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:44:47,487 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:44:47,487 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:44:47,488 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1a6b2558-73bd-40fe-8fcd-bf393a8b39f1/bin/uautomizer/../../sv-benchmarks/c/product-lines/minepump_spec4_product45.cil.c [2019-11-16 00:44:47,549 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1a6b2558-73bd-40fe-8fcd-bf393a8b39f1/bin/uautomizer/data/2c4c610f2/1854df76d77741a1a54cd78d20e0a9ca/FLAG366d74c3f [2019-11-16 00:44:48,026 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:44:48,028 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1a6b2558-73bd-40fe-8fcd-bf393a8b39f1/sv-benchmarks/c/product-lines/minepump_spec4_product45.cil.c [2019-11-16 00:44:48,051 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1a6b2558-73bd-40fe-8fcd-bf393a8b39f1/bin/uautomizer/data/2c4c610f2/1854df76d77741a1a54cd78d20e0a9ca/FLAG366d74c3f [2019-11-16 00:44:48,344 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1a6b2558-73bd-40fe-8fcd-bf393a8b39f1/bin/uautomizer/data/2c4c610f2/1854df76d77741a1a54cd78d20e0a9ca [2019-11-16 00:44:48,347 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:44:48,348 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:44:48,349 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:44:48,349 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:44:48,353 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:44:48,354 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:44:48" (1/1) ... [2019-11-16 00:44:48,356 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41e37240 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:48, skipping insertion in model container [2019-11-16 00:44:48,362 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:44:48" (1/1) ... [2019-11-16 00:44:48,367 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:44:48,421 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:44:48,763 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:44:48,774 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:44:48,850 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:44:48,883 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:44:48,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:48 WrapperNode [2019-11-16 00:44:48,884 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:44:48,884 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:44:48,884 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:44:48,885 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:44:48,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:48" (1/1) ... [2019-11-16 00:44:48,908 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:48" (1/1) ... [2019-11-16 00:44:48,963 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:44:48,963 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:44:48,964 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:44:48,964 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:44:48,973 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:48" (1/1) ... [2019-11-16 00:44:48,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:48" (1/1) ... [2019-11-16 00:44:48,979 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:48" (1/1) ... [2019-11-16 00:44:48,979 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:48" (1/1) ... [2019-11-16 00:44:48,994 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:48" (1/1) ... [2019-11-16 00:44:49,002 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:48" (1/1) ... [2019-11-16 00:44:49,006 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:48" (1/1) ... [2019-11-16 00:44:49,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:44:49,011 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:44:49,012 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:44:49,012 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:44:49,013 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a6b2558-73bd-40fe-8fcd-bf393a8b39f1/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-16 00:44:49,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:44:49,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-16 00:44:49,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:44:49,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:44:49,986 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:44:49,986 INFO L284 CfgBuilder]: Removed 192 assume(true) statements. [2019-11-16 00:44:49,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:44:49 BoogieIcfgContainer [2019-11-16 00:44:49,987 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:44:49,989 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:44:49,989 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:44:49,991 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:44:49,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:44:48" (1/3) ... [2019-11-16 00:44:49,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ecbf077 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:44:49, skipping insertion in model container [2019-11-16 00:44:49,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:48" (2/3) ... [2019-11-16 00:44:49,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ecbf077 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:44:49, skipping insertion in model container [2019-11-16 00:44:49,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:44:49" (3/3) ... [2019-11-16 00:44:49,995 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product45.cil.c [2019-11-16 00:44:50,003 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:44:50,010 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-16 00:44:50,020 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-16 00:44:50,062 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:44:50,062 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:44:50,063 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:44:50,063 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:44:50,069 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:44:50,069 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:44:50,069 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:44:50,069 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:44:50,095 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2019-11-16 00:44:50,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-16 00:44:50,108 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:50,108 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:50,110 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:50,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:50,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1880189342, now seen corresponding path program 1 times [2019-11-16 00:44:50,125 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:50,125 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903041639] [2019-11-16 00:44:50,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:50,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:50,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:50,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:50,375 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-16 00:44:50,376 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903041639] [2019-11-16 00:44:50,377 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:50,377 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:44:50,377 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783345755] [2019-11-16 00:44:50,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-16 00:44:50,381 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:50,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-16 00:44:50,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-16 00:44:50,396 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 2 states. [2019-11-16 00:44:50,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:50,427 INFO L93 Difference]: Finished difference Result 252 states and 377 transitions. [2019-11-16 00:44:50,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-16 00:44:50,428 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-16 00:44:50,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:50,439 INFO L225 Difference]: With dead ends: 252 [2019-11-16 00:44:50,439 INFO L226 Difference]: Without dead ends: 125 [2019-11-16 00:44:50,443 INFO L600 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-16 00:44:50,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-16 00:44:50,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-11-16 00:44:50,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-16 00:44:50,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 180 transitions. [2019-11-16 00:44:50,486 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 180 transitions. Word has length 16 [2019-11-16 00:44:50,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:50,487 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 180 transitions. [2019-11-16 00:44:50,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-16 00:44:50,487 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 180 transitions. [2019-11-16 00:44:50,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-16 00:44:50,488 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:50,488 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:50,489 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:50,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:50,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1368021057, now seen corresponding path program 1 times [2019-11-16 00:44:50,489 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:50,489 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373998397] [2019-11-16 00:44:50,490 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:50,490 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:50,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:50,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:50,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-11-16 00:44:50,572 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373998397] [2019-11-16 00:44:50,573 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:50,573 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:44:50,573 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647165018] [2019-11-16 00:44:50,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:44:50,575 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:50,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:44:50,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:44:50,575 INFO L87 Difference]: Start difference. First operand 125 states and 180 transitions. Second operand 3 states. [2019-11-16 00:44:50,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:50,587 INFO L93 Difference]: Finished difference Result 125 states and 180 transitions. [2019-11-16 00:44:50,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:44:50,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-16 00:44:50,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:50,589 INFO L225 Difference]: With dead ends: 125 [2019-11-16 00:44:50,589 INFO L226 Difference]: Without dead ends: 51 [2019-11-16 00:44:50,590 INFO L600 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-16 00:44:50,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-16 00:44:50,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-11-16 00:44:50,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-16 00:44:50,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2019-11-16 00:44:50,596 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 17 [2019-11-16 00:44:50,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:50,596 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2019-11-16 00:44:50,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:44:50,596 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2019-11-16 00:44:50,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-16 00:44:50,597 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:50,597 INFO L380 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-11-16 00:44:50,598 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:50,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:50,598 INFO L82 PathProgramCache]: Analyzing trace with hash -2019078694, now seen corresponding path program 1 times [2019-11-16 00:44:50,598 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:50,598 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573552525] [2019-11-16 00:44:50,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:50,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:50,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:50,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:50,707 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-16 00:44:50,707 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573552525] [2019-11-16 00:44:50,707 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:50,707 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:44:50,707 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434836375] [2019-11-16 00:44:50,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:44:50,708 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:50,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:44:50,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:44:50,709 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. Second operand 6 states. [2019-11-16 00:44:50,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:50,832 INFO L93 Difference]: Finished difference Result 96 states and 140 transitions. [2019-11-16 00:44:50,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:44:50,832 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-11-16 00:44:50,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:50,833 INFO L225 Difference]: With dead ends: 96 [2019-11-16 00:44:50,833 INFO L226 Difference]: Without dead ends: 51 [2019-11-16 00:44:50,834 INFO L600 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-16 00:44:50,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-16 00:44:50,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-11-16 00:44:50,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-16 00:44:50,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 72 transitions. [2019-11-16 00:44:50,840 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 72 transitions. Word has length 22 [2019-11-16 00:44:50,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:50,840 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 72 transitions. [2019-11-16 00:44:50,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:44:50,840 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 72 transitions. [2019-11-16 00:44:50,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-16 00:44:50,841 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:50,841 INFO L380 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-16 00:44:50,842 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:50,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:50,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1511639432, now seen corresponding path program 1 times [2019-11-16 00:44:50,842 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:50,842 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843892522] [2019-11-16 00:44:50,842 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:50,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:50,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:50,889 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-16 00:44:50,890 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843892522] [2019-11-16 00:44:50,890 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:50,890 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:44:50,890 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442441068] [2019-11-16 00:44:50,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:44:50,891 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:50,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:44:50,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:44:50,891 INFO L87 Difference]: Start difference. First operand 51 states and 72 transitions. Second operand 3 states. [2019-11-16 00:44:50,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:50,938 INFO L93 Difference]: Finished difference Result 117 states and 168 transitions. [2019-11-16 00:44:50,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:44:50,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-16 00:44:50,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:50,939 INFO L225 Difference]: With dead ends: 117 [2019-11-16 00:44:50,939 INFO L226 Difference]: Without dead ends: 72 [2019-11-16 00:44:50,940 INFO L600 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-16 00:44:50,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-16 00:44:50,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-11-16 00:44:50,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-16 00:44:50,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 98 transitions. [2019-11-16 00:44:50,954 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 98 transitions. Word has length 24 [2019-11-16 00:44:50,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:50,955 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 98 transitions. [2019-11-16 00:44:50,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:44:50,955 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2019-11-16 00:44:50,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-16 00:44:50,957 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:50,958 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:50,958 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:50,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:50,959 INFO L82 PathProgramCache]: Analyzing trace with hash 406595852, now seen corresponding path program 1 times [2019-11-16 00:44:50,959 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:50,959 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964693363] [2019-11-16 00:44:50,960 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:50,960 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:50,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:51,175 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-16 00:44:51,176 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964693363] [2019-11-16 00:44:51,176 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:51,176 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:44:51,176 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558803410] [2019-11-16 00:44:51,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:44:51,177 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:51,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:44:51,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:44:51,178 INFO L87 Difference]: Start difference. First operand 70 states and 98 transitions. Second operand 8 states. [2019-11-16 00:44:51,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:51,580 INFO L93 Difference]: Finished difference Result 447 states and 648 transitions. [2019-11-16 00:44:51,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:44:51,581 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-11-16 00:44:51,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:51,583 INFO L225 Difference]: With dead ends: 447 [2019-11-16 00:44:51,584 INFO L226 Difference]: Without dead ends: 383 [2019-11-16 00:44:51,585 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:44:51,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-11-16 00:44:51,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 169. [2019-11-16 00:44:51,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-11-16 00:44:51,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 234 transitions. [2019-11-16 00:44:51,610 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 234 transitions. Word has length 30 [2019-11-16 00:44:51,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:51,611 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 234 transitions. [2019-11-16 00:44:51,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:44:51,611 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 234 transitions. [2019-11-16 00:44:51,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-16 00:44:51,613 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:51,614 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1] [2019-11-16 00:44:51,614 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:51,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:51,614 INFO L82 PathProgramCache]: Analyzing trace with hash -553017344, now seen corresponding path program 1 times [2019-11-16 00:44:51,615 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:51,615 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909272976] [2019-11-16 00:44:51,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:51,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:51,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:51,683 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:44:51,683 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909272976] [2019-11-16 00:44:51,683 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:51,684 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:44:51,684 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804470829] [2019-11-16 00:44:51,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:44:51,685 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:51,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:44:51,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:44:51,685 INFO L87 Difference]: Start difference. First operand 169 states and 234 transitions. Second operand 5 states. [2019-11-16 00:44:51,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:51,782 INFO L93 Difference]: Finished difference Result 458 states and 627 transitions. [2019-11-16 00:44:51,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:44:51,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-11-16 00:44:51,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:51,785 INFO L225 Difference]: With dead ends: 458 [2019-11-16 00:44:51,785 INFO L226 Difference]: Without dead ends: 295 [2019-11-16 00:44:51,786 INFO L600 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-16 00:44:51,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-11-16 00:44:51,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 184. [2019-11-16 00:44:51,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-11-16 00:44:51,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 249 transitions. [2019-11-16 00:44:51,807 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 249 transitions. Word has length 51 [2019-11-16 00:44:51,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:51,808 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 249 transitions. [2019-11-16 00:44:51,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:44:51,808 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 249 transitions. [2019-11-16 00:44:51,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-16 00:44:51,811 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:51,811 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1] [2019-11-16 00:44:51,812 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:51,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:51,812 INFO L82 PathProgramCache]: Analyzing trace with hash 148582530, now seen corresponding path program 1 times [2019-11-16 00:44:51,812 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:51,813 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141533319] [2019-11-16 00:44:51,813 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:51,813 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:51,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:51,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:51,899 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:44:51,899 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141533319] [2019-11-16 00:44:51,900 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:51,900 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:44:51,900 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761753294] [2019-11-16 00:44:51,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:44:51,901 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:51,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:44:51,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:44:51,901 INFO L87 Difference]: Start difference. First operand 184 states and 249 transitions. Second operand 4 states. [2019-11-16 00:44:51,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:51,956 INFO L93 Difference]: Finished difference Result 392 states and 529 transitions. [2019-11-16 00:44:51,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:44:51,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-11-16 00:44:51,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:51,960 INFO L225 Difference]: With dead ends: 392 [2019-11-16 00:44:51,960 INFO L226 Difference]: Without dead ends: 214 [2019-11-16 00:44:51,961 INFO L600 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-16 00:44:51,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-11-16 00:44:51,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 154. [2019-11-16 00:44:51,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-16 00:44:51,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 204 transitions. [2019-11-16 00:44:51,985 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 204 transitions. Word has length 51 [2019-11-16 00:44:51,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:51,985 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 204 transitions. [2019-11-16 00:44:51,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:44:51,986 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 204 transitions. [2019-11-16 00:44:51,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-16 00:44:51,993 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:51,993 INFO L380 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] [2019-11-16 00:44:51,993 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:51,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:51,994 INFO L82 PathProgramCache]: Analyzing trace with hash -701166778, now seen corresponding path program 1 times [2019-11-16 00:44:51,994 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:51,994 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578432983] [2019-11-16 00:44:51,994 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:51,994 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:51,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:52,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:52,099 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:44:52,100 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578432983] [2019-11-16 00:44:52,100 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:52,100 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:44:52,100 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032609559] [2019-11-16 00:44:52,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:44:52,101 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:52,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:44:52,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:44:52,101 INFO L87 Difference]: Start difference. First operand 154 states and 204 transitions. Second operand 6 states. [2019-11-16 00:44:52,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:52,320 INFO L93 Difference]: Finished difference Result 756 states and 1034 transitions. [2019-11-16 00:44:52,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:44:52,321 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-16 00:44:52,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:52,327 INFO L225 Difference]: With dead ends: 756 [2019-11-16 00:44:52,327 INFO L226 Difference]: Without dead ends: 608 [2019-11-16 00:44:52,329 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:44:52,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-11-16 00:44:52,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 300. [2019-11-16 00:44:52,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-11-16 00:44:52,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 394 transitions. [2019-11-16 00:44:52,374 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 394 transitions. Word has length 52 [2019-11-16 00:44:52,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:52,376 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 394 transitions. [2019-11-16 00:44:52,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:44:52,376 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 394 transitions. [2019-11-16 00:44:52,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-16 00:44:52,379 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:52,379 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:52,379 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:52,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:52,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1850284924, now seen corresponding path program 1 times [2019-11-16 00:44:52,380 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:52,380 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306038096] [2019-11-16 00:44:52,380 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:52,380 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:52,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:52,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:52,486 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-16 00:44:52,487 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306038096] [2019-11-16 00:44:52,487 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:52,488 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:44:52,488 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415624602] [2019-11-16 00:44:52,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:44:52,488 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:52,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:44:52,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:44:52,489 INFO L87 Difference]: Start difference. First operand 300 states and 394 transitions. Second operand 5 states. [2019-11-16 00:44:52,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:52,674 INFO L93 Difference]: Finished difference Result 800 states and 1059 transitions. [2019-11-16 00:44:52,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:44:52,674 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-11-16 00:44:52,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:52,679 INFO L225 Difference]: With dead ends: 800 [2019-11-16 00:44:52,679 INFO L226 Difference]: Without dead ends: 798 [2019-11-16 00:44:52,680 INFO L600 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-16 00:44:52,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2019-11-16 00:44:52,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 300. [2019-11-16 00:44:52,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-11-16 00:44:52,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 392 transitions. [2019-11-16 00:44:52,712 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 392 transitions. Word has length 53 [2019-11-16 00:44:52,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:52,713 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 392 transitions. [2019-11-16 00:44:52,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:44:52,713 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 392 transitions. [2019-11-16 00:44:52,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-16 00:44:52,715 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:52,717 INFO L380 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-11-16 00:44:52,717 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:52,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:52,718 INFO L82 PathProgramCache]: Analyzing trace with hash -956023316, now seen corresponding path program 1 times [2019-11-16 00:44:52,718 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:52,718 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689129892] [2019-11-16 00:44:52,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:52,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:52,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:52,804 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:44:52,805 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689129892] [2019-11-16 00:44:52,805 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244922563] [2019-11-16 00:44:52,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a6b2558-73bd-40fe-8fcd-bf393a8b39f1/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-11-16 00:44:52,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:52,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:44:52,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:53,013 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:44:53,014 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:44:53,015 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-11-16 00:44:53,015 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893628970] [2019-11-16 00:44:53,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:44:53,017 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:53,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:44:53,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:44:53,018 INFO L87 Difference]: Start difference. First operand 300 states and 392 transitions. Second operand 8 states. [2019-11-16 00:44:53,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:53,314 INFO L93 Difference]: Finished difference Result 1100 states and 1463 transitions. [2019-11-16 00:44:53,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:44:53,314 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-11-16 00:44:53,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:53,320 INFO L225 Difference]: With dead ends: 1100 [2019-11-16 00:44:53,320 INFO L226 Difference]: Without dead ends: 854 [2019-11-16 00:44:53,321 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:44:53,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2019-11-16 00:44:53,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 386. [2019-11-16 00:44:53,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2019-11-16 00:44:53,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 500 transitions. [2019-11-16 00:44:53,368 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 500 transitions. Word has length 53 [2019-11-16 00:44:53,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:53,369 INFO L462 AbstractCegarLoop]: Abstraction has 386 states and 500 transitions. [2019-11-16 00:44:53,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:44:53,369 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 500 transitions. [2019-11-16 00:44:53,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-16 00:44:53,370 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:53,370 INFO L380 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-11-16 00:44:53,575 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:44:53,575 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:53,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:53,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1396677984, now seen corresponding path program 2 times [2019-11-16 00:44:53,576 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:53,576 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213551641] [2019-11-16 00:44:53,576 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:53,576 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:53,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:54,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:54,448 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:44:54,448 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-16 00:44:54,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:44:54 BoogieIcfgContainer [2019-11-16 00:44:54,630 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:44:54,631 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:44:54,631 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:44:54,631 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:44:54,631 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:44:49" (3/4) ... [2019-11-16 00:44:54,633 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-16 00:44:54,783 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_1a6b2558-73bd-40fe-8fcd-bf393a8b39f1/bin/uautomizer/witness.graphml [2019-11-16 00:44:54,783 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:44:54,785 INFO L168 Benchmark]: Toolchain (without parser) took 6436.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 218.1 MB). Free memory was 946.1 MB in the beginning and 997.3 MB in the end (delta: -51.2 MB). Peak memory consumption was 166.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:54,785 INFO L168 Benchmark]: CDTParser took 0.19 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-16 00:44:54,785 INFO L168 Benchmark]: CACSL2BoogieTranslator took 534.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.8 MB). Free memory was 946.1 MB in the beginning and 1.2 GB in the end (delta: -204.4 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:54,786 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:54,786 INFO L168 Benchmark]: Boogie Preprocessor took 47.72 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:54,786 INFO L168 Benchmark]: RCFGBuilder took 976.07 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: 70.7 MB). Peak memory consumption was 70.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:54,787 INFO L168 Benchmark]: TraceAbstraction took 4641.79 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 50.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 37.0 MB). Peak memory consumption was 87.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:54,787 INFO L168 Benchmark]: Witness Printer took 152.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 997.3 MB in the end (delta: 33.4 MB). Peak memory consumption was 33.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:54,789 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.19 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 534.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.8 MB). Free memory was 946.1 MB in the beginning and 1.2 GB in the end (delta: -204.4 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 78.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.72 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 976.07 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: 70.7 MB). Peak memory consumption was 70.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4641.79 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 50.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 37.0 MB). Peak memory consumption was 87.3 MB. Max. memory is 11.5 GB. * Witness Printer took 152.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 997.3 MB in the end (delta: 33.4 MB). Peak memory consumption was 33.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 317]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L117] int pumpRunning = 0; [L118] int systemActive = 1; [L491] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L715] int cleanupTimeShifts = 4; [L814] int waterLevel = 1; [L815] int methaneLevelCritical = 0; [L791] int retValue_acc ; [L792] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L934] int retValue_acc ; [L937] retValue_acc = 1 [L938] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L798] tmp = valid_product() [L800] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L45] int splverifierCounter ; [L46] int tmp ; [L47] int tmp___0 ; [L48] int tmp___1 ; [L49] int tmp___2 ; [L52] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L54] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L56] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L62] tmp = __VERIFIER_nondet_int() [L64] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L832] COND TRUE waterLevel < 2 [L833] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L72] tmp___0 = __VERIFIER_nondet_int() [L74] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L82] tmp___2 = __VERIFIER_nondet_int() [L84] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L125] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L132] COND TRUE \read(systemActive) [L180] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L183] COND FALSE !(\read(pumpRunning)) [L154] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L157] COND TRUE ! pumpRunning [L294] int retValue_acc ; [L295] int tmp ; [L296] int tmp___0 ; [L894] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L897] COND FALSE !(waterLevel < 2) [L901] retValue_acc = 0 [L902] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L300] tmp = isHighWaterSensorDry() [L302] COND FALSE !(\read(tmp)) [L305] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L307] retValue_acc = tmp___0 [L308] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L159] tmp = isHighWaterLevel() [L161] COND TRUE \read(tmp) [L213] int tmp ; [L238] int retValue_acc ; [L853] int retValue_acc ; [L856] retValue_acc = methaneLevelCritical [L857] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L242] retValue_acc = isMethaneLevelCritical() [L244] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L217] tmp = isMethaneAlarm() [L219] COND FALSE !(\read(tmp)) [L208] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L690] int tmp ; [L691] int tmp___0 ; [L885] int retValue_acc ; [L888] retValue_acc = waterLevel [L889] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L695] tmp = getWaterLevel() [L697] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L54] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L56] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L62] tmp = __VERIFIER_nondet_int() [L64] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L72] tmp___0 = __VERIFIER_nondet_int() [L74] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L82] tmp___2 = __VERIFIER_nondet_int() [L84] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L125] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L820] COND TRUE waterLevel > 0 [L821] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L132] COND TRUE \read(systemActive) [L180] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L183] COND TRUE \read(pumpRunning) [L238] int retValue_acc ; [L853] int retValue_acc ; [L856] retValue_acc = methaneLevelCritical [L857] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L242] retValue_acc = isMethaneLevelCritical() [L244] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L185] tmp = isMethaneAlarm() [L187] COND FALSE !(\read(tmp)) [L154] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L157] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L690] int tmp ; [L691] int tmp___0 ; [L885] int retValue_acc ; [L888] retValue_acc = waterLevel [L889] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L695] tmp = getWaterLevel() [L697] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L54] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L56] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L62] tmp = __VERIFIER_nondet_int() [L64] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L72] tmp___0 = __VERIFIER_nondet_int() [L74] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L82] tmp___2 = __VERIFIER_nondet_int() [L84] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L125] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L820] COND TRUE waterLevel > 0 [L821] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L132] COND TRUE \read(systemActive) [L180] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L183] COND TRUE \read(pumpRunning) [L238] int retValue_acc ; [L853] int retValue_acc ; [L856] retValue_acc = methaneLevelCritical [L857] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L242] retValue_acc = isMethaneLevelCritical() [L244] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L185] tmp = isMethaneAlarm() [L187] COND FALSE !(\read(tmp)) [L154] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L157] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L690] int tmp ; [L691] int tmp___0 ; [L885] int retValue_acc ; [L888] retValue_acc = waterLevel [L889] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L695] tmp = getWaterLevel() [L697] COND TRUE tmp == 0 [L249] int retValue_acc ; [L252] retValue_acc = pumpRunning [L253] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L699] tmp___0 = isPumpRunning() [L701] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L317] __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, 129 locations, 3 error locations. Result: UNSAFE, OverallTime: 4.5s, OverallIterations: 11, TraceHistogramMax: 3, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1090 SDtfs, 2086 SDslu, 2157 SDs, 0 SdLazy, 336 SolverSat, 87 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 134 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=386occurred 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.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 1661 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 494 NumberOfCodeBlocks, 494 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 411 ConstructedInterpolants, 0 QuantifiedInterpolants, 38596 SizeOfPredicates, 4 NumberOfNonLiveVariables, 409 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 86/92 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...