./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec1_product36_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_product36_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 9eb4b34c09edb6dce3c64c5d30aa92b31214d915 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:41:00,278 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 09:41:00,280 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 09:41:00,292 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 09:41:00,293 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 09:41:00,294 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 09:41:00,296 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 09:41:00,298 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 09:41:00,302 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 09:41:00,303 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 09:41:00,304 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 09:41:00,304 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 09:41:00,305 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 09:41:00,306 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 09:41:00,307 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 09:41:00,308 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 09:41:00,309 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 09:41:00,311 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 09:41:00,313 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 09:41:00,315 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 09:41:00,316 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 09:41:00,317 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 09:41:00,320 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 09:41:00,320 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 09:41:00,321 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 09:41:00,322 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 09:41:00,323 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 09:41:00,324 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 09:41:00,325 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 09:41:00,326 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 09:41:00,326 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 09:41:00,327 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 09:41:00,327 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 09:41:00,328 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 09:41:00,329 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 09:41:00,330 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 09:41:00,330 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:41:00,347 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 09:41:00,347 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 09:41:00,349 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 09:41:00,349 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 09:41:00,349 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 09:41:00,350 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 09:41:00,350 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 09:41:00,350 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 09:41:00,350 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 09:41:00,351 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 09:41:00,351 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 09:41:00,351 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 09:41:00,351 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 09:41:00,352 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 09:41:00,352 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 09:41:00,352 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 09:41:00,352 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 09:41:00,353 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 09:41:00,353 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 09:41:00,353 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 09:41:00,353 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 09:41:00,354 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:41:00,354 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 09:41:00,354 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 09:41:00,354 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 09:41:00,355 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 09:41:00,355 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 09:41:00,355 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 09:41:00,355 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 -> 9eb4b34c09edb6dce3c64c5d30aa92b31214d915 [2018-12-31 09:41:00,395 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 09:41:00,413 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 09:41:00,420 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 09:41:00,422 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 09:41:00,422 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 09:41:00,423 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec1_product36_false-unreach-call_false-termination.cil.c [2018-12-31 09:41:00,488 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ef61fcbb/3fea8a7108844043a0a8852cd11fe74c/FLAGe50deb4de [2018-12-31 09:41:01,032 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 09:41:01,034 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec1_product36_false-unreach-call_false-termination.cil.c [2018-12-31 09:41:01,051 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ef61fcbb/3fea8a7108844043a0a8852cd11fe74c/FLAGe50deb4de [2018-12-31 09:41:01,308 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ef61fcbb/3fea8a7108844043a0a8852cd11fe74c [2018-12-31 09:41:01,312 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 09:41:01,313 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 09:41:01,315 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 09:41:01,315 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 09:41:01,319 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 09:41:01,320 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:41:01" (1/1) ... [2018-12-31 09:41:01,323 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a9e942 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:01, skipping insertion in model container [2018-12-31 09:41:01,324 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:41:01" (1/1) ... [2018-12-31 09:41:01,334 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 09:41:01,392 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 09:41:01,767 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:41:01,786 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 09:41:01,878 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:41:02,005 INFO L195 MainTranslator]: Completed translation [2018-12-31 09:41:02,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:02 WrapperNode [2018-12-31 09:41:02,005 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 09:41:02,006 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 09:41:02,007 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 09:41:02,009 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 09:41:02,020 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:41:02" (1/1) ... [2018-12-31 09:41:02,049 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:41:02" (1/1) ... [2018-12-31 09:41:02,118 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 09:41:02,124 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 09:41:02,124 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 09:41:02,124 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 09:41:02,142 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:02" (1/1) ... [2018-12-31 09:41:02,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:02" (1/1) ... [2018-12-31 09:41:02,155 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:02" (1/1) ... [2018-12-31 09:41:02,158 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:02" (1/1) ... [2018-12-31 09:41:02,175 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:02" (1/1) ... [2018-12-31 09:41:02,193 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:02" (1/1) ... [2018-12-31 09:41:02,199 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:02" (1/1) ... [2018-12-31 09:41:02,203 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 09:41:02,211 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 09:41:02,211 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 09:41:02,211 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 09:41:02,212 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:02" (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:41:02,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 09:41:02,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-31 09:41:02,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 09:41:02,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 09:41:03,561 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 09:41:03,561 INFO L280 CfgBuilder]: Removed 102 assue(true) statements. [2018-12-31 09:41:03,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:41:03 BoogieIcfgContainer [2018-12-31 09:41:03,562 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 09:41:03,563 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 09:41:03,563 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 09:41:03,566 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 09:41:03,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 09:41:01" (1/3) ... [2018-12-31 09:41:03,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9042cfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:41:03, skipping insertion in model container [2018-12-31 09:41:03,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:02" (2/3) ... [2018-12-31 09:41:03,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9042cfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:41:03, skipping insertion in model container [2018-12-31 09:41:03,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:41:03" (3/3) ... [2018-12-31 09:41:03,570 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product36_false-unreach-call_false-termination.cil.c [2018-12-31 09:41:03,580 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 09:41:03,588 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 09:41:03,606 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 09:41:03,640 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 09:41:03,641 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 09:41:03,641 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 09:41:03,641 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 09:41:03,641 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 09:41:03,641 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 09:41:03,641 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 09:41:03,642 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 09:41:03,642 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 09:41:03,659 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2018-12-31 09:41:03,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 09:41:03,667 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:03,668 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:41:03,670 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:03,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:03,676 INFO L82 PathProgramCache]: Analyzing trace with hash -502845476, now seen corresponding path program 1 times [2018-12-31 09:41:03,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:03,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:03,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:03,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:03,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:03,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:03,974 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:41:03,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:03,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:41:03,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 09:41:03,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 09:41:03,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 09:41:04,002 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 2 states. [2018-12-31 09:41:04,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:04,040 INFO L93 Difference]: Finished difference Result 154 states and 233 transitions. [2018-12-31 09:41:04,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 09:41:04,042 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-12-31 09:41:04,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:04,059 INFO L225 Difference]: With dead ends: 154 [2018-12-31 09:41:04,059 INFO L226 Difference]: Without dead ends: 76 [2018-12-31 09:41:04,063 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:41:04,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-31 09:41:04,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-31 09:41:04,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-31 09:41:04,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 108 transitions. [2018-12-31 09:41:04,120 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 108 transitions. Word has length 16 [2018-12-31 09:41:04,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:04,121 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 108 transitions. [2018-12-31 09:41:04,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 09:41:04,121 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 108 transitions. [2018-12-31 09:41:04,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-31 09:41:04,122 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:04,123 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:41:04,123 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:04,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:04,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1549602373, now seen corresponding path program 1 times [2018-12-31 09:41:04,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:04,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:04,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:04,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:04,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:04,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:04,279 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:41:04,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:04,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:41:04,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:41:04,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:41:04,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:41:04,284 INFO L87 Difference]: Start difference. First operand 76 states and 108 transitions. Second operand 3 states. [2018-12-31 09:41:04,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:04,301 INFO L93 Difference]: Finished difference Result 76 states and 108 transitions. [2018-12-31 09:41:04,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:41:04,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-31 09:41:04,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:04,303 INFO L225 Difference]: With dead ends: 76 [2018-12-31 09:41:04,303 INFO L226 Difference]: Without dead ends: 36 [2018-12-31 09:41:04,304 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:41:04,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-31 09:41:04,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-31 09:41:04,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-31 09:41:04,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2018-12-31 09:41:04,310 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 17 [2018-12-31 09:41:04,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:04,311 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2018-12-31 09:41:04,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:41:04,311 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2018-12-31 09:41:04,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-31 09:41:04,312 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:04,312 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:41:04,312 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:04,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:04,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1499295122, now seen corresponding path program 1 times [2018-12-31 09:41:04,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:04,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:04,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:04,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:04,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:04,470 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:41:04,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:04,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:41:04,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:41:04,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:41:04,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:41:04,472 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand 3 states. [2018-12-31 09:41:04,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:04,549 INFO L93 Difference]: Finished difference Result 96 states and 141 transitions. [2018-12-31 09:41:04,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:41:04,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-31 09:41:04,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:04,552 INFO L225 Difference]: With dead ends: 96 [2018-12-31 09:41:04,552 INFO L226 Difference]: Without dead ends: 66 [2018-12-31 09:41:04,552 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:41:04,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-31 09:41:04,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2018-12-31 09:41:04,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-31 09:41:04,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 91 transitions. [2018-12-31 09:41:04,563 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 91 transitions. Word has length 22 [2018-12-31 09:41:04,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:04,564 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 91 transitions. [2018-12-31 09:41:04,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:41:04,564 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 91 transitions. [2018-12-31 09:41:04,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-31 09:41:04,565 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:04,565 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:41:04,566 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:04,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:04,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1870150441, now seen corresponding path program 1 times [2018-12-31 09:41:04,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:04,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:04,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:04,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:04,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:04,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:04,678 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:41:04,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:04,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:41:04,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:41:04,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:41:04,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:41:04,681 INFO L87 Difference]: Start difference. First operand 62 states and 91 transitions. Second operand 3 states. [2018-12-31 09:41:04,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:04,842 INFO L93 Difference]: Finished difference Result 159 states and 238 transitions. [2018-12-31 09:41:04,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:41:04,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-31 09:41:04,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:04,845 INFO L225 Difference]: With dead ends: 159 [2018-12-31 09:41:04,845 INFO L226 Difference]: Without dead ends: 103 [2018-12-31 09:41:04,846 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:41:04,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-31 09:41:04,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2018-12-31 09:41:04,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-31 09:41:04,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 147 transitions. [2018-12-31 09:41:04,870 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 147 transitions. Word has length 23 [2018-12-31 09:41:04,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:04,870 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 147 transitions. [2018-12-31 09:41:04,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:41:04,871 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 147 transitions. [2018-12-31 09:41:04,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-31 09:41:04,872 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:04,874 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] [2018-12-31 09:41:04,874 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:04,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:04,875 INFO L82 PathProgramCache]: Analyzing trace with hash 944519591, now seen corresponding path program 1 times [2018-12-31 09:41:04,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:04,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:04,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:04,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:04,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:04,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:05,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:41:05,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:05,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:41:05,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:41:05,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:41:05,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:41:05,100 INFO L87 Difference]: Start difference. First operand 101 states and 147 transitions. Second operand 5 states. [2018-12-31 09:41:05,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:05,390 INFO L93 Difference]: Finished difference Result 501 states and 748 transitions. [2018-12-31 09:41:05,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 09:41:05,393 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-12-31 09:41:05,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:05,399 INFO L225 Difference]: With dead ends: 501 [2018-12-31 09:41:05,399 INFO L226 Difference]: Without dead ends: 406 [2018-12-31 09:41:05,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:41:05,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-12-31 09:41:05,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 186. [2018-12-31 09:41:05,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-12-31 09:41:05,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 267 transitions. [2018-12-31 09:41:05,464 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 267 transitions. Word has length 25 [2018-12-31 09:41:05,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:05,470 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 267 transitions. [2018-12-31 09:41:05,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:41:05,470 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 267 transitions. [2018-12-31 09:41:05,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-31 09:41:05,472 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:05,475 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] [2018-12-31 09:41:05,476 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:05,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:05,476 INFO L82 PathProgramCache]: Analyzing trace with hash 740712497, now seen corresponding path program 1 times [2018-12-31 09:41:05,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:05,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:05,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:05,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:05,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:05,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:05,824 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:41:05,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:05,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:41:05,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:41:05,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:41:05,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:41:05,825 INFO L87 Difference]: Start difference. First operand 186 states and 267 transitions. Second operand 5 states. [2018-12-31 09:41:06,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:06,626 INFO L93 Difference]: Finished difference Result 524 states and 758 transitions. [2018-12-31 09:41:06,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 09:41:06,627 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-12-31 09:41:06,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:06,631 INFO L225 Difference]: With dead ends: 524 [2018-12-31 09:41:06,632 INFO L226 Difference]: Without dead ends: 522 [2018-12-31 09:41:06,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:41:06,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-12-31 09:41:06,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 186. [2018-12-31 09:41:06,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-12-31 09:41:06,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 265 transitions. [2018-12-31 09:41:06,664 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 265 transitions. Word has length 26 [2018-12-31 09:41:06,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:06,666 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 265 transitions. [2018-12-31 09:41:06,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:41:06,666 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 265 transitions. [2018-12-31 09:41:06,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-31 09:41:06,668 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:06,669 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:41:06,669 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:06,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:06,669 INFO L82 PathProgramCache]: Analyzing trace with hash 2030628178, now seen corresponding path program 1 times [2018-12-31 09:41:06,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:06,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:06,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:06,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:06,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:06,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:06,868 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:41:06,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:06,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:41:06,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:41:06,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:41:06,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:41:06,873 INFO L87 Difference]: Start difference. First operand 186 states and 265 transitions. Second operand 5 states. [2018-12-31 09:41:07,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:07,236 INFO L93 Difference]: Finished difference Result 510 states and 719 transitions. [2018-12-31 09:41:07,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:41:07,237 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-12-31 09:41:07,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:07,239 INFO L225 Difference]: With dead ends: 510 [2018-12-31 09:41:07,239 INFO L226 Difference]: Without dead ends: 330 [2018-12-31 09:41:07,246 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:41:07,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-12-31 09:41:07,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 198. [2018-12-31 09:41:07,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-12-31 09:41:07,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 277 transitions. [2018-12-31 09:41:07,283 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 277 transitions. Word has length 30 [2018-12-31 09:41:07,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:07,284 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 277 transitions. [2018-12-31 09:41:07,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:41:07,284 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 277 transitions. [2018-12-31 09:41:07,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-31 09:41:07,287 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:07,287 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:41:07,288 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:07,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:07,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1637601168, now seen corresponding path program 1 times [2018-12-31 09:41:07,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:07,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:07,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:07,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:07,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:07,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:07,457 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:41:07,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:07,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:41:07,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 09:41:07,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 09:41:07,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 09:41:07,459 INFO L87 Difference]: Start difference. First operand 198 states and 277 transitions. Second operand 4 states. [2018-12-31 09:41:07,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:07,620 INFO L93 Difference]: Finished difference Result 486 states and 674 transitions. [2018-12-31 09:41:07,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 09:41:07,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-12-31 09:41:07,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:07,623 INFO L225 Difference]: With dead ends: 486 [2018-12-31 09:41:07,623 INFO L226 Difference]: Without dead ends: 294 [2018-12-31 09:41:07,624 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:41:07,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-12-31 09:41:07,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 206. [2018-12-31 09:41:07,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-12-31 09:41:07,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 285 transitions. [2018-12-31 09:41:07,652 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 285 transitions. Word has length 30 [2018-12-31 09:41:07,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:07,653 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 285 transitions. [2018-12-31 09:41:07,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 09:41:07,653 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 285 transitions. [2018-12-31 09:41:07,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-31 09:41:07,654 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:07,654 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:41:07,656 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:07,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:07,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1895766606, now seen corresponding path program 1 times [2018-12-31 09:41:07,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:07,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:07,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:07,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:07,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:07,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:07,746 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:41:07,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:07,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:41:07,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:41:07,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:41:07,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:41:07,747 INFO L87 Difference]: Start difference. First operand 206 states and 285 transitions. Second operand 3 states. [2018-12-31 09:41:07,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:07,901 INFO L93 Difference]: Finished difference Result 506 states and 694 transitions. [2018-12-31 09:41:07,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:41:07,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-31 09:41:07,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:07,904 INFO L225 Difference]: With dead ends: 506 [2018-12-31 09:41:07,904 INFO L226 Difference]: Without dead ends: 306 [2018-12-31 09:41:07,905 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:41:07,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-12-31 09:41:07,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2018-12-31 09:41:07,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-12-31 09:41:07,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 407 transitions. [2018-12-31 09:41:07,948 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 407 transitions. Word has length 30 [2018-12-31 09:41:07,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:07,949 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 407 transitions. [2018-12-31 09:41:07,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:41:07,949 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 407 transitions. [2018-12-31 09:41:07,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 09:41:07,950 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:07,950 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:41:07,951 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:07,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:07,951 INFO L82 PathProgramCache]: Analyzing trace with hash -112049588, now seen corresponding path program 1 times [2018-12-31 09:41:07,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:07,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:07,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:07,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:07,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:08,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:41:08,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:41:08,657 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 09:41:08,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 09:41:08 BoogieIcfgContainer [2018-12-31 09:41:08,774 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 09:41:08,775 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 09:41:08,775 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 09:41:08,775 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 09:41:08,776 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:41:03" (3/4) ... [2018-12-31 09:41:08,781 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 09:41:08,905 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 09:41:08,905 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 09:41:08,906 INFO L168 Benchmark]: Toolchain (without parser) took 7593.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.0 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -164.4 MB). Peak memory consumption was 40.6 MB. Max. memory is 11.5 GB. [2018-12-31 09:41:08,908 INFO L168 Benchmark]: CDTParser took 0.17 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:41:08,909 INFO L168 Benchmark]: CACSL2BoogieTranslator took 691.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -181.1 MB). Peak memory consumption was 43.4 MB. Max. memory is 11.5 GB. [2018-12-31 09:41:08,909 INFO L168 Benchmark]: Boogie Procedure Inliner took 117.24 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: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2018-12-31 09:41:08,911 INFO L168 Benchmark]: Boogie Preprocessor took 81.70 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:41:08,911 INFO L168 Benchmark]: RCFGBuilder took 1351.51 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: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 11.5 GB. [2018-12-31 09:41:08,913 INFO L168 Benchmark]: TraceAbstraction took 5211.92 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -65.3 MB). Peak memory consumption was 277.4 MB. Max. memory is 11.5 GB. [2018-12-31 09:41:08,917 INFO L168 Benchmark]: Witness Printer took 130.20 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: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-12-31 09:41:08,922 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.17 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 691.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -181.1 MB). Peak memory consumption was 43.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 117.24 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: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 81.70 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 1351.51 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: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5211.92 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -65.3 MB). Peak memory consumption was 277.4 MB. Max. memory is 11.5 GB. * Witness Printer took 130.20 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: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 44]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L60] int pumpRunning = 0; [L61] int systemActive = 1; [L239] int waterLevel = 1; [L240] int methaneLevelCritical = 0; [L610] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L833] int cleanupTimeShifts = 4; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L906] int retValue_acc ; [L907] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L432] int retValue_acc ; [L435] retValue_acc = 1 [L436] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L913] tmp = valid_product() [L915] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L335] int splverifierCounter ; [L336] int tmp ; [L337] int tmp___0 ; [L338] int tmp___1 ; [L339] int tmp___2 ; [L342] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L344] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L346] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L352] tmp = __VERIFIER_nondet_int() [L354] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L257] COND TRUE waterLevel < 2 [L258] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L362] tmp___0 = __VERIFIER_nondet_int() [L364] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L269] COND FALSE !(\read(methaneLevelCritical)) [L272] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L372] tmp___2 = __VERIFIER_nondet_int() [L374] COND TRUE \read(tmp___2) [L231] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L68] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L75] COND TRUE \read(systemActive) [L97] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L100] COND TRUE ! pumpRunning [L194] int retValue_acc ; [L195] int tmp ; [L196] int tmp___0 ; [L319] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L322] COND FALSE !(waterLevel < 2) [L326] retValue_acc = 0 [L327] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L200] tmp = isHighWaterSensorDry() [L202] COND FALSE !(\read(tmp)) [L205] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L207] retValue_acc = tmp___0 [L208] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L102] tmp = isHighWaterLevel() [L104] COND TRUE \read(tmp) [L125] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L808] int tmp ; [L809] int tmp___0 ; [L278] int retValue_acc ; [L281] retValue_acc = methaneLevelCritical [L282] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L813] tmp = isMethaneLevelCritical() [L815] COND TRUE \read(tmp) [L149] int retValue_acc ; [L152] retValue_acc = pumpRunning [L153] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L817] tmp___0 = isPumpRunning() [L819] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L44] __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, 80 locations, 3 error locations. UNSAFE Result, 5.1s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 628 SDtfs, 711 SDslu, 859 SDs, 0 SdLazy, 107 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=306occurred 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, 782 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 250 NumberOfCodeBlocks, 250 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 210 ConstructedInterpolants, 0 QuantifiedInterpolants, 9524 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...