./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec4_product42_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_spec4_product42_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 c0851c41d1dd56ed840a839dd5bb938ccfe6bf65 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:43:54,656 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 09:43:54,658 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 09:43:54,670 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 09:43:54,671 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 09:43:54,672 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 09:43:54,673 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 09:43:54,675 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 09:43:54,677 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 09:43:54,678 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 09:43:54,679 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 09:43:54,679 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 09:43:54,680 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 09:43:54,681 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 09:43:54,682 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 09:43:54,683 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 09:43:54,684 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 09:43:54,686 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 09:43:54,688 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 09:43:54,690 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 09:43:54,691 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 09:43:54,692 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 09:43:54,695 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 09:43:54,696 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 09:43:54,696 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 09:43:54,697 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 09:43:54,698 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 09:43:54,699 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 09:43:54,700 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 09:43:54,701 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 09:43:54,702 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 09:43:54,703 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 09:43:54,703 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 09:43:54,703 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 09:43:54,704 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 09:43:54,705 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 09:43:54,706 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:43:54,721 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 09:43:54,721 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 09:43:54,723 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 09:43:54,723 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 09:43:54,723 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 09:43:54,724 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 09:43:54,724 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 09:43:54,724 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 09:43:54,724 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 09:43:54,725 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 09:43:54,725 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 09:43:54,725 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 09:43:54,725 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 09:43:54,725 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 09:43:54,725 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 09:43:54,726 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 09:43:54,726 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 09:43:54,726 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 09:43:54,726 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 09:43:54,726 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 09:43:54,726 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 09:43:54,728 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:43:54,728 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 09:43:54,729 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 09:43:54,729 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 09:43:54,729 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 09:43:54,729 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 09:43:54,730 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 09:43:54,730 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 -> c0851c41d1dd56ed840a839dd5bb938ccfe6bf65 [2018-12-31 09:43:54,768 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 09:43:54,784 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 09:43:54,790 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 09:43:54,792 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 09:43:54,793 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 09:43:54,794 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec4_product42_false-unreach-call_false-termination.cil.c [2018-12-31 09:43:54,857 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11fa55d82/9c33398c4b324529a79832b98b028fbc/FLAG1c03a20ef [2018-12-31 09:43:55,345 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 09:43:55,346 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec4_product42_false-unreach-call_false-termination.cil.c [2018-12-31 09:43:55,360 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11fa55d82/9c33398c4b324529a79832b98b028fbc/FLAG1c03a20ef [2018-12-31 09:43:55,661 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11fa55d82/9c33398c4b324529a79832b98b028fbc [2018-12-31 09:43:55,666 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 09:43:55,668 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 09:43:55,669 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 09:43:55,669 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 09:43:55,674 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 09:43:55,674 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:43:55" (1/1) ... [2018-12-31 09:43:55,678 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11793065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:55, skipping insertion in model container [2018-12-31 09:43:55,678 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:43:55" (1/1) ... [2018-12-31 09:43:55,687 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 09:43:55,749 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 09:43:56,139 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:43:56,154 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 09:43:56,238 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:43:56,283 INFO L195 MainTranslator]: Completed translation [2018-12-31 09:43:56,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:56 WrapperNode [2018-12-31 09:43:56,284 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 09:43:56,285 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 09:43:56,286 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 09:43:56,286 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 09:43:56,409 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:43:56" (1/1) ... [2018-12-31 09:43:56,449 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:43:56" (1/1) ... [2018-12-31 09:43:56,510 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 09:43:56,511 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 09:43:56,511 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 09:43:56,511 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 09:43:56,523 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:56" (1/1) ... [2018-12-31 09:43:56,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:56" (1/1) ... [2018-12-31 09:43:56,537 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:56" (1/1) ... [2018-12-31 09:43:56,538 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:56" (1/1) ... [2018-12-31 09:43:56,553 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:56" (1/1) ... [2018-12-31 09:43:56,570 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:56" (1/1) ... [2018-12-31 09:43:56,574 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:56" (1/1) ... [2018-12-31 09:43:56,583 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 09:43:56,584 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 09:43:56,584 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 09:43:56,584 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 09:43:56,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:56" (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:43:56,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 09:43:56,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-31 09:43:56,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 09:43:56,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 09:43:58,007 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 09:43:58,007 INFO L280 CfgBuilder]: Removed 116 assue(true) statements. [2018-12-31 09:43:58,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:43:58 BoogieIcfgContainer [2018-12-31 09:43:58,008 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 09:43:58,009 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 09:43:58,009 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 09:43:58,013 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 09:43:58,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 09:43:55" (1/3) ... [2018-12-31 09:43:58,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ef711c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:43:58, skipping insertion in model container [2018-12-31 09:43:58,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:56" (2/3) ... [2018-12-31 09:43:58,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ef711c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:43:58, skipping insertion in model container [2018-12-31 09:43:58,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:43:58" (3/3) ... [2018-12-31 09:43:58,016 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product42_false-unreach-call_false-termination.cil.c [2018-12-31 09:43:58,026 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 09:43:58,035 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 09:43:58,054 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 09:43:58,088 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 09:43:58,089 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 09:43:58,089 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 09:43:58,089 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 09:43:58,090 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 09:43:58,090 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 09:43:58,090 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 09:43:58,090 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 09:43:58,090 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 09:43:58,110 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2018-12-31 09:43:58,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 09:43:58,118 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:43:58,119 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:43:58,121 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:43:58,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:43:58,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1594902839, now seen corresponding path program 1 times [2018-12-31 09:43:58,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:43:58,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:43:58,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:58,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:58,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:58,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:43:58,448 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:43:58,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:43:58,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:43:58,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 09:43:58,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 09:43:58,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 09:43:58,478 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 2 states. [2018-12-31 09:43:58,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:43:58,512 INFO L93 Difference]: Finished difference Result 168 states and 251 transitions. [2018-12-31 09:43:58,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 09:43:58,514 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-12-31 09:43:58,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:43:58,528 INFO L225 Difference]: With dead ends: 168 [2018-12-31 09:43:58,529 INFO L226 Difference]: Without dead ends: 83 [2018-12-31 09:43:58,533 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:43:58,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-31 09:43:58,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-31 09:43:58,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-31 09:43:58,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 117 transitions. [2018-12-31 09:43:58,585 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 117 transitions. Word has length 16 [2018-12-31 09:43:58,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:43:58,586 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 117 transitions. [2018-12-31 09:43:58,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 09:43:58,586 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 117 transitions. [2018-12-31 09:43:58,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-31 09:43:58,587 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:43:58,588 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:43:58,588 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:43:58,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:43:58,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1653307560, now seen corresponding path program 1 times [2018-12-31 09:43:58,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:43:58,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:43:58,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:58,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:58,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:58,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:43:58,791 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:43:58,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:43:58,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:43:58,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:43:58,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:43:58,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:43:58,796 INFO L87 Difference]: Start difference. First operand 83 states and 117 transitions. Second operand 3 states. [2018-12-31 09:43:58,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:43:58,816 INFO L93 Difference]: Finished difference Result 83 states and 117 transitions. [2018-12-31 09:43:58,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:43:58,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-31 09:43:58,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:43:58,818 INFO L225 Difference]: With dead ends: 83 [2018-12-31 09:43:58,818 INFO L226 Difference]: Without dead ends: 37 [2018-12-31 09:43:58,820 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:43:58,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-31 09:43:58,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-31 09:43:58,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-31 09:43:58,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 52 transitions. [2018-12-31 09:43:58,827 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 52 transitions. Word has length 17 [2018-12-31 09:43:58,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:43:58,828 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 52 transitions. [2018-12-31 09:43:58,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:43:58,828 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 52 transitions. [2018-12-31 09:43:58,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-31 09:43:58,830 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:43:58,830 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:43:58,831 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:43:58,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:43:58,831 INFO L82 PathProgramCache]: Analyzing trace with hash 533078269, now seen corresponding path program 1 times [2018-12-31 09:43:58,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:43:58,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:43:58,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:58,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:58,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:43:58,960 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:43:58,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:43:58,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:43:58,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:43:58,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:43:58,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:43:58,961 INFO L87 Difference]: Start difference. First operand 37 states and 52 transitions. Second operand 3 states. [2018-12-31 09:43:59,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:43:59,030 INFO L93 Difference]: Finished difference Result 68 states and 98 transitions. [2018-12-31 09:43:59,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:43:59,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-31 09:43:59,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:43:59,033 INFO L225 Difference]: With dead ends: 68 [2018-12-31 09:43:59,035 INFO L226 Difference]: Without dead ends: 37 [2018-12-31 09:43:59,036 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:43:59,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-31 09:43:59,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-31 09:43:59,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-31 09:43:59,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2018-12-31 09:43:59,051 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 22 [2018-12-31 09:43:59,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:43:59,052 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2018-12-31 09:43:59,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:43:59,052 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2018-12-31 09:43:59,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-31 09:43:59,053 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:43:59,053 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:43:59,054 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:43:59,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:43:59,056 INFO L82 PathProgramCache]: Analyzing trace with hash 545820985, now seen corresponding path program 1 times [2018-12-31 09:43:59,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:43:59,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:43:59,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:59,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:59,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:43:59,186 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:43:59,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:43:59,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:43:59,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:43:59,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:43:59,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:43:59,189 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 3 states. [2018-12-31 09:43:59,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:43:59,360 INFO L93 Difference]: Finished difference Result 89 states and 126 transitions. [2018-12-31 09:43:59,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:43:59,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-31 09:43:59,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:43:59,362 INFO L225 Difference]: With dead ends: 89 [2018-12-31 09:43:59,362 INFO L226 Difference]: Without dead ends: 58 [2018-12-31 09:43:59,365 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:43:59,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-31 09:43:59,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-12-31 09:43:59,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-31 09:43:59,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 78 transitions. [2018-12-31 09:43:59,383 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 78 transitions. Word has length 23 [2018-12-31 09:43:59,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:43:59,384 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 78 transitions. [2018-12-31 09:43:59,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:43:59,384 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 78 transitions. [2018-12-31 09:43:59,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-31 09:43:59,385 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:43:59,385 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:43:59,386 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:43:59,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:43:59,387 INFO L82 PathProgramCache]: Analyzing trace with hash 2110814541, now seen corresponding path program 1 times [2018-12-31 09:43:59,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:43:59,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:43:59,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:59,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:59,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:59,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:43:59,660 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:43:59,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:43:59,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 09:43:59,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 09:43:59,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 09:43:59,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-31 09:43:59,663 INFO L87 Difference]: Start difference. First operand 56 states and 78 transitions. Second operand 7 states. [2018-12-31 09:43:59,979 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-31 09:44:00,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:44:00,413 INFO L93 Difference]: Finished difference Result 347 states and 506 transitions. [2018-12-31 09:44:00,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 09:44:00,415 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-12-31 09:44:00,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:44:00,418 INFO L225 Difference]: With dead ends: 347 [2018-12-31 09:44:00,419 INFO L226 Difference]: Without dead ends: 297 [2018-12-31 09:44:00,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-12-31 09:44:00,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-12-31 09:44:00,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 140. [2018-12-31 09:44:00,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-12-31 09:44:00,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 193 transitions. [2018-12-31 09:44:00,446 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 193 transitions. Word has length 29 [2018-12-31 09:44:00,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:44:00,447 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 193 transitions. [2018-12-31 09:44:00,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 09:44:00,447 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 193 transitions. [2018-12-31 09:44:00,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-31 09:44:00,450 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:44:00,450 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:44:00,450 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:44:00,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:44:00,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1559974996, now seen corresponding path program 1 times [2018-12-31 09:44:00,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:44:00,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:44:00,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:00,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:44:00,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:44:00,710 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-31 09:44:00,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:44:00,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:44:00,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:44:00,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:44:00,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:44:00,712 INFO L87 Difference]: Start difference. First operand 140 states and 193 transitions. Second operand 5 states. [2018-12-31 09:44:00,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:44:00,968 INFO L93 Difference]: Finished difference Result 388 states and 531 transitions. [2018-12-31 09:44:00,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:44:00,969 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-31 09:44:00,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:44:00,971 INFO L225 Difference]: With dead ends: 388 [2018-12-31 09:44:00,971 INFO L226 Difference]: Without dead ends: 254 [2018-12-31 09:44:00,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 09:44:00,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-12-31 09:44:01,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 149. [2018-12-31 09:44:01,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-12-31 09:44:01,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 202 transitions. [2018-12-31 09:44:01,023 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 202 transitions. Word has length 47 [2018-12-31 09:44:01,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:44:01,024 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 202 transitions. [2018-12-31 09:44:01,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:44:01,024 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 202 transitions. [2018-12-31 09:44:01,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-31 09:44:01,034 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:44:01,034 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:44:01,035 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:44:01,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:44:01,035 INFO L82 PathProgramCache]: Analyzing trace with hash -2069448086, now seen corresponding path program 1 times [2018-12-31 09:44:01,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:44:01,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:44:01,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:01,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:44:01,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:44:01,214 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-31 09:44:01,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:44:01,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:44:01,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 09:44:01,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 09:44:01,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 09:44:01,217 INFO L87 Difference]: Start difference. First operand 149 states and 202 transitions. Second operand 4 states. [2018-12-31 09:44:01,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:44:01,399 INFO L93 Difference]: Finished difference Result 311 states and 422 transitions. [2018-12-31 09:44:01,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 09:44:01,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-12-31 09:44:01,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:44:01,401 INFO L225 Difference]: With dead ends: 311 [2018-12-31 09:44:01,402 INFO L226 Difference]: Without dead ends: 168 [2018-12-31 09:44:01,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:44:01,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-12-31 09:44:01,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 123. [2018-12-31 09:44:01,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-12-31 09:44:01,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 164 transitions. [2018-12-31 09:44:01,436 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 164 transitions. Word has length 47 [2018-12-31 09:44:01,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:44:01,437 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 164 transitions. [2018-12-31 09:44:01,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 09:44:01,437 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 164 transitions. [2018-12-31 09:44:01,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-31 09:44:01,438 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:44:01,440 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:44:01,440 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:44:01,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:44:01,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1874975382, now seen corresponding path program 1 times [2018-12-31 09:44:01,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:44:01,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:44:01,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:01,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:44:01,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:01,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:44:01,747 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:44:01,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:44:01,747 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:44:01,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:44:01,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:44:01,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:44:02,041 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:44:02,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:44:02,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-12-31 09:44:02,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 09:44:02,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 09:44:02,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:44:02,072 INFO L87 Difference]: Start difference. First operand 123 states and 164 transitions. Second operand 8 states. [2018-12-31 09:44:03,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:44:03,332 INFO L93 Difference]: Finished difference Result 424 states and 586 transitions. [2018-12-31 09:44:03,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 09:44:03,333 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2018-12-31 09:44:03,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:44:03,339 INFO L225 Difference]: With dead ends: 424 [2018-12-31 09:44:03,339 INFO L226 Difference]: Without dead ends: 330 [2018-12-31 09:44:03,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2018-12-31 09:44:03,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-12-31 09:44:03,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 162. [2018-12-31 09:44:03,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-12-31 09:44:03,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 215 transitions. [2018-12-31 09:44:03,382 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 215 transitions. Word has length 48 [2018-12-31 09:44:03,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:44:03,382 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 215 transitions. [2018-12-31 09:44:03,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 09:44:03,382 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 215 transitions. [2018-12-31 09:44:03,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-31 09:44:03,389 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:44:03,390 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:44:03,390 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:44:03,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:44:03,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1478909471, now seen corresponding path program 2 times [2018-12-31 09:44:03,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:44:03,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:44:03,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:03,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:44:03,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:03,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:44:04,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:44:04,183 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 09:44:04,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 09:44:04 BoogieIcfgContainer [2018-12-31 09:44:04,345 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 09:44:04,346 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 09:44:04,346 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 09:44:04,346 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 09:44:04,346 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:43:58" (3/4) ... [2018-12-31 09:44:04,349 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 09:44:04,542 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 09:44:04,543 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 09:44:04,543 INFO L168 Benchmark]: Toolchain (without parser) took 8876.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 197.7 MB). Free memory was 951.4 MB in the beginning and 1.0 GB in the end (delta: -63.6 MB). Peak memory consumption was 134.1 MB. Max. memory is 11.5 GB. [2018-12-31 09:44:04,544 INFO L168 Benchmark]: CDTParser took 0.16 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:44:04,544 INFO L168 Benchmark]: CACSL2BoogieTranslator took 615.74 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 924.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-12-31 09:44:04,545 INFO L168 Benchmark]: Boogie Procedure Inliner took 224.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -184.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-12-31 09:44:04,545 INFO L168 Benchmark]: Boogie Preprocessor took 72.71 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. [2018-12-31 09:44:04,546 INFO L168 Benchmark]: RCFGBuilder took 1424.56 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: 59.5 MB). Peak memory consumption was 59.5 MB. Max. memory is 11.5 GB. [2018-12-31 09:44:04,546 INFO L168 Benchmark]: TraceAbstraction took 6336.21 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.0 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 11.5 MB). Peak memory consumption was 87.5 MB. Max. memory is 11.5 GB. [2018-12-31 09:44:04,546 INFO L168 Benchmark]: Witness Printer took 197.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2018-12-31 09:44:04,553 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.16 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 615.74 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 924.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 224.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -184.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 72.71 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 1424.56 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: 59.5 MB). Peak memory consumption was 59.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6336.21 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.0 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 11.5 MB). Peak memory consumption was 87.5 MB. Max. memory is 11.5 GB. * Witness Printer took 197.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 924]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L47] int waterLevel = 1; [L48] int methaneLevelCritical = 0; [L310] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L573] int cleanupTimeShifts = 4; [L742] int pumpRunning = 0; [L743] int systemActive = 1; [L649] int retValue_acc ; [L650] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L536] int retValue_acc ; [L539] retValue_acc = 1 [L540] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L656] tmp = valid_product() [L658] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L674] int splverifierCounter ; [L675] int tmp ; [L676] int tmp___0 ; [L677] int tmp___1 ; [L678] int tmp___2 ; [L681] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L683] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L685] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L691] tmp = __VERIFIER_nondet_int() [L693] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L65] COND TRUE waterLevel < 2 [L66] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L701] tmp___0 = __VERIFIER_nondet_int() [L703] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L711] tmp___2 = __VERIFIER_nondet_int() [L713] COND TRUE \read(tmp___2) [L915] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L749] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L756] COND TRUE \read(systemActive) [L778] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L781] COND TRUE ! pumpRunning [L893] int retValue_acc ; [L894] int tmp ; [L895] int tmp___0 ; [L127] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L130] COND FALSE !(waterLevel < 2) [L134] retValue_acc = 0 [L135] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L899] tmp = isHighWaterSensorDry() [L901] COND FALSE !(\read(tmp)) [L904] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L906] retValue_acc = tmp___0 [L907] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L783] tmp = isHighWaterLevel() [L785] COND TRUE \read(tmp) [L812] int tmp ; [L837] int retValue_acc ; [L86] int retValue_acc ; [L89] retValue_acc = methaneLevelCritical [L90] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L841] retValue_acc = isMethaneLevelCritical() [L843] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L816] tmp = isMethaneAlarm() [L818] COND FALSE !(\read(tmp)) [L806] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L548] int tmp ; [L549] int tmp___0 ; [L118] int retValue_acc ; [L121] retValue_acc = waterLevel [L122] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L553] tmp = getWaterLevel() [L555] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L683] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L685] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L691] tmp = __VERIFIER_nondet_int() [L693] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L701] tmp___0 = __VERIFIER_nondet_int() [L703] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L711] tmp___2 = __VERIFIER_nondet_int() [L713] COND TRUE \read(tmp___2) [L915] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L749] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L53] COND TRUE waterLevel > 0 [L54] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L756] COND TRUE \read(systemActive) [L778] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L781] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L548] int tmp ; [L549] int tmp___0 ; [L118] int retValue_acc ; [L121] retValue_acc = waterLevel [L122] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L553] tmp = getWaterLevel() [L555] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L683] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L685] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L691] tmp = __VERIFIER_nondet_int() [L693] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L701] tmp___0 = __VERIFIER_nondet_int() [L703] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L711] tmp___2 = __VERIFIER_nondet_int() [L713] COND TRUE \read(tmp___2) [L915] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L749] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L53] COND TRUE waterLevel > 0 [L54] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L756] COND TRUE \read(systemActive) [L778] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L781] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L548] int tmp ; [L549] int tmp___0 ; [L118] int retValue_acc ; [L121] retValue_acc = waterLevel [L122] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L553] tmp = getWaterLevel() [L555] COND TRUE tmp == 0 [L848] int retValue_acc ; [L851] retValue_acc = pumpRunning [L852] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L557] tmp___0 = isPumpRunning() [L559] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L924] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 87 locations, 3 error locations. UNSAFE Result, 6.2s OverallTime, 9 OverallIterations, 3 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 600 SDtfs, 931 SDslu, 945 SDs, 0 SdLazy, 164 SolverSat, 52 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred in iteration=8, 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, 8 MinimizatonAttempts, 477 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 360 NumberOfCodeBlocks, 360 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 288 ConstructedInterpolants, 0 QuantifiedInterpolants, 18814 SizeOfPredicates, 4 NumberOfNonLiveVariables, 394 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 50/56 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...