./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec4_product39.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec4_product39.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c228d9f74ddd17cda7010ca670107d7221f92470 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-30f4e4a [2019-11-28 00:22:47,089 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:22:47,092 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:22:47,105 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:22:47,106 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:22:47,107 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:22:47,108 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:22:47,110 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:22:47,112 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:22:47,113 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:22:47,114 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:22:47,121 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:22:47,121 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:22:47,123 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:22:47,124 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:22:47,125 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:22:47,126 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:22:47,127 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:22:47,128 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:22:47,130 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:22:47,132 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:22:47,133 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:22:47,134 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:22:47,135 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:22:47,138 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:22:47,138 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:22:47,138 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:22:47,139 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:22:47,140 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:22:47,141 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:22:47,141 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:22:47,142 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:22:47,143 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:22:47,144 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:22:47,145 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:22:47,145 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:22:47,146 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:22:47,146 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:22:47,146 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:22:47,147 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:22:47,148 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:22:47,149 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:22:47,165 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:22:47,165 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:22:47,166 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:22:47,167 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:22:47,167 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:22:47,167 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:22:47,167 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:22:47,168 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:22:47,168 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:22:47,168 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:22:47,168 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:22:47,168 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:22:47,169 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:22:47,169 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:22:47,169 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:22:47,169 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:22:47,169 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:22:47,170 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:22:47,170 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:22:47,170 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:22:47,170 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:22:47,170 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:22:47,171 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:22:47,171 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:22:47,171 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:22:47,171 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:22:47,172 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:22:47,172 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:22:47,172 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c228d9f74ddd17cda7010ca670107d7221f92470 [2019-11-28 00:22:47,565 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:22:47,585 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:22:47,589 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:22:47,590 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:22:47,591 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:22:47,592 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec4_product39.cil.c [2019-11-28 00:22:47,663 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef553bf9b/57e2065077e5454abc3df09e9a862f58/FLAG181e6266a [2019-11-28 00:22:48,189 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:22:48,189 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product39.cil.c [2019-11-28 00:22:48,207 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef553bf9b/57e2065077e5454abc3df09e9a862f58/FLAG181e6266a [2019-11-28 00:22:48,469 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef553bf9b/57e2065077e5454abc3df09e9a862f58 [2019-11-28 00:22:48,472 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:22:48,474 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:22:48,475 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:22:48,475 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:22:48,478 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:22:48,479 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:22:48" (1/1) ... [2019-11-28 00:22:48,482 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b299e71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:48, skipping insertion in model container [2019-11-28 00:22:48,482 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:22:48" (1/1) ... [2019-11-28 00:22:48,489 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:22:48,549 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:22:49,070 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:22:49,094 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:22:49,201 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:22:49,243 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:22:49,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:49 WrapperNode [2019-11-28 00:22:49,244 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:22:49,245 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:22:49,245 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:22:49,246 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:22:49,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:49" (1/1) ... [2019-11-28 00:22:49,273 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:49" (1/1) ... [2019-11-28 00:22:49,322 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:22:49,323 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:22:49,323 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:22:49,323 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:22:49,332 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:49" (1/1) ... [2019-11-28 00:22:49,332 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:49" (1/1) ... [2019-11-28 00:22:49,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:49" (1/1) ... [2019-11-28 00:22:49,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:49" (1/1) ... [2019-11-28 00:22:49,352 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:49" (1/1) ... [2019-11-28 00:22:49,362 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:49" (1/1) ... [2019-11-28 00:22:49,379 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:49" (1/1) ... [2019-11-28 00:22:49,387 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:22:49,389 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:22:49,390 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:22:49,390 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:22:49,394 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:22:49,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 00:22:49,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 00:22:49,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:22:49,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:22:50,421 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:22:50,421 INFO L297 CfgBuilder]: Removed 160 assume(true) statements. [2019-11-28 00:22:50,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:22:50 BoogieIcfgContainer [2019-11-28 00:22:50,423 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:22:50,427 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:22:50,427 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:22:50,432 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:22:50,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:22:48" (1/3) ... [2019-11-28 00:22:50,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e500692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:22:50, skipping insertion in model container [2019-11-28 00:22:50,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:49" (2/3) ... [2019-11-28 00:22:50,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e500692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:22:50, skipping insertion in model container [2019-11-28 00:22:50,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:22:50" (3/3) ... [2019-11-28 00:22:50,439 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product39.cil.c [2019-11-28 00:22:50,449 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:22:50,457 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 00:22:50,470 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 00:22:50,501 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:22:50,501 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:22:50,501 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:22:50,501 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:22:50,502 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:22:50,503 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:22:50,504 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:22:50,504 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:22:50,533 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2019-11-28 00:22:50,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 00:22:50,541 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:50,542 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:22:50,543 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:50,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:50,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1221872895, now seen corresponding path program 1 times [2019-11-28 00:22:50,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:50,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240365567] [2019-11-28 00:22:50,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:50,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:50,815 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-28 00:22:50,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240365567] [2019-11-28 00:22:50,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:50,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:22:50,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851451258] [2019-11-28 00:22:50,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 00:22:50,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:50,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 00:22:50,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 00:22:50,849 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 2 states. [2019-11-28 00:22:50,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:50,917 INFO L93 Difference]: Finished difference Result 220 states and 335 transitions. [2019-11-28 00:22:50,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 00:22:50,918 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-28 00:22:50,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:50,939 INFO L225 Difference]: With dead ends: 220 [2019-11-28 00:22:50,940 INFO L226 Difference]: Without dead ends: 109 [2019-11-28 00:22:50,947 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 00:22:50,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-28 00:22:51,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-11-28 00:22:51,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-28 00:22:51,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 159 transitions. [2019-11-28 00:22:51,022 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 159 transitions. Word has length 16 [2019-11-28 00:22:51,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:51,023 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 159 transitions. [2019-11-28 00:22:51,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 00:22:51,023 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 159 transitions. [2019-11-28 00:22:51,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 00:22:51,027 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:51,027 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:22:51,028 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:51,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:51,028 INFO L82 PathProgramCache]: Analyzing trace with hash 175115998, now seen corresponding path program 1 times [2019-11-28 00:22:51,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:51,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088655987] [2019-11-28 00:22:51,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:51,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:51,193 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-28 00:22:51,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088655987] [2019-11-28 00:22:51,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:51,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:22:51,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738516249] [2019-11-28 00:22:51,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:22:51,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:51,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:22:51,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:22:51,200 INFO L87 Difference]: Start difference. First operand 109 states and 159 transitions. Second operand 3 states. [2019-11-28 00:22:51,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:51,219 INFO L93 Difference]: Finished difference Result 109 states and 159 transitions. [2019-11-28 00:22:51,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:22:51,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 00:22:51,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:51,222 INFO L225 Difference]: With dead ends: 109 [2019-11-28 00:22:51,223 INFO L226 Difference]: Without dead ends: 47 [2019-11-28 00:22:51,225 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:22:51,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-28 00:22:51,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-11-28 00:22:51,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-28 00:22:51,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2019-11-28 00:22:51,236 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 17 [2019-11-28 00:22:51,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:51,237 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2019-11-28 00:22:51,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:22:51,237 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2019-11-28 00:22:51,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 00:22:51,239 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:51,239 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-11-28 00:22:51,240 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:51,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:51,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1744081540, now seen corresponding path program 1 times [2019-11-28 00:22:51,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:51,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256298771] [2019-11-28 00:22:51,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:51,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:51,374 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-28 00:22:51,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256298771] [2019-11-28 00:22:51,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:51,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:22:51,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568634495] [2019-11-28 00:22:51,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:22:51,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:51,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:22:51,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:22:51,378 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand 3 states. [2019-11-28 00:22:51,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:51,410 INFO L93 Difference]: Finished difference Result 129 states and 192 transitions. [2019-11-28 00:22:51,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:22:51,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 00:22:51,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:51,413 INFO L225 Difference]: With dead ends: 129 [2019-11-28 00:22:51,413 INFO L226 Difference]: Without dead ends: 88 [2019-11-28 00:22:51,414 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:22:51,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-28 00:22:51,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2019-11-28 00:22:51,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-28 00:22:51,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 125 transitions. [2019-11-28 00:22:51,431 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 125 transitions. Word has length 22 [2019-11-28 00:22:51,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:51,432 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 125 transitions. [2019-11-28 00:22:51,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:22:51,432 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 125 transitions. [2019-11-28 00:22:51,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 00:22:51,433 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:51,434 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:22:51,434 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:51,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:51,435 INFO L82 PathProgramCache]: Analyzing trace with hash -595366227, now seen corresponding path program 1 times [2019-11-28 00:22:51,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:51,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334582127] [2019-11-28 00:22:51,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:51,505 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-28 00:22:51,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334582127] [2019-11-28 00:22:51,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:51,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:22:51,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342956243] [2019-11-28 00:22:51,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:22:51,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:51,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:22:51,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:22:51,510 INFO L87 Difference]: Start difference. First operand 84 states and 125 transitions. Second operand 3 states. [2019-11-28 00:22:51,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:51,591 INFO L93 Difference]: Finished difference Result 203 states and 306 transitions. [2019-11-28 00:22:51,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:22:51,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 00:22:51,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:51,597 INFO L225 Difference]: With dead ends: 203 [2019-11-28 00:22:51,598 INFO L226 Difference]: Without dead ends: 125 [2019-11-28 00:22:51,600 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:22:51,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-28 00:22:51,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2019-11-28 00:22:51,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-11-28 00:22:51,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 179 transitions. [2019-11-28 00:22:51,621 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 179 transitions. Word has length 24 [2019-11-28 00:22:51,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:51,622 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 179 transitions. [2019-11-28 00:22:51,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:22:51,622 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 179 transitions. [2019-11-28 00:22:51,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 00:22:51,624 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:51,625 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:22:51,625 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:51,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:51,626 INFO L82 PathProgramCache]: Analyzing trace with hash 566175321, now seen corresponding path program 1 times [2019-11-28 00:22:51,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:51,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077183315] [2019-11-28 00:22:51,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:51,705 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-28 00:22:51,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077183315] [2019-11-28 00:22:51,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:51,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:22:51,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942475487] [2019-11-28 00:22:51,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:51,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:51,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:51,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:51,708 INFO L87 Difference]: Start difference. First operand 123 states and 179 transitions. Second operand 5 states. [2019-11-28 00:22:51,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:51,824 INFO L93 Difference]: Finished difference Result 439 states and 645 transitions. [2019-11-28 00:22:51,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:22:51,825 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-28 00:22:51,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:51,828 INFO L225 Difference]: With dead ends: 439 [2019-11-28 00:22:51,828 INFO L226 Difference]: Without dead ends: 322 [2019-11-28 00:22:51,829 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-11-28 00:22:51,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-11-28 00:22:51,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 206. [2019-11-28 00:22:51,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-28 00:22:51,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 290 transitions. [2019-11-28 00:22:51,853 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 290 transitions. Word has length 25 [2019-11-28 00:22:51,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:51,854 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 290 transitions. [2019-11-28 00:22:51,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:22:51,854 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 290 transitions. [2019-11-28 00:22:51,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 00:22:51,855 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:51,856 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-11-28 00:22:51,856 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:51,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:51,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1393133669, now seen corresponding path program 1 times [2019-11-28 00:22:51,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:51,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585096848] [2019-11-28 00:22:51,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:51,919 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-28 00:22:51,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585096848] [2019-11-28 00:22:51,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:51,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:22:51,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091276320] [2019-11-28 00:22:51,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:51,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:51,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:51,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:51,922 INFO L87 Difference]: Start difference. First operand 206 states and 290 transitions. Second operand 5 states. [2019-11-28 00:22:52,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:52,086 INFO L93 Difference]: Finished difference Result 438 states and 630 transitions. [2019-11-28 00:22:52,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:22:52,087 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 00:22:52,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:52,090 INFO L225 Difference]: With dead ends: 438 [2019-11-28 00:22:52,090 INFO L226 Difference]: Without dead ends: 436 [2019-11-28 00:22:52,091 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-28 00:22:52,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-11-28 00:22:52,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 206. [2019-11-28 00:22:52,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-28 00:22:52,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 288 transitions. [2019-11-28 00:22:52,130 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 288 transitions. Word has length 26 [2019-11-28 00:22:52,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:52,132 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 288 transitions. [2019-11-28 00:22:52,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:22:52,132 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 288 transitions. [2019-11-28 00:22:52,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 00:22:52,139 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:52,140 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:22:52,142 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:52,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:52,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1756729668, now seen corresponding path program 1 times [2019-11-28 00:22:52,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:52,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847700099] [2019-11-28 00:22:52,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:52,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:52,206 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-28 00:22:52,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847700099] [2019-11-28 00:22:52,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:52,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:22:52,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942138098] [2019-11-28 00:22:52,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:52,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:52,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:52,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:52,208 INFO L87 Difference]: Start difference. First operand 206 states and 288 transitions. Second operand 5 states. [2019-11-28 00:22:52,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:52,324 INFO L93 Difference]: Finished difference Result 577 states and 799 transitions. [2019-11-28 00:22:52,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:22:52,326 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-28 00:22:52,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:52,330 INFO L225 Difference]: With dead ends: 577 [2019-11-28 00:22:52,330 INFO L226 Difference]: Without dead ends: 377 [2019-11-28 00:22:52,333 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:22:52,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-11-28 00:22:52,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 224. [2019-11-28 00:22:52,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-11-28 00:22:52,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 306 transitions. [2019-11-28 00:22:52,363 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 306 transitions. Word has length 31 [2019-11-28 00:22:52,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:52,366 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 306 transitions. [2019-11-28 00:22:52,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:22:52,367 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 306 transitions. [2019-11-28 00:22:52,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 00:22:52,375 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:52,376 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:22:52,376 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:52,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:52,377 INFO L82 PathProgramCache]: Analyzing trace with hash 2145210618, now seen corresponding path program 1 times [2019-11-28 00:22:52,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:52,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671584730] [2019-11-28 00:22:52,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:52,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:52,488 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-28 00:22:52,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671584730] [2019-11-28 00:22:52,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:52,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:22:52,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726634280] [2019-11-28 00:22:52,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:52,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:52,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:52,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:52,490 INFO L87 Difference]: Start difference. First operand 224 states and 306 transitions. Second operand 5 states. [2019-11-28 00:22:52,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:52,625 INFO L93 Difference]: Finished difference Result 555 states and 749 transitions. [2019-11-28 00:22:52,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:22:52,627 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-28 00:22:52,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:52,630 INFO L225 Difference]: With dead ends: 555 [2019-11-28 00:22:52,631 INFO L226 Difference]: Without dead ends: 337 [2019-11-28 00:22:52,633 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 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-28 00:22:52,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-11-28 00:22:52,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 193. [2019-11-28 00:22:52,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-11-28 00:22:52,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 258 transitions. [2019-11-28 00:22:52,657 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 258 transitions. Word has length 31 [2019-11-28 00:22:52,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:52,658 INFO L462 AbstractCegarLoop]: Abstraction has 193 states and 258 transitions. [2019-11-28 00:22:52,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:22:52,658 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 258 transitions. [2019-11-28 00:22:52,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 00:22:52,659 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:52,659 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:22:52,660 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:52,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:52,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1891591240, now seen corresponding path program 1 times [2019-11-28 00:22:52,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:52,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881472417] [2019-11-28 00:22:52,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:52,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:52,724 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-28 00:22:52,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881472417] [2019-11-28 00:22:52,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:52,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:22:52,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435704549] [2019-11-28 00:22:52,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:52,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:52,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:52,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:52,728 INFO L87 Difference]: Start difference. First operand 193 states and 258 transitions. Second operand 5 states. [2019-11-28 00:22:52,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:52,894 INFO L93 Difference]: Finished difference Result 534 states and 732 transitions. [2019-11-28 00:22:52,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:22:52,895 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-28 00:22:52,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:52,898 INFO L225 Difference]: With dead ends: 534 [2019-11-28 00:22:52,898 INFO L226 Difference]: Without dead ends: 397 [2019-11-28 00:22:52,899 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-11-28 00:22:52,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-28 00:22:52,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 278. [2019-11-28 00:22:52,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-11-28 00:22:52,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 367 transitions. [2019-11-28 00:22:52,940 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 367 transitions. Word has length 31 [2019-11-28 00:22:52,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:52,941 INFO L462 AbstractCegarLoop]: Abstraction has 278 states and 367 transitions. [2019-11-28 00:22:52,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:22:52,941 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 367 transitions. [2019-11-28 00:22:52,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-28 00:22:52,943 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:52,944 INFO L410 BasicCegarLoop]: trace histogram [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-28 00:22:52,945 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:52,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:52,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1736126716, now seen corresponding path program 1 times [2019-11-28 00:22:52,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:52,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534132508] [2019-11-28 00:22:52,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:52,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:53,040 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 00:22:53,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534132508] [2019-11-28 00:22:53,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:53,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:22:53,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939964896] [2019-11-28 00:22:53,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:22:53,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:53,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:22:53,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:22:53,047 INFO L87 Difference]: Start difference. First operand 278 states and 367 transitions. Second operand 3 states. [2019-11-28 00:22:53,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:53,158 INFO L93 Difference]: Finished difference Result 344 states and 454 transitions. [2019-11-28 00:22:53,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:22:53,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-11-28 00:22:53,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:53,162 INFO L225 Difference]: With dead ends: 344 [2019-11-28 00:22:53,162 INFO L226 Difference]: Without dead ends: 139 [2019-11-28 00:22:53,163 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:22:53,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-11-28 00:22:53,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-11-28 00:22:53,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-11-28 00:22:53,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 175 transitions. [2019-11-28 00:22:53,183 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 175 transitions. Word has length 48 [2019-11-28 00:22:53,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:53,184 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 175 transitions. [2019-11-28 00:22:53,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:22:53,184 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 175 transitions. [2019-11-28 00:22:53,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 00:22:53,186 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:53,186 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] [2019-11-28 00:22:53,186 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:53,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:53,187 INFO L82 PathProgramCache]: Analyzing trace with hash -2038322788, now seen corresponding path program 1 times [2019-11-28 00:22:53,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:53,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468476749] [2019-11-28 00:22:53,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:53,270 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-28 00:22:53,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468476749] [2019-11-28 00:22:53,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164880596] [2019-11-28 00:22:53,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 00:22:53,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:53,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 00:22:53,439 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:22:53,490 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-28 00:22:53,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:22:53,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-11-28 00:22:53,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101235055] [2019-11-28 00:22:53,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:22:53,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:53,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:22:53,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:22:53,493 INFO L87 Difference]: Start difference. First operand 139 states and 175 transitions. Second operand 6 states. [2019-11-28 00:22:53,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:53,721 INFO L93 Difference]: Finished difference Result 431 states and 556 transitions. [2019-11-28 00:22:53,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:22:53,722 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2019-11-28 00:22:53,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:53,724 INFO L225 Difference]: With dead ends: 431 [2019-11-28 00:22:53,725 INFO L226 Difference]: Without dead ends: 322 [2019-11-28 00:22:53,726 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 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-11-28 00:22:53,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-11-28 00:22:53,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 191. [2019-11-28 00:22:53,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-11-28 00:22:53,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 243 transitions. [2019-11-28 00:22:53,754 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 243 transitions. Word has length 50 [2019-11-28 00:22:53,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:53,754 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 243 transitions. [2019-11-28 00:22:53,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:22:53,755 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 243 transitions. [2019-11-28 00:22:53,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-28 00:22:53,756 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:53,756 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] [2019-11-28 00:22:53,962 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:22:53,963 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:53,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:53,963 INFO L82 PathProgramCache]: Analyzing trace with hash 564554040, now seen corresponding path program 2 times [2019-11-28 00:22:53,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:53,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640014132] [2019-11-28 00:22:53,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:54,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:22:54,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:22:54,210 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 00:22:54,211 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 00:22:54,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:22:54 BoogieIcfgContainer [2019-11-28 00:22:54,366 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:22:54,367 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:22:54,367 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:22:54,367 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:22:54,367 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:22:50" (3/4) ... [2019-11-28 00:22:54,370 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 00:22:54,516 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:22:54,516 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:22:54,519 INFO L168 Benchmark]: Toolchain (without parser) took 6044.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.1 MB). Free memory was 960.4 MB in the beginning and 987.4 MB in the end (delta: -27.1 MB). Peak memory consumption was 147.0 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:54,519 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:22:54,520 INFO L168 Benchmark]: CACSL2BoogieTranslator took 770.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 83.9 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -103.4 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:54,520 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.12 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: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:54,520 INFO L168 Benchmark]: Boogie Preprocessor took 66.05 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:22:54,521 INFO L168 Benchmark]: RCFGBuilder took 1033.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 987.1 MB in the end (delta: 69.6 MB). Peak memory consumption was 69.6 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:54,521 INFO L168 Benchmark]: TraceAbstraction took 3939.65 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 90.2 MB). Free memory was 987.1 MB in the beginning and 1.0 GB in the end (delta: -26.0 MB). Peak memory consumption was 64.2 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:54,522 INFO L168 Benchmark]: Witness Printer took 149.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 987.4 MB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:54,524 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 770.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 83.9 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -103.4 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 77.12 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: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 66.05 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1033.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 987.1 MB in the end (delta: 69.6 MB). Peak memory consumption was 69.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3939.65 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 90.2 MB). Free memory was 987.1 MB in the beginning and 1.0 GB in the end (delta: -26.0 MB). Peak memory consumption was 64.2 MB. Max. memory is 11.5 GB. * Witness Printer took 149.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 987.4 MB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 722]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L247] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L524] int pumpRunning = 0; [L525] int systemActive = 1; [L728] int waterLevel = 1; [L729] int methaneLevelCritical = 0; [L822] int cleanupTimeShifts = 4; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L895] int retValue_acc ; [L896] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L69] int retValue_acc ; [L72] retValue_acc = 1 [L73] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L902] tmp = valid_product() [L904] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L450] int splverifierCounter ; [L451] int tmp ; [L452] int tmp___0 ; [L453] int tmp___1 ; [L454] int tmp___2 ; [L457] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L459] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L461] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L467] tmp = __VERIFIER_nondet_int() [L469] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L746] COND TRUE waterLevel < 2 [L747] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L477] tmp___0 = __VERIFIER_nondet_int() [L479] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L487] tmp___2 = __VERIFIER_nondet_int() [L489] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L532] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L539] COND TRUE \read(systemActive) [L587] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L590] COND FALSE !(\read(pumpRunning)) [L561] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L564] COND TRUE ! pumpRunning [L684] int retValue_acc ; [L685] int tmp ; [L686] int tmp___0 ; [L808] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L811] COND FALSE !(waterLevel < 2) [L815] retValue_acc = 0 [L816] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L690] tmp = isHighWaterSensorDry() [L692] COND FALSE !(\read(tmp)) [L695] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L697] retValue_acc = tmp___0 [L698] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L566] tmp = isHighWaterLevel() [L568] COND TRUE \read(tmp) [L615] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L919] int tmp ; [L920] int tmp___0 ; [L799] int retValue_acc ; [L802] retValue_acc = waterLevel [L803] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L924] tmp = getWaterLevel() [L926] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L459] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L461] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L467] tmp = __VERIFIER_nondet_int() [L469] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L477] tmp___0 = __VERIFIER_nondet_int() [L479] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L487] tmp___2 = __VERIFIER_nondet_int() [L489] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L532] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L734] COND TRUE waterLevel > 0 [L735] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L539] COND TRUE \read(systemActive) [L587] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L590] COND TRUE \read(pumpRunning) [L628] int retValue_acc ; [L767] int retValue_acc ; [L770] retValue_acc = methaneLevelCritical [L771] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L632] retValue_acc = isMethaneLevelCritical() [L634] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L592] tmp = isMethaneAlarm() [L594] COND FALSE !(\read(tmp)) [L561] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L564] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L919] int tmp ; [L920] int tmp___0 ; [L799] int retValue_acc ; [L802] retValue_acc = waterLevel [L803] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L924] tmp = getWaterLevel() [L926] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L459] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L461] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L467] tmp = __VERIFIER_nondet_int() [L469] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L477] tmp___0 = __VERIFIER_nondet_int() [L479] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L487] tmp___2 = __VERIFIER_nondet_int() [L489] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L532] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L734] COND TRUE waterLevel > 0 [L735] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L539] COND TRUE \read(systemActive) [L587] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L590] COND TRUE \read(pumpRunning) [L628] int retValue_acc ; [L767] int retValue_acc ; [L770] retValue_acc = methaneLevelCritical [L771] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L632] retValue_acc = isMethaneLevelCritical() [L634] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L592] tmp = isMethaneAlarm() [L594] COND FALSE !(\read(tmp)) [L561] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L564] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L919] int tmp ; [L920] int tmp___0 ; [L799] int retValue_acc ; [L802] retValue_acc = waterLevel [L803] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L924] tmp = getWaterLevel() [L926] COND TRUE tmp == 0 [L639] int retValue_acc ; [L642] retValue_acc = pumpRunning [L643] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L928] tmp___0 = isPumpRunning() [L930] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L722] __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, 113 locations, 3 error locations. Result: UNSAFE, OverallTime: 3.7s, OverallIterations: 12, TraceHistogramMax: 3, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1097 SDtfs, 1413 SDslu, 1666 SDs, 0 SdLazy, 254 SolverSat, 65 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 121 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=278occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 899 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 440 NumberOfCodeBlocks, 440 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 359 ConstructedInterpolants, 0 QuantifiedInterpolants, 23327 SizeOfPredicates, 4 NumberOfNonLiveVariables, 394 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 35/41 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...