./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec1_product40_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f 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_product40_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 ad65d1d3307a121fce5b7d95113e2f3f66b04b5a .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 14:46:10,480 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:46:10,482 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:46:10,494 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:46:10,494 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:46:10,495 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:46:10,496 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:46:10,498 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:46:10,500 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:46:10,501 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:46:10,501 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:46:10,502 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:46:10,503 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:46:10,504 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:46:10,505 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:46:10,505 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:46:10,506 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:46:10,508 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:46:10,510 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:46:10,512 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:46:10,513 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:46:10,514 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:46:10,516 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:46:10,517 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:46:10,517 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:46:10,518 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:46:10,519 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:46:10,519 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:46:10,520 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:46:10,521 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:46:10,522 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:46:10,522 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:46:10,523 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:46:10,523 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:46:10,524 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:46:10,525 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:46:10,525 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 14:46:10,549 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:46:10,549 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:46:10,551 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:46:10,552 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:46:10,552 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:46:10,553 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:46:10,553 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:46:10,553 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:46:10,553 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:46:10,553 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:46:10,553 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:46:10,554 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:46:10,554 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:46:10,554 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:46:10,554 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:46:10,554 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:46:10,554 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:46:10,557 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:46:10,557 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:46:10,557 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:46:10,557 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:46:10,558 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:46:10,558 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:46:10,558 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:46:10,558 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:46:10,558 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:46:10,558 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:46:10,559 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:46:10,559 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 -> ad65d1d3307a121fce5b7d95113e2f3f66b04b5a [2019-01-12 14:46:10,611 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:46:10,628 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:46:10,634 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:46:10,636 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:46:10,637 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:46:10,638 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec1_product40_false-unreach-call_false-termination.cil.c [2019-01-12 14:46:10,707 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43959ad40/d05aa5527a6b4cf68fa5bb9da85ecc08/FLAGe18794919 [2019-01-12 14:46:11,162 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:46:11,162 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec1_product40_false-unreach-call_false-termination.cil.c [2019-01-12 14:46:11,175 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43959ad40/d05aa5527a6b4cf68fa5bb9da85ecc08/FLAGe18794919 [2019-01-12 14:46:11,488 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43959ad40/d05aa5527a6b4cf68fa5bb9da85ecc08 [2019-01-12 14:46:11,492 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:46:11,494 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:46:11,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:46:11,496 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:46:11,500 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:46:11,501 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:46:11" (1/1) ... [2019-01-12 14:46:11,503 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c50214e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:11, skipping insertion in model container [2019-01-12 14:46:11,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:46:11" (1/1) ... [2019-01-12 14:46:11,512 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:46:11,584 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:46:11,934 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:46:11,955 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:46:12,072 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:46:12,128 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:46:12,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:12 WrapperNode [2019-01-12 14:46:12,130 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:46:12,132 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:46:12,132 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:46:12,132 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:46:12,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:12" (1/1) ... [2019-01-12 14:46:12,306 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:12" (1/1) ... [2019-01-12 14:46:12,377 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:46:12,379 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:46:12,379 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:46:12,379 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:46:12,392 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:12" (1/1) ... [2019-01-12 14:46:12,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:12" (1/1) ... [2019-01-12 14:46:12,399 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:12" (1/1) ... [2019-01-12 14:46:12,399 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:12" (1/1) ... [2019-01-12 14:46:12,411 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:12" (1/1) ... [2019-01-12 14:46:12,419 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:12" (1/1) ... [2019-01-12 14:46:12,427 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:12" (1/1) ... [2019-01-12 14:46:12,439 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:46:12,439 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:46:12,440 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:46:12,440 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:46:12,441 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:46:12,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 14:46:12,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-12 14:46:12,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:46:12,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:46:13,892 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:46:13,892 INFO L286 CfgBuilder]: Removed 162 assue(true) statements. [2019-01-12 14:46:13,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:46:13 BoogieIcfgContainer [2019-01-12 14:46:13,894 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:46:13,895 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:46:13,895 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:46:13,899 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:46:13,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:46:11" (1/3) ... [2019-01-12 14:46:13,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6368e8ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:46:13, skipping insertion in model container [2019-01-12 14:46:13,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:12" (2/3) ... [2019-01-12 14:46:13,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6368e8ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:46:13, skipping insertion in model container [2019-01-12 14:46:13,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:46:13" (3/3) ... [2019-01-12 14:46:13,904 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product40_false-unreach-call_false-termination.cil.c [2019-01-12 14:46:13,914 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:46:13,923 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 14:46:13,941 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 14:46:13,972 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:46:13,973 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:46:13,973 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:46:13,974 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:46:13,974 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:46:13,975 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:46:13,975 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:46:13,975 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:46:13,975 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:46:13,995 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2019-01-12 14:46:14,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 14:46:14,003 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:14,004 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:46:14,007 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:14,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:14,013 INFO L82 PathProgramCache]: Analyzing trace with hash 2074315904, now seen corresponding path program 1 times [2019-01-12 14:46:14,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:14,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:14,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:14,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:14,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:14,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:14,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:46:14,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:14,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:46:14,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 14:46:14,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 14:46:14,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:46:14,279 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 2 states. [2019-01-12 14:46:14,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:14,319 INFO L93 Difference]: Finished difference Result 220 states and 335 transitions. [2019-01-12 14:46:14,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 14:46:14,321 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-01-12 14:46:14,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:14,332 INFO L225 Difference]: With dead ends: 220 [2019-01-12 14:46:14,332 INFO L226 Difference]: Without dead ends: 109 [2019-01-12 14:46:14,336 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 [2019-01-12 14:46:14,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-12 14:46:14,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-01-12 14:46:14,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-12 14:46:14,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 159 transitions. [2019-01-12 14:46:14,383 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 159 transitions. Word has length 16 [2019-01-12 14:46:14,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:14,384 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 159 transitions. [2019-01-12 14:46:14,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 14:46:14,384 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 159 transitions. [2019-01-12 14:46:14,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 14:46:14,385 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:14,386 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:46:14,386 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:14,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:14,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1027559007, now seen corresponding path program 1 times [2019-01-12 14:46:14,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:14,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:14,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:14,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:14,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:14,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:14,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:46:14,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:14,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:46:14,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:46:14,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:46:14,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:46:14,566 INFO L87 Difference]: Start difference. First operand 109 states and 159 transitions. Second operand 3 states. [2019-01-12 14:46:14,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:14,593 INFO L93 Difference]: Finished difference Result 109 states and 159 transitions. [2019-01-12 14:46:14,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:46:14,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-12 14:46:14,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:14,595 INFO L225 Difference]: With dead ends: 109 [2019-01-12 14:46:14,595 INFO L226 Difference]: Without dead ends: 47 [2019-01-12 14:46:14,596 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 [2019-01-12 14:46:14,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-12 14:46:14,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-12 14:46:14,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-12 14:46:14,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2019-01-12 14:46:14,603 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 17 [2019-01-12 14:46:14,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:14,604 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2019-01-12 14:46:14,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:46:14,604 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2019-01-12 14:46:14,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 14:46:14,605 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:14,605 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] [2019-01-12 14:46:14,606 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:14,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:14,606 INFO L82 PathProgramCache]: Analyzing trace with hash 109011716, now seen corresponding path program 1 times [2019-01-12 14:46:14,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:14,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:14,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:14,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:14,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:14,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:14,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:46:14,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:14,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:46:14,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:46:14,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:46:14,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:46:14,781 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand 5 states. [2019-01-12 14:46:14,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:14,930 INFO L93 Difference]: Finished difference Result 111 states and 164 transitions. [2019-01-12 14:46:14,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:46:14,933 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-01-12 14:46:14,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:14,934 INFO L225 Difference]: With dead ends: 111 [2019-01-12 14:46:14,934 INFO L226 Difference]: Without dead ends: 70 [2019-01-12 14:46:14,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:46:14,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-12 14:46:14,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2019-01-12 14:46:14,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-12 14:46:14,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 97 transitions. [2019-01-12 14:46:14,946 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 97 transitions. Word has length 22 [2019-01-12 14:46:14,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:14,946 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 97 transitions. [2019-01-12 14:46:14,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:46:14,947 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 97 transitions. [2019-01-12 14:46:14,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-12 14:46:14,948 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:14,948 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] [2019-01-12 14:46:14,948 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:14,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:14,949 INFO L82 PathProgramCache]: Analyzing trace with hash 60563277, now seen corresponding path program 1 times [2019-01-12 14:46:14,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:14,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:14,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:14,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:14,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:14,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:15,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:46:15,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:15,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:46:15,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:46:15,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:46:15,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:46:15,045 INFO L87 Difference]: Start difference. First operand 66 states and 97 transitions. Second operand 3 states. [2019-01-12 14:46:15,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:15,138 INFO L93 Difference]: Finished difference Result 147 states and 218 transitions. [2019-01-12 14:46:15,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:46:15,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-12 14:46:15,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:15,140 INFO L225 Difference]: With dead ends: 147 [2019-01-12 14:46:15,140 INFO L226 Difference]: Without dead ends: 87 [2019-01-12 14:46:15,141 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 [2019-01-12 14:46:15,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-12 14:46:15,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2019-01-12 14:46:15,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-12 14:46:15,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 121 transitions. [2019-01-12 14:46:15,153 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 121 transitions. Word has length 24 [2019-01-12 14:46:15,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:15,154 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 121 transitions. [2019-01-12 14:46:15,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:46:15,154 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 121 transitions. [2019-01-12 14:46:15,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-12 14:46:15,155 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:15,155 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] [2019-01-12 14:46:15,156 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:15,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:15,156 INFO L82 PathProgramCache]: Analyzing trace with hash -445763815, now seen corresponding path program 1 times [2019-01-12 14:46:15,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:15,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:15,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:15,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:15,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:15,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:15,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:46:15,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:15,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:46:15,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:46:15,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:46:15,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:46:15,404 INFO L87 Difference]: Start difference. First operand 85 states and 121 transitions. Second operand 5 states. [2019-01-12 14:46:16,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:16,078 INFO L93 Difference]: Finished difference Result 413 states and 601 transitions. [2019-01-12 14:46:16,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 14:46:16,079 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-01-12 14:46:16,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:16,084 INFO L225 Difference]: With dead ends: 413 [2019-01-12 14:46:16,087 INFO L226 Difference]: Without dead ends: 334 [2019-01-12 14:46:16,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:46:16,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-01-12 14:46:16,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 156. [2019-01-12 14:46:16,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-01-12 14:46:16,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 220 transitions. [2019-01-12 14:46:16,136 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 220 transitions. Word has length 25 [2019-01-12 14:46:16,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:16,137 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 220 transitions. [2019-01-12 14:46:16,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:46:16,137 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 220 transitions. [2019-01-12 14:46:16,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-12 14:46:16,142 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:16,143 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] [2019-01-12 14:46:16,143 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:16,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:16,143 INFO L82 PathProgramCache]: Analyzing trace with hash -649570909, now seen corresponding path program 1 times [2019-01-12 14:46:16,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:16,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:16,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:16,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:16,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:16,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:16,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:46:16,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:16,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:46:16,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:46:16,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:46:16,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:46:16,320 INFO L87 Difference]: Start difference. First operand 156 states and 220 transitions. Second operand 5 states. [2019-01-12 14:46:17,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:17,524 INFO L93 Difference]: Finished difference Result 436 states and 619 transitions. [2019-01-12 14:46:17,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:46:17,526 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-01-12 14:46:17,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:17,530 INFO L225 Difference]: With dead ends: 436 [2019-01-12 14:46:17,530 INFO L226 Difference]: Without dead ends: 434 [2019-01-12 14:46:17,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:46:17,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2019-01-12 14:46:17,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 156. [2019-01-12 14:46:17,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-01-12 14:46:17,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 218 transitions. [2019-01-12 14:46:17,559 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 218 transitions. Word has length 26 [2019-01-12 14:46:17,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:17,561 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 218 transitions. [2019-01-12 14:46:17,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:46:17,561 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 218 transitions. [2019-01-12 14:46:17,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-12 14:46:17,563 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:17,564 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] [2019-01-12 14:46:17,564 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:17,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:17,565 INFO L82 PathProgramCache]: Analyzing trace with hash 108971892, now seen corresponding path program 1 times [2019-01-12 14:46:17,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:17,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:17,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:17,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:17,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:17,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:17,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:46:17,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:17,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:46:17,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:46:17,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:46:17,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:46:17,846 INFO L87 Difference]: Start difference. First operand 156 states and 218 transitions. Second operand 5 states. [2019-01-12 14:46:18,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:18,173 INFO L93 Difference]: Finished difference Result 468 states and 648 transitions. [2019-01-12 14:46:18,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:46:18,173 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-01-12 14:46:18,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:18,175 INFO L225 Difference]: With dead ends: 468 [2019-01-12 14:46:18,176 INFO L226 Difference]: Without dead ends: 318 [2019-01-12 14:46:18,177 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 [2019-01-12 14:46:18,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-01-12 14:46:18,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 168. [2019-01-12 14:46:18,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-01-12 14:46:18,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 230 transitions. [2019-01-12 14:46:18,203 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 230 transitions. Word has length 31 [2019-01-12 14:46:18,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:18,204 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 230 transitions. [2019-01-12 14:46:18,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:46:18,204 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 230 transitions. [2019-01-12 14:46:18,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-12 14:46:18,206 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:18,206 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] [2019-01-12 14:46:18,206 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:18,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:18,207 INFO L82 PathProgramCache]: Analyzing trace with hash -284055118, now seen corresponding path program 1 times [2019-01-12 14:46:18,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:18,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:18,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:18,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:18,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:18,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:46:18,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:18,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 14:46:18,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:46:18,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:46:18,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:46:18,317 INFO L87 Difference]: Start difference. First operand 168 states and 230 transitions. Second operand 6 states. [2019-01-12 14:46:18,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:18,760 INFO L93 Difference]: Finished difference Result 502 states and 682 transitions. [2019-01-12 14:46:18,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 14:46:18,761 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-01-12 14:46:18,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:18,764 INFO L225 Difference]: With dead ends: 502 [2019-01-12 14:46:18,764 INFO L226 Difference]: Without dead ends: 340 [2019-01-12 14:46:18,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-01-12 14:46:18,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-01-12 14:46:18,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 176. [2019-01-12 14:46:18,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-01-12 14:46:18,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 238 transitions. [2019-01-12 14:46:18,795 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 238 transitions. Word has length 31 [2019-01-12 14:46:18,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:18,795 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 238 transitions. [2019-01-12 14:46:18,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:46:18,795 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 238 transitions. [2019-01-12 14:46:18,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-12 14:46:18,797 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:18,797 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] [2019-01-12 14:46:18,797 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:18,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:18,798 INFO L82 PathProgramCache]: Analyzing trace with hash -25889680, now seen corresponding path program 1 times [2019-01-12 14:46:18,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:18,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:18,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:18,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:18,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:18,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:18,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:46:18,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:18,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:46:18,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:46:18,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:46:18,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:46:18,880 INFO L87 Difference]: Start difference. First operand 176 states and 238 transitions. Second operand 3 states. [2019-01-12 14:46:19,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:19,067 INFO L93 Difference]: Finished difference Result 434 states and 586 transitions. [2019-01-12 14:46:19,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:46:19,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-01-12 14:46:19,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:19,070 INFO L225 Difference]: With dead ends: 434 [2019-01-12 14:46:19,070 INFO L226 Difference]: Without dead ends: 264 [2019-01-12 14:46:19,071 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 [2019-01-12 14:46:19,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-01-12 14:46:19,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2019-01-12 14:46:19,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-01-12 14:46:19,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 348 transitions. [2019-01-12 14:46:19,132 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 348 transitions. Word has length 31 [2019-01-12 14:46:19,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:19,133 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 348 transitions. [2019-01-12 14:46:19,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:46:19,133 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 348 transitions. [2019-01-12 14:46:19,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-12 14:46:19,135 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:19,135 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, 1] [2019-01-12 14:46:19,135 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:19,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:19,136 INFO L82 PathProgramCache]: Analyzing trace with hash -2138649550, now seen corresponding path program 1 times [2019-01-12 14:46:19,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:19,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:19,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:19,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:19,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:19,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:46:19,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:46:20,044 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 14:46:20,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:46:20 BoogieIcfgContainer [2019-01-12 14:46:20,163 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:46:20,164 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:46:20,164 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:46:20,164 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:46:20,165 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:46:13" (3/4) ... [2019-01-12 14:46:20,168 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 14:46:20,310 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:46:20,310 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:46:20,311 INFO L168 Benchmark]: Toolchain (without parser) took 8817.71 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 222.3 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -106.7 MB). Peak memory consumption was 115.6 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:20,312 INFO L168 Benchmark]: CDTParser took 0.47 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. [2019-01-12 14:46:20,312 INFO L168 Benchmark]: CACSL2BoogieTranslator took 634.93 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 925.9 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:20,313 INFO L168 Benchmark]: Boogie Procedure Inliner took 247.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -214.1 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:20,313 INFO L168 Benchmark]: Boogie Preprocessor took 59.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:46:20,314 INFO L168 Benchmark]: RCFGBuilder took 1454.27 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: 67.4 MB). Peak memory consumption was 67.4 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:20,314 INFO L168 Benchmark]: TraceAbstraction took 6268.18 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 69.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -2.9 MB). Peak memory consumption was 66.9 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:20,315 INFO L168 Benchmark]: Witness Printer took 146.36 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:20,326 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.47 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 634.93 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 925.9 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 247.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -214.1 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.97 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 1454.27 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: 67.4 MB). Peak memory consumption was 67.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6268.18 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 69.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -2.9 MB). Peak memory consumption was 66.9 MB. Max. memory is 11.5 GB. * Witness Printer took 146.36 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 490]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L51] int pumpRunning = 0; [L52] int systemActive = 1; [L352] int cleanupTimeShifts = 4; [L664] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L862] int waterLevel = 1; [L863] int methaneLevelCritical = 0; [L428] int retValue_acc ; [L429] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L477] int retValue_acc ; [L480] retValue_acc = 1 [L481] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L435] tmp = valid_product() [L437] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L257] int splverifierCounter ; [L258] int tmp ; [L259] int tmp___0 ; [L260] int tmp___1 ; [L261] int tmp___2 ; [L264] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L266] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L268] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L274] tmp = __VERIFIER_nondet_int() [L276] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L880] COND TRUE waterLevel < 2 [L881] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L284] tmp___0 = __VERIFIER_nondet_int() [L286] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L892] COND FALSE !(\read(methaneLevelCritical)) [L895] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L294] tmp___2 = __VERIFIER_nondet_int() [L296] COND TRUE \read(tmp___2) [L248] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L59] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L66] COND TRUE \read(systemActive) [L114] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L117] COND FALSE !(\read(pumpRunning)) [L88] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L91] COND TRUE ! pumpRunning [L211] int retValue_acc ; [L212] int tmp ; [L213] int tmp___0 ; [L942] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L945] COND FALSE !(waterLevel < 2) [L949] retValue_acc = 0 [L950] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L217] tmp = isHighWaterSensorDry() [L219] COND FALSE !(\read(tmp)) [L222] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L224] retValue_acc = tmp___0 [L225] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L93] tmp = isHighWaterLevel() [L95] COND TRUE \read(tmp) [L142] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L327] int tmp ; [L328] int tmp___0 ; [L901] int retValue_acc ; [L904] retValue_acc = methaneLevelCritical [L905] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L332] tmp = isMethaneLevelCritical() [L334] COND TRUE \read(tmp) [L166] int retValue_acc ; [L169] retValue_acc = pumpRunning [L170] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L336] tmp___0 = isPumpRunning() [L338] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L490] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 113 locations, 3 error locations. UNSAFE Result, 6.1s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 3.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 829 SDtfs, 1296 SDslu, 1083 SDs, 0 SdLazy, 160 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=264occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 776 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 255 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 214 ConstructedInterpolants, 0 QuantifiedInterpolants, 10236 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...