./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product40.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_product40.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 ad65d1d3307a121fce5b7d95113e2f3f66b04b5a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:16,418 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:20:16,421 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:20:16,439 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:20:16,440 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:20:16,442 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:20:16,444 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:20:16,453 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:20:16,459 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:20:16,463 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:20:16,464 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:20:16,466 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:20:16,466 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:20:16,470 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:20:16,471 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:20:16,473 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:20:16,474 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:20:16,475 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:20:16,479 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:20:16,483 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:20:16,488 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:20:16,492 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:20:16,493 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:20:16,494 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:20:16,496 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:20:16,497 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:20:16,497 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:20:16,498 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:20:16,498 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:20:16,499 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:20:16,500 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:20:16,501 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:20:16,501 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:20:16,502 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:20:16,504 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:20:16,504 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:20:16,505 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:20:16,505 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:20:16,505 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:20:16,507 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:20:16,507 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:20:16,508 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:16,523 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:20:16,523 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:20:16,525 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:20:16,525 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:20:16,525 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:20:16,526 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:20:16,526 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:20:16,526 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:20:16,527 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:20:16,527 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:20:16,527 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:20:16,527 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:20:16,528 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:20:16,528 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:20:16,528 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:20:16,529 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:20:16,529 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:20:16,529 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:20:16,529 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:20:16,530 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:20:16,530 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:20:16,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:20:16,531 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:20:16,531 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:20:16,531 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:20:16,531 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:20:16,532 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:20:16,532 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:20:16,532 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 -> ad65d1d3307a121fce5b7d95113e2f3f66b04b5a [2019-11-28 00:20:16,825 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:20:16,842 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:20:16,846 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:20:16,847 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:20:16,848 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:20:16,850 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product40.cil.c [2019-11-28 00:20:16,927 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d78398c2/7ece8adadd44458993abaad781842ca6/FLAGa30637cad [2019-11-28 00:20:17,497 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:20:17,498 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product40.cil.c [2019-11-28 00:20:17,524 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d78398c2/7ece8adadd44458993abaad781842ca6/FLAGa30637cad [2019-11-28 00:20:17,848 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d78398c2/7ece8adadd44458993abaad781842ca6 [2019-11-28 00:20:17,851 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:20:17,853 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:20:17,854 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:20:17,854 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:20:17,858 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:20:17,859 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:20:17" (1/1) ... [2019-11-28 00:20:17,862 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11b68f39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:17, skipping insertion in model container [2019-11-28 00:20:17,862 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:20:17" (1/1) ... [2019-11-28 00:20:17,870 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:20:17,910 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:20:18,343 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:20:18,370 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:20:18,454 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:20:18,500 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:20:18,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:18 WrapperNode [2019-11-28 00:20:18,502 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:20:18,503 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:20:18,503 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:20:18,503 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:20:18,511 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:18" (1/1) ... [2019-11-28 00:20:18,532 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:18" (1/1) ... [2019-11-28 00:20:18,581 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:20:18,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:20:18,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:20:18,582 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:20:18,590 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:18" (1/1) ... [2019-11-28 00:20:18,591 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:18" (1/1) ... [2019-11-28 00:20:18,596 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:18" (1/1) ... [2019-11-28 00:20:18,596 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:18" (1/1) ... [2019-11-28 00:20:18,608 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:18" (1/1) ... [2019-11-28 00:20:18,617 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:18" (1/1) ... [2019-11-28 00:20:18,622 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:18" (1/1) ... [2019-11-28 00:20:18,632 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:20:18,632 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:20:18,633 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:20:18,633 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:20:18,634 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:18" (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:18,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 00:20:18,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 00:20:18,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:20:18,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:20:19,667 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:20:19,667 INFO L297 CfgBuilder]: Removed 162 assume(true) statements. [2019-11-28 00:20:19,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:20:19 BoogieIcfgContainer [2019-11-28 00:20:19,669 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:20:19,670 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:20:19,670 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:20:19,674 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:20:19,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:20:17" (1/3) ... [2019-11-28 00:20:19,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15247447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:20:19, skipping insertion in model container [2019-11-28 00:20:19,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:18" (2/3) ... [2019-11-28 00:20:19,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15247447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:20:19, skipping insertion in model container [2019-11-28 00:20:19,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:20:19" (3/3) ... [2019-11-28 00:20:19,681 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product40.cil.c [2019-11-28 00:20:19,691 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:20:19,698 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 00:20:19,708 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 00:20:19,731 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:20:19,732 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:20:19,732 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:20:19,732 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:20:19,733 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:20:19,733 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:20:19,733 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:20:19,733 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:20:19,752 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2019-11-28 00:20:19,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 00:20:19,760 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:19,761 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:19,761 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:19,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:19,766 INFO L82 PathProgramCache]: Analyzing trace with hash 2074315904, now seen corresponding path program 1 times [2019-11-28 00:20:19,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:19,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094493370] [2019-11-28 00:20:19,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:19,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:20,070 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:20,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094493370] [2019-11-28 00:20:20,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:20,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:20:20,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416433171] [2019-11-28 00:20:20,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 00:20:20,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:20,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 00:20:20,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 00:20:20,098 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 2 states. [2019-11-28 00:20:20,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:20,156 INFO L93 Difference]: Finished difference Result 220 states and 335 transitions. [2019-11-28 00:20:20,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 00:20:20,158 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-28 00:20:20,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:20,170 INFO L225 Difference]: With dead ends: 220 [2019-11-28 00:20:20,170 INFO L226 Difference]: Without dead ends: 109 [2019-11-28 00:20:20,174 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:20,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-28 00:20:20,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-11-28 00:20:20,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-28 00:20:20,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 159 transitions. [2019-11-28 00:20:20,227 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 159 transitions. Word has length 16 [2019-11-28 00:20:20,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:20,227 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 159 transitions. [2019-11-28 00:20:20,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 00:20:20,228 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 159 transitions. [2019-11-28 00:20:20,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 00:20:20,229 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:20,229 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:20,229 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:20,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:20,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1027559007, now seen corresponding path program 1 times [2019-11-28 00:20:20,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:20,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631066202] [2019-11-28 00:20:20,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:20,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:20,368 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:20,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631066202] [2019-11-28 00:20:20,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:20,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:20:20,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325456766] [2019-11-28 00:20:20,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:20:20,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:20,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:20:20,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:20:20,373 INFO L87 Difference]: Start difference. First operand 109 states and 159 transitions. Second operand 3 states. [2019-11-28 00:20:20,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:20,387 INFO L93 Difference]: Finished difference Result 109 states and 159 transitions. [2019-11-28 00:20:20,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:20:20,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 00:20:20,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:20,389 INFO L225 Difference]: With dead ends: 109 [2019-11-28 00:20:20,389 INFO L226 Difference]: Without dead ends: 47 [2019-11-28 00:20:20,391 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:20,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-28 00:20:20,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-11-28 00:20:20,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-28 00:20:20,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2019-11-28 00:20:20,398 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 17 [2019-11-28 00:20:20,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:20,399 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2019-11-28 00:20:20,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:20:20,399 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2019-11-28 00:20:20,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 00:20:20,400 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:20,400 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:20,401 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:20,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:20,401 INFO L82 PathProgramCache]: Analyzing trace with hash 109011716, now seen corresponding path program 1 times [2019-11-28 00:20:20,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:20,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055923041] [2019-11-28 00:20:20,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:20,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:20,495 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:20,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055923041] [2019-11-28 00:20:20,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:20,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:20:20,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430597676] [2019-11-28 00:20:20,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:20:20,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:20,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:20:20,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:20:20,498 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand 5 states. [2019-11-28 00:20:20,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:20,583 INFO L93 Difference]: Finished difference Result 111 states and 164 transitions. [2019-11-28 00:20:20,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:20:20,584 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-28 00:20:20,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:20,586 INFO L225 Difference]: With dead ends: 111 [2019-11-28 00:20:20,586 INFO L226 Difference]: Without dead ends: 70 [2019-11-28 00:20:20,587 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:20,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-28 00:20:20,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2019-11-28 00:20:20,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-28 00:20:20,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 97 transitions. [2019-11-28 00:20:20,598 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 97 transitions. Word has length 22 [2019-11-28 00:20:20,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:20,598 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 97 transitions. [2019-11-28 00:20:20,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:20:20,599 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 97 transitions. [2019-11-28 00:20:20,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 00:20:20,600 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:20,601 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:20,601 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:20,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:20,602 INFO L82 PathProgramCache]: Analyzing trace with hash 60563277, now seen corresponding path program 1 times [2019-11-28 00:20:20,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:20,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812430427] [2019-11-28 00:20:20,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:20,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:20,687 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:20,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812430427] [2019-11-28 00:20:20,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:20,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:20:20,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86825095] [2019-11-28 00:20:20,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:20:20,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:20,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:20:20,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:20:20,691 INFO L87 Difference]: Start difference. First operand 66 states and 97 transitions. Second operand 3 states. [2019-11-28 00:20:20,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:20,769 INFO L93 Difference]: Finished difference Result 147 states and 218 transitions. [2019-11-28 00:20:20,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:20:20,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 00:20:20,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:20,771 INFO L225 Difference]: With dead ends: 147 [2019-11-28 00:20:20,772 INFO L226 Difference]: Without dead ends: 87 [2019-11-28 00:20:20,773 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:20,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-28 00:20:20,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2019-11-28 00:20:20,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-28 00:20:20,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 121 transitions. [2019-11-28 00:20:20,792 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 121 transitions. Word has length 24 [2019-11-28 00:20:20,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:20,792 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 121 transitions. [2019-11-28 00:20:20,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:20:20,793 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 121 transitions. [2019-11-28 00:20:20,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 00:20:20,794 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:20,794 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:20,794 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:20,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:20,795 INFO L82 PathProgramCache]: Analyzing trace with hash -445763815, now seen corresponding path program 1 times [2019-11-28 00:20:20,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:20,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121827939] [2019-11-28 00:20:20,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:20,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:20,867 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:20,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121827939] [2019-11-28 00:20:20,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:20,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:20:20,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540895706] [2019-11-28 00:20:20,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:20:20,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:20,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:20:20,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:20:20,870 INFO L87 Difference]: Start difference. First operand 85 states and 121 transitions. Second operand 5 states. [2019-11-28 00:20:20,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:20,980 INFO L93 Difference]: Finished difference Result 413 states and 601 transitions. [2019-11-28 00:20:20,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 00:20:20,981 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-28 00:20:20,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:20,984 INFO L225 Difference]: With dead ends: 413 [2019-11-28 00:20:20,984 INFO L226 Difference]: Without dead ends: 334 [2019-11-28 00:20:20,985 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:20,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-11-28 00:20:21,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 156. [2019-11-28 00:20:21,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-28 00:20:21,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 220 transitions. [2019-11-28 00:20:21,024 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 220 transitions. Word has length 25 [2019-11-28 00:20:21,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:21,024 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 220 transitions. [2019-11-28 00:20:21,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:20:21,025 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 220 transitions. [2019-11-28 00:20:21,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 00:20:21,027 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:21,027 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:21,028 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:21,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:21,028 INFO L82 PathProgramCache]: Analyzing trace with hash -649570909, now seen corresponding path program 1 times [2019-11-28 00:20:21,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:21,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906080861] [2019-11-28 00:20:21,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:21,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:21,112 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:21,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906080861] [2019-11-28 00:20:21,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:21,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:20:21,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455240588] [2019-11-28 00:20:21,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:20:21,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:21,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:20:21,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:20:21,115 INFO L87 Difference]: Start difference. First operand 156 states and 220 transitions. Second operand 5 states. [2019-11-28 00:20:21,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:21,281 INFO L93 Difference]: Finished difference Result 436 states and 619 transitions. [2019-11-28 00:20:21,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:20:21,282 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 00:20:21,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:21,285 INFO L225 Difference]: With dead ends: 436 [2019-11-28 00:20:21,285 INFO L226 Difference]: Without dead ends: 434 [2019-11-28 00:20:21,286 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:21,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2019-11-28 00:20:21,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 156. [2019-11-28 00:20:21,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-28 00:20:21,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 218 transitions. [2019-11-28 00:20:21,311 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 218 transitions. Word has length 26 [2019-11-28 00:20:21,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:21,312 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 218 transitions. [2019-11-28 00:20:21,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:20:21,313 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 218 transitions. [2019-11-28 00:20:21,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 00:20:21,318 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:21,318 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:21,321 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:21,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:21,323 INFO L82 PathProgramCache]: Analyzing trace with hash 108971892, now seen corresponding path program 1 times [2019-11-28 00:20:21,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:21,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684779577] [2019-11-28 00:20:21,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:21,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:21,395 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:21,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684779577] [2019-11-28 00:20:21,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:21,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:20:21,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490870439] [2019-11-28 00:20:21,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:20:21,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:21,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:20:21,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:20:21,399 INFO L87 Difference]: Start difference. First operand 156 states and 218 transitions. Second operand 5 states. [2019-11-28 00:20:21,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:21,507 INFO L93 Difference]: Finished difference Result 468 states and 648 transitions. [2019-11-28 00:20:21,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:20:21,508 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-28 00:20:21,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:21,510 INFO L225 Difference]: With dead ends: 468 [2019-11-28 00:20:21,510 INFO L226 Difference]: Without dead ends: 318 [2019-11-28 00:20:21,514 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:21,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-11-28 00:20:21,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 168. [2019-11-28 00:20:21,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-28 00:20:21,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 230 transitions. [2019-11-28 00:20:21,538 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 230 transitions. Word has length 31 [2019-11-28 00:20:21,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:21,540 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 230 transitions. [2019-11-28 00:20:21,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:20:21,541 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 230 transitions. [2019-11-28 00:20:21,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 00:20:21,545 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:21,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, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:20:21,546 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:21,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:21,546 INFO L82 PathProgramCache]: Analyzing trace with hash -284055118, now seen corresponding path program 1 times [2019-11-28 00:20:21,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:21,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684787208] [2019-11-28 00:20:21,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:21,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:21,636 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:21,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684787208] [2019-11-28 00:20:21,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:21,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 00:20:21,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919379338] [2019-11-28 00:20:21,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:20:21,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:21,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:20:21,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:20:21,639 INFO L87 Difference]: Start difference. First operand 168 states and 230 transitions. Second operand 6 states. [2019-11-28 00:20:21,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:21,760 INFO L93 Difference]: Finished difference Result 502 states and 682 transitions. [2019-11-28 00:20:21,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 00:20:21,761 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-11-28 00:20:21,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:21,764 INFO L225 Difference]: With dead ends: 502 [2019-11-28 00:20:21,765 INFO L226 Difference]: Without dead ends: 340 [2019-11-28 00:20:21,766 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-28 00:20:21,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-11-28 00:20:21,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 176. [2019-11-28 00:20:21,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-11-28 00:20:21,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 238 transitions. [2019-11-28 00:20:21,798 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 238 transitions. Word has length 31 [2019-11-28 00:20:21,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:21,799 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 238 transitions. [2019-11-28 00:20:21,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:20:21,800 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 238 transitions. [2019-11-28 00:20:21,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 00:20:21,801 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:21,801 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:21,801 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:21,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:21,802 INFO L82 PathProgramCache]: Analyzing trace with hash -25889680, now seen corresponding path program 1 times [2019-11-28 00:20:21,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:21,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724772548] [2019-11-28 00:20:21,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:21,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:21,856 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:21,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724772548] [2019-11-28 00:20:21,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:21,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:20:21,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046220744] [2019-11-28 00:20:21,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:20:21,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:21,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:20:21,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:20:21,862 INFO L87 Difference]: Start difference. First operand 176 states and 238 transitions. Second operand 3 states. [2019-11-28 00:20:21,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:21,913 INFO L93 Difference]: Finished difference Result 434 states and 586 transitions. [2019-11-28 00:20:21,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:20:21,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-28 00:20:21,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:21,916 INFO L225 Difference]: With dead ends: 434 [2019-11-28 00:20:21,916 INFO L226 Difference]: Without dead ends: 264 [2019-11-28 00:20:21,917 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:21,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-11-28 00:20:21,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2019-11-28 00:20:21,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-11-28 00:20:21,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 348 transitions. [2019-11-28 00:20:21,972 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 348 transitions. Word has length 31 [2019-11-28 00:20:21,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:21,973 INFO L462 AbstractCegarLoop]: Abstraction has 264 states and 348 transitions. [2019-11-28 00:20:21,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:20:21,973 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 348 transitions. [2019-11-28 00:20:21,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 00:20:21,975 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:21,975 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:21,975 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:21,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:21,976 INFO L82 PathProgramCache]: Analyzing trace with hash -2138649550, now seen corresponding path program 1 times [2019-11-28 00:20:21,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:21,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043416036] [2019-11-28 00:20:21,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:20:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:20:22,210 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 00:20:22,211 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 00:20:22,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:20:22 BoogieIcfgContainer [2019-11-28 00:20:22,352 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:20:22,352 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:20:22,352 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:20:22,353 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:20:22,353 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:19" (3/4) ... [2019-11-28 00:20:22,356 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 00:20:22,450 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:20:22,450 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:20:22,453 INFO L168 Benchmark]: Toolchain (without parser) took 4599.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 215.0 MB). Free memory was 953.7 MB in the beginning and 1.2 GB in the end (delta: -197.8 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:22,454 INFO L168 Benchmark]: CDTParser took 0.36 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:22,454 INFO L168 Benchmark]: CACSL2BoogieTranslator took 648.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -162.7 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:22,455 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.28 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:22,455 INFO L168 Benchmark]: Boogie Preprocessor took 49.84 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:20:22,456 INFO L168 Benchmark]: RCFGBuilder took 1036.79 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: 64.7 MB). Peak memory consumption was 64.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:22,456 INFO L168 Benchmark]: TraceAbstraction took 2681.75 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 80.2 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -122.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:20:22,457 INFO L168 Benchmark]: Witness Printer took 98.34 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: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:22,460 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.36 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 648.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -162.7 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 79.28 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 49.84 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1036.79 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: 64.7 MB). Peak memory consumption was 64.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2681.75 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 80.2 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -122.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 98.34 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: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 490]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L51] int pumpRunning = 0; [L52] int systemActive = 1; [L352] int cleanupTimeShifts = 4; [L664] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L862] int waterLevel = 1; [L863] int methaneLevelCritical = 0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L428] int retValue_acc ; [L429] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L477] int retValue_acc ; [L480] retValue_acc = 1 [L481] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L435] tmp = valid_product() [L437] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L257] int splverifierCounter ; [L258] int tmp ; [L259] int tmp___0 ; [L260] int tmp___1 ; [L261] int tmp___2 ; [L264] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L266] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L268] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L274] tmp = __VERIFIER_nondet_int() [L276] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L880] COND TRUE waterLevel < 2 [L881] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L284] tmp___0 = __VERIFIER_nondet_int() [L286] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L892] COND FALSE !(\read(methaneLevelCritical)) [L895] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L294] tmp___2 = __VERIFIER_nondet_int() [L296] COND TRUE \read(tmp___2) [L248] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L59] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L66] COND TRUE \read(systemActive) [L114] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L117] COND FALSE !(\read(pumpRunning)) [L88] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L91] COND TRUE ! pumpRunning [L211] int retValue_acc ; [L212] int tmp ; [L213] int tmp___0 ; [L942] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L945] COND FALSE !(waterLevel < 2) [L949] retValue_acc = 0 [L950] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L217] tmp = isHighWaterSensorDry() [L219] COND FALSE !(\read(tmp)) [L222] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L224] retValue_acc = tmp___0 [L225] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L93] tmp = isHighWaterLevel() [L95] COND TRUE \read(tmp) [L142] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L327] int tmp ; [L328] int tmp___0 ; [L901] int retValue_acc ; [L904] retValue_acc = methaneLevelCritical [L905] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L332] tmp = isMethaneLevelCritical() [L334] COND TRUE \read(tmp) [L166] int retValue_acc ; [L169] retValue_acc = pumpRunning [L170] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L336] tmp___0 = isPumpRunning() [L338] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L490] __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, 113 locations, 3 error locations. Result: UNSAFE, OverallTime: 2.4s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 829 SDtfs, 1296 SDslu, 1083 SDs, 0 SdLazy, 160 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=264occurred 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, 776 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 255 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 214 ConstructedInterpolants, 0 QuantifiedInterpolants, 10236 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...