./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec4_product48_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_spec4_product48_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 5f57b6f2bb2bb4fa43dac897ff23a28c21886d7b ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:48:59,667 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:48:59,669 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:48:59,680 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:48:59,681 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:48:59,682 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:48:59,683 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:48:59,685 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:48:59,686 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:48:59,687 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:48:59,688 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:48:59,688 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:48:59,689 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:48:59,690 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:48:59,691 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:48:59,692 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:48:59,693 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:48:59,694 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:48:59,696 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:48:59,698 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:48:59,699 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:48:59,700 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:48:59,703 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:48:59,703 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:48:59,704 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:48:59,705 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:48:59,706 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:48:59,706 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:48:59,707 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:48:59,711 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:48:59,712 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:48:59,712 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:48:59,713 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:48:59,713 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:48:59,714 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:48:59,714 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:48:59,715 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:48:59,742 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:48:59,742 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:48:59,743 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:48:59,744 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:48:59,744 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:48:59,744 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:48:59,744 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:48:59,744 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:48:59,745 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:48:59,748 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:48:59,748 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:48:59,748 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:48:59,748 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:48:59,748 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:48:59,749 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:48:59,749 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:48:59,749 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:48:59,749 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:48:59,749 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:48:59,750 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:48:59,750 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:48:59,750 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:48:59,750 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:48:59,750 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:48:59,751 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:48:59,752 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:48:59,752 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:48:59,752 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:48:59,752 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 -> 5f57b6f2bb2bb4fa43dac897ff23a28c21886d7b [2019-01-12 14:48:59,818 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:48:59,831 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:48:59,834 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:48:59,835 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:48:59,836 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:48:59,836 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec4_product48_false-unreach-call_false-termination.cil.c [2019-01-12 14:48:59,889 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/845f1f8da/80ddca8a1a974d9ca174dc18b9f41d0c/FLAGe86961d84 [2019-01-12 14:49:00,391 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:49:00,392 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec4_product48_false-unreach-call_false-termination.cil.c [2019-01-12 14:49:00,403 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/845f1f8da/80ddca8a1a974d9ca174dc18b9f41d0c/FLAGe86961d84 [2019-01-12 14:49:00,691 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/845f1f8da/80ddca8a1a974d9ca174dc18b9f41d0c [2019-01-12 14:49:00,695 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:49:00,696 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:49:00,697 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:49:00,697 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:49:00,699 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:49:00,700 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:49:00" (1/1) ... [2019-01-12 14:49:00,703 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b8f157c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:49:00, skipping insertion in model container [2019-01-12 14:49:00,703 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:49:00" (1/1) ... [2019-01-12 14:49:00,710 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:49:00,765 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:49:01,142 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:49:01,156 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:49:01,322 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:49:01,368 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:49:01,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:49:01 WrapperNode [2019-01-12 14:49:01,369 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:49:01,370 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:49:01,370 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:49:01,370 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:49:01,379 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:49:01" (1/1) ... [2019-01-12 14:49:01,407 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:49:01" (1/1) ... [2019-01-12 14:49:01,462 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:49:01,463 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:49:01,463 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:49:01,463 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:49:01,474 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:49:01" (1/1) ... [2019-01-12 14:49:01,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:49:01" (1/1) ... [2019-01-12 14:49:01,480 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:49:01" (1/1) ... [2019-01-12 14:49:01,480 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:49:01" (1/1) ... [2019-01-12 14:49:01,493 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:49:01" (1/1) ... [2019-01-12 14:49:01,514 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:49:01" (1/1) ... [2019-01-12 14:49:01,519 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:49:01" (1/1) ... [2019-01-12 14:49:01,529 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:49:01,530 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:49:01,530 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:49:01,530 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:49:01,531 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:49:01" (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:49:01,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 14:49:01,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-12 14:49:01,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:49:01,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:49:03,180 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:49:03,180 INFO L286 CfgBuilder]: Removed 198 assue(true) statements. [2019-01-12 14:49:03,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:49:03 BoogieIcfgContainer [2019-01-12 14:49:03,182 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:49:03,183 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:49:03,183 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:49:03,186 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:49:03,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:49:00" (1/3) ... [2019-01-12 14:49:03,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b99419d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:49:03, skipping insertion in model container [2019-01-12 14:49:03,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:49:01" (2/3) ... [2019-01-12 14:49:03,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b99419d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:49:03, skipping insertion in model container [2019-01-12 14:49:03,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:49:03" (3/3) ... [2019-01-12 14:49:03,190 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product48_false-unreach-call_false-termination.cil.c [2019-01-12 14:49:03,200 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:49:03,208 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 14:49:03,225 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 14:49:03,257 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:49:03,257 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:49:03,257 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:49:03,258 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:49:03,258 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:49:03,258 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:49:03,258 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:49:03,258 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:49:03,259 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:49:03,279 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2019-01-12 14:49:03,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 14:49:03,287 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:49:03,288 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:49:03,290 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:49:03,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:49:03,296 INFO L82 PathProgramCache]: Analyzing trace with hash 325683581, now seen corresponding path program 1 times [2019-01-12 14:49:03,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:49:03,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:49:03,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:03,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:49:03,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:03,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:49:03,523 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:49:03,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:49:03,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:49:03,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 14:49:03,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 14:49:03,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:49:03,543 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 2 states. [2019-01-12 14:49:03,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:49:03,577 INFO L93 Difference]: Finished difference Result 256 states and 383 transitions. [2019-01-12 14:49:03,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 14:49:03,580 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-01-12 14:49:03,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:49:03,595 INFO L225 Difference]: With dead ends: 256 [2019-01-12 14:49:03,596 INFO L226 Difference]: Without dead ends: 127 [2019-01-12 14:49:03,599 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:49:03,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-01-12 14:49:03,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-01-12 14:49:03,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-12 14:49:03,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 183 transitions. [2019-01-12 14:49:03,666 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 183 transitions. Word has length 16 [2019-01-12 14:49:03,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:49:03,667 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 183 transitions. [2019-01-12 14:49:03,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 14:49:03,667 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 183 transitions. [2019-01-12 14:49:03,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 14:49:03,668 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:49:03,668 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:49:03,670 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:49:03,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:49:03,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1302516555, now seen corresponding path program 1 times [2019-01-12 14:49:03,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:49:03,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:49:03,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:03,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:49:03,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:03,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:49:03,912 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:49:03,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:49:03,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:49:03,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:49:03,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:49:03,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:49:03,920 INFO L87 Difference]: Start difference. First operand 127 states and 183 transitions. Second operand 3 states. [2019-01-12 14:49:03,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:49:03,961 INFO L93 Difference]: Finished difference Result 127 states and 183 transitions. [2019-01-12 14:49:03,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:49:03,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-12 14:49:03,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:49:03,963 INFO L225 Difference]: With dead ends: 127 [2019-01-12 14:49:03,963 INFO L226 Difference]: Without dead ends: 53 [2019-01-12 14:49:03,967 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:49:03,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-12 14:49:03,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-12 14:49:03,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-12 14:49:03,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 76 transitions. [2019-01-12 14:49:03,976 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 76 transitions. Word has length 17 [2019-01-12 14:49:03,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:49:03,977 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 76 transitions. [2019-01-12 14:49:03,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:49:03,977 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 76 transitions. [2019-01-12 14:49:03,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 14:49:03,978 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:49:03,978 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:49:03,978 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:49:03,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:49:03,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1189907750, now seen corresponding path program 1 times [2019-01-12 14:49:03,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:49:03,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:49:03,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:03,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:49:03,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:04,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:49:04,153 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:49:04,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:49:04,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:49:04,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:49:04,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:49:04,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:49:04,154 INFO L87 Difference]: Start difference. First operand 53 states and 76 transitions. Second operand 5 states. [2019-01-12 14:49:04,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:49:04,304 INFO L93 Difference]: Finished difference Result 123 states and 180 transitions. [2019-01-12 14:49:04,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:49:04,306 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-01-12 14:49:04,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:49:04,307 INFO L225 Difference]: With dead ends: 123 [2019-01-12 14:49:04,307 INFO L226 Difference]: Without dead ends: 76 [2019-01-12 14:49:04,308 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:49:04,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-12 14:49:04,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2019-01-12 14:49:04,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-12 14:49:04,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 105 transitions. [2019-01-12 14:49:04,328 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 105 transitions. Word has length 22 [2019-01-12 14:49:04,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:49:04,329 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 105 transitions. [2019-01-12 14:49:04,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:49:04,329 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 105 transitions. [2019-01-12 14:49:04,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-12 14:49:04,332 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:49:04,332 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:49:04,332 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:49:04,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:49:04,333 INFO L82 PathProgramCache]: Analyzing trace with hash 752688312, now seen corresponding path program 1 times [2019-01-12 14:49:04,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:49:04,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:49:04,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:04,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:49:04,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:04,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:49:04,453 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:49:04,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:49:04,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:49:04,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:49:04,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:49:04,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:49:04,454 INFO L87 Difference]: Start difference. First operand 72 states and 105 transitions. Second operand 3 states. [2019-01-12 14:49:04,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:49:04,623 INFO L93 Difference]: Finished difference Result 159 states and 234 transitions. [2019-01-12 14:49:04,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:49:04,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-12 14:49:04,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:49:04,626 INFO L225 Difference]: With dead ends: 159 [2019-01-12 14:49:04,627 INFO L226 Difference]: Without dead ends: 93 [2019-01-12 14:49:04,628 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:49:04,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-12 14:49:04,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2019-01-12 14:49:04,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-12 14:49:04,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 129 transitions. [2019-01-12 14:49:04,639 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 129 transitions. Word has length 24 [2019-01-12 14:49:04,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:49:04,640 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 129 transitions. [2019-01-12 14:49:04,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:49:04,640 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 129 transitions. [2019-01-12 14:49:04,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-12 14:49:04,641 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:49:04,641 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:49:04,641 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:49:04,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:49:04,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1744683281, now seen corresponding path program 1 times [2019-01-12 14:49:04,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:49:04,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:49:04,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:04,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:49:04,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:49:04,908 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:49:04,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:49:04,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 14:49:04,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 14:49:04,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 14:49:04,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:49:04,910 INFO L87 Difference]: Start difference. First operand 91 states and 129 transitions. Second operand 8 states. [2019-01-12 14:49:06,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:49:06,353 INFO L93 Difference]: Finished difference Result 585 states and 851 transitions. [2019-01-12 14:49:06,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 14:49:06,354 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-01-12 14:49:06,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:49:06,360 INFO L225 Difference]: With dead ends: 585 [2019-01-12 14:49:06,361 INFO L226 Difference]: Without dead ends: 500 [2019-01-12 14:49:06,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-01-12 14:49:06,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-01-12 14:49:06,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 227. [2019-01-12 14:49:06,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-01-12 14:49:06,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 316 transitions. [2019-01-12 14:49:06,421 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 316 transitions. Word has length 25 [2019-01-12 14:49:06,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:49:06,421 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 316 transitions. [2019-01-12 14:49:06,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 14:49:06,422 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 316 transitions. [2019-01-12 14:49:06,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-12 14:49:06,434 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:49:06,434 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:49:06,435 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:49:06,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:49:06,436 INFO L82 PathProgramCache]: Analyzing trace with hash 31993027, now seen corresponding path program 1 times [2019-01-12 14:49:06,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:49:06,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:49:06,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:06,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:49:06,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:06,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:49:06,799 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-12 14:49:06,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:49:06,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:49:06,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:49:06,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:49:06,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:49:06,803 INFO L87 Difference]: Start difference. First operand 227 states and 316 transitions. Second operand 5 states. [2019-01-12 14:49:07,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:49:07,279 INFO L93 Difference]: Finished difference Result 543 states and 767 transitions. [2019-01-12 14:49:07,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:49:07,280 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-01-12 14:49:07,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:49:07,285 INFO L225 Difference]: With dead ends: 543 [2019-01-12 14:49:07,285 INFO L226 Difference]: Without dead ends: 541 [2019-01-12 14:49:07,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:49:07,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2019-01-12 14:49:07,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 227. [2019-01-12 14:49:07,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-01-12 14:49:07,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 314 transitions. [2019-01-12 14:49:07,338 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 314 transitions. Word has length 41 [2019-01-12 14:49:07,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:49:07,338 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 314 transitions. [2019-01-12 14:49:07,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:49:07,341 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 314 transitions. [2019-01-12 14:49:07,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-12 14:49:07,348 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:49:07,348 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:49:07,348 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:49:07,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:49:07,349 INFO L82 PathProgramCache]: Analyzing trace with hash 501007855, now seen corresponding path program 1 times [2019-01-12 14:49:07,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:49:07,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:49:07,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:07,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:49:07,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:49:07,508 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-12 14:49:07,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:49:07,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:49:07,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:49:07,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:49:07,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:49:07,513 INFO L87 Difference]: Start difference. First operand 227 states and 314 transitions. Second operand 5 states. [2019-01-12 14:49:07,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:49:07,794 INFO L93 Difference]: Finished difference Result 680 states and 933 transitions. [2019-01-12 14:49:07,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:49:07,795 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-01-12 14:49:07,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:49:07,798 INFO L225 Difference]: With dead ends: 680 [2019-01-12 14:49:07,798 INFO L226 Difference]: Without dead ends: 459 [2019-01-12 14:49:07,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:49:07,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-01-12 14:49:07,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 242. [2019-01-12 14:49:07,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-01-12 14:49:07,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 329 transitions. [2019-01-12 14:49:07,844 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 329 transitions. Word has length 51 [2019-01-12 14:49:07,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:49:07,845 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 329 transitions. [2019-01-12 14:49:07,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:49:07,845 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 329 transitions. [2019-01-12 14:49:07,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-12 14:49:07,850 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:49:07,850 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:49:07,851 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:49:07,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:49:07,851 INFO L82 PathProgramCache]: Analyzing trace with hash -85798159, now seen corresponding path program 1 times [2019-01-12 14:49:07,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:49:07,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:49:07,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:07,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:49:07,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:49:08,039 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-12 14:49:08,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:49:08,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:49:08,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 14:49:08,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 14:49:08,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 14:49:08,043 INFO L87 Difference]: Start difference. First operand 242 states and 329 transitions. Second operand 4 states. [2019-01-12 14:49:08,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:49:08,441 INFO L93 Difference]: Finished difference Result 560 states and 760 transitions. [2019-01-12 14:49:08,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 14:49:08,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-01-12 14:49:08,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:49:08,445 INFO L225 Difference]: With dead ends: 560 [2019-01-12 14:49:08,445 INFO L226 Difference]: Without dead ends: 324 [2019-01-12 14:49:08,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:49:08,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-01-12 14:49:08,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 211. [2019-01-12 14:49:08,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-01-12 14:49:08,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 282 transitions. [2019-01-12 14:49:08,478 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 282 transitions. Word has length 51 [2019-01-12 14:49:08,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:49:08,478 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 282 transitions. [2019-01-12 14:49:08,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 14:49:08,478 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 282 transitions. [2019-01-12 14:49:08,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-12 14:49:08,479 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:49:08,479 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:49:08,481 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:49:08,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:49:08,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1687322796, now seen corresponding path program 1 times [2019-01-12 14:49:08,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:49:08,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:49:08,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:08,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:49:08,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:08,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:49:08,660 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:49:08,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:49:08,661 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:49:08,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:49:08,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:49:08,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:49:08,822 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:49:08,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:49:08,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-12 14:49:08,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:49:08,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:49:08,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:49:08,865 INFO L87 Difference]: Start difference. First operand 211 states and 282 transitions. Second operand 6 states. [2019-01-12 14:49:09,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:49:09,745 INFO L93 Difference]: Finished difference Result 598 states and 816 transitions. [2019-01-12 14:49:09,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:49:09,746 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-01-12 14:49:09,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:49:09,751 INFO L225 Difference]: With dead ends: 598 [2019-01-12 14:49:09,751 INFO L226 Difference]: Without dead ends: 435 [2019-01-12 14:49:09,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-12 14:49:09,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-01-12 14:49:09,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 274. [2019-01-12 14:49:09,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-01-12 14:49:09,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 365 transitions. [2019-01-12 14:49:09,802 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 365 transitions. Word has length 53 [2019-01-12 14:49:09,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:49:09,803 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 365 transitions. [2019-01-12 14:49:09,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:49:09,803 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 365 transitions. [2019-01-12 14:49:09,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-12 14:49:09,806 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:49:09,806 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:49:09,806 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:49:09,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:49:09,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1211162538, now seen corresponding path program 2 times [2019-01-12 14:49:09,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:49:09,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:49:09,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:09,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:49:09,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:49:10,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:49:10,746 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 14:49:10,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:49:10 BoogieIcfgContainer [2019-01-12 14:49:10,951 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:49:10,952 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:49:10,952 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:49:10,955 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:49:10,956 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:49:03" (3/4) ... [2019-01-12 14:49:10,959 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 14:49:11,158 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:49:11,158 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:49:11,159 INFO L168 Benchmark]: Toolchain (without parser) took 10463.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Free memory was 952.7 MB in the beginning and 883.2 MB in the end (delta: 69.4 MB). Peak memory consumption was 270.2 MB. Max. memory is 11.5 GB. [2019-01-12 14:49:11,161 INFO L168 Benchmark]: CDTParser took 0.15 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:49:11,163 INFO L168 Benchmark]: CACSL2BoogieTranslator took 672.69 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -144.8 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. [2019-01-12 14:49:11,163 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-12 14:49:11,165 INFO L168 Benchmark]: Boogie Preprocessor took 66.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-12 14:49:11,166 INFO L168 Benchmark]: RCFGBuilder took 1652.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.2 MB). Peak memory consumption was 60.2 MB. Max. memory is 11.5 GB. [2019-01-12 14:49:11,166 INFO L168 Benchmark]: TraceAbstraction took 7768.53 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 82.3 MB). Free memory was 1.0 GB in the beginning and 915.6 MB in the end (delta: 108.0 MB). Peak memory consumption was 190.3 MB. Max. memory is 11.5 GB. [2019-01-12 14:49:11,167 INFO L168 Benchmark]: Witness Printer took 206.47 ms. Allocated memory is still 1.2 GB. Free memory was 915.6 MB in the beginning and 883.2 MB in the end (delta: 32.4 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. [2019-01-12 14:49:11,169 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.15 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 672.69 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -144.8 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 92.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 66.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1652.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.2 MB). Peak memory consumption was 60.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7768.53 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 82.3 MB). Free memory was 1.0 GB in the beginning and 915.6 MB in the end (delta: 108.0 MB). Peak memory consumption was 190.3 MB. Max. memory is 11.5 GB. * Witness Printer took 206.47 ms. Allocated memory is still 1.2 GB. Free memory was 915.6 MB in the beginning and 883.2 MB in the end (delta: 32.4 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 439]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L238] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L444] int cleanupTimeShifts = 4; [L556] int pumpRunning = 0; [L557] int systemActive = 1; [L774] int waterLevel = 1; [L775] int methaneLevelCritical = 0; [L525] int retValue_acc ; [L526] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L963] int retValue_acc ; [L966] retValue_acc = 1 [L967] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L532] tmp = valid_product() [L534] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L869] int splverifierCounter ; [L870] int tmp ; [L871] int tmp___0 ; [L872] int tmp___1 ; [L873] int tmp___2 ; [L876] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L878] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L880] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L886] tmp = __VERIFIER_nondet_int() [L888] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L792] COND TRUE waterLevel < 2 [L793] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L896] tmp___0 = __VERIFIER_nondet_int() [L898] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L906] tmp___2 = __VERIFIER_nondet_int() [L908] COND TRUE \read(tmp___2) [L769] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L563] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L570] COND TRUE \read(systemActive) [L618] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L621] COND FALSE !(\read(pumpRunning)) [L592] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L595] COND TRUE ! pumpRunning [L732] int retValue_acc ; [L733] int tmp ; [L734] int tmp___0 ; [L854] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L857] COND FALSE !(waterLevel < 2) [L861] retValue_acc = 0 [L862] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L738] tmp = isHighWaterSensorDry() [L740] COND FALSE !(\read(tmp)) [L743] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L745] retValue_acc = tmp___0 [L746] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L597] tmp = isHighWaterLevel() [L599] COND TRUE \read(tmp) [L651] int tmp ; [L676] int retValue_acc ; [L813] int retValue_acc ; [L816] retValue_acc = methaneLevelCritical [L817] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L680] retValue_acc = isMethaneLevelCritical() [L682] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L655] tmp = isMethaneAlarm() [L657] COND FALSE !(\read(tmp)) [L646] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L44] int tmp ; [L45] int tmp___0 ; [L845] int retValue_acc ; [L848] retValue_acc = waterLevel [L849] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L49] tmp = getWaterLevel() [L51] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L878] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L880] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L886] tmp = __VERIFIER_nondet_int() [L888] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L896] tmp___0 = __VERIFIER_nondet_int() [L898] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L906] tmp___2 = __VERIFIER_nondet_int() [L908] COND TRUE \read(tmp___2) [L769] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L563] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L780] COND TRUE waterLevel > 0 [L781] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L570] COND TRUE \read(systemActive) [L618] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L621] COND TRUE \read(pumpRunning) [L676] int retValue_acc ; [L813] int retValue_acc ; [L816] retValue_acc = methaneLevelCritical [L817] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L680] retValue_acc = isMethaneLevelCritical() [L682] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L623] tmp = isMethaneAlarm() [L625] COND FALSE !(\read(tmp)) [L592] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L595] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L44] int tmp ; [L45] int tmp___0 ; [L845] int retValue_acc ; [L848] retValue_acc = waterLevel [L849] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L49] tmp = getWaterLevel() [L51] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L878] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L880] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L886] tmp = __VERIFIER_nondet_int() [L888] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L896] tmp___0 = __VERIFIER_nondet_int() [L898] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L906] tmp___2 = __VERIFIER_nondet_int() [L908] COND TRUE \read(tmp___2) [L769] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L563] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L780] COND TRUE waterLevel > 0 [L781] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L570] COND TRUE \read(systemActive) [L618] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L621] COND TRUE \read(pumpRunning) [L676] int retValue_acc ; [L813] int retValue_acc ; [L816] retValue_acc = methaneLevelCritical [L817] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L680] retValue_acc = isMethaneLevelCritical() [L682] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L623] tmp = isMethaneAlarm() [L625] COND FALSE !(\read(tmp)) [L592] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L595] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L44] int tmp ; [L45] int tmp___0 ; [L845] int retValue_acc ; [L848] retValue_acc = waterLevel [L849] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L49] tmp = getWaterLevel() [L51] COND TRUE tmp == 0 [L687] int retValue_acc ; [L690] retValue_acc = pumpRunning [L691] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L53] tmp___0 = isPumpRunning() [L55] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L439] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 131 locations, 3 error locations. UNSAFE Result, 7.6s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 3.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1025 SDtfs, 1698 SDslu, 1733 SDs, 0 SdLazy, 278 SolverSat, 69 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 123 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=274occurred 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.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 1084 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 425 NumberOfCodeBlocks, 425 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 343 ConstructedInterpolants, 0 QuantifiedInterpolants, 26367 SizeOfPredicates, 4 NumberOfNonLiveVariables, 413 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 65/71 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...