./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product43.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f6fb2bb1 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_spec1_product43.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 63b48aee14c7431a4aa25f8de4f2dd8129d50ad4 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-f6fb2bb [2019-11-19 18:56:59,169 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 18:56:59,172 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 18:56:59,185 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 18:56:59,186 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 18:56:59,187 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 18:56:59,189 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 18:56:59,191 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 18:56:59,192 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 18:56:59,193 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 18:56:59,195 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 18:56:59,196 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 18:56:59,196 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 18:56:59,197 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 18:56:59,198 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 18:56:59,200 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 18:56:59,201 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 18:56:59,202 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 18:56:59,204 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 18:56:59,206 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 18:56:59,208 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 18:56:59,209 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 18:56:59,211 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 18:56:59,212 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 18:56:59,214 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 18:56:59,215 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 18:56:59,215 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 18:56:59,216 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 18:56:59,216 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 18:56:59,217 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 18:56:59,218 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 18:56:59,219 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 18:56:59,219 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 18:56:59,220 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 18:56:59,222 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 18:56:59,222 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 18:56:59,223 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 18:56:59,223 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 18:56:59,223 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 18:56:59,225 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 18:56:59,226 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 18:56:59,226 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 18:56:59,243 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 18:56:59,243 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 18:56:59,245 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 18:56:59,245 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 18:56:59,246 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 18:56:59,246 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 18:56:59,246 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 18:56:59,247 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 18:56:59,247 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 18:56:59,247 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 18:56:59,247 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 18:56:59,248 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 18:56:59,248 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 18:56:59,248 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 18:56:59,249 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 18:56:59,249 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 18:56:59,249 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 18:56:59,250 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 18:56:59,250 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 18:56:59,250 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 18:56:59,250 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 18:56:59,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 18:56:59,251 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 18:56:59,251 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 18:56:59,252 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 18:56:59,252 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 18:56:59,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 18:56:59,253 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 18:56:59,253 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 -> 63b48aee14c7431a4aa25f8de4f2dd8129d50ad4 [2019-11-19 18:56:59,643 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 18:56:59,659 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 18:56:59,663 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 18:56:59,665 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 18:56:59,665 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 18:56:59,666 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product43.cil.c [2019-11-19 18:56:59,744 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f27517422/17740ef958e544a0bfb3dccfa5677867/FLAG9b79660d4 [2019-11-19 18:57:00,327 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 18:57:00,328 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product43.cil.c [2019-11-19 18:57:00,353 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f27517422/17740ef958e544a0bfb3dccfa5677867/FLAG9b79660d4 [2019-11-19 18:57:00,578 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f27517422/17740ef958e544a0bfb3dccfa5677867 [2019-11-19 18:57:00,581 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 18:57:00,582 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 18:57:00,585 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 18:57:00,585 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 18:57:00,589 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 18:57:00,590 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:57:00" (1/1) ... [2019-11-19 18:57:00,593 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77aebe68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:00, skipping insertion in model container [2019-11-19 18:57:00,594 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:57:00" (1/1) ... [2019-11-19 18:57:00,603 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 18:57:00,673 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 18:57:01,112 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 18:57:01,142 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 18:57:01,279 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 18:57:01,321 INFO L192 MainTranslator]: Completed translation [2019-11-19 18:57:01,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:01 WrapperNode [2019-11-19 18:57:01,322 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 18:57:01,323 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 18:57:01,323 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 18:57:01,323 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 18:57:01,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:01" (1/1) ... [2019-11-19 18:57:01,353 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:01" (1/1) ... [2019-11-19 18:57:01,397 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 18:57:01,398 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 18:57:01,398 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 18:57:01,398 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 18:57:01,409 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:01" (1/1) ... [2019-11-19 18:57:01,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:01" (1/1) ... [2019-11-19 18:57:01,414 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:01" (1/1) ... [2019-11-19 18:57:01,414 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:01" (1/1) ... [2019-11-19 18:57:01,426 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:01" (1/1) ... [2019-11-19 18:57:01,439 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:01" (1/1) ... [2019-11-19 18:57:01,442 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:01" (1/1) ... [2019-11-19 18:57:01,447 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 18:57:01,447 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 18:57:01,448 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 18:57:01,448 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 18:57:01,449 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:01" (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-19 18:57:01,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 18:57:01,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-19 18:57:01,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 18:57:01,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 18:57:02,367 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 18:57:02,368 INFO L285 CfgBuilder]: Removed 118 assume(true) statements. [2019-11-19 18:57:02,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:57:02 BoogieIcfgContainer [2019-11-19 18:57:02,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 18:57:02,373 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 18:57:02,373 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 18:57:02,385 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 18:57:02,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:57:00" (1/3) ... [2019-11-19 18:57:02,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69934f18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:57:02, skipping insertion in model container [2019-11-19 18:57:02,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:01" (2/3) ... [2019-11-19 18:57:02,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69934f18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:57:02, skipping insertion in model container [2019-11-19 18:57:02,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:57:02" (3/3) ... [2019-11-19 18:57:02,396 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product43.cil.c [2019-11-19 18:57:02,421 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 18:57:02,441 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-19 18:57:02,470 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-19 18:57:02,494 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 18:57:02,495 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 18:57:02,495 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 18:57:02,495 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 18:57:02,495 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 18:57:02,495 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 18:57:02,496 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 18:57:02,496 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 18:57:02,514 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2019-11-19 18:57:02,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-19 18:57:02,521 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:57:02,523 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:57:02,523 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:57:02,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:57:02,531 INFO L82 PathProgramCache]: Analyzing trace with hash 929673937, now seen corresponding path program 1 times [2019-11-19 18:57:02,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:57:02,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981687704] [2019-11-19 18:57:02,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:57:02,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:57:02,847 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-19 18:57:02,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981687704] [2019-11-19 18:57:02,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:57:02,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 18:57:02,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261303033] [2019-11-19 18:57:02,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-19 18:57:02,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:57:02,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-19 18:57:02,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 18:57:02,871 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 2 states. [2019-11-19 18:57:02,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:57:02,922 INFO L93 Difference]: Finished difference Result 172 states and 257 transitions. [2019-11-19 18:57:02,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-19 18:57:02,924 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-19 18:57:02,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:57:02,937 INFO L225 Difference]: With dead ends: 172 [2019-11-19 18:57:02,937 INFO L226 Difference]: Without dead ends: 85 [2019-11-19 18:57:02,942 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-19 18:57:02,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-19 18:57:02,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-11-19 18:57:02,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-19 18:57:02,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 120 transitions. [2019-11-19 18:57:02,987 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 120 transitions. Word has length 16 [2019-11-19 18:57:02,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:57:02,987 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 120 transitions. [2019-11-19 18:57:02,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-19 18:57:02,987 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 120 transitions. [2019-11-19 18:57:02,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-19 18:57:02,989 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:57:02,989 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:57:02,989 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:57:02,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:57:02,990 INFO L82 PathProgramCache]: Analyzing trace with hash -117082960, now seen corresponding path program 1 times [2019-11-19 18:57:02,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:57:02,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284670267] [2019-11-19 18:57:02,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:57:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:57:03,123 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-19 18:57:03,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284670267] [2019-11-19 18:57:03,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:57:03,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:57:03,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070296475] [2019-11-19 18:57:03,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:57:03,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:57:03,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:57:03,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:57:03,128 INFO L87 Difference]: Start difference. First operand 85 states and 120 transitions. Second operand 3 states. [2019-11-19 18:57:03,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:57:03,140 INFO L93 Difference]: Finished difference Result 85 states and 120 transitions. [2019-11-19 18:57:03,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:57:03,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-19 18:57:03,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:57:03,142 INFO L225 Difference]: With dead ends: 85 [2019-11-19 18:57:03,142 INFO L226 Difference]: Without dead ends: 39 [2019-11-19 18:57:03,143 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-19 18:57:03,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-19 18:57:03,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-11-19 18:57:03,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-19 18:57:03,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2019-11-19 18:57:03,150 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 17 [2019-11-19 18:57:03,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:57:03,151 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2019-11-19 18:57:03,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:57:03,151 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2019-11-19 18:57:03,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-19 18:57:03,152 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:57:03,152 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-19 18:57:03,153 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:57:03,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:57:03,153 INFO L82 PathProgramCache]: Analyzing trace with hash 337421565, now seen corresponding path program 1 times [2019-11-19 18:57:03,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:57:03,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160576666] [2019-11-19 18:57:03,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:57:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:57:03,326 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-19 18:57:03,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160576666] [2019-11-19 18:57:03,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:57:03,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 18:57:03,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804446560] [2019-11-19 18:57:03,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 18:57:03,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:57:03,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 18:57:03,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-19 18:57:03,330 INFO L87 Difference]: Start difference. First operand 39 states and 55 transitions. Second operand 6 states. [2019-11-19 18:57:03,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:57:03,510 INFO L93 Difference]: Finished difference Result 128 states and 187 transitions. [2019-11-19 18:57:03,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 18:57:03,511 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-11-19 18:57:03,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:57:03,512 INFO L225 Difference]: With dead ends: 128 [2019-11-19 18:57:03,512 INFO L226 Difference]: Without dead ends: 95 [2019-11-19 18:57:03,513 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-19 18:57:03,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-19 18:57:03,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 58. [2019-11-19 18:57:03,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-19 18:57:03,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 84 transitions. [2019-11-19 18:57:03,530 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 84 transitions. Word has length 22 [2019-11-19 18:57:03,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:57:03,533 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 84 transitions. [2019-11-19 18:57:03,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 18:57:03,533 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 84 transitions. [2019-11-19 18:57:03,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-19 18:57:03,534 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:57:03,534 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] [2019-11-19 18:57:03,536 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:57:03,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:57:03,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1224569535, now seen corresponding path program 1 times [2019-11-19 18:57:03,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:57:03,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705847674] [2019-11-19 18:57:03,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:57:03,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:57:03,635 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-19 18:57:03,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705847674] [2019-11-19 18:57:03,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:57:03,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 18:57:03,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712906558] [2019-11-19 18:57:03,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:57:03,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:57:03,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:57:03,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:57:03,640 INFO L87 Difference]: Start difference. First operand 58 states and 84 transitions. Second operand 3 states. [2019-11-19 18:57:03,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:57:03,704 INFO L93 Difference]: Finished difference Result 131 states and 192 transitions. [2019-11-19 18:57:03,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:57:03,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-19 18:57:03,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:57:03,710 INFO L225 Difference]: With dead ends: 131 [2019-11-19 18:57:03,710 INFO L226 Difference]: Without dead ends: 79 [2019-11-19 18:57:03,711 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-19 18:57:03,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-19 18:57:03,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2019-11-19 18:57:03,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-19 18:57:03,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 109 transitions. [2019-11-19 18:57:03,734 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 109 transitions. Word has length 23 [2019-11-19 18:57:03,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:57:03,734 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 109 transitions. [2019-11-19 18:57:03,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:57:03,735 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 109 transitions. [2019-11-19 18:57:03,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-19 18:57:03,737 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:57:03,737 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:57:03,737 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:57:03,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:57:03,738 INFO L82 PathProgramCache]: Analyzing trace with hash -840484654, now seen corresponding path program 1 times [2019-11-19 18:57:03,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:57:03,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425250549] [2019-11-19 18:57:03,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:57:03,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:57:03,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:57:03,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425250549] [2019-11-19 18:57:03,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:57:03,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:57:03,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803050824] [2019-11-19 18:57:03,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 18:57:03,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:57:03,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 18:57:03,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:57:03,845 INFO L87 Difference]: Start difference. First operand 77 states and 109 transitions. Second operand 5 states. [2019-11-19 18:57:03,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:57:03,979 INFO L93 Difference]: Finished difference Result 371 states and 539 transitions. [2019-11-19 18:57:03,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 18:57:03,982 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-19 18:57:03,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:57:03,985 INFO L225 Difference]: With dead ends: 371 [2019-11-19 18:57:03,989 INFO L226 Difference]: Without dead ends: 300 [2019-11-19 18:57:03,992 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-19 18:57:03,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-19 18:57:04,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 140. [2019-11-19 18:57:04,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-19 18:57:04,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 196 transitions. [2019-11-19 18:57:04,044 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 196 transitions. Word has length 25 [2019-11-19 18:57:04,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:57:04,045 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 196 transitions. [2019-11-19 18:57:04,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 18:57:04,046 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 196 transitions. [2019-11-19 18:57:04,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-19 18:57:04,049 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:57:04,049 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-19 18:57:04,050 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:57:04,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:57:04,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1044291748, now seen corresponding path program 1 times [2019-11-19 18:57:04,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:57:04,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035666965] [2019-11-19 18:57:04,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:57:04,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:57:04,150 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-19 18:57:04,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035666965] [2019-11-19 18:57:04,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:57:04,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:57:04,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693545420] [2019-11-19 18:57:04,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 18:57:04,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:57:04,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 18:57:04,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:57:04,155 INFO L87 Difference]: Start difference. First operand 140 states and 196 transitions. Second operand 5 states. [2019-11-19 18:57:04,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:57:04,303 INFO L93 Difference]: Finished difference Result 392 states and 553 transitions. [2019-11-19 18:57:04,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 18:57:04,304 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-19 18:57:04,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:57:04,307 INFO L225 Difference]: With dead ends: 392 [2019-11-19 18:57:04,307 INFO L226 Difference]: Without dead ends: 390 [2019-11-19 18:57:04,309 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-19 18:57:04,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-11-19 18:57:04,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 140. [2019-11-19 18:57:04,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-19 18:57:04,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 194 transitions. [2019-11-19 18:57:04,344 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 194 transitions. Word has length 26 [2019-11-19 18:57:04,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:57:04,345 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 194 transitions. [2019-11-19 18:57:04,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 18:57:04,346 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 194 transitions. [2019-11-19 18:57:04,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-19 18:57:04,353 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:57:04,354 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:57:04,359 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:57:04,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:57:04,360 INFO L82 PathProgramCache]: Analyzing trace with hash 895513141, now seen corresponding path program 1 times [2019-11-19 18:57:04,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:57:04,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313107458] [2019-11-19 18:57:04,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:57:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:57:04,436 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-19 18:57:04,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313107458] [2019-11-19 18:57:04,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:57:04,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 18:57:04,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176535776] [2019-11-19 18:57:04,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 18:57:04,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:57:04,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 18:57:04,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:57:04,446 INFO L87 Difference]: Start difference. First operand 140 states and 194 transitions. Second operand 5 states. [2019-11-19 18:57:04,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:57:04,520 INFO L93 Difference]: Finished difference Result 426 states and 588 transitions. [2019-11-19 18:57:04,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 18:57:04,521 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-11-19 18:57:04,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:57:04,524 INFO L225 Difference]: With dead ends: 426 [2019-11-19 18:57:04,524 INFO L226 Difference]: Without dead ends: 292 [2019-11-19 18:57:04,528 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-19 18:57:04,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-11-19 18:57:04,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 146. [2019-11-19 18:57:04,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-19 18:57:04,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 200 transitions. [2019-11-19 18:57:04,559 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 200 transitions. Word has length 33 [2019-11-19 18:57:04,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:57:04,562 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 200 transitions. [2019-11-19 18:57:04,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 18:57:04,562 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 200 transitions. [2019-11-19 18:57:04,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-19 18:57:04,567 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:57:04,568 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:57:04,568 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:57:04,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:57:04,569 INFO L82 PathProgramCache]: Analyzing trace with hash 308707127, now seen corresponding path program 1 times [2019-11-19 18:57:04,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:57:04,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385918965] [2019-11-19 18:57:04,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:57:04,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:57:04,634 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-19 18:57:04,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385918965] [2019-11-19 18:57:04,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:57:04,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-19 18:57:04,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325766833] [2019-11-19 18:57:04,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 18:57:04,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:57:04,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 18:57:04,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-19 18:57:04,637 INFO L87 Difference]: Start difference. First operand 146 states and 200 transitions. Second operand 6 states. [2019-11-19 18:57:04,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:57:04,733 INFO L93 Difference]: Finished difference Result 444 states and 606 transitions. [2019-11-19 18:57:04,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 18:57:04,734 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-11-19 18:57:04,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:57:04,736 INFO L225 Difference]: With dead ends: 444 [2019-11-19 18:57:04,736 INFO L226 Difference]: Without dead ends: 304 [2019-11-19 18:57:04,738 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-19 18:57:04,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-11-19 18:57:04,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 150. [2019-11-19 18:57:04,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-19 18:57:04,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 204 transitions. [2019-11-19 18:57:04,761 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 204 transitions. Word has length 33 [2019-11-19 18:57:04,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:57:04,762 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 204 transitions. [2019-11-19 18:57:04,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 18:57:04,763 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 204 transitions. [2019-11-19 18:57:04,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-19 18:57:04,764 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:57:04,764 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:57:04,765 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:57:04,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:57:04,765 INFO L82 PathProgramCache]: Analyzing trace with hash -971156551, now seen corresponding path program 1 times [2019-11-19 18:57:04,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:57:04,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129720693] [2019-11-19 18:57:04,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:57:04,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:57:04,821 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-19 18:57:04,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129720693] [2019-11-19 18:57:04,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:57:04,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 18:57:04,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389164451] [2019-11-19 18:57:04,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:57:04,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:57:04,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:57:04,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:57:04,824 INFO L87 Difference]: Start difference. First operand 150 states and 204 transitions. Second operand 3 states. [2019-11-19 18:57:04,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:57:04,885 INFO L93 Difference]: Finished difference Result 380 states and 516 transitions. [2019-11-19 18:57:04,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:57:04,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-19 18:57:04,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:57:04,888 INFO L225 Difference]: With dead ends: 380 [2019-11-19 18:57:04,889 INFO L226 Difference]: Without dead ends: 236 [2019-11-19 18:57:04,890 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-19 18:57:04,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-11-19 18:57:04,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2019-11-19 18:57:04,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-11-19 18:57:04,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 312 transitions. [2019-11-19 18:57:04,925 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 312 transitions. Word has length 33 [2019-11-19 18:57:04,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:57:04,925 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 312 transitions. [2019-11-19 18:57:04,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:57:04,926 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 312 transitions. [2019-11-19 18:57:04,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-19 18:57:04,928 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:57:04,928 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:57:04,929 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:57:04,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:57:04,929 INFO L82 PathProgramCache]: Analyzing trace with hash 186139387, now seen corresponding path program 1 times [2019-11-19 18:57:04,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:57:04,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903592693] [2019-11-19 18:57:04,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:57:04,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:57:05,043 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-19 18:57:05,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903592693] [2019-11-19 18:57:05,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:57:05,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-19 18:57:05,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099059377] [2019-11-19 18:57:05,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 18:57:05,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:57:05,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 18:57:05,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-19 18:57:05,051 INFO L87 Difference]: Start difference. First operand 236 states and 312 transitions. Second operand 8 states. [2019-11-19 18:57:05,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:57:05,493 INFO L93 Difference]: Finished difference Result 874 states and 1160 transitions. [2019-11-19 18:57:05,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-19 18:57:05,493 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-11-19 18:57:05,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:57:05,498 INFO L225 Difference]: With dead ends: 874 [2019-11-19 18:57:05,498 INFO L226 Difference]: Without dead ends: 644 [2019-11-19 18:57:05,499 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2019-11-19 18:57:05,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2019-11-19 18:57:05,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 236. [2019-11-19 18:57:05,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-11-19 18:57:05,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 306 transitions. [2019-11-19 18:57:05,535 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 306 transitions. Word has length 34 [2019-11-19 18:57:05,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:57:05,537 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 306 transitions. [2019-11-19 18:57:05,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 18:57:05,537 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 306 transitions. [2019-11-19 18:57:05,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-19 18:57:05,539 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:57:05,540 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-19 18:57:05,540 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:57:05,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:57:05,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1466712466, now seen corresponding path program 1 times [2019-11-19 18:57:05,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:57:05,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483075317] [2019-11-19 18:57:05,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:57:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 18:57:06,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 18:57:06,377 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 18:57:06,377 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 18:57:06,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:57:06 BoogieIcfgContainer [2019-11-19 18:57:06,527 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 18:57:06,527 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 18:57:06,527 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 18:57:06,528 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 18:57:06,528 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:57:02" (3/4) ... [2019-11-19 18:57:06,531 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-19 18:57:06,690 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 18:57:06,690 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 18:57:06,693 INFO L168 Benchmark]: Toolchain (without parser) took 6109.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 957.7 MB in the beginning and 860.3 MB in the end (delta: 97.4 MB). Peak memory consumption was 256.8 MB. Max. memory is 11.5 GB. [2019-11-19 18:57:06,693 INFO L168 Benchmark]: CDTParser took 0.30 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-19 18:57:06,694 INFO L168 Benchmark]: CACSL2BoogieTranslator took 737.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 55.1 MB). Free memory was 957.7 MB in the beginning and 1.0 GB in the end (delta: -76.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2019-11-19 18:57:06,695 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-11-19 18:57:06,695 INFO L168 Benchmark]: Boogie Preprocessor took 49.48 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 18:57:06,696 INFO L168 Benchmark]: RCFGBuilder took 923.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 971.6 MB in the end (delta: 55.7 MB). Peak memory consumption was 55.7 MB. Max. memory is 11.5 GB. [2019-11-19 18:57:06,696 INFO L168 Benchmark]: TraceAbstraction took 4154.11 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 104.3 MB). Free memory was 971.6 MB in the beginning and 877.9 MB in the end (delta: 93.7 MB). Peak memory consumption was 198.1 MB. Max. memory is 11.5 GB. [2019-11-19 18:57:06,697 INFO L168 Benchmark]: Witness Printer took 162.65 ms. Allocated memory is still 1.2 GB. Free memory was 877.9 MB in the beginning and 860.3 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2019-11-19 18:57:06,699 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.30 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 737.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 55.1 MB). Free memory was 957.7 MB in the beginning and 1.0 GB in the end (delta: -76.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.48 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 923.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 971.6 MB in the end (delta: 55.7 MB). Peak memory consumption was 55.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4154.11 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 104.3 MB). Free memory was 971.6 MB in the beginning and 877.9 MB in the end (delta: 93.7 MB). Peak memory consumption was 198.1 MB. Max. memory is 11.5 GB. * Witness Printer took 162.65 ms. Allocated memory is still 1.2 GB. Free memory was 877.9 MB in the beginning and 860.3 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 405]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L47] int waterLevel = 1; [L48] int methaneLevelCritical = 0; [L147] int pumpRunning = 0; [L148] int systemActive = 1; [L436] int cleanupTimeShifts = 4; [L704] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L512] int retValue_acc ; [L513] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L927] int retValue_acc ; [L930] retValue_acc = 1 [L931] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L519] tmp = valid_product() [L521] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L335] int splverifierCounter ; [L336] int tmp ; [L337] int tmp___0 ; [L338] int tmp___1 ; [L339] int tmp___2 ; [L342] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L344] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L346] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L352] tmp = __VERIFIER_nondet_int() [L354] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L65] COND TRUE waterLevel < 2 [L66] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L362] tmp___0 = __VERIFIER_nondet_int() [L364] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L372] tmp___2 = __VERIFIER_nondet_int() [L374] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L155] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L162] COND TRUE \read(systemActive) [L184] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L187] COND TRUE ! pumpRunning [L299] int retValue_acc ; [L300] int tmp ; [L301] int tmp___0 ; [L127] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L130] COND FALSE !(waterLevel < 2) [L134] retValue_acc = 0 [L135] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L305] tmp = isHighWaterSensorDry() [L307] COND FALSE !(\read(tmp)) [L310] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L312] retValue_acc = tmp___0 [L313] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L189] tmp = isHighWaterLevel() [L191] COND TRUE \read(tmp) [L218] int tmp ; [L243] int retValue_acc ; [L86] int retValue_acc ; [L89] retValue_acc = methaneLevelCritical [L90] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L247] retValue_acc = isMethaneLevelCritical() [L249] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L222] tmp = isMethaneAlarm() [L224] COND FALSE !(\read(tmp)) [L212] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L411] int tmp ; [L412] int tmp___0 ; [L86] int retValue_acc ; [L89] retValue_acc = methaneLevelCritical [L90] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L416] tmp = isMethaneLevelCritical() [L418] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L344] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L346] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L352] tmp = __VERIFIER_nondet_int() [L354] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L362] tmp___0 = __VERIFIER_nondet_int() [L364] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L77] COND FALSE !(\read(methaneLevelCritical)) [L80] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L372] tmp___2 = __VERIFIER_nondet_int() [L374] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L155] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L53] COND TRUE waterLevel > 0 [L54] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L162] COND TRUE \read(systemActive) [L184] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L187] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L411] int tmp ; [L412] int tmp___0 ; [L86] int retValue_acc ; [L89] retValue_acc = methaneLevelCritical [L90] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L416] tmp = isMethaneLevelCritical() [L418] COND TRUE \read(tmp) [L254] int retValue_acc ; [L257] retValue_acc = pumpRunning [L258] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L420] tmp___0 = isPumpRunning() [L422] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L405] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 89 locations, 3 error locations. Result: UNSAFE, OverallTime: 4.0s, OverallIterations: 11, TraceHistogramMax: 2, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 870 SDtfs, 1375 SDslu, 1757 SDs, 0 SdLazy, 219 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=236occurred 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.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 1157 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 311 NumberOfCodeBlocks, 311 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 252 ConstructedInterpolants, 0 QuantifiedInterpolants, 13787 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 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...