./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec1_product33_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: 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 /storage/repos/svcomp/c/product-lines/minepump_spec1_product33_false-unreach-call_false-termination.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 3e754f75ca06d39e1069a0bad88498ddd2436bb7 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-2e94e6a [2018-12-31 09:40:47,531 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 09:40:47,532 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 09:40:47,546 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 09:40:47,546 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 09:40:47,547 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 09:40:47,549 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 09:40:47,559 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 09:40:47,561 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 09:40:47,562 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 09:40:47,563 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 09:40:47,563 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 09:40:47,565 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 09:40:47,566 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 09:40:47,567 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 09:40:47,568 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 09:40:47,569 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 09:40:47,571 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 09:40:47,573 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 09:40:47,575 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 09:40:47,576 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 09:40:47,577 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 09:40:47,580 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 09:40:47,580 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 09:40:47,580 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 09:40:47,581 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 09:40:47,582 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 09:40:47,583 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 09:40:47,584 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 09:40:47,585 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 09:40:47,585 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 09:40:47,586 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 09:40:47,586 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 09:40:47,586 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 09:40:47,587 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 09:40:47,589 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 09:40:47,589 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 09:40:47,604 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 09:40:47,604 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 09:40:47,606 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 09:40:47,606 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 09:40:47,606 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 09:40:47,607 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 09:40:47,607 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 09:40:47,607 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 09:40:47,607 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 09:40:47,607 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 09:40:47,608 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 09:40:47,608 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 09:40:47,608 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 09:40:47,608 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 09:40:47,608 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 09:40:47,608 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 09:40:47,610 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 09:40:47,610 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 09:40:47,610 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 09:40:47,611 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 09:40:47,611 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 09:40:47,611 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:40:47,611 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 09:40:47,611 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 09:40:47,611 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 09:40:47,612 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 09:40:47,613 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 09:40:47,613 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 09:40:47,613 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> 3e754f75ca06d39e1069a0bad88498ddd2436bb7 [2018-12-31 09:40:47,650 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 09:40:47,664 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 09:40:47,670 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 09:40:47,672 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 09:40:47,672 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 09:40:47,674 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec1_product33_false-unreach-call_false-termination.cil.c [2018-12-31 09:40:47,756 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b2fb052e/c05a9735396843f0a1d5ec182663acde/FLAG1717e6a8f [2018-12-31 09:40:48,303 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 09:40:48,304 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec1_product33_false-unreach-call_false-termination.cil.c [2018-12-31 09:40:48,323 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b2fb052e/c05a9735396843f0a1d5ec182663acde/FLAG1717e6a8f [2018-12-31 09:40:48,565 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b2fb052e/c05a9735396843f0a1d5ec182663acde [2018-12-31 09:40:48,569 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 09:40:48,570 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 09:40:48,572 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 09:40:48,572 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 09:40:48,576 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 09:40:48,576 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:40:48" (1/1) ... [2018-12-31 09:40:48,580 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3041d37c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:40:48, skipping insertion in model container [2018-12-31 09:40:48,581 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:40:48" (1/1) ... [2018-12-31 09:40:48,591 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 09:40:48,655 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 09:40:49,013 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:40:49,041 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 09:40:49,270 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:40:49,320 INFO L195 MainTranslator]: Completed translation [2018-12-31 09:40:49,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:40:49 WrapperNode [2018-12-31 09:40:49,321 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 09:40:49,323 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 09:40:49,323 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 09:40:49,323 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 09:40:49,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:40:49" (1/1) ... [2018-12-31 09:40:49,370 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:40:49" (1/1) ... [2018-12-31 09:40:49,429 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 09:40:49,432 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 09:40:49,432 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 09:40:49,432 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 09:40:49,448 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:40:49" (1/1) ... [2018-12-31 09:40:49,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:40:49" (1/1) ... [2018-12-31 09:40:49,453 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:40:49" (1/1) ... [2018-12-31 09:40:49,453 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:40:49" (1/1) ... [2018-12-31 09:40:49,462 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:40:49" (1/1) ... [2018-12-31 09:40:49,470 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:40:49" (1/1) ... [2018-12-31 09:40:49,473 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:40:49" (1/1) ... [2018-12-31 09:40:49,478 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 09:40:49,478 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 09:40:49,479 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 09:40:49,479 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 09:40:49,480 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:40:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:40:49,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 09:40:49,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-31 09:40:49,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 09:40:49,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 09:40:50,663 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 09:40:50,664 INFO L280 CfgBuilder]: Removed 96 assue(true) statements. [2018-12-31 09:40:50,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:40:50 BoogieIcfgContainer [2018-12-31 09:40:50,664 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 09:40:50,665 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 09:40:50,665 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 09:40:50,669 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 09:40:50,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 09:40:48" (1/3) ... [2018-12-31 09:40:50,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e29aefb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:40:50, skipping insertion in model container [2018-12-31 09:40:50,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:40:49" (2/3) ... [2018-12-31 09:40:50,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e29aefb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:40:50, skipping insertion in model container [2018-12-31 09:40:50,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:40:50" (3/3) ... [2018-12-31 09:40:50,672 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product33_false-unreach-call_false-termination.cil.c [2018-12-31 09:40:50,682 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 09:40:50,689 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 09:40:50,706 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 09:40:50,741 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 09:40:50,742 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 09:40:50,742 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 09:40:50,742 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 09:40:50,743 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 09:40:50,743 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 09:40:50,743 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 09:40:50,744 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 09:40:50,744 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 09:40:50,761 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2018-12-31 09:40:50,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 09:40:50,769 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:40:50,770 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:40:50,772 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:40:50,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:40:50,779 INFO L82 PathProgramCache]: Analyzing trace with hash 768274677, now seen corresponding path program 1 times [2018-12-31 09:40:50,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:40:50,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:40:50,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:40:50,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:40:50,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:40:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:40:51,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:40:51,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:40:51,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:40:51,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 09:40:51,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 09:40:51,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 09:40:51,125 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 2 states. [2018-12-31 09:40:51,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:40:51,152 INFO L93 Difference]: Finished difference Result 150 states and 227 transitions. [2018-12-31 09:40:51,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 09:40:51,154 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-12-31 09:40:51,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:40:51,167 INFO L225 Difference]: With dead ends: 150 [2018-12-31 09:40:51,167 INFO L226 Difference]: Without dead ends: 74 [2018-12-31 09:40:51,171 INFO L631 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 [2018-12-31 09:40:51,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-31 09:40:51,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-31 09:40:51,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-31 09:40:51,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 105 transitions. [2018-12-31 09:40:51,217 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 105 transitions. Word has length 16 [2018-12-31 09:40:51,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:40:51,217 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 105 transitions. [2018-12-31 09:40:51,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 09:40:51,218 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2018-12-31 09:40:51,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-31 09:40:51,219 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:40:51,219 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:40:51,219 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:40:51,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:40:51,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1484097871, now seen corresponding path program 1 times [2018-12-31 09:40:51,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:40:51,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:40:51,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:40:51,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:40:51,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:40:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:40:51,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:40:51,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:40:51,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:40:51,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:40:51,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:40:51,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:40:51,439 INFO L87 Difference]: Start difference. First operand 74 states and 105 transitions. Second operand 3 states. [2018-12-31 09:40:51,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:40:51,473 INFO L93 Difference]: Finished difference Result 74 states and 105 transitions. [2018-12-31 09:40:51,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:40:51,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-31 09:40:51,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:40:51,475 INFO L225 Difference]: With dead ends: 74 [2018-12-31 09:40:51,475 INFO L226 Difference]: Without dead ends: 34 [2018-12-31 09:40:51,478 INFO L631 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 [2018-12-31 09:40:51,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-31 09:40:51,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-31 09:40:51,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-31 09:40:51,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2018-12-31 09:40:51,486 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 17 [2018-12-31 09:40:51,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:40:51,486 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2018-12-31 09:40:51,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:40:51,486 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2018-12-31 09:40:51,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-31 09:40:51,487 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:40:51,488 INFO L402 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] [2018-12-31 09:40:51,488 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:40:51,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:40:51,489 INFO L82 PathProgramCache]: Analyzing trace with hash 670124178, now seen corresponding path program 1 times [2018-12-31 09:40:51,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:40:51,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:40:51,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:40:51,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:40:51,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:40:51,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:40:51,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:40:51,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:40:51,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:40:51,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:40:51,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:40:51,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:40:51,642 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand 3 states. [2018-12-31 09:40:51,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:40:51,662 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2018-12-31 09:40:51,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:40:51,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-31 09:40:51,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:40:51,665 INFO L225 Difference]: With dead ends: 62 [2018-12-31 09:40:51,665 INFO L226 Difference]: Without dead ends: 34 [2018-12-31 09:40:51,666 INFO L631 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 [2018-12-31 09:40:51,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-31 09:40:51,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-31 09:40:51,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-31 09:40:51,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 47 transitions. [2018-12-31 09:40:51,674 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 47 transitions. Word has length 22 [2018-12-31 09:40:51,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:40:51,674 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 47 transitions. [2018-12-31 09:40:51,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:40:51,674 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2018-12-31 09:40:51,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-31 09:40:51,677 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:40:51,678 INFO L402 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] [2018-12-31 09:40:51,678 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:40:51,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:40:51,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1804645939, now seen corresponding path program 1 times [2018-12-31 09:40:51,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:40:51,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:40:51,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:40:51,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:40:51,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:40:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:40:51,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:40:51,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:40:51,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:40:51,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:40:51,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:40:51,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:40:51,773 INFO L87 Difference]: Start difference. First operand 34 states and 47 transitions. Second operand 3 states. [2018-12-31 09:40:51,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:40:51,850 INFO L93 Difference]: Finished difference Result 83 states and 118 transitions. [2018-12-31 09:40:51,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:40:51,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-31 09:40:51,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:40:51,852 INFO L225 Difference]: With dead ends: 83 [2018-12-31 09:40:51,852 INFO L226 Difference]: Without dead ends: 55 [2018-12-31 09:40:51,853 INFO L631 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 [2018-12-31 09:40:51,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-31 09:40:51,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2018-12-31 09:40:51,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-31 09:40:51,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 74 transitions. [2018-12-31 09:40:51,869 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 74 transitions. Word has length 23 [2018-12-31 09:40:51,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:40:51,869 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 74 transitions. [2018-12-31 09:40:51,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:40:51,876 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 74 transitions. [2018-12-31 09:40:51,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-31 09:40:51,877 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:40:51,877 INFO L402 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] [2018-12-31 09:40:51,877 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:40:51,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:40:51,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1746371458, now seen corresponding path program 1 times [2018-12-31 09:40:51,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:40:51,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:40:51,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:40:51,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:40:51,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:40:51,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:40:52,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:40:52,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:40:52,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:40:52,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:40:52,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:40:52,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:40:52,044 INFO L87 Difference]: Start difference. First operand 53 states and 74 transitions. Second operand 5 states. [2018-12-31 09:40:52,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:40:52,238 INFO L93 Difference]: Finished difference Result 139 states and 194 transitions. [2018-12-31 09:40:52,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:40:52,240 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-12-31 09:40:52,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:40:52,241 INFO L225 Difference]: With dead ends: 139 [2018-12-31 09:40:52,241 INFO L226 Difference]: Without dead ends: 92 [2018-12-31 09:40:52,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 09:40:52,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-31 09:40:52,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 56. [2018-12-31 09:40:52,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-31 09:40:52,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 77 transitions. [2018-12-31 09:40:52,256 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 77 transitions. Word has length 29 [2018-12-31 09:40:52,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:40:52,256 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 77 transitions. [2018-12-31 09:40:52,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:40:52,257 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 77 transitions. [2018-12-31 09:40:52,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-31 09:40:52,257 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:40:52,258 INFO L402 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] [2018-12-31 09:40:52,258 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:40:52,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:40:52,259 INFO L82 PathProgramCache]: Analyzing trace with hash 916139585, now seen corresponding path program 1 times [2018-12-31 09:40:52,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:40:52,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:40:52,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:40:52,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:40:52,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:40:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:40:52,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:40:52,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:40:52,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:40:52,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:40:52,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:40:52,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:40:52,396 INFO L87 Difference]: Start difference. First operand 56 states and 77 transitions. Second operand 5 states. [2018-12-31 09:40:52,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:40:52,601 INFO L93 Difference]: Finished difference Result 270 states and 384 transitions. [2018-12-31 09:40:52,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 09:40:52,603 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-12-31 09:40:52,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:40:52,605 INFO L225 Difference]: With dead ends: 270 [2018-12-31 09:40:52,608 INFO L226 Difference]: Without dead ends: 220 [2018-12-31 09:40:52,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:40:52,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-12-31 09:40:52,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 100. [2018-12-31 09:40:52,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-31 09:40:52,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 137 transitions. [2018-12-31 09:40:52,651 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 137 transitions. Word has length 29 [2018-12-31 09:40:52,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:40:52,651 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 137 transitions. [2018-12-31 09:40:52,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:40:52,655 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 137 transitions. [2018-12-31 09:40:52,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-31 09:40:52,656 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:40:52,656 INFO L402 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] [2018-12-31 09:40:52,657 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:40:52,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:40:52,657 INFO L82 PathProgramCache]: Analyzing trace with hash -863305781, now seen corresponding path program 1 times [2018-12-31 09:40:52,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:40:52,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:40:52,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:40:52,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:40:52,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:40:52,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:40:52,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:40:52,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:40:52,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:40:52,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:40:52,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:40:52,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:40:52,910 INFO L87 Difference]: Start difference. First operand 100 states and 137 transitions. Second operand 5 states. [2018-12-31 09:40:53,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:40:53,496 INFO L93 Difference]: Finished difference Result 280 states and 386 transitions. [2018-12-31 09:40:53,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 09:40:53,497 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-12-31 09:40:53,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:40:53,499 INFO L225 Difference]: With dead ends: 280 [2018-12-31 09:40:53,499 INFO L226 Difference]: Without dead ends: 278 [2018-12-31 09:40:53,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:40:53,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-12-31 09:40:53,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 100. [2018-12-31 09:40:53,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-31 09:40:53,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 136 transitions. [2018-12-31 09:40:53,521 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 136 transitions. Word has length 30 [2018-12-31 09:40:53,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:40:53,521 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 136 transitions. [2018-12-31 09:40:53,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:40:53,521 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 136 transitions. [2018-12-31 09:40:53,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-31 09:40:53,523 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:40:53,523 INFO L402 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] [2018-12-31 09:40:53,523 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:40:53,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:40:53,524 INFO L82 PathProgramCache]: Analyzing trace with hash 376123462, now seen corresponding path program 1 times [2018-12-31 09:40:53,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:40:53,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:40:53,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:40:53,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:40:53,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:40:53,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:40:53,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:40:53,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:40:53,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:40:53,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:40:53,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:40:53,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:40:53,780 INFO L87 Difference]: Start difference. First operand 100 states and 136 transitions. Second operand 5 states. [2018-12-31 09:40:54,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:40:54,374 INFO L93 Difference]: Finished difference Result 276 states and 374 transitions. [2018-12-31 09:40:54,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:40:54,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-12-31 09:40:54,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:40:54,376 INFO L225 Difference]: With dead ends: 276 [2018-12-31 09:40:54,376 INFO L226 Difference]: Without dead ends: 182 [2018-12-31 09:40:54,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:40:54,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-12-31 09:40:54,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 104. [2018-12-31 09:40:54,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-31 09:40:54,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 140 transitions. [2018-12-31 09:40:54,409 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 140 transitions. Word has length 30 [2018-12-31 09:40:54,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:40:54,409 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 140 transitions. [2018-12-31 09:40:54,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:40:54,409 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 140 transitions. [2018-12-31 09:40:54,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-31 09:40:54,411 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:40:54,411 INFO L402 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] [2018-12-31 09:40:54,411 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:40:54,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:40:54,413 INFO L82 PathProgramCache]: Analyzing trace with hash 634288900, now seen corresponding path program 1 times [2018-12-31 09:40:54,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:40:54,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:40:54,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:40:54,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:40:54,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:40:54,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:40:54,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:40:54,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:40:54,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:40:54,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:40:54,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:40:54,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:40:54,515 INFO L87 Difference]: Start difference. First operand 104 states and 140 transitions. Second operand 3 states. [2018-12-31 09:40:54,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:40:54,659 INFO L93 Difference]: Finished difference Result 250 states and 336 transitions. [2018-12-31 09:40:54,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:40:54,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-31 09:40:54,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:40:54,662 INFO L225 Difference]: With dead ends: 250 [2018-12-31 09:40:54,662 INFO L226 Difference]: Without dead ends: 152 [2018-12-31 09:40:54,663 INFO L631 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 [2018-12-31 09:40:54,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-12-31 09:40:54,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-12-31 09:40:54,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-31 09:40:54,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 198 transitions. [2018-12-31 09:40:54,700 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 198 transitions. Word has length 30 [2018-12-31 09:40:54,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:40:54,700 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 198 transitions. [2018-12-31 09:40:54,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:40:54,700 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 198 transitions. [2018-12-31 09:40:54,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 09:40:54,702 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:40:54,702 INFO L402 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] [2018-12-31 09:40:54,706 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:40:54,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:40:54,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1373527294, now seen corresponding path program 1 times [2018-12-31 09:40:54,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:40:54,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:40:54,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:40:54,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:40:54,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:40:55,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:40:55,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:40:55,482 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 09:40:55,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 09:40:55 BoogieIcfgContainer [2018-12-31 09:40:55,596 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 09:40:55,596 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 09:40:55,596 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 09:40:55,597 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 09:40:55,597 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:40:50" (3/4) ... [2018-12-31 09:40:55,600 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 09:40:55,732 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 09:40:55,732 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 09:40:55,733 INFO L168 Benchmark]: Toolchain (without parser) took 7163.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 188.7 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -160.3 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2018-12-31 09:40:55,735 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:40:55,735 INFO L168 Benchmark]: CACSL2BoogieTranslator took 749.71 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -137.6 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. [2018-12-31 09:40:55,736 INFO L168 Benchmark]: Boogie Procedure Inliner took 106.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-31 09:40:55,736 INFO L168 Benchmark]: Boogie Preprocessor took 46.34 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:40:55,737 INFO L168 Benchmark]: RCFGBuilder took 1186.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.8 MB). Peak memory consumption was 53.8 MB. Max. memory is 11.5 GB. [2018-12-31 09:40:55,737 INFO L168 Benchmark]: TraceAbstraction took 4930.89 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 83.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -91.7 MB). Peak memory consumption was 275.5 MB. Max. memory is 11.5 GB. [2018-12-31 09:40:55,738 INFO L168 Benchmark]: Witness Printer took 135.93 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: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. [2018-12-31 09:40:55,752 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 749.71 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -137.6 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 106.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.34 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1186.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.8 MB). Peak memory consumption was 53.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4930.89 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 83.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -91.7 MB). Peak memory consumption was 275.5 MB. Max. memory is 11.5 GB. * Witness Printer took 135.93 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: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 410]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L209] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L424] int pumpRunning = 0; [L425] int systemActive = 1; [L683] int cleanupTimeShifts = 4; [L806] int waterLevel = 1; [L807] int methaneLevelCritical = 0; [L756] int retValue_acc ; [L757] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L674] int retValue_acc ; [L677] retValue_acc = 1 [L678] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L763] tmp = valid_product() [L765] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L581] int splverifierCounter ; [L582] int tmp ; [L583] int tmp___0 ; [L584] int tmp___1 ; [L585] int tmp___2 ; [L588] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L590] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L592] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L598] tmp = __VERIFIER_nondet_int() [L600] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L824] COND TRUE waterLevel < 2 [L825] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L608] tmp___0 = __VERIFIER_nondet_int() [L610] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L836] COND FALSE !(\read(methaneLevelCritical)) [L839] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L618] tmp___2 = __VERIFIER_nondet_int() [L620] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L432] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L439] COND TRUE \read(systemActive) [L461] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L464] COND TRUE ! pumpRunning [L558] int retValue_acc ; [L559] int tmp ; [L560] int tmp___0 ; [L886] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L889] COND FALSE !(waterLevel < 2) [L893] retValue_acc = 0 [L894] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L564] tmp = isHighWaterSensorDry() [L566] COND FALSE !(\read(tmp)) [L569] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L571] retValue_acc = tmp___0 [L572] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L466] tmp = isHighWaterLevel() [L468] COND TRUE \read(tmp) [L489] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L780] int tmp ; [L781] int tmp___0 ; [L845] int retValue_acc ; [L848] retValue_acc = methaneLevelCritical [L849] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L785] tmp = isMethaneLevelCritical() [L787] COND TRUE \read(tmp) [L513] int retValue_acc ; [L516] retValue_acc = pumpRunning [L517] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L789] tmp___0 = isPumpRunning() [L791] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L410] __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, 78 locations, 3 error locations. UNSAFE Result, 4.8s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 577 SDtfs, 704 SDslu, 767 SDs, 0 SdLazy, 102 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 414 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 257 NumberOfCodeBlocks, 257 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 217 ConstructedInterpolants, 0 QuantifiedInterpolants, 12233 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...