./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product52.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_spec1_product52.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 eb59a6e6bbeea05d6faf844d6f750609a5360ad9 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:20:23,334 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:20:23,337 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:20:23,354 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:20:23,355 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:20:23,357 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:20:23,359 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:20:23,372 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:20:23,374 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:20:23,377 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:20:23,378 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:20:23,381 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:20:23,381 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:20:23,386 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:20:23,387 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:20:23,389 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:20:23,391 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:20:23,394 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:20:23,397 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:20:23,402 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:20:23,407 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:20:23,413 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:20:23,415 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:20:23,417 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:20:23,421 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:20:23,422 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:20:23,422 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:20:23,424 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:20:23,424 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:20:23,425 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:20:23,425 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:20:23,426 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:20:23,427 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:20:23,428 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:20:23,430 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:20:23,430 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:20:23,431 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:20:23,431 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:20:23,432 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:20:23,433 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:20:23,434 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:20:23,435 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:20:23,459 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:20:23,460 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:20:23,463 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:20:23,464 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:20:23,464 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:20:23,464 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:20:23,465 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:20:23,465 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:20:23,465 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:20:23,465 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:20:23,466 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:20:23,467 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:20:23,467 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:20:23,467 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:20:23,468 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:20:23,468 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:20:23,468 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:20:23,468 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:20:23,469 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:20:23,469 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:20:23,469 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:20:23,469 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:20:23,470 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:20:23,470 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:20:23,470 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:20:23,470 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:20:23,470 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:20:23,471 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:20:23,471 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 -> eb59a6e6bbeea05d6faf844d6f750609a5360ad9 [2019-11-28 00:20:23,772 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:20:23,786 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:20:23,789 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:20:23,791 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:20:23,792 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:20:23,793 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product52.cil.c [2019-11-28 00:20:23,858 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bd477149/f30978d4d32d4fc4b69ed82b5e5f37d3/FLAGfd3549787 [2019-11-28 00:20:24,382 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:20:24,383 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product52.cil.c [2019-11-28 00:20:24,401 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bd477149/f30978d4d32d4fc4b69ed82b5e5f37d3/FLAGfd3549787 [2019-11-28 00:20:24,721 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bd477149/f30978d4d32d4fc4b69ed82b5e5f37d3 [2019-11-28 00:20:24,725 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:20:24,726 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:20:24,727 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:20:24,727 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:20:24,730 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:20:24,731 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:20:24" (1/1) ... [2019-11-28 00:20:24,733 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67981a6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:24, skipping insertion in model container [2019-11-28 00:20:24,734 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:20:24" (1/1) ... [2019-11-28 00:20:24,741 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:20:24,813 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:20:25,195 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:20:25,210 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:20:25,332 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:20:25,385 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:20:25,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:25 WrapperNode [2019-11-28 00:20:25,386 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:20:25,387 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:20:25,387 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:20:25,388 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:20:25,398 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:20:25" (1/1) ... [2019-11-28 00:20:25,431 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:20:25" (1/1) ... [2019-11-28 00:20:25,491 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:20:25,491 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:20:25,492 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:20:25,494 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:20:25,502 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:25" (1/1) ... [2019-11-28 00:20:25,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:25" (1/1) ... [2019-11-28 00:20:25,506 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:25" (1/1) ... [2019-11-28 00:20:25,507 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:25" (1/1) ... [2019-11-28 00:20:25,523 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:25" (1/1) ... [2019-11-28 00:20:25,535 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:25" (1/1) ... [2019-11-28 00:20:25,539 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:25" (1/1) ... [2019-11-28 00:20:25,545 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:20:25,546 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:20:25,546 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:20:25,546 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:20:25,547 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:25" (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:20:25,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 00:20:25,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 00:20:25,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:20:25,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:20:26,475 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:20:26,476 INFO L297 CfgBuilder]: Removed 162 assume(true) statements. [2019-11-28 00:20:26,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:20:26 BoogieIcfgContainer [2019-11-28 00:20:26,478 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:20:26,479 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:20:26,480 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:20:26,483 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:20:26,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:20:24" (1/3) ... [2019-11-28 00:20:26,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cf2cf1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:20:26, skipping insertion in model container [2019-11-28 00:20:26,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:25" (2/3) ... [2019-11-28 00:20:26,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cf2cf1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:20:26, skipping insertion in model container [2019-11-28 00:20:26,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:20:26" (3/3) ... [2019-11-28 00:20:26,491 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product52.cil.c [2019-11-28 00:20:26,501 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:20:26,509 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 00:20:26,521 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 00:20:26,545 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:20:26,545 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:20:26,545 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:20:26,545 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:20:26,545 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:20:26,546 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:20:26,546 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:20:26,546 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:20:26,566 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states. [2019-11-28 00:20:26,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 00:20:26,573 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:26,574 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:20:26,575 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:26,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:26,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1794729554, now seen corresponding path program 1 times [2019-11-28 00:20:26,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:26,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685693584] [2019-11-28 00:20:26,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:26,917 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:20:26,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685693584] [2019-11-28 00:20:26,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:26,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:20:26,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883803211] [2019-11-28 00:20:26,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 00:20:26,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:26,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 00:20:26,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 00:20:26,949 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 2 states. [2019-11-28 00:20:26,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:26,990 INFO L93 Difference]: Finished difference Result 232 states and 353 transitions. [2019-11-28 00:20:26,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 00:20:26,992 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-28 00:20:26,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:27,006 INFO L225 Difference]: With dead ends: 232 [2019-11-28 00:20:27,007 INFO L226 Difference]: Without dead ends: 115 [2019-11-28 00:20:27,011 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:20:27,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-28 00:20:27,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-11-28 00:20:27,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-28 00:20:27,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 168 transitions. [2019-11-28 00:20:27,063 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 168 transitions. Word has length 16 [2019-11-28 00:20:27,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:27,064 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 168 transitions. [2019-11-28 00:20:27,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 00:20:27,065 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 168 transitions. [2019-11-28 00:20:27,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 00:20:27,066 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:27,066 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:20:27,066 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:27,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:27,067 INFO L82 PathProgramCache]: Analyzing trace with hash 529368141, now seen corresponding path program 1 times [2019-11-28 00:20:27,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:27,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758763670] [2019-11-28 00:20:27,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:27,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:27,187 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:20:27,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758763670] [2019-11-28 00:20:27,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:27,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:20:27,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374842470] [2019-11-28 00:20:27,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:20:27,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:27,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:20:27,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:20:27,191 INFO L87 Difference]: Start difference. First operand 115 states and 168 transitions. Second operand 3 states. [2019-11-28 00:20:27,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:27,210 INFO L93 Difference]: Finished difference Result 115 states and 168 transitions. [2019-11-28 00:20:27,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:20:27,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 00:20:27,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:27,219 INFO L225 Difference]: With dead ends: 115 [2019-11-28 00:20:27,219 INFO L226 Difference]: Without dead ends: 49 [2019-11-28 00:20:27,220 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:20:27,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-28 00:20:27,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-11-28 00:20:27,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-28 00:20:27,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2019-11-28 00:20:27,235 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 17 [2019-11-28 00:20:27,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:27,236 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 71 transitions. [2019-11-28 00:20:27,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:20:27,237 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 71 transitions. [2019-11-28 00:20:27,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 00:20:27,239 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:27,240 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:20:27,240 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:27,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:27,242 INFO L82 PathProgramCache]: Analyzing trace with hash -2061312917, now seen corresponding path program 1 times [2019-11-28 00:20:27,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:27,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984030650] [2019-11-28 00:20:27,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:27,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:27,402 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:20:27,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984030650] [2019-11-28 00:20:27,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:27,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:20:27,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162401324] [2019-11-28 00:20:27,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:20:27,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:27,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:20:27,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:20:27,410 INFO L87 Difference]: Start difference. First operand 49 states and 71 transitions. Second operand 5 states. [2019-11-28 00:20:27,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:27,526 INFO L93 Difference]: Finished difference Result 115 states and 170 transitions. [2019-11-28 00:20:27,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:20:27,527 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-28 00:20:27,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:27,529 INFO L225 Difference]: With dead ends: 115 [2019-11-28 00:20:27,529 INFO L226 Difference]: Without dead ends: 72 [2019-11-28 00:20:27,530 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 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:20:27,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-28 00:20:27,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2019-11-28 00:20:27,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-28 00:20:27,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 100 transitions. [2019-11-28 00:20:27,542 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 100 transitions. Word has length 22 [2019-11-28 00:20:27,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:27,543 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 100 transitions. [2019-11-28 00:20:27,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:20:27,543 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 100 transitions. [2019-11-28 00:20:27,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 00:20:27,545 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:27,545 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:20:27,545 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:27,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:27,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1499976397, now seen corresponding path program 1 times [2019-11-28 00:20:27,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:27,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191906560] [2019-11-28 00:20:27,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:27,645 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:20:27,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191906560] [2019-11-28 00:20:27,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:27,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:20:27,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076429644] [2019-11-28 00:20:27,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:20:27,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:27,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:20:27,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:20:27,650 INFO L87 Difference]: Start difference. First operand 68 states and 100 transitions. Second operand 3 states. [2019-11-28 00:20:27,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:27,709 INFO L93 Difference]: Finished difference Result 151 states and 224 transitions. [2019-11-28 00:20:27,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:20:27,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 00:20:27,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:27,711 INFO L225 Difference]: With dead ends: 151 [2019-11-28 00:20:27,711 INFO L226 Difference]: Without dead ends: 89 [2019-11-28 00:20:27,713 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:20:27,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-28 00:20:27,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2019-11-28 00:20:27,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-28 00:20:27,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 124 transitions. [2019-11-28 00:20:27,725 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 124 transitions. Word has length 24 [2019-11-28 00:20:27,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:27,726 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 124 transitions. [2019-11-28 00:20:27,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:20:27,727 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 124 transitions. [2019-11-28 00:20:27,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 00:20:27,728 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:27,728 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:20:27,728 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:27,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:27,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1678878848, now seen corresponding path program 1 times [2019-11-28 00:20:27,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:27,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087868246] [2019-11-28 00:20:27,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:27,812 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:20:27,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087868246] [2019-11-28 00:20:27,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:27,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:20:27,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181319813] [2019-11-28 00:20:27,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:20:27,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:27,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:20:27,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:20:27,816 INFO L87 Difference]: Start difference. First operand 87 states and 124 transitions. Second operand 5 states. [2019-11-28 00:20:27,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:27,970 INFO L93 Difference]: Finished difference Result 445 states and 650 transitions. [2019-11-28 00:20:27,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 00:20:27,971 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-28 00:20:27,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:27,975 INFO L225 Difference]: With dead ends: 445 [2019-11-28 00:20:27,977 INFO L226 Difference]: Without dead ends: 364 [2019-11-28 00:20:27,979 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:20:27,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-11-28 00:20:28,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 160. [2019-11-28 00:20:28,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-11-28 00:20:28,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 226 transitions. [2019-11-28 00:20:28,042 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 226 transitions. Word has length 25 [2019-11-28 00:20:28,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:28,043 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 226 transitions. [2019-11-28 00:20:28,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:20:28,043 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 226 transitions. [2019-11-28 00:20:28,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 00:20:28,045 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:28,046 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:20:28,046 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:28,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:28,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1475071754, now seen corresponding path program 1 times [2019-11-28 00:20:28,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:28,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817735118] [2019-11-28 00:20:28,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:28,171 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:20:28,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817735118] [2019-11-28 00:20:28,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:28,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:20:28,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735236810] [2019-11-28 00:20:28,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:20:28,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:28,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:20:28,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:20:28,176 INFO L87 Difference]: Start difference. First operand 160 states and 226 transitions. Second operand 5 states. [2019-11-28 00:20:28,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:28,345 INFO L93 Difference]: Finished difference Result 448 states and 637 transitions. [2019-11-28 00:20:28,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:20:28,346 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 00:20:28,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:28,349 INFO L225 Difference]: With dead ends: 448 [2019-11-28 00:20:28,349 INFO L226 Difference]: Without dead ends: 446 [2019-11-28 00:20:28,350 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:20:28,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-11-28 00:20:28,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 160. [2019-11-28 00:20:28,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-11-28 00:20:28,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 224 transitions. [2019-11-28 00:20:28,374 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 224 transitions. Word has length 26 [2019-11-28 00:20:28,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:28,375 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 224 transitions. [2019-11-28 00:20:28,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:20:28,375 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 224 transitions. [2019-11-28 00:20:28,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 00:20:28,376 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:28,377 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:20:28,377 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:28,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:28,377 INFO L82 PathProgramCache]: Analyzing trace with hash 317568404, now seen corresponding path program 1 times [2019-11-28 00:20:28,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:28,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824767020] [2019-11-28 00:20:28,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:28,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:28,451 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:20:28,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824767020] [2019-11-28 00:20:28,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:28,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:20:28,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604466770] [2019-11-28 00:20:28,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:20:28,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:28,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:20:28,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:20:28,455 INFO L87 Difference]: Start difference. First operand 160 states and 224 transitions. Second operand 5 states. [2019-11-28 00:20:28,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:28,565 INFO L93 Difference]: Finished difference Result 476 states and 660 transitions. [2019-11-28 00:20:28,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:20:28,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-28 00:20:28,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:28,570 INFO L225 Difference]: With dead ends: 476 [2019-11-28 00:20:28,570 INFO L226 Difference]: Without dead ends: 322 [2019-11-28 00:20:28,575 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:20:28,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-11-28 00:20:28,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 172. [2019-11-28 00:20:28,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-11-28 00:20:28,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 236 transitions. [2019-11-28 00:20:28,604 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 236 transitions. Word has length 31 [2019-11-28 00:20:28,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:28,607 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 236 transitions. [2019-11-28 00:20:28,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:20:28,608 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 236 transitions. [2019-11-28 00:20:28,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 00:20:28,614 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:28,616 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:20:28,616 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:28,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:28,617 INFO L82 PathProgramCache]: Analyzing trace with hash -75458606, now seen corresponding path program 1 times [2019-11-28 00:20:28,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:28,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460767285] [2019-11-28 00:20:28,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:28,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:28,674 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:20:28,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460767285] [2019-11-28 00:20:28,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:28,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:20:28,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200392094] [2019-11-28 00:20:28,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:20:28,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:28,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:20:28,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:20:28,676 INFO L87 Difference]: Start difference. First operand 172 states and 236 transitions. Second operand 4 states. [2019-11-28 00:20:28,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:28,741 INFO L93 Difference]: Finished difference Result 434 states and 592 transitions. [2019-11-28 00:20:28,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:20:28,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-28 00:20:28,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:28,744 INFO L225 Difference]: With dead ends: 434 [2019-11-28 00:20:28,745 INFO L226 Difference]: Without dead ends: 268 [2019-11-28 00:20:28,745 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:20:28,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-11-28 00:20:28,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 180. [2019-11-28 00:20:28,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-28 00:20:28,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 244 transitions. [2019-11-28 00:20:28,769 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 244 transitions. Word has length 31 [2019-11-28 00:20:28,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:28,770 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 244 transitions. [2019-11-28 00:20:28,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:20:28,770 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 244 transitions. [2019-11-28 00:20:28,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 00:20:28,771 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:28,771 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:20:28,772 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:28,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:28,773 INFO L82 PathProgramCache]: Analyzing trace with hash 182706832, now seen corresponding path program 1 times [2019-11-28 00:20:28,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:28,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414877400] [2019-11-28 00:20:28,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:28,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:28,834 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:20:28,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414877400] [2019-11-28 00:20:28,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:28,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:20:28,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720546615] [2019-11-28 00:20:28,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:20:28,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:28,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:20:28,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:20:28,838 INFO L87 Difference]: Start difference. First operand 180 states and 244 transitions. Second operand 3 states. [2019-11-28 00:20:28,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:28,889 INFO L93 Difference]: Finished difference Result 442 states and 598 transitions. [2019-11-28 00:20:28,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:20:28,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-28 00:20:28,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:28,892 INFO L225 Difference]: With dead ends: 442 [2019-11-28 00:20:28,893 INFO L226 Difference]: Without dead ends: 268 [2019-11-28 00:20:28,894 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:20:28,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-11-28 00:20:28,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2019-11-28 00:20:28,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-11-28 00:20:28,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 354 transitions. [2019-11-28 00:20:28,926 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 354 transitions. Word has length 31 [2019-11-28 00:20:28,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:28,926 INFO L462 AbstractCegarLoop]: Abstraction has 268 states and 354 transitions. [2019-11-28 00:20:28,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:20:28,926 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 354 transitions. [2019-11-28 00:20:28,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 00:20:28,927 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:28,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] [2019-11-28 00:20:28,928 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:28,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:28,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1930053038, now seen corresponding path program 1 times [2019-11-28 00:20:28,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:28,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644731234] [2019-11-28 00:20:28,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:20:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:20:29,153 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 00:20:29,153 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 00:20:29,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:20:29 BoogieIcfgContainer [2019-11-28 00:20:29,275 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:20:29,276 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:20:29,276 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:20:29,276 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:20:29,277 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:20:26" (3/4) ... [2019-11-28 00:20:29,280 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 00:20:29,453 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:20:29,454 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:20:29,456 INFO L168 Benchmark]: Toolchain (without parser) took 4729.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 210.2 MB). Free memory was 956.3 MB in the beginning and 1.2 GB in the end (delta: -204.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:29,457 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:20:29,457 INFO L168 Benchmark]: CACSL2BoogieTranslator took 659.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -147.5 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:29,458 INFO L168 Benchmark]: Boogie Procedure Inliner took 103.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:29,463 INFO L168 Benchmark]: Boogie Preprocessor took 53.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:29,464 INFO L168 Benchmark]: RCFGBuilder took 932.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.0 MB). Peak memory consumption was 58.0 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:29,464 INFO L168 Benchmark]: TraceAbstraction took 2796.33 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 81.3 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -136.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:20:29,465 INFO L168 Benchmark]: Witness Printer took 177.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:29,467 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 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 659.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -147.5 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 103.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 932.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.0 MB). Peak memory consumption was 58.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2796.33 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 81.3 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -136.5 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 177.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 383]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L48] int waterLevel = 1; [L49] int methaneLevelCritical = 0; [L158] int pumpRunning = 0; [L159] int systemActive = 1; [L458] int cleanupTimeShifts = 4; [L752] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L534] int retValue_acc ; [L535] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L975] int retValue_acc ; [L978] retValue_acc = 1 [L979] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L541] tmp = valid_product() [L543] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L390] int splverifierCounter ; [L391] int tmp ; [L392] int tmp___0 ; [L393] int tmp___1 ; [L394] int tmp___2 ; [L397] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L399] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L401] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L407] tmp = __VERIFIER_nondet_int() [L409] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L66] COND TRUE waterLevel < 2 [L67] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L417] tmp___0 = __VERIFIER_nondet_int() [L419] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L78] COND FALSE !(\read(methaneLevelCritical)) [L81] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L427] tmp___2 = __VERIFIER_nondet_int() [L429] COND TRUE \read(tmp___2) [L374] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L166] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L173] COND TRUE \read(systemActive) [L221] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L224] COND FALSE !(\read(pumpRunning)) [L195] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L198] COND TRUE ! pumpRunning [L318] int retValue_acc ; [L319] int tmp ; [L320] int tmp___0 ; [L128] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L131] COND FALSE !(waterLevel < 2) [L135] retValue_acc = 0 [L136] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L324] tmp = isHighWaterSensorDry() [L326] COND FALSE !(\read(tmp)) [L329] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L331] retValue_acc = tmp___0 [L332] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L200] tmp = isHighWaterLevel() [L202] COND TRUE \read(tmp) [L249] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L558] int tmp ; [L559] int tmp___0 ; [L87] int retValue_acc ; [L90] retValue_acc = methaneLevelCritical [L91] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L563] tmp = isMethaneLevelCritical() [L565] COND TRUE \read(tmp) [L273] int retValue_acc ; [L276] retValue_acc = pumpRunning [L277] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L567] tmp___0 = isPumpRunning() [L569] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L383] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 119 locations, 3 error locations. Result: UNSAFE, OverallTime: 2.6s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 875 SDtfs, 1177 SDslu, 1132 SDs, 0 SdLazy, 149 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=268occurred 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, 9 MinimizatonAttempts, 734 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 255 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 214 ConstructedInterpolants, 0 QuantifiedInterpolants, 10056 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...